Let be transitive classes, both interpreted with actual membership. A formula is upward absolute from to if for every tuple of parameters from ,For proper classes this means the usual relativization of the fixed formula's quantifiers. Full absoluteness requires the implication in both directions. The qualification on parameters matters: the smaller class must contain every object named in the comparison.
A sufficient syntactic condition is that be a sigma-one formula in set theory, written : an existential block with bounded, meaning that each of its quantifiers is of the form or . A bounded formula is also called and is absolute in both directions between transitive classes.
Prove the latter fact by structural induction. Atomic membership and equality have their actual meanings in both classes, and Boolean connectives preserve equivalence of truth. For a bounded quantifier with bound , transitivity ensures that every element of belongs to ; thus its range is exactly the same in both classes, and induction applies to its matrix. This proves the bounded case. If the smaller class satisfies a formula, take its existential witnesses in . They remain available in , and bounded absoluteness preserves the matrix. Hence formulas are upward absolute. An arbitrary unbounded universal quantifier has no such witness-preservation argument.
Use the bounded formulaIt expresses with no unbounded quantifier. For parameters , transitivity puts every member of in already, and membership in has the same meaning in both classes. Thus the formula is and is absolute in both directions, in particular upward absolute.
Equality with the union is expressed byThe first conjunct says that every member of lies in some member of ; the second gives the reverse inclusion. Every quantifier is bounded by a parameter or by an element of a previously bounded parameter. Therefore bounded absoluteness applies, proving full absoluteness and hence upward absoluteness of . This only compares the relation for existing parameters; it does not require either class to contain the union of every one of its sets.
A bounded expression for the successor relation isThe first two clauses put and all its elements into , while the last forbids any additional member of . Extensionality identifies this exactly with . Since the formula is , it is absolute in both directions between the transitive classes and therefore upward absolute. This bounded description also justifies the successor computations used earlier in the rank-stage Replacement counterexample.
To prove that power-set equality is not upward absolute, use the standard constructible universe theorem: is a transitive inner model of ZF containing every ordinal, and set rank is absolute between and . Since , some rank stage contains a nonconstructible set. Let be the least ordinal with . It is not zero; it cannot be a limit, since a union of earlier stages contained in is still contained in . Thus and .
We need not merely this inclusion, but that itself belongs to . Inside , ZF constructs its own rank stage , which is a set of . By transitivity and rank absoluteness,Consequently . Let , the power set computed in . Then and .
By minimality there is . Externally , but , because every member of the set is in the transitive class . Hence . Taking and proves power-set equality is not upward absolute, even between transitive models of ZF.
There is no contradiction with absoluteness of : that bounded relation agrees whenever both parameters are present in the smaller class. Power-set equality quantifies over all subsets, including a new absent from the smaller class. The step proving is essential; inclusion in a class alone would not imply membership in it.
Articles by others on the same topic
There are currently no matching articles.