-1

If $f$ is injective and $g$ is not injective, $g\circ f$ is not injective?

If $f$ is surjective and $g$ is not surjective, $g\circ f$ is not surjective?

sdnaksn
  • 55

2 Answers2

0

Hint for the 1st question: $g$ can be injective in a smaller subset. Hint for the 2nd question: apply the definition.

0

What you conjectured in the comments is correct:

  1. Take $f\colon\{1\}\longrightarrow\mathbb N$ and $g\colon\mathbb{N}\longrightarrow\mathbb N$ defined by $f(1)=1$ and $g(n)=1$ respectively. Then $g\circ f=f$, which is injective.
  2. If $g$ is not surjective, then $g\circ f$ cannot be surjective, because if $f$ is a function from $A$ to $B$ and $g$ is a function from $B$ to $C$, if there is a $c\in C$ which cannot be expressed as $g(b)$ for some $b\in B$, then $c$ cannot be expressed as $g\bigl(f(a)\bigr)$ for soma $a\in A$ also. Otherwise, you would just take $b=f(a)$.