How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Ranks agree and hierarchy membership is absolute
Statement
If are transitive models of ZF and , then . For every , . Equality of the two internal power sets or stage sets is not asserted.
Facts & Assumptions
Ordinals and omega in transitive models: In ambient ZF, ordinalhood is absolute between transitive membership domains containing the parameter. A transitive set model of ZF contains precisely the real finite ordinals as its natural numbers and has . Its ordinals form an initial segment of the actual ordinals.
Membership rank under Foundation: Now assume ZF, including Foundation. Membership on the universe is well-founded and setlike, so its ordinal rank is defined for every set. Write
The empty supremum is , so . If , then . This is the Foundation-dependent special case of relation rank. The earlier construction of did not require Foundation.
Conventions and prerequisites: def-rank-of-a-well-founded-relation, thm-foundation-equivalent-to-hierarchy-exhaustion.
Absolute basic set operations and relations: The graphs of empty set, subset, unordered pair, singleton, union, intersection (with ), difference, Kuratowski ordered pair, Cartesian product, relation domain/range, functionhood, evaluation and injection have definitions. Thus their values agree between transitive membership structures whenever the input and output sets are in the smaller domain. This is graph agreement, not an assertion that an arbitrary transitive domain is closed under these operations.
Rank characterizes hierarchy membership: In ZF, for every set and ordinal ,
Thus is the least with , and iff .
Proof
Given: are transitive ZF models; and is an ordinal.
Each model has its rank function by its ZF axioms; F1 identifies its ordinal values with actual ordinals. Suppose by external membership induction that both ranks agree on every . Transitivity ensures these are exactly the predecessors considered inside either model.
By F2, each rank of is the supremum of the predecessor ranks plus one. Ordinal successor and union have their actual values by F3, so both suprema are the same actual ordinal. For both are the empty supremum . Foundation validates this external induction, proving rank agreement for every .
For , F4 applied inside the two ZF models gives . Also every element of belongs to by transitivity. These two statements give precisely the displayed intersection equality.
Depends on
Used by
Dependency tree · two levels
9 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Geschke, Models of Set Theory — §3 end pp9–10, hierarchy-membership absoluteness; local explicit rank induction (standard reference, not scraped)