Alphabeta Math
Pipeline-generated
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

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

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Stems, direct extensions, and the generic sequence

Example

Let M be a transitive model of ZFC containing a normal measure U on an uncountable cardinal κ, let G be M-generic for the corresponding Prikry forcing, choose α<β<γ<κ, and put

Aδ={ξ<κ:δ<ξ}.

Then

p=(α,Aα),q=(α,β,Aβ),r=(γ,Aγ)

are Prikry conditions. The condition q extends p but is not a direct extension; by contrast

p=(α,Aβ)

is a direct extension of p. The conditions p and r 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: M,U,κ,G,α,β,γ are as above, and conditions are ordered stronger-below.

[F1]

Prikry forcing and its direct-extension order: Conditions have finite strictly increasing stems, upper parts in U, and extensions end-extend the old stem using points from its upper part; direct extensions keep the stem fixed.

[F2]

The Prikry generic sequence changes cofinality to omega: In M[G], the union of the stems in G is a strictly increasing sequence of order type ω cofinal in κ.

[F3]

Dense open sets and generic filters over a model: An M-generic filter meets every dense subset of the forcing that belongs to M.

Verification

1.1

Every tail Aδ belongs to U: its complement is the union of fewer than κ singletons, while U is nonprincipal and κ-complete. Its minimum is δ+1. Hence p,q,r,p satisfy the upper-part inequality in F1; in particular, α<α+1, β<β+1, and γ<γ+1.

F1
1.2

If a condition extended both p and r, its stem would end-extend both one-entry stems. Its first entry would then have to be both α and γ, contrary to α<γ. Thus pr. Notice that shrinking either upper part cannot repair this disagreement at the first stem entry.

F1
1.3

For n<ω, write Dn={(s,A):sn}. From a stem of length m<n, choose successively nm increasing points of its upper part and then shrink above the last chosen point; F1 shows that the resulting condition lies in Dn. Thus Dn is dense. For η<κ, let Eη consist of conditions with nonempty stem and last entry above η. Given (s,A), the measure-one set A is unbounded, so choose ξA above both η and every entry of s, append ξ, and shrink the upper part to AAξ. This gives an extension in Eη, so Eη is dense.

F1
2.1

The stem α,β end-extends α, its new entry β lies in Aα, and AβAα. Thus qp. Their stems differ, so q̸p. On the other hand pp, AβAα, and the stems of p and p agree, so pp.

F1step 1.1
3.1

Each Dn and Eη is a member of M, because it is defined there from the ground forcing and the displayed ground parameters. By F3, G meets every one of them. Meeting all Dn makes the compatible stems have union of domain ω, and meeting all Eη 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.

F2F3step 1.3
ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

A bounded-name direct-extension fusion

Example

Let U be a normal measure on κ, let γ<κ, and suppose

p=(s,A0)x˙γˇ.

Keeping the stem s fixed, decide the membership questions ξˇx˙ one at a time for ξ<γ. At limit stages, intersect all earlier upper parts. The final intersection is still in U because γ<κ, and the resulting direct extension decides x˙ to equal one ground-model subset of γ.

For the finite sample γ=3, a possible decision trace +,,+ produces the ground set {0,2} and the final upper part A0A1A2A3.

Facts & Assumptions

Given: The forcing-theorem setting over a transitive ZFC ground, with U,κ,γ,p,x˙ as above.

[F1]

The Prikry property: Every membership sentence has a deciding direct extension, so the next decision can be made without changing s.

[F2]

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 γ.

[F3]

Complete ultrafilters and measurable cardinals: The normal measure U is κ-complete, so the intersection of fewer than κ members of U remains in U.

[F4]

The Axiom of Choice: In the ZFC ground, a selector may be fixed for the nonempty sets of direct deciding extensions.

Verification

1.1

For every direct extension rp and every ξ<γ, let C(r,ξ) be the nonempty set of direct extensions of r deciding “ξˇx˙.” Nonemptiness is F1. Use F4 once to choose d(r,ξ)C(r,ξ) simultaneously for all such pairs.

F1F4
2.1

Define pξ=(s,Aξ) for ξγ. Start with p0=p. Given pξ, put pξ+1=d(pξ,ξ). At a nonzero limit δγ, put Aδ=ξ<δAξ and pδ=(s,Aδ). Since δγ<κ, F3 keeps Aδ in U. Thus this is a direct-extension decreasing recursion, and pξ+1 decides the ξth membership question.

F1F3step 1.1
3.1

Put B=ξγAξ and q=(s,B). The family has cardinality below κ, so F3 gives BU and qpξ for every ξγ. Define x={ξ<γ:pξ+1ξˇx˙}. For each ξ<γ, the stronger condition q preserves the decision of pξ+1; hence it forces membership exactly for the ordinals in x. Together with qp and px˙γˇ, extensionality gives qx˙=xˇ, the conclusion in F2.

F2F3step 2.1
4.1

When γ=3, the recursion has p0,p1,p2,p3. If their three successive decisions are “0x˙,” “1x˙,” and “2x˙,” then the defining calculation in step 3.1 gives x={0,2} and B=A0A1A2A3. For γ=0, there are no decisions, x=, and the one-factor intersection returns q=p; for γ=1, there is exactly one deciding direct extension.

step 2.1step 3.1
False statementConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

False: Prikry forcing is ccc

Statement refuted

Prikry forcing is ccc.

In fact, if U is a normal measure on the uncountable cardinal κ, then PU has an antichain of size κ. This refutes ccc even though PU is κ+-cc.

Facts & Assumptions

Given: U is a normal measure on the uncountable cardinal κ, and PU uses the stronger-below order.

[F1]

Prikry forcing is kappa-plus-cc but not ccc: Prikry forcing is κ+-cc but has an antichain of size κ and is not ccc.

[F2]

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.

[F3]

Complete ultrafilters and measurable cardinals: The normal measure is nonprincipal and κ-complete.

[F4]

Closure, distributivity, and chain conditions for forcing orders: ccc means that every antichain is countable, while κ+-cc excludes antichains of size κ+.

Counterexample

1.1

For each α<κ, set Aα={ξ<κ:α<ξ}. Its complement is the intersection-complement of the singletons {ξ} for ξα: nonprincipality puts every κ{ξ} in U, and F3 keeps their fewer-than-κ intersection Aα in U.

F3
2.1

Define pα=(α,Aα). Since minAα=α+1, F2 makes pα a condition. If αβ and r extended both pα and pβ, the stem of r would end-extend both one-entry stems, so its first entry would have to equal both α and β. This is impossible. Therefore {pα:α<κ} is a pairwise incompatible family, and the indexing is injective, so it is an antichain of cardinality exactly κ.

F2step 1.1
3.1

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.

F4step 2.1
4.1

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.

F1F2F4step 2.1step 3.1

Sources