--- title: Well-Ordering Theorem description: The Well-Ordering Theorem states that every set can be well-ordered, meaning every non-empty subset has a least element. Learners will understand its equivalence to the Axiom of Choice and Zorn's Lemma, and its applications in constructing mathematical proofs. category: mathematics subcategory: set-theory difficulty: beginner, intermediate, advanced url: /subject/well-ordering-theorem --- # Well-Ordering Theorem The Well-Ordering Theorem states that every set can be well-ordered, meaning every non-empty subset has a least element. Learners will understand its equivalence to the Axiom of Choice and Zorn's Lemma, and its applications in constructing mathematical proofs. ## Available Resources 1 Books • 2 Courses • 4 Websites • 1 Papers ## Websites ### 1. ProofWiki: Well-Ordering Theorem ProofWiki page stating Zermelo's theorem that every set can be well-ordered, with proofs from the axiom of choice via a choice function, transfinite induction and transfinite recursion, each step linked to its underlying definitions and lemmas. Two of the proofs are marked incomplete. **Difficulty:** Beginner | **Price:** Free **Link:** https://proofwiki.org/wiki/Well-Ordering_Theorem **Tags:** well-ordering-theorem, axiom-of-choice, transfinite-induction, set-theory ### 2. nLab: Well-ordering theorem nLab entry on the theorem that every set admits a well-ordering: Zermelo's 1904 proof from the axiom of choice, its use in defining cardinals as initial ordinals, and recent results on its status in constructive mathematics, with primary-source references. **Difficulty:** Beginner | **Price:** Free **Link:** https://ncatlab.org/nlab/show/well-ordering+theorem **Tags:** well-ordering-theorem, axiom-of-choice, constructive-mathematics, set-theory ### 3. 245B Notes 7: Well-ordered sets, ordinals, and Zorn's lemma **Author:** Terence Tao Graduate course notes developing well-ordered sets, order isomorphism, ordinals, and transfinite induction, then proving the well-ordering principle and Zorn's lemma from the axiom of choice. Includes exercises and commentary on why the constructions feel non-constructive. **Difficulty:** Advanced | **Language:** English | **Price:** Free **Link:** https://terrytao.wordpress.com/2009/01/28/245b-notes-7-well-ordered-sets-ordinals-and-zorns-lemma-optional/ **Tags:** ordinals, well-ordered-sets, transfinite-induction, zorns-lemma, set-theory ### 4. Wolfram MathWorld **Author:** Eric W. Weisstein MathWorld is an online mathematics encyclopedia from Wolfram Research offering detailed, browsable articles on topics across the math spectrum, including algebra, geometry, calculus, and number theory. Each entry includes definitions, theorems, formulas, diagrams, worked examples, and links to further reading. **Difficulty:** Intermediate | **Language:** English | **Price:** Free **Link:** https://mathworld.wolfram.com **Tags:** mathematics-reference, encyclopedia, abstract-algebra, number-theory, geometry ## Books ### 1. The Axiom of Choice **Author:** Thomas J. Jech The definitive ceiling for this topic — the only source here that treats the well-ordering theorem inside the full landscape of choice, including what fails without it. Graduate monograph on the axiom of choice: its equivalents including the well-ordering theorem and Zorn's lemma, consistency and independence via permutation models and forcing, embedding theorems, and systematic study of weaker choice principles and their consequences. **Difficulty:** Advanced | **Language:** English | **Price:** Paid **Link:** https://www.amazon.com/dp/0486466248?tag=edmonddante07-20 **Tags:** axiom-of-choice, well-ordering-theorem, forcing, permutation-models, set-theory ## Papers ### 1. Zorn's Lemma and Some Applications **Author:** Keith Conrad Expository notes stating Zorn's lemma and applying it to construct maximal ideals, bases of vector spaces, algebraic closures, and other objects across group theory, ring theory, linear algebra, and topology, with a closing discussion of its non-constructive character. **Difficulty:** Intermediate | **Language:** English | **Price:** Free **Link:** https://kconrad.math.uconn.edu/blurbs/zorn1.pdf **Tags:** zorns-lemma, axiom-of-choice, maximal-ideals, algebraic-closure, abstract-algebra ## Courses ### 1. Part II — Logic and Set Theory (Cambridge Lecture Notes) **Author:** Dexter Chua (from lectures by Imre Leader) Full typeset notes for Cambridge's Part II Logic and Set Theory course. Covers well-orderings, ordinals, Hartogs' lemma, transfinite induction, posets, Zorn's lemma, and the well-ordering principle with complete proofs, plus propositional and predicate logic and ZF. **Difficulty:** Intermediate | **Language:** English | **Price:** Free **Link:** https://dec41.user.srcf.net/notes/II_L/logic_and_set_theory.pdf **Tags:** set-theory, ordinals, zorns-lemma, mathematical-logic, well-ordering-theorem ### 2. Introduction to Mathematical Thinking **Author:** Keith Devlin Stanford course by Keith Devlin on how mathematicians reason, starting with the logic of language (and, or, not, implication, quantifiers) and moving to the structure of proofs, including contradiction and induction. Learners become able to read, construct and critique simple mathematical proofs. **Difficulty:** Beginner | **Language:** English | **Duration:** Expect to require at least 10 hours of study per week to complete this course satisfactorily. | **Price:** Free **Link:** https://www.coursera.org/learn/mathematical-thinking **Tags:** mathematical-logic, proof-writing, quantifiers, mathematical-reasoning --- *This content is part of Dantes.io - Your Treasure Map to Knowledge* *Curated by humans at Dantes.io. Personal study use welcome; republishing this curation requires permission (team@dantes.io).* View this page online: https://dantes.io/subject/well-ordering-theorem