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.
Prikry forcing and its direct-extension order
Definition
Work in ZFC. Let be an uncountable cardinal and let be a normal measure on in the sense of Complete ultrafilters and measurable cardinals. A Prikry condition is a pair such that
- is a finite strictly increasing sequence of ordinals below ;
- ; and
- if , then .
The empty stem imposes no maximum condition. The first coordinate is the stem, and is the upper part.
For and , write when is stronger than , meaning that end-extends , , and every entry of after belongs to . This is the stronger-below convention of Forcing preorders, compatibility and filters. Write
and call a direct extension of when and .
Reflexivity is immediate. If , then end-extends and . An entry added by either was already added by and therefore lies in , or lies in . Thus , so this is a forcing preorder. Likewise, equality of stems and inclusion of upper parts show that is reflexive and transitive. For a fixed stem, any two conditions are compatible: is a common extension, since a proper filter is closed under finite intersections.
No choice is needed to form a condition or compare two fixed conditions. The dependency The Axiom of Choice records the ambient ZFC hypothesis used for cardinal arithmetic and for the simultaneous measure-one selections in later results on this page; it is not being inferred from the existence of .
Depends on
Used by
Dependency tree · two levels
6 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, Definition 9.9 (standard reference, not scraped)