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

Absoluteness

Graduate Depth 97 in the knowledge graph ☐ I know this ☆ Set as goal
4topics build on this
562prerequisites beneath it
See this on the map →
Independence Results in Set TheoryThe Constructible Universe→→Introduction to Forcing
absoluteness Δ₁ formulas Shoenfield absoluteness transitive models inner models

Core Idea

A formula φ is absolute between two models M ⊆ N of set theory if φ holds in M exactly when it holds in N — the truth value does not depend on which model is evaluating it. Δ₁ formulas (those equivalent to both a Σ₁ and a Π₁ formula) are absolute for transitive models: properties like 'x is an ordinal', 'x is a natural number', and 'f is a function' cannot change their truth value when passing between a transitive model and the full universe. Shoenfield's absoluteness theorem extends this dramatically: all Σ¹₂ statements of second-order arithmetic are absolute between V and any inner model containing all countable ordinals. This means many analytic and coanalytic properties of reals are immune to forcing and cannot be shown independent by standard methods.

How It's Best Learned

Start with concrete examples of absolute and non-absolute notions. 'x is an ordinal' is absolute; 'x is countable' is not (a set can be countable in V but uncountable in an inner model that lacks the witnessing bijection). Prove that bounded quantifier formulas (Δ₀) are absolute for transitive models, then extend to Σ₁ and Δ₁. Finally, state Shoenfield absoluteness and see why it limits what independence proofs can achieve: no Σ¹₂ statement of analysis can be shown independent of ZFC using forcing.

Common Misconceptions

Explainer

From your study of independence results, you know that set theory has models — the same axioms can be satisfied by different mathematical universes. Two models M and N (with M ⊆ N) may disagree about the truth of statements: a sentence true in M might be false in N. This is disturbing if you think of M and N as "the same sets" — but they are not the same universe, and each evaluates formulas in its own domain. Absoluteness is the study of which properties are immune to this model-dependence.

The cleanest example is Δ₀ absoluteness. A Δ₀ formula (also called bounded) is one where all quantifiers are restricted: instead of ∀x, you write ∀x ∈ y (for all x that are elements of y). Such formulas only quantify over elements of things already in scope, so their truth can be checked by looking "inside" the sets present in the model. If M is a transitive model (closed under membership: x ∈ y ∈ M → x ∈ M), then a Δ₀ formula φ(a) is absolute between M and V: φ(a) holds in M iff it holds in V. Properties like "x is an ordered pair," "f is a function with domain d," and "x is an ordinal" are all Δ₀ or Δ₁ (provably equivalent to both a Σ₁ and a Π₁ formula), hence absolute for transitive models.

By contrast, "x is countable" is the archetypal non-absolute notion. Countability means "there exists a bijection between x and ω." That bijection must exist *in the model*. An inner model M might be missing many bijections that exist in V — in fact, forcing constructions deliberately add new bijections to make previously "uncountable" sets become countable. So ℵ₁^M (what M thinks is the first uncountable cardinal) might be countable from V's perspective. The formula ∃f (f is a bijection from x to ω) is Σ₁, and Σ₁ formulas are upward absolute (if true in M, they remain true in any extension N ⊇ M) but not downward absolute. "x is uncountable" is Π₁, hence downward absolute but not upward — the exact mirror.

Shoenfield's absoluteness theorem dramatically extends these observations. It states that all Σ¹₂ statements of second-order arithmetic — formulas of the form ∃f ∀g φ(f, g) where f, g range over real numbers and φ is arithmetic — are absolute between V and any inner model containing all the countable ordinals (in particular, between V and L, and between V and any forcing extension). This means that many of the central problems of descriptive set theory — the Borel and analytic sets — cannot be shown independent of ZFC by forcing. Forcing changes which reals exist, but it cannot change which Σ¹₂ statements hold, because those statements only depend on countable objects, and forcing extensions agree with V on all countable ordinals. Absoluteness thus draws a sharp line: below Σ¹₂ the set-theoretic universe is rigid; above it, independence results become possible.

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

Longest path: 98 steps · 562 total prerequisite topics

Prerequisites (2)

Leads To (1)