Well-ordering theorem

The well-ordering theorem, also known as Zermelo's theorem, tells us that every set can be well-ordered. A set is well-ordered if every part of it has a smallest piece. This idea helps mathematicians study and understand collections.

The well-ordering theorem is important because it is linked to the axiom of choice. This axiom is a basic rule in mathematics. Ernst Zermelo was the mathematician who first showed how useful this theorem can be.

Because of the well-ordering theorem, mathematicians can use a method called transfinite induction. This is a way to prove things about large collections.

History

Georg Cantor thought the well-ordering theorem was a very important idea. But it was hard to imagine how all real numbers could be arranged in a special order. In 1904, Gyula König said he had shown this could not be done, but Felix Hausdorff found a mistake in his proof.

We now know that the well-ordering theorem is closely linked to something called the axiom of choice. With the axiom of choice, we can prove the well-ordering theorem. And with the well-ordering theorem, we can prove the axiom of choice, too. The same is true for Zorn's lemma.

Proof from axiom of choice

The well-ordering theorem can be shown to follow from the axiom of choice. Imagine we have a set called A that we want to arrange in a special order where every smaller group inside A has a first element.

To do this, we pick a rule (a choice function) that helps us select one unused element from A at each step. By repeating this process carefully, we can build an order for all elements in A where every part has a beginning. This shows that such an ordering is possible for any set.

Proof of axiom of choice

The axiom of choice can be shown to be true using the well-ordering theorem.

To pick one item from each group in a collection, we first combine all the groups into one big set. The well-ordering theorem tells us we can arrange this big set so that every smaller part has a first item. By using this arrangement, we can pick the first item from each original group, which gives us the choice we need.

This proof only needs one main choice — the way we arrange the big set — instead of needing to pick a first item from each group separately.