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 property

Statement

Let U be a normal measure on κ, and let PU be Prikry forcing. For every pPU and every forcing-language sentence φ, there is a direct extension qp which decides φ.

Facts & Assumptions

Given: ZFC, p=(s,A) in PU, and a fixed sentence φ (with any name parameters fixed). The stronger-below convention is in force.

[F1]

Prikry forcing and its direct-extension order: Conditions with a fixed stem are compatible by intersecting their measure-one upper parts.

[F2]

Finite-set homogeneity for a normal measure: A family of finite-set colourings into fewer than κ colours is simultaneously homogeneous on one measure-one set.

[F3]

Monotonicity, density, and decision for forcing: Conditions deciding a fixed sentence are dense, forcing persists to stronger conditions, and a sentence forced densely below a condition is forced by that condition.

Proof

1.1

For each n<ω and t[A]n, listed increasingly, colour t by 0 if some upper part Bt makes (st,Bt) a condition forcing φ, by 1 if some such condition forces ¬φ, and by 2 if neither exists. Colours 0 and 1 cannot both apply: two witnesses have the same stem, so F1 gives a common extension, while persistence would make that extension force both alternatives. By F2, shrink A to one AU on which every arity-colouring is constant, and set q=(s,A)p.

F1F2
2.1

Decision density below q gives a condition rq deciding φ. Let n be the number of entries which the stem of r adds after s, and let t be that increasing n-tuple. Then t[A]n and its colour is 0 or 1, according to the decision made by r; it is not 2. Write ε{0,1} for this homogeneous colour at arity n.

F3step 1.1
3.1

For every m<ω, the homogeneous colour at arity n+m is also ε. Indeed, start with a witness at t having colour ε and choose m further increasing points from its measure-one upper part intersected with A; strengthening by those points preserves its decision, so the resulting (n+m)-tuple has colour ε. Homogeneity at that arity gives the claim, including m=0. Only finite selection is made here; the arbitrary simultaneous measure-one choices occurred inside F2 and are the precise AC use propagated from The Axiom of Choice.

F1F2F3step 2.1
4.1

Let aq be arbitrary and let m be the number of its new stem entries after s. Extend that stem by n points from its upper part. Its resulting (m+n)-tuple has colour ε by step 3.1, so a same-stem witness forces the corresponding alternative. Intersecting the two upper parts as in F1 gives a common strengthening of a which forces that alternative. Thus that alternative is dense below q, and F3 implies that q itself forces it. Hence q decides φ without changing the stem of p. [F1, F3, step 3.1]

Depends on

Used by

Dependency tree · two levels

11 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