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.

The continuum hypothesis and its generalisation are independent of ZFC

Statement

Write CH for the continuum hypothesis, the assertion that no set A satisfies N≺A≺P(N), where X≺Y means that X injects into Y but Y does not inject into X. Write GCH for the generalised continuum hypothesis, the assertion that for no infinite A is there a B with A≺B≺P(A).

If ZFC is consistent, then all four of ZFC + CH, ZFC + (not CH), ZFC + GCH and ZFC + (not GCH) are consistent. In particular neither CH nor GCH is decided by ZFC, unless ZFC is inconsistent.

The two halves come from the two constructions already recorded here. The constructible universe of Gödel 1938: ZF does not refute the Axiom of Choice ‡ satisfies GCH, and hence CH, which rules out a ZFC refutation of either. Cohen's forcing, the method of Cohen 1963: ZF does not prove the Axiom of Choice ‡, adjoins ℵ2 many generic subsets of N to a model of ZFC + GCH while preserving cardinals, producing a model of ZFC in which CH, and therefore GCH, fails.

In cardinal notation, using the alephs and beths of the aleph and beth hierarchies developed later in the library, GCH is the statement 2ℵα=ℵα+1 for every ordinal α, and CH is its instance α=0.

Remarks

  • Not proved in this library. Neither half is proved here. The cardinal arithmetic in which the statement is phrased above is now fully available — Cardinal (initial ordinal) and cardinality ↗, cardinal exponentiation and the aleph and beth hierarchies are all developed on a later page — what is absent is the forcing and inner-model machinery that would prove the independence statement itself.

  • What would prove it. For consistency of CH, the inner model L together with its condensation lemma. For consistency of the negation, the forcing Fn(ℵ2×ω,2) of finite partial functions, plus the countable chain condition and the Δ-system lemma, which are what show that this forcing collapses no cardinal. Both belong to a forcing and inner-model track that this library does not contain.

  • Why it matters here. The continuum hypothesis, and what this page does not prove ↗ states CH immediately after Cantor's theorem: A≺P(A) ↗ establishes the gap N≺P(N), and has to record that the obvious next question is not answerable. This item is the result it quotes. Note the gap that The continuum hypothesis, and what this page does not prove ↗ itself points out: the form of CH about R rather than about P(N) needs R≈P(N), which the library now proves in ZF, on a later page, so the two forms are interchangeable after all — the gap The continuum hypothesis, and what this page does not prove ↗ records was closed by a later page, not a standing limitation of this remark's own claim.

  • Conditional discipline. Every clause above is relative to the consistency of ZFC. "CH is independent of ZFC" is shorthand and is never used here as a standalone assertion.

Depends on

Used by

Dependency tree · one level

2 results within one dependency step 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