Skip to content
Tutorials Center
My learning

Topics

Lesson 33 of 38 · Axioms and Paradoxes

The ZFC Axioms

A guided tour of the axioms of Zermelo–Fraenkel set theory with choice: what each says, why it is needed, and a tiny Python model of hereditarily finite sets.

After Russell's paradox, mathematicians wrote down a short list of rules that say exactly which sets exist and how they can be formed. The most widely used list is ZFC: Zermelo–Fraenkel set theory with the axiom of Choice. Almost all of ordinary mathematics can be formalized inside it. You do not need to memorize the axioms, but knowing what each one buys you shows how the whole subject is built from almost nothing.

The only primitive notion is membership, x ∈ y. Everything, including numbers and functions, is a set.

The building blocks

Extensionality Same elements, same set
Empty set A set with no elements
Pairing {a, b} exists

These start the universe.

1 / 4

The axioms, one by one

1. Extensionality. Two sets with the same elements are equal: ∀z (z ∈ x ⟺ z ∈ y) ⟹ x = y. A set is nothing but its members.

2. Empty set. There is a set with no elements, ∅.

3. Pairing. For any a and b there is a set {a, b}. With a = b this gives singletons .

4. Union. For any set A there is a set ⋃A of all elements of elements of A. So A ∪ B = ⋃{A, B}.

5. Power set. For any set A there is a set P(A) containing all subsets of A.

6. Separation (schema). For any set A and property φ, there is the set {x ∈ A : φ(x)}. This is the restricted comprehension that avoids Russell's paradox. It is called a schema because there is one axiom for each property φ we can write.

7. Replacement (schema). If F is a rule that assigns to each element of a set A exactly one set, then the collection {F(x) : x ∈ A} is a set. Replacement is what lets us build {ℕ, P(ℕ), P(P(ℕ)), ...} and large ordinals like ω + ω.

8. Infinity. There is a set containing ∅ and closed under x ↦ x ∪ {x}. It gives us ω, the set of natural numbers, as in the ordinal lesson.

9. Foundation (regularity). Every nonempty set A has an element m with m ∩ A = ∅. In consequence no set is a member of itself, and there is no infinite chain x₀ ∋ x₁ ∋ x₂ ∋ ....

10. Choice. For every family of nonempty sets there is a function choosing one element from each. See the axiom of choice.

ZF without Choice is written ZF. Some books drop Foundation or Replacement in "Zermelo set theory" (Z). The list above is the usual modern formulation; textbooks differ in small details such as which axioms are derivable from the others.

What you can build

With these axioms:

  • Ordered pairs: (a, b) = {{a}, {a, b}} (Kuratowski's definition). Then (a, b) = (c, d) if and only if a = c and b = d.
  • Cartesian products, relations and functions (a function is a set of ordered pairs).
  • The natural numbers as von Neumann ordinals, then ℤ, ℚ, ℝ and all the structures of analysis.
  • Cardinal and ordinal arithmetic, as in this chapter's earlier lessons.

A tiny model: hereditarily finite sets

We cannot run all of ZFC on a computer because it describes infinite sets. But we can model its finite fragment with Python's frozenset. A hereditarily finite set is a finite set whose elements are hereditarily finite sets. The operations below correspond to pairing, union, power set and separation.

Python Pairing, union, power set, separation on finite sets

Press Run (or Ctrl + Enter) to see the result here.

Program input · what you'd type while the program runs

Type the answers before you press Run, one per line. Each time the program reads a line (with input()), it gets the next line from this box.

Notice that frozenset cannot contain itself: an object must exist before it can be put inside a container. That is foundation at work: sets are built up in stages from the empty set.

Axioms and independence

Some questions cannot be answered from the axioms: they are independent of ZFC. The two most famous are the Axiom of Choice relative to ZF and the Continuum Hypothesis relative to ZFC. Independence is a theorem: we can prove that neither the statement nor its negation can be proved from the axioms, assuming ZFC is itself consistent.

Another limit: by Gödel's second incompleteness theorem (1931), ZFC, if consistent, cannot prove its own consistency. We trust it because of decades of use, not because of a proof from within.

Python Build the first few stages of the hereditarily finite universe

Press Run (or Ctrl + Enter) to see the result here.

Program input · what you'd type while the program runs

Type the answers before you press Run, one per line. Each time the program reads a line (with input()), it gets the next line from this box.

The stage sizes 0, 1, 2, 4, 16, 65536, ... grow as a tower of powers of 2.

Check your understanding

Quick check · 4 questions

of 4 answered You scored / 4 · perfect!

  1. 1. Which axiom says that a set is determined by its elements?

    Extensionality: two sets with the same elements are equal.
  2. 2. Which axiom prevents a set from being a member of itself?

    Foundation says every nonempty set has an element disjoint from it. This rules out x ∈ x and infinite descending membership chains.
  3. 3. Why is separation called a schema?

    Each formula φ gives a separate instance of the axiom, so it is an infinite family of axioms.
  4. 4. What is the Kuratowski definition of the ordered pair (a, b)?

    The set {{a}, {a, b}} remembers which element came first, using only sets.

Summary

  • ZFC is a short list of axioms about the membership relation: extensionality, empty set, pairing, union, power set, separation, replacement, infinity, foundation and choice.
  • Separation, not unrestricted comprehension, is how sets are carved out; replacement builds large sets.
  • Ordered pairs, functions, numbers and ordinals can all be built as sets.
  • Hereditarily finite sets give a small model you can compute with.
  • Some statements are independent of ZFC, and ZFC cannot prove its own consistency.

Next: The Axiom of Choice