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

Continuum Hypothesis and Independence from ZFC

Graduate Depth 99 in the knowledge graph ☐ I know this ☆ Set as goal
1topic build on this
568prerequisites beneath it
See this on the map →
Cardinal Arithmetic, Exponentiation, and HierarchyUncountable Sets and Cantor Diagonalization+2 more→→Independence in ZFC and Limitations of Axiomatization
continuum-hypothesis independence godel-cohen forcing

Core Idea

The Continuum Hypothesis (CH) asserts 2^ℵ₀ = ℵ₁—that there is no cardinal strictly between ℵ₀ and the continuum. Gödel proved CH is consistent with ZFC; Cohen proved its negation is also consistent. Thus CH is independent of ZFC: undecidable from the standard axioms alone.

Explainer

You already know from Cantor's diagonalization that the set of real numbers is strictly larger than the set of natural numbers — |ℝ| = 2ℵ₀ > ℵ₀. And from cardinal arithmetic you know that power sets jump to strictly larger cardinalities. The natural question is: exactly how much larger is 2ℵ₀? The Continuum Hypothesis is the claim that 2ℵ₀ = ℵ₁ — the reals are precisely the *next* infinite cardinality after the naturals, with no cardinal in between. It is one of the most famous open questions in the history of mathematics, and its resolution revealed something unexpected: neither CH nor its negation is provable from the standard axioms.

Gödel established the first half in 1940 by constructing the constructible universe L — a minimal model of ZFC built by systematically defining only sets that are explicitly definable from earlier sets. In L, the axiom of choice holds, the generalized continuum hypothesis holds, and CH in particular holds. This means you cannot disprove CH from ZFC: if ZFC is consistent, then ZFC + CH is consistent, because L is a model of ZFC in which CH is true. Gödel's method is sometimes called an inner model argument — you build a carefully constrained universe inside any model of ZFC where the desired statement happens to be true.

Paul Cohen established the second half in 1963 using a radically new technique called forcing. Starting from a model of ZFC + CH, forcing constructs a carefully designed extension of the model — adding new "generic" sets — in which CH fails. The extended model satisfies all the ZFC axioms but contains enough real numbers to make 2ℵ₀ > ℵ₁. Cohen's construction showed you can add arbitrarily many reals to a model without contradiction. CH is therefore undecidable: neither CH nor ¬CH can be derived from ZFC alone. Together, Gödel and Cohen showed that CH is independent of ZFC — it is a statement that ZFC is simply silent about.

What does independence mean philosophically? It does not mean CH is meaningless or random. It means ZFC does not determine the answer. Set theorists have since explored both CH and its negation as possible axioms, and explored stronger axioms (large cardinal axioms, Martin's Axiom, Woodin's Ultimate L program) that do decide CH one way or another. Some mathematicians hold a Platonist view — there is a real mathematical universe and CH is either truly true or truly false, even if ZFC cannot tell us which. Others take a pluralist view — there are many consistent universes of set theory, and CH is true in some and false in others. The independence of CH was a watershed moment that permanently changed mathematicians' understanding of what axioms do and do not determine.

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 → Terms and Atomic Formulas in FOL → Variable Binding and Scope → Open and Closed Formulas in First-Order Logic → Variable Substitution and Capture-Avoidance in First-Order Logic → Quantifier Instantiation Rules in First-Order Proof Systems → Universal Quantification: Meaning and Scope → Free Variables and Bound Variables → Substitution and Instantiation in Predicate Logic → Terms and Atomic Formulas → Formulas and Well-Formed Expressions → Structures and Interpretations → Model Interpretation and Satisfaction → Interpretation, Truth, and Satisfaction of Formulas → Logical Consequence and Entailment → Soundness Theorem and Validity of Proof Systems → Deductive Reasoning and Formal Proof Systems → First-Order Resolution → Propositional Resolution → Semantic Tableaux (Propositional) → Semantic Tableaux (First-Order) → Decidable Fragments of First-Order Logic → Gödel's Completeness Theorem for First-Order Logic → Gödel's Incompleteness Theorems → Independence Results in Set Theory → The Constructible Universe → Absoluteness → Introduction to Forcing → Continuum Hypothesis and Independence from ZFC

Longest path: 100 steps · 568 total prerequisite topics

Prerequisites (4)

Leads To (1)