Axiom of Choice Summary

Set Theory · Axiom Academy

Recap of the most powerful and controversial axiom in mathematics AC asserts: Choice functions exist for any collection of non-empty sets Non-constructive: Guarantees existence without providing explicit construction When not needed: Finite collections, explicit rules, well-ordered sets Classic example: Shoes (distinguishable) vs socks (indistinguishable) Well-Ordering Theorem: Every set can be well-ordered Zorn's Lemma: The algebraist's favorite—used to prove existence of bases, maximal ideals Trichotomy: Any two cardinals are comparable Right inverses: Every surjection has a right inverse Essential Applications Across Mathematics Linear Algebra: Every vector space has a basis Ring Theory: Every ideal extends to a maximal ideal Field Theory: Every field has an algebraic closure Topology: Tychonoff's Theorem (product of compact spaces) Analysis: Hahn-Banach Theorem in functional analysis Set Theory: Every infinite set contains a countable subset Banach-Tarski: Decompose a ball into finitely many pieces, reassemble into two identical balls Vitali sets: Non-measurable subsets of ℝ that "break" measure theory Not contradictory: Counterintuitive ≠ inconsistent Why it happens: AC allows "wild" decompositions using non-constructive choices Gödel (1938): AC is consistent with ZF (cannot be disproven) Cohen (1963): AC is independent of ZF (cannot be proven) Status: Optional axiom—mathematics works with or without it Practice: Most mathematicians accept AC; constructivists reject it

This is the written version of the interactive lesson above. See the full Set Theory course.