4.I.1C

Numbers and Sets | Part IA, 2002

What does it mean to say that a function f:A→Bf: A \rightarrow B is injective? What does it mean to say that a function g:A→Bg: A \rightarrow B is surjective?

Consider the functions f:A→B,g:B→Cf: A \rightarrow B, g: B \rightarrow C and their composition g∘f:A→Cg \circ f: A \rightarrow C given by g∘f(a)=g(f(a))g \circ f(a)=g(f(a)). Prove the following results.

(i) If ff and gg are surjective, then so is g∘fg \circ f.

(ii) If ff and gg are injective, then so is g∘fg \circ f.

(iii) If g∘fg \circ f is injective, then so is ff.

(iv) If g∘fg \circ f is surjective, then so is gg.

Give an example where g∘fg \circ f is injective and surjective but ff is not surjective and gg is not injective.

Typos? Please submit corrections to this page on GitHub.