Why can the axiom of separation not be used to construct the set {ω, P(ω), P(P(ω)), ...} (the sequence of iterated power sets of ω)?
ABecause P(ω) and P(P(ω)) do not exist as individual sets in ZFC
BBecause separation can only carve subsets from an existing set, and no single set is large enough to already contain all of these as elements
CBecause the sequence is infinite and ZFC does not permit infinite sets
DBecause separation applies only to finite collections
Separation lets you extract a subset from an existing set using a formula — but you need a containing set to start from. Each P(ω), P(P(ω)), etc. exists individually by the power set axiom, but they live at ever-higher levels of the cumulative hierarchy. There is no single set already containing all of them to separate from. Replacement sidesteps this by applying the function n ↦ Vω+n to the domain ω, directly guaranteeing the image is a set.
Question 2 Multiple Choice
Suppose φ(x, y) is a formula where for some x₀ in set A, both φ(x₀, y₁) and φ(x₀, y₂) hold for two distinct values y₁ ≠ y₂. What does this mean for the axiom of replacement?
AReplacement still applies — both y₁ and y₂ are included in the image
BReplacement does not apply because φ fails the functionality condition
CReplacement applies only to y₁, the value encountered first
DReplacement applies if y₁ and y₂ belong to the same rank in the cumulative hierarchy
Replacement requires φ(x, y) to be a class function: for each x in A, there is exactly one y with φ(x, y). If x₀ maps to two distinct values, φ is a mere relation, not a function, and replacement does not guarantee the image is a set — it could be a proper class. The uniqueness condition is not a technicality; it is what bounds the image's size.
Question 3 True / False
The axiom schema of replacement requires that for each element x in the domain set A, the formula φ(x, y) determines exactly one value y.
TTrue
FFalse
Answer: True
This functionality condition is the heart of replacement. It guarantees the image contains at most one output per input, keeping the image no larger (in terms of counting elements) than the domain set A — even if individual outputs live at much higher levels of the set-theoretic universe. Without this condition, the image could be a proper class, and the axiom would be false.
Question 4 True / False
The axiom schema of replacement can be derived from the axiom of separation together with the power set axiom and the other basic ZFC axioms.
TTrue
FFalse
Answer: False
Replacement is genuinely stronger than separation. Separation only produces subsets of an existing set — it is conservative and never generates a set 'higher' in the hierarchy than its input. Replacement can map a set to outputs at arbitrarily high levels of the cumulative hierarchy, producing sets that no combination of separation, union, and power set can reach. This additional strength is essential for transfinite recursion.
Question 5 Short Answer
Explain why the axiom schema of separation is insufficient for transfinite recursion, and what the axiom of replacement contributes to make it possible.
Think about your answer, then reveal below.
Model answer: Separation only builds subsets of an already-existing set — it cannot produce a set whose elements live higher in the hierarchy than any available starting set. Transfinite recursion requires collecting outputs (e.g., Vα for all α < λ) that are scattered across arbitrarily high cumulative hierarchy levels. Replacement guarantees that the image of a class function on a set is itself a set, regardless of how high the outputs are — providing the formal license to climb the hierarchy without bound.
The distinction is: separation is conservative (output ⊆ input), replacement is expansive (output can be anywhere the function maps). Transfinite recursion needs the latter to collect the hierarchy's stages into sets stage by stage.