A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Axiom of Infinity

College Depth 73 in the knowledge graph ☐ I know this ☆ Set as goal
894topics build on this
340prerequisites beneath it
See this on the map →
ZFC Axioms Overview→→Countably Infinite SetsHereditarily Finite Sets+1 more
ZFC infinity natural numbers inductive set

Core Idea

The axiom of infinity asserts the existence of an inductive set: a set I such that ∅ ∈ I and whenever x ∈ I, also x ∪ {x} ∈ I. This guarantees that the natural numbers — identified in the von Neumann encoding with ∅, {∅}, {∅,{∅}}, ... — form a set. Without this axiom, ZF could be modeled entirely by hereditarily finite sets, making infinite mathematics impossible. The axiom of infinity is therefore the gateway to all of transfinite set theory, enabling ordinals, cardinals, and the full hierarchy of infinities.

How It's Best Learned

Verify explicitly that {∅, {∅}, {∅,{∅}}, ...} is inductive. Observe that the von Neumann natural number n is the set {0, 1, ..., n-1}, so 3 = {0, 1, 2} = {∅, {∅}, {∅,{∅}}}. Reflect on what mathematics would look like without this axiom — only finite sets would exist.

Common Misconceptions

Explainer

From your study of the ZFC axioms, you know that most of them deal with *constructing new sets from existing ones*: pairing combines two sets, union collects their members, power set collects all subsets, separation carves out subsets satisfying a property, replacement applies a function to an existing set. None of these axioms, applied to a starting universe of only finite sets, can ever produce an infinite set. The axiom of infinity is the one axiom that reaches beyond the finite by directly asserting the existence of a set that cannot be built by finite construction.

The axiom says: there exists a set I such that ∅ ∈ I and whenever x ∈ I, also x ∪ {x} ∈ I. Such a set is called inductive. Starting from ∅, the closure condition generates: ∅ ∪ {∅} = {∅}, then {∅} ∪ {{∅}} = {∅, {∅}}, and so on without end. These generated elements are exactly the von Neumann natural numbers: 0 = ∅, 1 = {∅}, 2 = {∅, {∅}}, 3 = {∅, {∅}, {∅,{∅}}}, where each natural number n is the set of all its predecessors {0, 1, ..., n−1}. The axiom of infinity guarantees this entire infinite sequence can be collected into a single set.

The axiom does not directly define ω — it asserts some inductive set I exists. The set ω of natural numbers is then carved out by the separation axiom: ω = {x ∈ I : x belongs to every inductive subset of I}. This intersection-of-all-inductive-subsets maneuver extracts the *smallest* inductive set, which is ω. This two-step process is necessary because without first having some inductive set in hand, separation has nothing to apply to. The axiom provides the raw material; separation shapes it precisely.

Without the axiom of infinity, ZF could be modeled entirely by the hereditarily finite sets V_ω — every set in this universe is finite, and infinite mathematics is impossible within it. The axiom of infinity is therefore the dividing line between finitary and infinitary set theory. Once ω exists as a set, the power set axiom produces P(ω) (an uncountable set), replacement iterates the ordinal construction into the transfinite, and the full hierarchy of infinite cardinals and ordinals opens up. Every subsequent piece of infinitary mathematics — transfinite induction, cardinal arithmetic, the continuum — ultimately rests on this single axiom's guarantee that one infinite set exists.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Boolean Algebra → Introduction to Propositional Logic → Introduction to Predicate Logic (First-Order Logic) → First-Order Logic Syntax → ZFC Axioms Overview → Axiom of Infinity

Longest path: 74 steps · 340 total prerequisite topics

Prerequisites (1)

Leads To (3)