Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-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.

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

Depends on

Used by

Nothing in the library uses this result yet.

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.