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 Prikry generic sequence changes cofinality to omega
Statement
Let be a transitive model of ZFC containing a normal measure on , let be Prikry forcing as computed in , and let be -generic. Then in the union of the stems in is a strictly increasing sequence of order type cofinal in . Consequently .
Facts & Assumptions
Given: as in the statement. Conditions are ordered stronger-below.
Prikry forcing and its direct-extension order: A condition has a finite strictly increasing stem, extensions end-extend stems, and new entries come from the old measure-one upper part.
Complete ultrafilters and measurable cardinals: A normal measure is a nonprincipal -complete ultrafilter on .
Dense open sets and generic filters over a model: An -generic filter meets every dense subset of the forcing which belongs to .
Forcing theorem: The forcing theorem supplies the truth lemma for every -generic filter.
Cofinality , and regular and singular cardinals: is the least ordinal length of a map into with cofinal range.
Proof
Any two conditions in have a common stronger condition because is a filter. Their stems are therefore both initial segments of the common stem and hence are comparable by end-extension. Thus is a function whose domain is an initial segment of , and F1 makes it strictly increasing.
For each , let consist of conditions whose stems have length at least . It is dense: from add finitely many increasing points from the nonempty successive measure-one tails of . The definition of and this density proof are in . By F3, meets for every ground-model natural number ; transitivity makes these all actual natural numbers. Hence .
A measure-one set is unbounded in . Otherwise it would be contained in some , while belongs to because it is the intersection of fewer than complements of singleton sets; this contradicts properness. For each , the set of conditions with a nonempty stem whose last entry exceeds is consequently dense: extend once using a point of the upper part above . Since , F3 gives , and an entry of exceeds . Thus is cofinal in .
The canonical name for the union of generic stems evaluates to , and the truth lemma places the preceding statements in . By F5, cofinal gives . No finite sequence is cofinal in the infinite limit ordinal , since its finite range has a maximum below ; therefore is not finite and equals . [F4, F5, step 2.1, step 2.2]
Depends on
Used by
Dependency tree · two levels
19 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
- Karagila, Forcing lecture notes, Section 9.2, Theorem 9.10(1) (standard reference, not scraped)