ConceptComplete

The Axiom of Infinity

The axiom of infinity is the most profound of the ZFC axioms, as it asserts the existence of an actually infinite set. Without this axiom, we could only prove the existence of finite sets, making much of modern mathematics impossible.

DefinitionAxiom of Infinity

There exists a set II such that I\emptyset \in I and whenever xIx \in I, we also have x{x}Ix \cup \{x\} \in I. Formally:

I(Ix(xIx{x}I))\exists I(\emptyset \in I \land \forall x(x \in I \rightarrow x \cup \{x\} \in I))

Such a set II is called an inductive set.

The axiom of infinity provides the foundation for arithmetic and analysis. It guarantees that we can perform the successor operation xx{x}x \mapsto x \cup \{x\} infinitely many times, creating an endless sequence of distinct sets.

ExampleConstruction of Natural Numbers

Using the von Neumann construction, we define natural numbers as:

0=1=0{0}={}={0}2=1{1}={0,1}3=2{2}={0,1,2}\begin{align*} 0 &= \emptyset \\ 1 &= 0 \cup \{0\} = \{\emptyset\} = \{0\} \\ 2 &= 1 \cup \{1\} = \{0, 1\} \\ 3 &= 2 \cup \{2\} = \{0, 1, 2\} \\ &\vdots \end{align*}

In general, each natural number nn is the set of all smaller natural numbers: n={0,1,2,,n1}n = \{0, 1, 2, \ldots, n-1\}.

The successor function S(x)=x{x}S(x) = x \cup \{x\} plays a central role. For natural numbers, S(n)=n{n}S(n) = n \cup \{n\} corresponds to adding one. This definition ensures that each number contains exactly as many elements as its value, and that the membership relation \in corresponds to the less-than relation << on natural numbers.

DefinitionThe Set of Natural Numbers

The set of natural numbers ω\omega (or N\mathbb{N}) is the smallest inductive set, defined as the intersection of all inductive sets:

ω={I:I is inductive}\omega = \bigcap \{I : I \text{ is inductive}\}

This set exists by the axiom of infinity and the axiom schema of comprehension.

The smallness condition is crucial: ω\omega contains exactly those sets that must be in every inductive set. This means ω\omega contains 0,1,2,3,0, 1, 2, 3, \ldots and nothing else. In particular, ω\omega does not contain itself, and it does not contain any infinite sets other than those constructed from natural numbers.

Remark

The axiom of infinity is independent of the other axioms of ZFC. Without it, we can construct finite set theory (FST), where only finite sets exist. FST is consistent if ZFC is, but it cannot prove the existence of N\mathbb{N}, R\mathbb{R}, or most mathematical structures studied in analysis and topology.

The existence of ω\omega has profound implications. It allows us to define:

  1. Arithmetic: Addition and multiplication can be defined via recursion on ω\omega
  2. Recursion: The principle of definition by recursion relies on ω\omega
  3. Induction: Mathematical induction becomes a theorem about ω\omega
  4. Sequences: Infinite sequences are functions from ω\omega to other sets

Moreover, ω\omega is the first example of a transfinite set—a set that is equinumerous with a proper subset of itself. Specifically, ωω{0}\omega \sim \omega \setminus \{0\} via the function nn+1n \mapsto n+1.

ExampleProperties of omega

The set ω\omega has several remarkable properties:

  1. Well-ordered: Every non-empty subset of ω\omega has a least element
  2. Transitive: If nωn \in \omega and mnm \in n, then mωm \in \omega
  3. Not self-membered: ωω\omega \notin \omega
  4. Limit ordinal: ω\omega is not the successor of any natural number

These properties make ω\omega the prototype for all infinite ordinal numbers.

The axiom of infinity opens the door to infinite mathematics. Once we have ω\omega, we can construct P(ω)\mathcal{P}(\omega) (the real numbers), P(P(ω))\mathcal{P}(\mathcal{P}(\omega)), and so on, climbing through an infinite hierarchy of ever-larger infinities. This hierarchy, formalized through the theory of ordinal and cardinal numbers, reveals the rich structure of infinity that ZFC set theory makes rigorous.