Choice Functions

Set Theory · Axiom Academy

LESSON Axiom of Choice (Preview) Every collection of non-empty sets has a choice function Imagine you have a collection of boxes, each containing some objects. The Axiom of Choice says you can simultaneously select exactly one object from each box. Formally: Given a collection C of non-empty sets, there exists a function f (called a choice function) such that for each set A in C, we have f(A) ∈ A. For finite collections, AC is provable from the other axioms - we can just choose elements one at a time. AC becomes essential for infinite collections, especially when there's no "rule" for choosing. Example: We can choose from infinitely many pairs 2n, 2n+1 by always picking the smaller number. But for arbitrary sets with no distinguishing features, we need AC. The Axiom of Choice has many equivalent formulations (Zorn's Lemma, Well-Ordering Theorem) and remarkable consequences (Banach-Tarski Paradox, existence of non-measurable sets). Unit 6 will explore AC in depth: its equivalents, consequences, independence from ZF, and its role in modern mathematics. For now, just know that AC completes the ZFC axiom system!

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