Questions: The Cumulative Hierarchy and Ranks

Question 1

The set {ω} contains exactly one element, yet it has rank ω + 1. Why?

• A. Because {ω} is infinite, and infinite sets always have infinite rank
• B. Because rank equals the number of elements, and ω + 1 is the successor of ω which has ω elements
• C. Because rank measures depth of membership nesting: ω has rank ω (since each n ∈ ω has rank n), so {ω} ∈ V_{ω+1} and has rank ω + 1
• D. Because {ω} is not in V_ω, and the next available rank is ω + 1 by the power set construction

Answer: (C)

Rank measures depth of membership nesting, not cardinality. The rank of a set is one more than the supremum of the ranks of its elements. The element ω = {0, 1, 2, ...} has rank ω (each natural number n has rank n, and their supremum is ω). So {ω} has rank sup{rank(ω)} + 1 = ω + 1. A set with one deeply nested element can have arbitrarily high rank. This is the key conceptual distinction: rank ≠ cardinality.

Question 2

How many elements does V₃ (the third level of the cumulative hierarchy) contain?

• A. 3
• B. 4
• C. 8
• D. 16

Answer: (C)

V₀ = ∅ (0 elements). V₁ = P(V₀) = {∅} (1 element). V₂ = P(V₁) = {∅, {∅}} (2 elements). V₃ = P(V₂) = P({∅, {∅}}) = {∅, {∅}, {{∅}}, {∅, {∅}}} (4 elements). At each successor stage, the level doubles in size because we take the power set. The pattern is |V_{n+1}| = 2^|V_n|, giving 0, 1, 2, 4, 16, 65536, ... elements at levels 0, 1, 2, 3, 4, 5, ...

Question 3

A set with higher rank necessarily contains more elements than a set with lower rank.

• T. True
• F. False

Answer: False

Rank and cardinality are independent. The set {ω} has rank ω + 1 but contains exactly one element; {0, 1, 2} has rank 4 (since 2 = {0,1} has rank 3, so {0,1,2} has rank 4) but contains three elements. In general, rank measures how deeply nested a set's construction is — how many levels of membership you must descend before reaching ∅ — while cardinality measures how many elements a set has. A singleton with a very deeply nested element can have much higher rank than a large set of small-rank elements.

Question 4

The union V = ⋃_α V_α of most levels of the cumulative hierarchy is itself a set that belongs to some V_α at a high enough rank.

• T. True
• F. False

Answer: False

V is a proper class, not a set. If V were a set, it would have some rank α, meaning V ∈ V_{α+1}. But then V ∈ V, creating a membership cycle that violates the axiom of regularity. More fundamentally, by Cantor's theorem and the Burali-Forti paradox, the collection of all ordinals (needed to index V) is too large to be a set. V is the totality of all well-founded sets — it has no rank, because rank is defined only for sets, and V transcends any single V_α.

Question 5

What does the 'rank' of a set measure, and why is it different from the cardinality of the set?

Model answer: Rank measures the depth of membership nesting — how many levels of ∈ you must descend from the set before reaching ∅. Formally, rank(x) = sup{rank(y) + 1 : y ∈ x}. A set of rank n contains only sets of rank < n, which contain only sets of rank < n−1, and so on, bottoming out at ∅. Cardinality, by contrast, measures how many elements a set has. These are orthogonal: {ω} has cardinality 1 but rank ω+1; {0, 1, 2, ..., 1000} has cardinality 1001 but rank only 4 (since 1000 has rank 4 as a von Neumann ordinal).

The distinction between rank and cardinality is essential for understanding the cumulative hierarchy. Rank tells you when in the transfinite construction V_α a set first appears — a set of rank α first appears at V_{α+1}. Cardinality tells you how big the set is. Sets at V_ω include all hereditarily finite sets (every set whose members, and their members, etc., are all finite), regardless of their cardinality. The integers are in V_ω; ℝ (the reals) are in V_{ω+1} as a power set construction — higher rank but also higher cardinality in this case.