Definition
The statement that every set can be equipped with a well-ordering, i.e., there exists a binary relation on the set that is a total order and in which every nonempty subset has a least element.
Principle
Principle
Global ordering via choice: existence of a well-order for any set arises from the ability to make a sequence of choices that selects least elements, and in ZF this assertion is equivalent to the Axiom of Choice and to Zorn's Lemma.
Demonstration
Demonstration
For finite sets and the natural numbers the well-ordering is explicit; for arbitrary sets the theorem guarantees a well-order but typically nonconstructively—for example, it implies there is a well-order on the real numbers though no explicit definable order may be given in ZF alone.
Misapplication
Misapplication
Assuming the theorem provides a constructive or canonical ordering for arbitrary sets, or expecting the well-order to be compatible with other structures (topology, algebra) without further specification.
Consequence
Consequence
Permits transfinite induction and recursion on any set, provides canonical ordinal types for cardinals, and yields comparability results for cardinalities when combined with other principles; it is central to ordinal and cardinal arithmetic.
Reversal
Reversal
Rejecting the Axiom of Choice permits models of set theory where some sets have no well-order; the negation emphasizes that well-orderability is not provable in ZF alone without choice.
Boundary
Boundary
Applies to sets in the framework of ZF/ZFC; it does not provide an explicit construction in general and does not impose uniqueness of the well-order (many nonisomorphic well-orders may exist).
Semantic Tension
Semantic Tension
Equivalent in ZF to Zorn's Lemma and the Axiom of Choice but conceptually different: it asserts the existence of a global total order with least elements, which can conflict with expectations of constructivity or with additional structure like topology.
Synthesis
Synthesis
The Well-Ordering Theorem affirms that any set admits a total order with least elements on all nonempty subsets, enabling ordinal-indexed arguments and making choice-like global selection principles manifest in order form.