Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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.

Condensation bounds a constructible real

Example

If xω and xL, the hull-and-collapse proof produces a countable ordinal β<ω1 such that xLβ.

Facts & Assumptions

Given: Ambient ZF and a constructible real xω.

[F1]

Canonical L-hulls are elementary and small makes the hull of the countable seed ω{ω,x} elementary and countably infinite.

[F2]

Condensation for constructible levels identifies the transitive collapse of that hull with Lβ.

[F3]

What the collapse fixes fixes every transitive subset of the hull pointwise and computes collapsed ordinals as order types.

[F4]

Constructible subsets appear before successor cardinals gives the general conclusion xLω1; the calculation below exhibits its sharper witness β<ω1.

Verification

1.1

Choose a nonzero limit θ with x,ωLθ and form H=HullLθ(ω{ω,x}). F1 gives HLθ and a bijection between H and ω. In particular every natural number belongs to H, not merely the set ω as one element.

F1given
2.1

Collapse H by π to M=Lβ using F2. Since ωH is transitive, F3 fixes every natural number. The map π is an isomorphism onto the transitive set M: if yπ(x), surjectivity gives uH with π(u)=y, and relation reflection gives ux; conversely ux implies π(u)π(x). Since xωH and π(u)=u there, π(x)={π(u):ux}=x. Hence xM=Lβ. This includes the empty real.

F2F3step 1.1
3.1

The collapse is a bijection, so M is countable. Since β=OrdMM, the ordinal β is countable and therefore β<ω1. Thus the hull calculation proves the claimed bound and, consistently with F4, yields xLω1. No ambient Choice is used.

F2F4step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

14 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