Well-ordering theorem

"Zermelo's theorem" redirects here. For Zermelo's theorem in game theory, see Zermelo's theorem (game theory).

Not to be confused with Well-ordering principle.

In mathematics, the well-ordering theorem, also known as Zermelo's theorem, states that every set can be well-ordered. A set X is well-ordered by a strict total order if every non-empty subset of X has a least element under the ordering. The well-ordering theorem together with Zorn's lemma are the most important mathematical statements that are equivalent to the axiom of choice (see also Axiom of choice § Equivalents). Ernst Zermelo introduced the axiom of choice as an "unobjectionable logical principle" to prove the well-ordering theorem. One can conclude from the well-ordering theorem that every set susceptible to transfinite induction, which is considered by mathematicians to be a powerful technique. One famous consequence of the theorem is the Banach–Tarski paradox.

History

Georg Cantor considered the well-ordering theorem to be a "fundamental principle of thought". Most mathematicians however find it difficult to visualize a well-ordering of, for example, the set R of real numbers. In 1904, Gyula Kőnig claimed to have proven that such a well-ordering cannot exist. A few weeks later, Felix Hausdorff found a mistake in the proof. It turned out, though, that the well-ordering theorem is equivalent to the axiom of choice, in the sense that either one together with the Zermelo–Fraenkel axioms is sufficient to prove the other, in first order logic (the same applies to Zorn's Lemma). In second order logic, however, the well-ordering theorem is strictly stronger than the axiom of choice: from the well-ordering theorem one may deduce the axiom of choice, but from the axiom of choice one cannot deduce the well-ordering theorem.

Proof

The well-ordering theorem follows from Zorn's lemma. Take the set $\mathbf {A}$ of all well-orderings of subsets of X: an element of $\mathbf {A}$ is an ordered pair (a,b) where a is a subset of X and b is a well-ordering of a. $\mathbf {A}$ can be partially ordered by continuation. That means, define E ≤ F if E is an initial segment of F and the ordering of the members of E is the same as their ordering in F. If ${\mathcal {E}}$ is a chain in $\mathbf {A}$, then the union of the sets in ${\mathcal {E}}$ can be ordered in a way that makes it a continuation of any set in ${\mathcal {E}}$; this ordering is a well-ordering, and therefore, an upper bound of ${\mathcal {E}}$ in $\mathbf {A}$ . We may therefore apply Zorn's Lemma to conclude that $\mathbf {A}$ has a maximal element, say (M,R). The set M must be equal to X, for if X has an element x not in M, then the set M∪{x} has a well-ordering that restricts to R on M, and for which x is larger than all elements of M. This well ordered set is a continuation of (M,R), contradicting its maximality, therefore M = X. Now R is a well-ordering of X.

The Axiom of Choice can be proven from the well-ordering theorem as follows. To make a choice function for a collection of non-empty sets, E, take the union of the sets in E and call it X. There exists a well-ordering of X; let R be such an ordering. The function that to each set S of E associates the smallest element of S, as ordered by (the restriction to S of) R, is a choice function for the collection E. An essential point of this proof is that it involves only a single arbitrary choice, that of R; applying the well-ordering theorem to each member S of E separately would not work, since the theorem only asserts the existence of a well-ordering, and choosing for each S a well-ordering would not be easier than choosing an element.

See also

• Well-ordering principle

External links

• Mizar system proof: http://mizar.org/version/current/html/wellord2.html