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.
Condensation for constructible levels
Statement
In ZF, let be a nonzero limit ordinal, let , and let be the Mostowski collapse. Then
Moreover, fixes every transitive set pointwise. For every ordinal , is the order type of ; in particular, if is transitive then .
Facts & Assumptions
Given: Ambient ZF, a nonzero limit ordinal , an elementary substructure , and its collapse .
Finite-stage L histories and weak limit-level absoluteness supplies one fixed finite sentence which holds in every nonzero limit -level and characterizes such levels among nonempty transitive sets.
Collapse of elementary membership submodels says that the membership relation on has a unique transitive collapse and that the collapse is an isomorphism .
What the collapse fixes gives the stated fixing and ordinal-order-type conclusions for any actual-membership collapse.
Proof
By F1, . Since , also . F2 makes an isomorphism from to the transitive set , so . In particular is nonempty; no assertion that or satisfies Infinity, Power Set, Replacement, Separation, or Choice has been used.
Put . The converse direction of F1 applies directly to the nonempty transitive set satisfying and yields . This includes the boundary : the supplier proves , verifies there by finite certificates, and explicitly does not infer Infinity.
F3 applied to this collapse fixes each transitive pointwise. It also gives for every actual ordinal , and gives when that intersection is transitive. These conclusions do not require itself to be transitive, and the empty transitive part is fixed vacuously.
Depends on
Used by
Dependency tree · two levels
18 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
- Lietz, Set Theory, Lemma 7.11, pp.57–58; weak-level finite-history gap completed locally (standard reference, not scraped)
- Kunen, Set Theory, Chapter VI Theorems 3.8–3.9, pp.171–172 (standard reference, not scraped)