Ordinals and axioms · Definition

Axiom of choice

set theoryordinals and axioms

Before you start you need to know

It seems obvious that we can always pick one element from each set, but with infinite families that intuition is not enough. Zermelo formulated it in 1904 to prove the well-ordering theorem.

Definition

Statement that every family of nonempty sets admits a choice function \(f\) that picks one element from each set in the family.

\[\forall X\,(\emptyset\notin X \rightarrow \exists f\,\forall A\in X\,(f(A)\in A))\]

The axiom of choice is independent of ZF: Gödel showed in 1938 that it is consistent with ZF, and Cohen showed in 1963 that its negation is also consistent. It is equivalent to several principles, such as Zorn's lemma, the well-ordering theorem, and the claim that every surjection has a right inverse. With it, every set can be well-ordered and any two cardinals are comparable, so cardinals become totally ordered.

Let \(\mathcal{P}^*(\mathbb{R})\) be the family of nonempty subsets of \(\mathbb{R}\). Some of them have a natural representative, such as the infimum of those bounded below, but no known rule selects one element from each. The axiom guarantees that a choice function on this family exists, even if it cannot be described.

A common mistake is to think the axiom is needed for finite families, where choice is explicit and follows from ZF by induction. Another is to believe the axiom gives a concrete construction: it only asserts that a choice function exists, without saying how to compute it.

Think about it

Why isn't it enough to always pick the first element of each set?

Because without a well-order there is no definable rule that picks a 'first' element, so the choice requires the axiom.

Exercises 10

What comes next

References

  • Herbert B. Enderton, Elements of Set Theory, 1st edition, Academic Press, 1977.
  • Thomas Jech, Set Theory (The Third Millennium Edition), 3rd millennium edition, Springer, 2003.