2 Homework

P. 2.1. Let f : A −→ B be a function. Show that:

a) f is surjective if and only if for any set C and any functions g, h : B −→ C, if f · g = f · h then g = h.
b) f is injective if and only if for any set C and any functions g, h : C −→ A, if g · f = h · f then g = h.

P. 2.2. a) Give examples of an infinite set M and functions f, g : M −→ M such that f is surjective but
noninjective, respectively G is injective but nonsurjective.
b) Show that if M is a finite set and f : M −→ M a function, then f is surjective if and only if it is
injective.