Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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 M be a transitive model of ZFC containing a normal measure U on κ, let PU be Prikry forcing as computed in M, and let G be M-generic. Then in M[G] the union of the stems in G is a strictly increasing sequence of order type ω cofinal in κ. Consequently M[G]cf(κ)=ω.

Facts & Assumptions

Given: M,U,κ,PU,G as in the statement. Conditions are ordered stronger-below.

[F1]

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.

[F2]

Complete ultrafilters and measurable cardinals: A normal measure is a nonprincipal κ-complete ultrafilter on κ.

[F3]

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

[F4]

Forcing theorem: The forcing theorem supplies the truth lemma for every M-generic filter.

[F5]

Cofinality cf(α), and regular and singular cardinals: cf(κ) is the least ordinal length of a map into κ with cofinal range.

Proof

1.1

Any two conditions in G have a common stronger condition because G is a filter. Their stems are therefore both initial segments of the common stem and hence are comparable by end-extension. Thus g={sp:pG} is a function whose domain is an initial segment of ω, and F1 makes it strictly increasing.

F1F3
2.1

For each n<ω, let Dn consist of conditions whose stems have length at least n. It is dense: from (s,A) add finitely many increasing points from the nonempty successive measure-one tails of A. The definition of Dn and this density proof are in M. By F3, G meets Dn for every ground-model natural number n; transitivity makes these all actual natural numbers. Hence dom(g)=ω.

F1F2F3step 1.1
2.2

A measure-one set is unbounded in κ. Otherwise it would be contained in some α<κ, while κα belongs to U because it is the intersection of fewer than κ complements of singleton sets; this contradicts properness. For each α<κ, the set Eα of conditions with a nonempty stem whose last entry exceeds α is consequently dense: extend once using a point of the upper part above α. Since EαM, F3 gives pGEα, and an entry of g exceeds α. Thus g is cofinal in κ.

F1F2F3step 1.1
3.1

The canonical name for the union of generic stems evaluates to g, and the truth lemma places the preceding statements in M[G]. By F5, g:ωκ cofinal gives cf(κ)ω. No finite sequence is cofinal in the infinite limit ordinal κ, since its finite range has a maximum below κ; therefore cf(κ) 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