Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-fable-5)
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.

ℵ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

Example

Assume the Axiom of Choice (The Axiom of Choice). Then

ℵ0<ℵ1≤2ℵ0,

and consequently ω1 injects into R (The first uncountable ordinal ω1:=ℵ(ω), 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). Moreover 2ℵ0=ℵα for exactly one ordinal α, and that α satisfies 1≤α (Every infinite cardinal is ℵα for exactly one ordinal α, in ZF; and, assuming the Axiom of Choice, every infinite set is equinumerous with exactly one aleph).

The computation is one line and uses nothing about R: 2ℵ0 is a cardinal strictly above ℵ0 by Cantor's theorem in cardinal form (Assuming the Axiom of Choice, 2κ=∣P(κ)∣, and Cantor's theorem in cardinal form: κ<2κ), and ℵ1 is by construction the least cardinal strictly above ℵ0 (For every set A the Hartogs number ℵ(A) is a cardinal, and for every cardinal κ it is the least cardinal strictly above κ; this is a theorem of ZF). The inequality is therefore forced, and the interest lies entirely in the fact that nothing here decides whether it is an equality.

Facts & Assumptions

Given: The Axiom of Choice.

[L3]

Every infinite cardinal is ℵα for exactly one ordinal α, and the enumeration is strictly increasing (Every infinite cardinal is ℵα for exactly one ordinal α, in ZF; and, assuming the Axiom of Choice, every infinite set is equinumerous with exactly one aleph).

[L6]

Ordinals satisfy trichotomy (Trichotomy and well-ordering of the ordinals).

Verification

technique · direct
1.1

By [L1] at κ=ℵ0, the value 2ℵ0 is a cardinal with ℵ0<2ℵ0.

L1
1.2

By [L2], ℵ1 is the least cardinal strictly above ℵ0, and ℵ1=ω1.

L2
2.1

Steps 1.1 and 1.2 give ℵ1≤2ℵ0 directly from minimality; hence ω1=ℵ1⪯2ℵ0=∣R∣≈R by [L5] and [L4], so ω1 injects into R.

step 1.1step 1.2L4L5
3.1

Finally 2ℵ0 is an infinite cardinal by step 1.1, so 2ℵ0=ℵα for exactly one α by [L3], and α=0 is excluded because ℵ0<2ℵ0, so 1≤α by [L6].

step 1.1step 2.1L3L6∎

Remarks

What the inequality is not. It is not evidence for the continuum hypothesis, and it is not a partial result towards one. ℵ1≤2ℵ0 holds in every model of ZFC, including those where 2ℵ0 is very large; the inequality is a consequence of ℵ1 being defined as a least cardinal above ℵ0, so it would hold even if the continuum were enormous.

Where the real constraint lies. The one genuine restriction on 2ℵ0 proved in this development is on its cofinality, not on its position: Assuming the Axiom of Choice: κ<κcf⁡(κ) for every infinite cardinal κ, and cf⁡(2κ)>κ; in particular cf⁡(2ℵ0)>ℵ0 gives cf⁡(2ℵ0)>ℵ0, which excludes candidate values such as ℵω (FALSE: 2ℵ0=ℵω) while excluding neither ℵ1 nor ℵ2, both of which are regular under choice. Whether 2ℵ0=ℵ1 is the continuum hypothesis, and What each result on this page costs in choice, and where the continuum escapes what ZFC can decide records what is and is not settled about it here.

Without choice the statement is not even expressible in this form. In ZF alone P(N) need not be well-orderable, so 2ℵ0 need not be a cardinal and "ℵ1≤2ℵ0" has no ordinal to compare. What is a theorem of ZF is the existence of ω1 itself (The first uncountable ordinal ω1:=ℵ(ω), ω1 is uncountable, every ordinal below it is at most countable, it is a cardinal and a limit ordinal, and its existence is a theorem of ZF); the injection ω1→R of step 2.1 is obtained here from the Axiom of Choice, and nothing above claims it without that hypothesis.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

56 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