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 Gitik's Singular-Cardinal Model: Examples and Counterexamples
1 · Prerequisites
- Boolean Algebras, Stone Duality, and the Prime Ideal Theorem
- Cardinal Arithmetic, Cofinality and the Alephs
- Club, Stationary Sets, and Pressing Down
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Countability and Uncountability
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Forcing Orders, Names, and Generic Extensions
- Formal Set-Theoretic Syntax, Structures, and Satisfaction
- Foundations of the Real Numbers for Analysis
- Large Cardinals, Measures, and Elementary Embeddings
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordinal Arithmetic and the First Uncountable Ordinal
- Ordinals, Cardinals, and Transfinite Recursion
- Preservation, Cohen Forcing, and the Continuum
- Prikry Forcing and Gitik's Singular-Cardinal Model
- Reflection, Absoluteness, and Elementary Submodels
- Relations, Functions, and Quotients
- Roots, Rational Powers, and Classical Inequalities
- Set-Theoretic Trees, Delta Systems, and Diamond
- Suprema and Infima
- The Forcing Theorem and Formal Consistency Transfer
- The ZFC Axioms and the Basic Set Constructions
- Well-Founded Relations, Rank, and the Cumulative Hierarchy
2 · Summary
The first example calculates ordinary extensions, direct tail shrinkings and incompatibility for explicit Prikry stems, then writes the dense length and height requirements whose generic union is cofinal. The second displays the bounded-name fusion through every successor and limit stage, including the final intersection and a three-decision trace producing the set {0,2}.
The counterexample uses the singleton-stem conditions to exhibit an uncountable antichain of size kappa. This directly refutes ccc while remaining compatible with the sharp kappa-plus chain condition, since among kappa-plus many conditions two must have the same stem.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Stems, direct extensions, and the generic sequence
Example
Let be a transitive model of ZFC containing a normal measure on an uncountable cardinal , let be -generic for the corresponding Prikry forcing, choose , and put
Then
are Prikry conditions. The condition extends but is not a direct extension; by contrast
is a direct extension of . The conditions and are incompatible. For a generic filter, the dense requirements on stem length and final height make the union of its stems an increasing cofinal -sequence in .
Facts & Assumptions
Given: are as above, and conditions are ordered stronger-below.
Prikry forcing and its direct-extension order: Conditions have finite strictly increasing stems, upper parts in , and extensions end-extend the old stem using points from its upper part; direct extensions keep the stem fixed.
The Prikry generic sequence changes cofinality to omega: In , the union of the stems in is a strictly increasing sequence of order type cofinal in .
Dense open sets and generic filters over a model: An -generic filter meets every dense subset of the forcing that belongs to .
Verification
Every tail belongs to : its complement is the union of fewer than singletons, while is nonprincipal and -complete. Its minimum is . Hence satisfy the upper-part inequality in F1; in particular, , , and .
If a condition extended both and , its stem would end-extend both one-entry stems. Its first entry would then have to be both and , contrary to . Thus . Notice that shrinking either upper part cannot repair this disagreement at the first stem entry.
For , write . From a stem of length , choose successively increasing points of its upper part and then shrink above the last chosen point; F1 shows that the resulting condition lies in . Thus is dense. For , let consist of conditions with nonempty stem and last entry above . Given , the measure-one set is unbounded, so choose above both and every entry of , append , and shrink the upper part to . This gives an extension in , so is dense.
The stem end-extends , its new entry lies in , and . Thus . Their stems differ, so . On the other hand , , and the stems of and agree, so .
Each and is a member of , because it is defined there from the ground forcing and the displayed ground parameters. By F3, meets every one of them. Meeting all makes the compatible stems have union of domain , and meeting all makes that union unbounded in . Since extensions only end-extend strictly increasing stems, the union is a strictly increasing cofinal -sequence, exactly as F2 asserts.
A bounded-name direct-extension fusion
Example
Let be a normal measure on , let , and suppose
Keeping the stem fixed, decide the membership questions one at a time for . At limit stages, intersect all earlier upper parts. The final intersection is still in because , and the resulting direct extension decides to equal one ground-model subset of .
For the finite sample , a possible decision trace produces the ground set and the final upper part .
Facts & Assumptions
Given: The forcing-theorem setting over a transitive ZFC ground, with as above.
The Prikry property: Every membership sentence has a deciding direct extension, so the next decision can be made without changing .
Prikry forcing adds no bounded subsets of kappa: A name forced to be a subset of is decided by a direct extension to equal a ground-model subset of .
Complete ultrafilters and measurable cardinals: The normal measure is -complete, so the intersection of fewer than members of remains in .
The Axiom of Choice: In the ZFC ground, a selector may be fixed for the nonempty sets of direct deciding extensions.
Verification
For every direct extension and every , let be the nonempty set of direct extensions of deciding “.” Nonemptiness is F1. Use F4 once to choose simultaneously for all such pairs.
Define for . Start with . Given , put . At a nonzero limit , put and . Since , F3 keeps in . Thus this is a direct-extension decreasing recursion, and decides the th membership question.
Put and . The family has cardinality below , so F3 gives and for every . Define For each , the stronger condition preserves the decision of ; hence it forces membership exactly for the ordinals in . Together with and , extensionality gives , the conclusion in F2.
When , the recursion has . If their three successive decisions are “,” “,” and “,” then the defining calculation in step 3.1 gives and . For , there are no decisions, , and the one-factor intersection returns ; for , there is exactly one deciding direct extension.
False: Prikry forcing is ccc
Statement refuted
Prikry forcing is ccc.
In fact, if is a normal measure on the uncountable cardinal , then has an antichain of size . This refutes ccc even though is -cc.
Facts & Assumptions
Given: is a normal measure on the uncountable cardinal , and uses the stronger-below order.
Prikry forcing is kappa-plus-cc but not ccc: Prikry forcing is -cc but has an antichain of size and is not ccc.
Prikry forcing and its direct-extension order: A condition has a finite increasing stem and a measure-one upper part; any two conditions with the same stem are compatible.
Complete ultrafilters and measurable cardinals: The normal measure is nonprincipal and -complete.
Closure, distributivity, and chain conditions for forcing orders: ccc means that every antichain is countable, while -cc excludes antichains of size .
Counterexample
For each , set . Its complement is the intersection-complement of the singletons for : nonprincipality puts every in , and F3 keeps their fewer-than- intersection in .
Define . Since , F2 makes a condition. If and extended both and , the stem of would end-extend both one-entry stems, so its first entry would have to equal both and . This is impossible. Therefore is a pairwise incompatible family, and the indexing is injective, so it is an antichain of cardinality exactly .
Because is uncountable, the antichain in step 2.1 is uncountable. By F4 this violates ccc, furnishing the promised witness to the failure of the refuted statement.
There is no conflict with the weaker positive conclusion in F1. There are only finite stems, and conditions with the same stem are compatible by F2. Thus among conditions two share a stem and are compatible, so no antichain has size . The explicit antichain from step 2.1 has size , which is below that forbidden size.