Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passverified 2026-08-05 (gpt-5.6-sol-codex-subscription) rests on unproved material (inherited)
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.

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Assuming the Axiom of Choice: 0=0, 1=20=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=20=R,2=220=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=20 is known (RP(N) in ZF, by the Cantor set for one injection and by the cuts {qQ:q<x} for the other; so R=20 under the Axiom of Choice) and once 2A=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, AB and AB); 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 nn is injective by that same strict increase, so Cω and C=0 by [L4] and [L1].

L1L4L7
2.1

1=20=20 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 0cf(ω) by [L6]; hence cf(ω)=0 by [L7], and 0=0<ω by the strict increase in [L1].

step 1.2L1L5L6L7
3.1

2=21=2R=P(R) by [L1], step 2.1 and [L2]; and 21=220 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 11 (120 under the Axiom of Choice, because 20 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 220 it is a cardinal computation; as P(R) it is a statement about a familiar set. The bridge is the general clause 2A=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 nn) 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 · next 3 levels

Direct dependencies and their dependencies through the next three levels: 165 results over 37 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources