This winter I started to study much harder the set theory and especially the axiom of choice. Unfortunately, I have problems with solving the next exercise:
Prove that the 3 statements of the axiom of choice are equivalent :
1) For any non-empty collection $X$ of pairwise disjoint non-empty sets, there exists a choice set.
2) For any non-empty collection $X$ there is a choice function.
3) For any non-empty set $X$, there exists a function $f:P(X)\setminus\{\varnothing\}\to X$ so that for any non-empty set $A\subseteq X$, $f(A) \in A$.
I'll show you how to prove 3) implies 1), the rest should be relatively easy. So let $X$ be a nonempty set. For every nonempty subset $Y$ of $X$, let $Y^*=Y\times\{Y\}$. Then the family $\{Y^*:X\supseteq Y\neq\emptyset\}$ consists of disjoint nonempty sets, so there exists a choice set $C$. Let $f^*$ be the function that maps each nonempty set $Y\subseteq X$ to the unique element of $C$ that lies in $Y^*$. This isn't yet the function we want to construct. So let $\pi$ be the function that maps each element in $\{Y\times\{Y\}:X\supseteq Y\neq\emptyset\}$ (a ordered pair) to its first coordinate. Then letting $f=\pi\circ f^*$ gives you the needed function, as you can easily verify.