Axiom of Choice — Definition, Formula & Examples

The Axiom of Choice states that given any collection of non-empty sets, it is possible to select exactly one element from each set, even if the collection is infinite and no explicit rule for making the selections exists.

For every indexed family of non-empty sets $\{S_i\}_{i \in I}$ , there exists a function $f: I \to \bigcup_{i \in I} S_i$ such that $f(i) \in S_i$ for every $i \in I$ . This function $f$ is called a choice function.

Key Formula

\forall \{S_i\}_{i \in I}\!\left(\,\forall i\, (S_i \neq \emptyset) \;\Rightarrow\; \exists\, f\!: I \to \bigcup_{i \in I} S_i \text{ such that } f(i) \in S_i\,\right)

Where:

$S_i$ = A non-empty set in the indexed family
$I$ = The index set labeling the family of sets
$f$ = The choice function that picks one element from each set

How It Works

For finite collections of sets, choosing one element from each is uncontroversial — you can simply list your choices. The Axiom of Choice becomes necessary when you have infinitely many sets and no definable rule to pick elements. It guarantees a choice function exists without requiring you to construct one explicitly. This makes it a pure existence assertion, which is why it has been historically controversial among mathematicians. ZFC (Zermelo–Fraenkel set theory with the Axiom of Choice) is the standard foundation for most of modern mathematics.

Example

Problem: Suppose for every natural number n you have a set S_n of real numbers, each non-empty. Can you form a sequence by picking one element from each S_n?

Setup: Define the family of sets:

S_1, S_2, S_3, \ldots

where each

S_n \neq \emptyset

. For example, let

S_n

be the set of all real numbers in the interval

(n, n+1)

S_n = (n,\, n+1) \subset \mathbb{R}

Apply the Axiom: The Axiom of Choice guarantees a choice function

f: \mathbb{N} \to \mathbb{R}

with

f(n) \in S_n

for every

n

. Note: no explicit formula for

f

is needed.

f(n) \in (n,\, n+1) \quad \text{for all } n \in \mathbb{N}

Result: The sequence

(f(1), f(2), f(3), \ldots)

is a well-defined sequence of real numbers, one chosen from each interval, even though we never specified a selection rule.

Answer: The Axiom of Choice ensures the sequence exists. A possible (but not required) realization is

f(n) = n + 0.5

, but the axiom applies even when no such formula can be written down.

Why It Matters

Many foundational results depend on the Axiom of Choice: every vector space has a basis, Tychonoff's theorem in topology, and the well-ordering theorem all require it. If you study real analysis, algebra, or topology at the graduate level, you will encounter arguments that implicitly or explicitly invoke this axiom.

Common Mistakes

Mistake: Thinking the Axiom of Choice is only needed for uncountable collections.

Correction: Even for countably infinite families of sets, the Axiom of Choice (or a weaker variant called Countable Choice) is required when no explicit selection rule exists. Finite collections never need it.