The cumulative hierarchy and rank

1. The cumulative hierarchy

Using the Recusion Theorem (recursion on ordinals) we can give the official definition of the cumulative hierarchy first introduced informally in an earlier web page.


We define V 0 = , V α + 1 = P ( V α ) , and V λ = { V α : α λ } .

Alternatively and equivalently the single equation V α = { V β : β α } suffices in all cases, when α is zero, a successor or a limit.

This is well-defined, by the Recursion Theorem.


For all sets x there is some V α with x V α .


By -induction on x . We have V 0 and if y x α y V α define a function f mapping each y x to the least ordinal α such that y V α . Thus { f ( y ) : y x } is a set by replacement, hence β = { f ( y ) + 1 : y x } is an ordinal and it can be checked that x V β .

2. Rank


The rank of a set x is the least ordinal α such that x V α .

This is well-defined by the proposition above. An alternative equivalent definition is obtained from rank ( x ) = { rank ( y ) + 1 : y x } .

The formal definition of the cumulative hierarchy and rank completes a major piece of work in the setting up of Zermelo-Fraenkel set theory: it shows that the axiom of ZF do capture in some sense the intuitive idea of the hierarchy of pure sets and the notion of sets constructed in stages that we talked about to justify the axioms, especially foundation. Of course, by Gödel's incompleteness theorem the ZF axioms cannot settle everything and we shall go on to look at further axioms that we can reasonably add to them. This is the subject of the next web page in this sequence.