Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passverified 2026-08-05 (gpt-5.6-sol-codex-subscription)
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.

Assuming the Axiom of Choice: ℶ0=ℵ0, ℶ1=2ℵ0=∣R∣, ℶ2=∣P(R)∣, and ℶω has cofinality ℵ0

Example

Assume the Axiom of Choice (The Axiom of Choice), which is what makes the beths available at all (The successor cardinal κ+, the alephs ℵα, the beths ℶα, successor and limit cardinals, and the identifications ℵ0=ω and ℵ1=ω1). Then

ℶ0=ℵ0,ℶ1=2ℵ0=∣R∣,ℶ2=22ℵ0=∣P(R)∣,

and

cf⁡(ℶω)=ℵ0<ℶω,

so ℶω is singular (Cofinality cf⁡(α), and regular and singular cardinals).

The first three values are the definition unwound, once ∣R∣=2ℵ0 is known (R≈P(N) in ZF, by the Cantor set for one injection and by the cuts {q∈Q:q<x} for the other; so ∣R∣=2ℵ0 under the Axiom of Choice) and once 2∣A∣=∣P(A)∣ is available for an arbitrary set (Assuming the Axiom of Choice, 2κ=∣P(κ)∣, and Cantor's theorem in cardinal form: κ<2κ). The last is the same cofinality argument that applies to ℵω, and for the same reason: the index ω is a limit reached by an ω-indexed family, and the beth operation is continuous at limits.

Facts & Assumptions

Given: The Axiom of Choice.

[L4]

For a well-orderable set X, ∣X∣ is the least ordinal equinumerous with X, equinumerous sets receive the same one, and ∣α∣=α exactly when α is a cardinal (A set equinumerous with some ordinal has a least such ordinal, that ordinal is a cardinal, and equinumerous sets get the same one; no choice principle is used, Cardinal (initial ordinal) and cardinality, Equinumerous sets, A≈B and A⪯B); assuming the Axiom of Choice every set has a cardinality (The well-ordering theorem).

[L7]

ω is a limit ordinal; ordinals satisfy trichotomy, the union of a set of ordinals is its least upper bound, α⊆β iff α∈β or α=β, and every strictly increasing map of ordinals is injective (ω is the least limit ordinal, Basic closure properties of ordinals, Trichotomy and well-ordering of the ordinals, Injection, surjection, bijection).

Verification

technique · direct
1.1

ℶ0=ω=ℵ0, by the two base clauses in [L1].

L1
1.2

The set C={ℶn:n∈ω} exists by Replacement, is contained in ℶω by the strict increase in [L1], and is cofinal in ℶω=⋃C, since every ζ∈ℶω lies in some ℶn and hence satisfies ζ≤ℶn; and n↦ℶn is injective by that same strict increase, so C≈ω and ∣C∣=ℵ0 by [L4] and [L1].

L1L4L7
2.1

ℶ1=2ℶ0=2ℵ0 by [L1] and step 1.1, and this equals ∣R∣ by [L3].

step 1.1L1L3
2.2

ℶω is an infinite cardinal by [L1], hence a limit ordinal by [L6], so [L5] applied to step 1.2 gives cf⁡(ℶω)≤ℵ0, while cf⁡(ℶω) is an infinite cardinal by [L5] and so ℵ0≤cf⁡(ℶω) by [L6]; hence cf⁡(ℶω)=ℵ0 by [L7], and ℵ0=ℶ0<ℶω by the strict increase in [L1].

step 1.2L1L5L6L7
3.1

ℶ2=2ℶ1=2∣R∣=∣P(R)∣ by [L1], step 2.1 and [L2]; and 2ℶ1=22ℵ0 by step 2.1.

step 2.1L1L2∎

Remarks

Where the beths and the alephs are known to agree, and where they are not. ℶ0=ℵ0 by the base clauses. Beyond that, this development proves ℵ1≤ℶ1 (ℵ1≤2ℵ0 under the Axiom of Choice, because 2ℵ0 is a cardinal strictly above ℵ0 and ℵ1 is the least such; so ω1 injects into R) and nothing sharper: whether ℶ1=ℵ1 is the continuum hypothesis, which What each result on this page costs in choice, and where the continuum escapes what ZFC can decide records as undecided by the axioms in use here.

Why ℶ2 is written two ways. As 22ℵ0 it is a cardinal computation; as ∣P(R)∣ it is a statement about a familiar set. The bridge is the general clause 2∣A∣=∣P(A)∣ of Assuming the Axiom of Choice, 2κ=∣P(κ)∣, and Cantor's theorem in cardinal form: κ<2κ, applied at A=R; without it the two expressions would have to be related by hand.

Singularity at a limit index is generic, not special to ℶω. The computation of step 2.2 uses only that the operation is strictly increasing and continuous at ω, so it applies verbatim to ℵω (cf⁡(ℵω)=ℵ0, computed from the cofinal map n↦ℵn) and to the fixed-point tower of An ordinal α with ℵα=α, built as the supremum of the tower ℵ0,ℵℵ0,ℵℵℵ0,…, and its cofinality is ℵ0. What is not generic is the value of the cofinality at other limit indices, which depends on the index and not on the operation.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

80 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