The Well-Ordering Theorem
The well-ordering theorem, equivalent to the axiom of choice, asserts that every set can be well-ordered. This powerful result was first proved by Zermelo in 1904 and was the original motivation for the explicit formulation of AC.
Statement
For every set , there exists a well-ordering on .
Proof from AC
Let be a set. By AC, fix a choice function with for every nonempty .
We construct a well-ordering by transfinite recursion. Define:
- .
- , if .
- For limit : continue if .
This process must terminate at some ordinal when (since is a set and ordinals form a proper class). The resulting enumeration gives a well-ordering of with order type .
Proof that Well-Ordering Implies AC
Let be a family of nonempty sets. Well-order by some well-ordering . Define for each . Since each is nonempty and well-ordered, the minimum exists. Then is a choice function.
Consequences
-
Every set has a cardinality: If can be well-ordered with order type , then is the initial ordinal . Without well-ordering (in ZF without AC), cardinality is much harder to define.
-
Cardinal comparability: For any sets , either or . (Well-order both and compare.)
-
Infinite sets contain countable subsets: Well-order any infinite set ; the first elements form a countably infinite subset.
Zermelo published his proof in 1904, provoking intense debate. The controversy centered on the choice function: critics (including Borel, Lebesgue, and Baire) objected to asserting the existence of an object without constructing it. This debate led Zermelo to axiomatize set theory (1908), making the axiom of choice explicit as a foundational principle. The independence results of Godel and Cohen eventually settled the question: AC is neither provable nor refutable from the other axioms.