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.
Absoluteness of names and their ranks
Statement
In ZF, let M be a transitive ZF model containing P. Its P-names are exactly the actual P-names that belong to M, and internal and external name ranks agree on these names. Equality of internal and external name-stage power sets is not asserted.
Facts & Assumptions
Given: ZF; transitive ZF M containing P. External membership-rank induction compares pair decoding, all subnames and the rank-supremum equations without asserting equality of name-stage power sets.
Forcing names and their rank: Names are characterized recursively by their pair entries and name predecessors; rank is the supremum of predecessor ranks plus one.
Ordinals and omega in transitive models: Ordinalhood and finite indices agree in M.
Absolute basic set operations and relations: Kuratowski pair decoding, membership, successor and union agree for sets in M; internal ZF supplies their existence.
Proof
Induct externally in actual membership rank on . Whether every entry is a pair with second coordinate in P is absolute by transitivity and F3. Every first coordinate sigma then belongs to M and has smaller membership rank. By induction sigma is internally a name iff it is actually a name. F1 characterizes namehood by exactly these entry conditions in both universes; its stage-bound converse is available internally in M because M satisfies ZF. Thus namehood agrees, including the empty name.
For a name tau, its internal set of predecessor ranks plus one exists by internal Replacement. The induction hypothesis identifies each predecessor rank, and F2 and F3 identify ordinal successors and the union giving the supremum. Both rank recursions consequently give the same value at tau. The empty predecessor set gives zero on both sides. No comparison of the full power sets at a name stage entered either induction.
Depends on
Used by
Dependency tree · two levels
7 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
- Marks Definition 24.1 and following absoluteness paragraph p97 (standard reference, not scraped)