Statement of the Axiom of Choice

Set Theory · Axiom Academy

LESSON The Axiom of Choice: Statement Understanding one of mathematics' most controversial axioms For any indexed collection of non-empty sets A i i∈I , there exists a choice function that selects exactly one element from each set. 2. Finite AC is Provable in ZF When the index set I is finite, the Axiom of Choice is actually provable from the other axioms of Zermelo-Fraenkel set theory (ZF). We can explicitly construct a choice function by choosing one element at a time from each set. This is why AC seems so obvious—in everyday mathematics, we typically work with finite collections! The Axiom of Countable Choice (AC ω ) is a weaker version that only asserts the existence of choice functions for countably many sets. Interestingly, AC ω is strictly weaker than full AC! Some mathematicians accept AC ω while rejecting full AC, as it's sufficient for much of analysis and has fewer controversial consequences. 4. Why AC is Not Provable from ZF In 1963, Paul Cohen proved that AC is independent from ZF. This means: Neither AC nor its negation can be proven from ZF alone There exist models of ZF where AC is true (ZFC) There exist models of ZF where AC is false This independence is why AC must be taken as an additional axiom if we want to use it.

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