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.
What the collapse fixes
Statement
Let be a collapse of actual membership as above. It fixes every transitive subset pointwise. If is an actual ordinal, is the order type of . In particular, if is transitive, .
Facts & Assumptions
Collapse of elementary membership submodels: Let be a set with and let . In ambient ZF, restricted to is well-founded and extensional. It has a unique transitive collapse , and the inverse collapse followed by inclusion is an elementary embedding . Countability is preserved by .
Ordinal (von Neumann): A set is an ordinal when both of the following hold.
- is a transitive set: every element of is also a subset of , that is .
- The membership relation restricted to , namely , is a strict well-order of (def-well-order): it is irreflexive, transitive as a relation, trichotomous on , and every nonempty subset of has an -least element.
Ordinals are written with lowercase Greek letters, and for ordinals we set
Write , which is an ordinal because both clauses hold vacuously, and write for the successor of .
Proof
Given: A membership-collapse isomorphism , a transitive , and an actual ordinal .
For , transitivity gives . Assuming the collapse fixes every member , its equation (F1) gives . External membership induction proves this for all , starting with the empty predecessor set.
The restriction of to is an order isomorphism onto the elements of , by its equation and injectivity. This image is transitive: if and , then for ; ordinal transitivity gives , so . The induced membership order is a well-order since inherits one from (F2). Thus is an ordinal of the indicated order type.
If is transitive it is itself an ordinal, and the unique ordinal isomorphic to its membership order is itself. Therefore its order type, hence , equals . Without the hypothesis this need not equal .
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 — Exercise 4.7 p12, with complete local induction and ordinal calculation (standard reference, not scraped)