Axiom schema of replacement
Axiom schema ensuring definable images of sets are sets.
In Zermelo–Fraenkel set theory (ZF), the axiom schema of replacement is a collection of axioms. It states that if you have any set and any mapping that can be defined, the image of that set under the mapping is itself a set. This principle is required to build certain infinite sets within ZF.
The idea behind the schema is that whether a collection qualifies as a set depends on its size (cardinality), not on the complexity or rank of its members. So, if one collection is small enough to be a set, and there is a way to map every element of that set onto a second collection, then the second collection is also a set. However, since ZFC only deals with sets and not proper classes, the schema is phrased only for mappings that can be defined using formulas.
More formally, suppose a formula \(P\) defines a binary relation (which might be a proper class) such that for every set \(x\) there is exactly one set \(y\) with \(P(x,y)\). This gives a definable function \(F_P\), where \(F_P(x)=y\) exactly when \(P(x,y)\) holds. Now consider the collection \(B\) of all sets \(y\) for which there exists some \(x\) in a given set \(A\) with \(F_P(x)=y\). This \(B\) is the image of \(A\) under \(F_P\), written as \(F_P[A]\) or \(\{F_P(x): x\in A\}\).
The axiom schema then says: if \(F\) is any definable class function (as just described) and \(A\) is any set, then the image \(F[A]\) is also a set. This can be thought of as a principle of smallness—if \(A\) is small enough to be a set, then \(F[A]\) is also small enough. The stronger axiom of limitation of size implies this schema.
Because first-order logic cannot directly talk about all definable functions, the schema is given as one instance for each formula \(\phi\) in the language of set theory. The formula \(\phi\) may have free variables among \(w_1,\dots,w_n, A, x, y\), but \(B\) must not be free. In formal notation, the schema reads:
\[ \forall w_1,\dots,w_n\, \forall A\, \big( [\forall x\in A\, \exists! y\, \phi(x,y,w_1,\dots,w_n,A)] \implies \exists B\, \forall y\, [y\in B \iff \exists x\in A\, \phi(x,y,w_1,\dots,w_n,A)] \big). \]
- field
- Set theory
- part_of
- Zermelo–Fraenkel set theory (ZF)
- motivation
- Whether a class is a set depends only on the cardinality of the class, not on the rank of its elements
- formal_language
- First-order logic with the language of set theory
Lore & Background
The axiom schema of replacement is motivated by the idea that whether a class is a set depends only on the cardinality of the class, not on the rank of its elements. Thus, if one class is 'small enough' to be a set, and there is a surjection from that class to a second class, the axiom states that the second class is also a set. However, because ZFC only speaks of sets, not proper classes, the schema is stated only for definable surjections, which are identified with their defining formulas.
Reader's Guide
The axiom schema of replacement is a foundational principle in Zermelo–Fraenkel set theory, necessary for constructing certain infinite sets. It formalizes the idea that the image of a set under a definable function is itself a set. Because it is impossible to quantify over definable functions in first-order logic, one instance of the schema is included for each formula φ in the language of set theory. The schema can be seen as a principle of smallness: if A is small enough to be a set, then F[A] is also small enough to be a set. It is implied by the stronger axiom of limitation of size. The statement uses uniqueness quantification (∃!) to ensure the definable relation behaves like a function. This axiom is crucial for constructing ordinals and other large sets within ZF, and it distinguishes ZF from weaker set theories.
Did You Know?
- The axiom schema of replacement asserts that the image of any set under any definable mapping is also a set.
- It is necessary for the construction of certain infinite sets in ZF.
- The schema is motivated by the idea that whether a class is a set depends only on the cardinality of the class, not on the rank of its elements.
- Because ZFC only speaks of sets, the schema is stated only for definable surjections, identified with their defining formulas.
Frequently Asked Questions
What is the Axiom Schema of Replacement?
It is a family of axioms in ZF set theory that guarantees the image of any set under a definable function is itself a set. Because first-order logic cannot quantify over its own formulas, the schema generates one distinct axiom for every well-formed formula in the language of set theory, rather than being a single standalone statement.
How does Replacement differ from the Axiom of Separation?
Separation simply thins out an existing set by keeping only elements that satisfy a definable property, so the resulting set's elements are always a subset of the original. Replacement, by contrast, pushes every element through a definable function and collects the outputs, which can produce a set whose members have strictly higher rank than those of the starting set.
What breaks in ZF if you drop Replacement?
Without it, the theory cannot prove that many standard infinite objects—such as the set of all countable ordinals or the cumulative-hierarchy levels V_α for arbitrary α—are actually sets. The resulting system is too weak to carry out routine constructions in analysis, combinatorics, and descriptive set theory.
What is the core intuition behind Replacement?
The guiding principle is that whether a collection qualifies as a set depends on its cardinality, not on how complex or high-ranking its members happen to be. If you can pair every element of a known set with a unique output of a definable function, the collection of outputs must be small enough to be a set as well.
Why is it called a 'schema' rather than a single axiom?
Because the object language of first-order set theory has no way to range over its own formulas, so a single sentence cannot capture 'for every definable function.' Instead, the schema acts as a template: plug in any formula and you get a fully valid, self-contained axiom, giving you an infinite but individually checkable family of statements.
More in Set Theory And Foundations 1-20
Spotted an error? Know more?
This is a living reference — every entry is fact-audited, and reader corrections feed straight into our audit queue. Suggest an edit · See this site's audit record