Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27
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.

Under CH the classical cardinal invariants all equal aleph one

Statement

In ZFC (with the Axiom of Choice The Axiom of Choice), assume the Continuum Hypothesis, in the form c=2ℵ0=ℵ1 (Cardinal sum κ⊕λ, product κ⊗λ and exponentiation κλ, and why they are written apart from the ordinal operations, The successor cardinal κ+, the alephs ℵα, the beths ℶα, successor and limit cardinals, and the identifications ℵ0=ω and ℵ1=ω1). Then the six combinatorial invariants and the eight ideal invariants of this pair of pages all collapse to ℵ1:

p=t=b=d=s=r=ℵ1,add⁡(I)=cov⁡(I)=non⁡(I)=cof⁡(I)=ℵ1(I=N,M).

Facts & Assumptions

Given: ZFC and the Continuum Hypothesis, stated as c=2ℵ0=ℵ1.

[F1]

p and t are cardinals with ℵ1≤p≤t≤c=2ℵ0. (Basic bounds for p and t, The pseudointersection and tower numbers)

[F2]

b and d are cardinals with ℵ1≤b=cf⁡(b)≤cf⁡(d)≤d≤c. (Basic bounding and dominating relations, Eventual domination and the numbers b and d)

[F3]

s and r are cardinals with ℵ1≤s≤d≤c and ℵ1≤b≤r≤c. (Splitting and reaping comparisons with b and d, The splitting and reaping numbers)

[F4]

For I=N and I=M the eight numbers satisfy ℵ1≤add⁡(I)≤min⁡(cov⁡(I),non⁡(I))≤max⁡(cov⁡(I),non⁡(I))≤cof⁡(I)≤c. (Elementary bounds on ideal cardinal invariants, Add, cov, non and cof for null and meagre ideals)

[F5]

In ZFC, hence under the Axiom of Choice, all the numbers above are cardinals, hence ordinals, and for ordinals α,β,γ with α≤β≤α one has α=β, because exactly one of α∈β, α=β, β∈α holds. (The Axiom of Choice, Cardinal (initial ordinal) and cardinality, Trichotomy and well-ordering of the ordinals)

Proof

technique · direct
1.1

By [F1], ℵ1≤p≤t≤c=ℵ1, so p and t are pinched between ℵ1 and ℵ1.

givenF1
1.2

By [F2], ℵ1≤b≤d≤c=ℵ1, so b and d are pinched between ℵ1 and ℵ1.

givenF2
1.3

By [F4], for I=N and I=M each of the four numbers lies between ℵ1 and c=ℵ1.

givenF4
2.1

By [F3] together with step 1.2, ℵ1≤s≤d≤ℵ1 and ℵ1≤b≤r≤c=ℵ1, so s and r are pinched between ℵ1 and ℵ1.

step 1.2givenF3
3.1

Every one of the fourteen numbers is an ordinal x with ℵ1≤x≤ℵ1, so x=ℵ1 by the antisymmetry clause of [F5]; this gives p=t=b=d=s=r=ℵ1 and add⁡(I)=cov⁡(I)=non⁡(I)=cof⁡(I)=ℵ1 for both ideals I=N,M, as claimed. ∎

step 1.1step 1.2step 1.3step 2.1F5

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

72 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