Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

A two-step Cohen iteration is a product

Statement

When Q˙ is the constant check-name for Add(ω,1), Add(ω,1)Q˙ is forcing-equivalent to Add(ω,2), and its extension adjoins two mutually generic Cohen reals in either order.

Facts & Assumptions

Given: The hypotheses, objects, and conventions in the Statement.

[F1]

Two-step forcing iterations defines the pair order.

[F3]

Proof

1.1

The check names qˇ for qAdd(ω,1) occur in the constant name Q˙, hence lie in F1's bounded carrier R. They form a dense suborder of the restricted iteration: for any (p,q˙), the forcing membership clause gives a strengthening pp that forces q˙=qˇ for some ground q, and (p,qˇ) extends (p,q˙). On this dense check-name suborder, (p,qˇ)(p,qˇ) exactly when pp and qq. Send this pair to the finite function r on 2×ω with r(0,n)=p(n) and r(1,n)=q(n). Restriction is the inverse on the dense suborder, proving forcing equivalence.

F1
2.1

F2 factors the generic into the two one-coordinate generics; F3 says their union reconstitutes the full generic and either coordinate is Cohen-generic over the extension by the other.

F2F3

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

13 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