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

Diamond implies CH

Statement

In ZFC, implies 20=1.

Facts & Assumptions

Given: A diamond sequence (Aα)α<ω1; assume AC.

[F1]

For each Aω1, the correct-guess set meets every club. Diamond on ω1

[F2]

Club means closed and unbounded, with closure tested at nonzero limits. Closed unbounded subsets of ordinals

[F3]

The power set of any set has strictly larger cardinality than that set. Cantor's theorem: AP(A)

[F4]

Under AC cardinality is the least equinumerous ordinal. Cardinal (initial ordinal) and cardinality

[A1]

Proof

1.1

The tail C={α<ω1:α>ω} is club: it is unbounded, and any nonzero limit point of it is greater than ω and still belongs to it. For Bω, apply F1 to B and C. At the resulting α>ω one has Bα=B, so Aα=B. Define j(B) to be the least such α>ω. This minimum exists in the nonempty set of eligible ordinals. If j(B)=j(D)=α, then B=Aα=D, proving that j:P(ω)ω1 is injective. The argument includes B= and B=ω.

F1F2given
2.1

Step 1.1 gives P(ω)1. F3 with A=ω gives 0<P(ω), and by F4 and A1 any uncountable cardinal is at least the least uncountable cardinal 1. The two inequalities give P(ω)=1, which is 20=1.

F3F4A1step 1.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

20 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