Can every set be well-ordered? This property is equivalent to the Axiom of Choice and therefore has a somewhat controversial ontological status among mathematicians.
Let be a set of non-empty sets. A choice function for is a function that assigns every set an element .
The Axiom of Choice allows for enumerating a (non-empty) set by using a choice function for all non-empty subsets of . If the set of elements of not yet enumerated is non-empty, the choice function applied to this set will give us the next element to be enumerated (thereby well-ordering ). On the other hand, if is well-ordered, we can obtain a choice function by mapping a non-empty subset of to its least element under the well-ordering.
It follows that the Axiom of Choice is equivalent to Zermelo’s Well-Ordering Principle:
Besides , has applications in pretty much any branch of mathematics, with many equivalent principles (such as Zorn’s Lemma, that every vector space has a basis, and Tychonoff’s theorem), but also some strange consequences (such as the Banach–Tarski paradox).
The foundational issue with the Axiom of Choice lies primarily in the fact that it postulates the existence of a function without giving any hint at how such a function might be defined. For some sets (e.g., the rationals) we can explicitly describe a well-ordering (by identifying with a subset of and then well-ordering that). But also guarantees a well-order of the reals, and if you try to ‘write down’ such a well-order, you will quickly run into difficulties.
We will need the Axiom of Choice in many places. In the next section, we will use it to develop the theory of cardinal numbers. Some axioms that are considered in descriptive set theory (such as the Axiom of Determinacy, ) contradict . It is therefore important to keep track of where exactly we use the Axiom of Choice.
For some applications, it suffices to use weaker forms of .
Both implications are strict, in a way we will make precise later.
The axiom is sufficient to prove, for example, the following:
- Every infinite set contains a countably infinite subset.
- A countable union of countable sets is countable.
and therefore play an important role in the foundations of analysis and measure theory.