Jensen hierarchy

In set theory, a mathematical discipline, the Jensen hierarchy or J-hierarchy is a modification of Gödel's constructible hierarchy, L, that circumvents certain technical difficulties that exist in the constructible hierarchy. The J-Hierarchy figures prominently in fine structure theory, a field pioneered by Ronald Jensen, for whom the Jensen hierarchy is named. Rudimentary functions describe a method for iterating through the Jensen hierarchy.

Definition

As in the definition of L, let Def(X) be the collection of sets definable with parameters over X:

Def(X):={{y∈X∣Φ(y,z1,...,zn) is true in (X,∈)}∣Φ is a first order formula,z1,...,zn∈X}

The constructible hierarchy, L is defined by transfinite recursion. In particular, at successor ordinals, Lα+1=Def(Lα).

The difficulty with this construction is that each of the levels is not closed under the formation of unordered pairs; for a given x,y∈Lα+1∖Lα, the set {x,y} will not be an element of Lα+1, since it is not a subset of Lα.

However, Lα does have the desirable property of being closed under Σ0 separation.

Jensen's modification of the L hierarchy retains this property and the slightly weaker condition that Jα+1∩𝒫(Jα)=Def(Jα), but is also closed under pairing. The key technique is to encode hereditarily definable sets over Jα by codes; then Jα+1 will contain all sets whose codes are in Jα.

Like Lα, Jα is defined recursively. For each ordinal α, we define Wnα to be a universal Σn predicate for Jα. We encode hereditarily definable sets as Xα(n+1,e)={Xα(n,f)∣Wn+1α(e,f)}, with Xα(0,e)=e. Then set Jα,n:={Xα(n,e)∣e∈Jα} and finally, Jα+1:=⋃n∈ωJα,n.

Properties

Each sublevel Jα, n is transitive and contains all ordinals less than or equal to ωα + n. The sequence of sublevels is strictly ⊆-increasing in n, since a Σm predicate is also Σn for any n > m. The levels Jα will thus be transitive and strictly ⊆-increasing as well, and are also closed under pairing, Δ0-comprehension and transitive closure. Moreover, they have the property that

Jα+1∩𝒫(Jα)=Def(Jα),

as desired. (Or a bit more generally, Lω+α=J1+α∩Vω+α.)

The levels and sublevels are themselves Σ1 uniformly definable (i.e. the definition of Jα, n in Jβ does not depend on β), and have a uniform Σ1 well-ordering. Also, the levels of the Jensen hierarchy satisfy a condensation lemma much like the levels of Gödel's original hierarchy.

For any Jα, considering any Σn relation on Jα, there is a Skolem function for that relation that is itself definable by a Σn formula.

Rudimentary functions

A rudimentary function is a Vn→V function (i.e. a finitary function accepting sets as arguments) that can be obtained from the following operations:

For any set M let rud(M) be the smallest set containing M∪{M} closed under the rudimentary functions. Then the Jensen hierarchy satisfies Jα+1 = rud(Jα).

Projecta

Jensen defines ραn, the Σn projectum of α, as the largest β≤α such that (Jβ,A) is amenable for all A∈Σn(Jα)∩𝒫(Jβ), and the Δn projectum of α is defined similarly. One of the main results of fine structure theory is that ραn is also the largest γ such that not every Σn(Jα) subset of ωγ is (in the terminology of α-recursion theory) α-finite.

Lerman defines the Sn projectum of α to be the largest γ such that not every Sn subset of β is α-finite, where a set is Sn if it is the image of a function f(x) expressible as limy1limy2…limyng(x,y1,y2,…,yn) where g is α-recursive. In a Jensen-style characterization, S3 projectum of α is the largest β≤α such that there is an S3 epimorphism from β onto α. There exists an ordinal α whose Δ3 projectum is ω, but whose Sn projectum is α for all natural n.