Mathematics
Well-Ordering and the Well-Ordering Theorem
Quick fact
The well-ordering theorem says that every set can be well-ordered, a statement equivalent to the axiom of choice. In fact, this theorem is so non-constructive that we cannot usually describe the well-ordering of a set like the real numbers—it just exists.
Why this is interesting
You’ve known since grade school that the natural numbers are ordered: 1, 2, 3, and so on. But what if every set—even the infinite ones—could be organized in a similar way, so that every non-empty part has a smallest element?
Read the full explanation
Understanding Well-Ordering and the Well-Ordering Theorem
Let’s start with the familiar: the natural numbers, {1, 2, 3, …}, have a special property. If you take any non-empty subset, like the even numbers or the numbers greater than 100, there is always a least element. This property is called being well-ordered. In contrast, the integers (…, -2, -1, 0, 1, 2, …) are not well-ordered in their usual order, because the set of all integers has no smallest element. The positive rationals also fail: the set of all positive rationals has no least element since you can always find a smaller one. So well-ordering is about having a solid starting point for any subset, not just having an order. Now, the well-ordering theorem (also called Zermelo’s theorem) makes a bold claim: no matter how wild a set is—even the real numbers—there exists some ordering that makes it well-ordered. This order may be completely different from the usual one. It might interleave numbers in a bizarre way, but it still ensures that every non-empty subset has a least element. This is not obvious at all, and it turns out that this statement is logically equivalent to the axiom of choice, one of the most famous axioms in mathematics.
A deeper explanation
The well-ordering theorem is not a trivial assumption; it actually implies the axiom of choice and is implied by it. To see why it implies AC, suppose you have a family of non-empty sets. If the whole universe can be well-ordered, then you can simply choose the least element from each set according to that well-order, producing a choice function. Conversely, to prove the theorem from AC, you use Zermelo’s proof: for any set S, consider all subsets and use choice to pick an element from each non-empty subset. Then you build a chain of choices that eventually “sweeps through” the whole set, assigning each element an ordinal number. This creates a well-ordering because the ordinal numbers are well-ordered. Historically, Zermelo introduced the axiom of choice in 1904 to justify this very theorem, which was controversial at the time. The theorem’s power lies in its consequences: it guarantees the existence of well-ordering for every set, which is essential for transfinite induction and the study of ordinals. Without it, we cannot even define cardinal arithmetic properly, because sizes of sets need well-orderings to compare. The downside is that the ordering is often non-constructive—for a set like the real numbers, we might never be able to explicitly describe it, yet the theorem assures us it exists. This tension between existence and construction is a central theme in set theory.