Alphabeta Math
Remark‡ sources checked 2026-07-29‡ not proved here
‡ Recorded, not proved here. This statement is included so the library can refer to it honestly, with a citation to the literature. It is not proved anywhere in this library: the track that would prove it has not been developed here yet.

Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice

Statement

Over ZF, the generalised continuum hypothesis implies the Axiom of Choice.

Precisely: assume ZF, and assume GCH in the choice-free form "for every infinite set A there is no set B with A≺B≺P(A)", where X≺Y means X injects into Y but not conversely. Then every set can be well-ordered, and so the Axiom of Choice holds.

The argument (Lindenbaum and Tarski announced it in 1926; Sierpiński gave the published proof in 1947) runs through Hartogs numbers. For a set A let ℵ(A) be the least ordinal not injecting into A, which exists in ZF. One shows in ZF that ℵ(A)⪯P(P(P(A))), and then uses GCH three times, on A, on P(A) and on P(P(A)), to force A into bijection with an ordinal.

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

3 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