PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Very high Entry average rating: No information on entry rating
[parent] surjection and axiom of choice (Derivation)

In this entry, we show the statement that

(*) every surjection has a left inverse
is equivalent to the axiom of choice (AC).
Proposition 1   AC implies (*).
Proof. Let $f:A\to B$ be a surjection. Then the set $C:=\lbrace f^{-1}(y)\mid y\in B\rbrace$ partitions $A$ By the axiom of choice, there is a function $g:C\to \bigcup C$ such that $g(f^{-1}(y))\in f^{-1}(y)$ for every $y\in B$ Since $\bigcup C=A$ $g$ is a function from $C$ to $A$ Define $h:B\to A$ by $h(y)=g(f^{-1}(y))$ Then $h(y)\in f^{-1}(y)$ and therefore $(f\circ h)(y)=f(h(y))=y$ implying that $f$ has a left inverse. $ \qedsymbol$

Remark. The function $h$ is easily seen to be an injection: if $h(y_1)=h(y_2)$ then $y_1 = f(h(y_1))=f(h(y_2)) = y_2$

Proposition 2 (*)   implies AC.

Before proving this, let us remark that, in the collection $C$ of non-empty sets of the axiom of choice, there is no assumption that the sets in $C$ be pairwise disjoint. The statement

(**) given a set $C$ of pairwise disjoint non-empty sets, there is a choice function $f:C\to \bigcup C$
seemingly weaker than AC, turns out to be equivalent to AC, and we will prove this fact first.
Proof. Obviously AC implies (**). Conversely, assume (**). Let $C$ be a collection of non-empty sets. We assume $C\ne \varnothing$ For each $a\in C$ define a set $A_a:=\lbrace (x,a)\mid x\in a\rbrace$ Since $a\ne \varnothing$ $A_a\ne \varnothing$ In addition, $A_a\cap A_b= \varnothing$ iff $a\ne b$ (true since elements of $A_a$ and elements of $A_b$ have distinct second coordinates). So the collection $D:=\lbrace A_a\mid a\in C\rbrace$ is a set consisting of pairwise disjoint non-empty sets. By (**), there is a function $f:D\to \bigcup D$ such that $f(A_a)\in A_a$ for every $a\in C$ Now, define two functions $g: C\to D$ and $h:\bigcup D\to \bigcup C$ by $g(a)=A_a$ and $h(x,a)=x$ Then, for any $a\in C$ we have $(h\circ f \circ g)(a)=h(f(A_a))$ Since $f(A_a)\in A_a$ its first coordinate is an element of $a$ Therefore $h(f(A_a))\in a$ and hence $h\circ f\circ g$ is the desired choice function. $ \qedsymbol$
Proof. [Proof of Propositon 2] We show that (*) implies (**), and since (**) implies AC as shown above, the proof of Proposition 2 is then complete.

Let $C$ be a collection of pairwise disjoint non-empty sets. Each element of $\bigcup C$ belongs to a unique set in $C$ Then the function $g:\bigcup C \to C$ taking each element of $\bigcup C$ to the set it belongs in $C$ is a well-defined function. It is clearly surjective. Hence, by assumption, there is a function $f:C\to \bigcup C$ such that $g\circ f=1_C$ For each $x\in C$ $g(f(x))=x$ which is the same as saying that $f(x)$ is an element of $x$ by the definition of $g$ $ \qedsymbol$

Remark. In the category of sets, AC is equivalent to saying that every epimorophism is a split epimorphism. In general, a category is said to have the axiom of choice if every epimorphism is a split epimorphism.




"surjection and axiom of choice" is owned by CWoo.
(view preamble | get metadata)

View style:


This object's parent.
Log in to rate this entry.
(view current ratings)

Cross-references: epimorphism, category, split epimorphism, category of sets, surjective, well-defined, complete, proposition, proof, coordinates, iff, conversely, choice function, pairwise disjoint, collection, injection, function, partitions, implies, axiom of choice, equivalent, left inverse, surjection
There is 1 reference to this entry.

This is version 5 of surjection and axiom of choice, born on 2009-01-17, modified 2009-01-23.
Object id is 11517, canonical name is SurjectionAndAxiomOfChoice.
Accessed 587 times total.

Classification:
AMS MSC03E25 (Mathematical logic and foundations :: Set theory :: Axiom of choice and related propositions)

Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add example | add (any)