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.
The inaccessible Lévy-collapse setup for Solovay's construction
Definition
Let be a transitive model of ZFC and let be strongly inaccessible in . For the real--ordinal definability form of the Solovay model, take the forcing ground to be . The constructible-inner-model theorem gives with the same ordinals as . Moreover, is still inaccessible in : regularity is downward absolute; and unboundedly many -cardinals below it remain cardinals in the inner model; and GCH in makes this regular limit cardinal a strong limit. The canonical setlike global well-order of also makes every ground-model parameter definable from an ordinal. We henceforth write for this constructible ground.
In , let
ordered by reverse inclusion. This is the finite-condition presentation of . For , put and, for a supplied -generic filter , put .
The restriction map is a complete projection: if , then projects to , since the initial and tail domains are disjoint. Thus is -generic over , , and the remaining forcing is the quotient .
No model or generic is asserted to exist. Passing to adds no consistency hypothesis beyond the inaccessible in . Choice is a ground/ambient hypothesis: it supports the usual cardinal comparisons, maximal-antichain arguments and forcing recursion. It is not included in the eventual inner model.
Depends on
Used by
- The hereditarily ordinal-sequence-definable Solovay model Definition
- Factoring the Solovay collapse around a real parameter Example
- A perfect tree of mutually generic name interpretations Lemma
- Fixed finite-fragment verification for the Solovay construction Lemma
- The Lévy collapse localizes countable ordinal data Lemma
- All sets of reals in Solovay L(R) have LM, BP, and PSP Theorem
- Every uncountable Solovay-model set of reals has a perfect subset Theorem
- The Solovay inner model satisfies ZF and every real set has a real–ordinal definition Theorem
Dependency tree · two levels
31 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
- Solovay, A model of set-theory in which every set of reals is Lebesgue measurable, Part I §3 (standard reference, not scraped)