Proposition

The axiom of choice is equivalent to the statement “every surjective set function has a right inverse.”

Proof

Suppose every surjective function has a right inverse. Let F\mathscr{F} be a family of disjoint nonempty subsets of Z.Z. Let Z=F.Z' = \bigcup \mathscr{F}. Let g:ZFg : Z' \to \mathscr{F} be the function sending each zZz \in Z' to the unique set AFA \in \mathscr{F} such that zA.z \in A. This function is surjective, since each zZz \in Z' comes from an element of F.\mathscr{F}.

Let g1:FZg^{-1} : \mathscr{F} \to Z' be a right inverse to gg. If AFA \in \mathscr{F} then a=g1(A)a = g^{-1}(A) must satisfy g(a)=A,g(a) = A, and hence aA.a \in A. Then the image of g1g^{-1} is exactly the set containing one element of each AF,A \in \mathscr{F}, as required.

Conversely, suppose that the axiom of choice holds and let f:ABf : A \to B be a surjective function. For each element bB,b \in B, the fiber f1{b}f^{-1}\{b\} is non-empty (by surjectivity) and any two distinct elements of BB have disjoint fibers (since ff is a function). A right inverse of ff can be constructed by choosing a single representative from each fiber using the axiom of choice.

\blacksquare