A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Continuum Hypothesis

College Depth 87 in the knowledge graph ☐ I know this ☆ Set as goal
10topics build on this
457prerequisites beneath it
See this on the map →
Aleph NumbersCantor's Theorem+8 more→→Continuum Hypothesis and Independence from ZFCIndependence Results in Set Theory+2 more
continuum hypothesis independence cardinals Cantor Godel Cohen

Core Idea

The continuum hypothesis (CH), proposed by Cantor in 1878, asserts there is no cardinal strictly between ℵ₀ (the cardinality of ℕ) and 2^ℵ₀ (the cardinality of ℝ): equivalently, 2^ℵ₀ = ℵ₁. Gödel showed in 1940 that CH cannot be refuted from ZFC (it holds in the constructible universe L); Cohen showed in 1963 that it cannot be proved from ZFC either (his forcing technique constructs models where 2^ℵ₀ = ℵ₂ or any other prescribed value). The independence of CH was the first major application of forcing and established that the size of the continuum is fundamentally undetermined by the standard axioms.

How It's Best Learned

First situate CH: ℕ is countable, ℝ is uncountable, and the question is whether anything lies strictly between. Study Cantor's original formulation, then understand at the sketch level how Gödel's L witnesses CH cannot be disproved, and how forcing witnesses it cannot be proved. The independence result is as important as the statement.

Common Misconceptions

Explainer

From Cantor's theorem, you know that the power set 𝒫(X) is strictly larger than X for any set X, so |𝒫(ℕ)| > |ℕ|. Since 𝒫(ℕ) has the same cardinality as ℝ (both equal 2ℵ₀), there is a strict jump from ℕ to ℝ. The Continuum Hypothesis (CH) asks: is there any infinite cardinality strictly between |ℕ| = ℵ₀ and |ℝ| = 2ℵ₀? Equivalently, is 2ℵ₀ = ℵ₁—does the cardinality of the reals equal the *first* uncountable cardinal? Cantor believed no such intermediate cardinality existed and worked intensively to prove it. The question became the first problem on Hilbert's famous 1900 list. The eventual answer was not a proof or a refutation but something more radical: the question is independent of the standard axioms.

To understand what independence means, recall that a statement is independent of an axiomatic system if neither it nor its negation can be derived from those axioms. Gödel showed in 1940 that CH *cannot be disproved* from ZFC by constructing L, the constructible universe. L is an inner model of ZFC—a class of sets built by an explicit staged construction where each set is "definable" from previously constructed sets. In L, the cardinality structure is as tight as possible: 2ℵ₀ = ℵ₁, and in fact the Generalized Continuum Hypothesis (GCH: 2ℵ_α = ℵ_{α+1} for all α) holds. Since L is a legitimate model of ZFC, ZFC cannot prove CH is false.

Paul Cohen showed in 1963 that CH also *cannot be proved* from ZFC. His technique, forcing, adds new "generic" sets to a base model by specifying what properties they must satisfy without constructing them explicitly—analogous to adding a transcendental element to a field. By adding ℵ₂ many new real numbers through forcing while carefully preserving cardinal structure (not "collapsing" ℵ₁ to ℵ₀), Cohen produced a model of ZFC where 2ℵ₀ = ℵ₂, violating CH. König's theorem places the only constraint: 2ℵ₀ must have uncountable cofinality (it cannot be, e.g., ℵ_ω), but subject to this constraint, forcing can realize any prescribed value for 2ℵ₀.

The independence of CH is philosophically profound. It is not a temporary gap in mathematical knowledge—it is a structural feature of ZFC. The question has a definite answer in each *model* of ZFC (true in L, false in Cohen's model) but no answer within ZFC alone. Some set theorists respond by seeking new axioms that resolve CH: large cardinal axioms and forcing axioms like Martin's Maximum tend to imply 2ℵ₀ = ℵ₂, suggesting CH is false. Others accept that set theory has multiple equally legitimate "universes" with no canonical size for the continuum. This divide—between those seeking a unique set-theoretic universe and those embracing a multiverse—is one of the central open debates in the foundations of mathematics today.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Boolean Algebra → Introduction to Propositional Logic → Introduction to Predicate Logic (First-Order Logic) → First-Order Logic Syntax → ZFC Axioms Overview → Axiom Schema of Separation → Axiom Schema of Replacement → Von Neumann Ordinals → Hereditarily Finite Sets → Recursive Definitions on Finite Sets → Well-Founded Relations and Transfinite Recursion → The Axiom of Choice and Equivalent Formulations → Axiom of Choice → Well-Ordering Theorem → Infinite Cardinal Numbers → Cantor's Theorem → Set-Theoretic Cardinality → Aleph Numbers → Cardinal Arithmetic for Infinite Sets → Continuum Hypothesis

Longest path: 88 steps · 457 total prerequisite topics

Prerequisites (10)

Leads To (4)