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

Inner Models and Relative Consistency Proofs

Graduate Depth 97 in the knowledge graph ☐ I know this ☆ Set as goal
1topic build on this
624prerequisites beneath it
See this on the map →
The Constructible UniverseConsistency Strength and the Large-Cardinal Hierarchy+1 more→→Independence in ZFC and Limitations of Axiomatization
inner-models consistency l godel

Core Idea

An inner model M is a transitive class satisfying ZFC, contained in V. Gödel's L (constructible sets) is the canonical inner model; it satisfies GCH, the axiom of choice, and V=L. Other inner models (HOD, L[0#], etc.) capture different set-theoretic properties. Relative consistency is proved by embedding statements into inner models: if M ⊨ φ for a statement φ and M ⊆ V, then Con(ZFC) implies Con(ZFC + φ).

How It's Best Learned

Define L recursively: L₀ = ∅, L_{α+1} = Def(L_α), and L_λ = ⋃_{α < λ} L_α, where Def denotes definable subsets. Prove L ⊨ ZFC. Show Con(ZFC) → Con(ZFC + CH) via the canonical inner model. Explore other inner models and their properties.

Common Misconceptions

Explainer

From your study of the constructible universe L, you know that Gödel built a specific model inside ZFC — a class where every set is "definable from earlier sets" in a precise transfinite construction. An inner model generalizes this idea: it is any transitive class M satisfying all ZFC axioms and contained within the set-theoretic universe V. Transitivity is the key closure condition: if a ∈ M and b ∈ a, then b ∈ M. This means the model "doesn't import aliens" — every element of every element of M is already in M. Transitivity ensures that the ∈-relation inside M agrees with the actual ∈-relation in V, making M a "genuine" universe of sets, not an artificial simulation.

The key technique inner models provide is relative consistency: showing that if ZFC is consistent, then ZFC + φ is also consistent for some additional statement φ. The method is to exhibit an inner model M where φ holds. Gödel showed L ⊨ V=L (every set is constructible), L ⊨ AC (the axiom of choice holds), and L ⊨ GCH (the generalized continuum hypothesis). Since L is a definable class inside any model of ZFC, if ZFC is consistent then L gives a model of ZFC + GCH. This proves Con(ZFC) → Con(ZFC + GCH): you cannot derive a contradiction from ZFC + GCH without first deriving one from ZFC. In other words, GCH cannot be *disproved* from ZFC alone.

Notice what the technique does *not* prove: it does not show GCH is *true*, or that V = L. It shows only that assuming GCH leads to no new contradictions. This is the nature of relative consistency — a conditional, not an absolute, result. The complementary result, that GCH cannot be *proved* from ZFC, came later from Cohen's forcing method, which constructs models where GCH fails. Together, the inner model technique and forcing establish the independence of GCH from ZFC: neither the hypothesis nor its negation follows from the axioms. The inner model Gödel constructed answers "can GCH be false?"; forcing answers "can GCH be true by necessity?" — and both answers are no.

Beyond L, the inner model landscape is rich. HOD (hereditarily ordinal-definable sets) is the class of all sets whose entire membership tree is definable from ordinals — strictly larger than L, but still an inner model satisfying AC. The core model program (due to Jensen and others) generalizes L to accommodate large cardinal axioms: if large cardinals exist in V, L is too small to capture them, but a larger inner model built from "mice" (small structured sets with embeddings) can. The existence of the inner model L[0#] — L extended by a "sharp" encoding structural information about L — is equivalent to 0# existing, which in turn follows from certain large cardinal assumptions. Each inner model is a lens for studying which set-theoretic truths are already "built in" to ZFC versus which require additional axioms. Inner models are not alternative realities to be chosen between — they are tools for probing the structure of V itself.

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 → Inner Models and Relative Consistency Proofs

Longest path: 98 steps · 624 total prerequisite topics

Prerequisites (3)

Leads To (1)