Set Theory Axioms

Why This Matters

Set theory axioms aren't just abstract rules—they're the foundation of modern mathematics. Every mathematical structure you'll encounter, from number systems to topological spaces, ultimately rests on these principles. You're being tested on your ability to understand why we need each axiom, what it allows us to construct, and how these axioms work together to create a consistent mathematical universe.

Don't fall into the trap of memorizing definitions in isolation. The real exam skill is recognizing which axiom justifies a particular construction or proof step. When you see a question about forming new sets, ask yourself: Which axiom permits this? Understanding the logical dependencies between axioms—and the problems each one solves—will serve you far better than rote recall.

---

Axioms That Define Set Identity

These axioms establish what sets are and when two sets count as the same object. Without a clear criterion for equality, we couldn't reason about sets at all.

Axiom of Extensionality

• Sets are equal if and only if they have the same elements—the order or method of construction is irrelevant
• Content determines identity, meaning $\{1, 2, 3\} = \{3, 2, 1\} = \{1, 1, 2, 3\}$
• Foundational for all proofs involving set equality; to show $A = B$, prove every element of $A$ is in $B$ and vice versa

---

Axioms That Build New Sets

These axioms provide the construction tools of set theory. Each specifies a legitimate way to form new sets from existing ones, ensuring we can build complex mathematical structures without contradiction.

Axiom of Pairing

• Given any two sets $a$ and $b$, the set $\{a, b\}$ exists—this creates ordered structure from unordered elements
• Enables ordered pairs through the Kuratowski definition: $(a, b) = \{\{a\}, \{a, b\}\}$
• Gateway to relations and functions, since these are built from ordered pairs

Axiom of Union

• For any set $A$, there exists $\bigcup A$ containing all elements of all members of $A$
• Flattens nested structure: if $A = \{\{1, 2\}, \{3\}\}$, then $\bigcup A = \{1, 2, 3\}$
• Essential for combining sets and defining operations like $A \cup B = \bigcup\{A, B\}$

Axiom of Power Set

• For any set $A$, the power set $\mathcal{P}(A)$ exists—the collection of all subsets of $A$
• Generates exponential growth: if $|A| = n$, then $|\mathcal{P}(A)| = 2^n$
• Critical for cardinality arguments, especially Cantor's theorem that $|\mathcal{P}(A)| > |A|$

Axiom Schema of Separation (Comprehension)

• From any set $A$ and property $\phi(x)$, form $\{x \in A : \phi(x)\}$—the subset of elements satisfying $\phi$
• Avoids Russell's Paradox by requiring a pre-existing set; you can't form "the set of all sets"
• Called a schema because it's actually infinitely many axioms, one for each formula $\phi$

Axiom Schema of Replacement

• If $F$ is a function-like formula and $A$ is a set, then $\{F(x) : x \in A\}$ is a set
• Stronger than Separation—creates sets whose elements may not belong to any previously known set
• Essential for transfinite constructions and building sets "too large" for Separation alone

---

Axioms That Guarantee Existence

These axioms assert that certain important sets exist, rather than describing how to build them from other sets.

Axiom of Infinity

• There exists a set containing $\emptyset$ and closed under the successor operation $x \mapsto x \cup \{x\}$
• Guarantees infinite sets exist—without it, all sets constructible from other axioms would be finite
• Provides the natural numbers: $\emptyset = 0$, $\{0\} = 1$, $\{0, 1\} = 2$, and so on (von Neumann ordinals)

---

Axioms That Prevent Paradoxes

These axioms impose structural constraints on the set-theoretic universe, ruling out pathological constructions that would lead to contradictions.

Axiom of Foundation (Regularity)

• Every non-empty set $A$ contains an element disjoint from $A$—formally, $\exists x \in A$ such that $x \cap A = \emptyset$
• Prohibits self-membership: no set can satisfy $A \in A$ or circular chains like $A \in B \in A$
• Creates a well-founded hierarchy where sets are "built up" from simpler sets, with $\emptyset$ at the bottom

---

Axioms That Enable Choice

This axiom stands apart—it's independent of the others and has profound consequences throughout mathematics.

Axiom of Choice

• For any collection of non-empty sets, there exists a function selecting one element from each
• Equivalent to many important results: Zorn's Lemma, Well-Ordering Theorem, existence of bases for all vector spaces
• Independent of ZF axioms—can be assumed or denied without contradiction, leading to different set-theoretic universes

---

Quick Reference Table

---

Self-Check Questions

1. Which two axioms are actually schemas rather than single axioms, and what makes them different from the others?

2. If you want to prove that $\{x \in \mathbb{N} : x \text{ is even}\}$ is a set, which axiom justifies this construction? Why isn't Replacement needed here?

3. Compare and contrast the Axiom of Foundation and the Axiom of Extensionality: what aspect of sets does each one govern?

4. The Axiom of Infinity guarantees the existence of at least one infinite set. Explain how Pairing and Union alone cannot produce an infinite set, no matter how many times you apply them.

5. Why is the Axiom of Choice considered more controversial than the other axioms? Give an example of a mathematical result that requires Choice and explain what makes it "non-constructive."