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.

Cardinal exponentiation below the continuum under MA

Statement

In ZFC+MA, for every infinite κ<20, 2κ=20. Consequently the continuum is regular.

Proof

1.1

Fix Xκ. Let PX consist of pairs (s,F) with s a finite partial map ω2 and FκX finite. Put (t,H)(s,F) iff st, FH, and t1(1)(dom(t)dom(s))is disjoint fromαFAα. This is transitive: an extension never puts a new 1 on any set already protected by the weaker condition. Conditions with the same stem s are compatible, since (s,FH) extends both. There are only countably many finite stems, so PX is σ-centered and hence ccc.

F2
2.1

For αX, let Eα={(s,F):αF}; this is dense because adjoining α to F changes no stem. For αX and n<ω, let Dα,n={(s,F):(m>n)[mAαdom(s) and s(m)=1]}. Given (s,F), the set AαβFAβ is finite by almost disjointness. Since Aα is infinite, choose m>n outside that finite set and dom(s); setting s(m)=1 gives an extension in Dα,n. Thus all these sets are dense. Their number is at most κ0=κ, so MA supplies a filter G meeting them. Let rX={m:((s,F)G) s(m)=1}. Directedness makes the stems in G consistent. If αX, meeting every Dα,n makes rXAα infinite. If αX, choose (s,F)GEα. For any (t,H)G, take (u,K)G below both. Since (u,K)(s,F) and αF, no new 1 of u beyond s lies in Aα; hence t1(1)Aαs1(1). Consequently rXAαs1(1) is finite. Therefore X={α:rXAα=0}.

F1F2step 1.1
3.1

Choosing the least real in a fixed well-order among the codes for each X gives an injection P(κ)P(ω); AC is used here. Monotonicity gives c2κ, hence equality. If cf(c)=λ<c, then ccλ=(2λ)λ=2λ=c, while König gives cλ>c, contradiction. Therefore c is regular.

F3step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

25 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