The Lévy reflection theorem states that for every finite collection of formulas and every ordinal , there is an ordinal such that, for every and all parameters ,Indeed, the ordinals reflecting all formulas in form a closed unbounded class.
Let and takeThis formula is upward absolute between transitive models: if the smaller model contains such an , the assumed absoluteness of “function”, domain, range, and shows that the same witness works in the larger model.
The generic union is a total map , because the conditions deciding each input form a dense set. For every , the conditions putting somewhere in the range are also dense, so is surjective. Thus . But because regards as its first uncountable ordinal. Hence is not downward absolute between and .
With the same parameter , letThis formula is downward absolute: if the larger transitive model has no such function, then neither can the smaller model, since any witness in the smaller model would remain a witness in the larger one. The model satisfies , while the generic surjection makes it false in . Therefore it is not upward absolute.
Assume is a Delta-one formula in set theory. Thus ZF proves it equivalent to a formula and to a formula . Only finitely many axioms of ZF occur in these two formal proofs; collect them, together with the finite fragment needed for bounded-formula absoluteness, into .
Let be a transitive class containing and satisfying . If , then , and upward absoluteness of formulas gives , hence . If , then , and downward absoluteness of formulas gives , hence . Therefore ZF proves that is absolute for every such .
Conversely, suppose a finite has the stated absoluteness property. LetBecause is finite, every satisfaction assertion here can be replaced by the corresponding formula relativization to a class. All quantifiers in the matrix are bounded by , so is . Define the formula
By the Lévy reflection theorem, ZF proves that for any parameters there is a level containing them and satisfying the finite fragment . The assumed absoluteness says that every such transitive set agrees with about . Consequently ZF provesThus is both and , so it is .
Articles by others on the same topic
There are currently no matching articles.