TheoremComplete

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

Theorem6.5Well-ordering theorem (Zermelo)

For every set AA, there exists a well-ordering \leq on AA.


Proof from AC

Proof

Let AA be a set. By AC, fix a choice function f:P(A){}Af: \mathcal{P}(A) \setminus \{\emptyset\} \to A with f(S)Sf(S) \in S for every nonempty SAS \subseteq A.

We construct a well-ordering by transfinite recursion. Define:

  • a0=f(A)a_0 = f(A).
  • aα+1=f(A{aβ:βα})a_{\alpha+1} = f(A \setminus \{a_\beta : \beta \leq \alpha\}), if A{aβ:βα}A \setminus \{a_\beta : \beta \leq \alpha\} \neq \emptyset.
  • For limit λ\lambda: continue if A{aβ:β<λ}A \setminus \{a_\beta : \beta < \lambda\} \neq \emptyset.

This process must terminate at some ordinal θ\theta when A={aβ:β<θ}A = \{a_\beta : \beta < \theta\} (since AA is a set and ordinals form a proper class). The resulting enumeration gives a well-ordering of AA with order type θ\theta. \blacksquare


Proof that Well-Ordering Implies AC

Proof

Let {Ai}iI\{A_i\}_{i \in I} be a family of nonempty sets. Well-order iIAi\bigcup_{i \in I} A_i by some well-ordering \leq. Define f(i)=min(Ai)f(i) = \min_\leq(A_i) for each iIi \in I. Since each AiA_i is nonempty and well-ordered, the minimum exists. Then ff is a choice function. \blacksquare


Consequences

ExampleConsequences of the well-ordering theorem
  1. Every set has a cardinality: If AA can be well-ordered with order type α\alpha, then A|A| is the initial ordinal α|\alpha|. Without well-ordering (in ZF without AC), cardinality is much harder to define.

  2. Cardinal comparability: For any sets A,BA, B, either AB|A| \leq |B| or BA|B| \leq |A|. (Well-order both and compare.)

  3. Infinite sets contain countable subsets: Well-order any infinite set AA; the first ω\omega elements form a countably infinite subset.

RemarkHistorical significance

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.