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

Measurable Cardinals and Ultrafilters

Research Depth 92 in the knowledge graph ☐ I know this ☆ Set as goal
3topics build on this
569prerequisites beneath it
See this on the map →
Cardinal Arithmetic for Infinite SetsSingular Cardinals+2 more→→Consistency Strength and the Large-Cardinal Hierarchy
measurable-cardinals ultrafilters large-cardinals measure

Core Idea

A cardinal κ is measurable if there exists a κ-complete nonprincipal ultrafilter on κ. Equivalently, there is a κ-additive {0,1}-valued measure on the power set of κ. Measurable cardinals are among the first large cardinals, lying far above ℵ₁ and beyond. Their existence is unprovable in ZFC but has deep consistency consequences.

How It's Best Learned

Review ultrafilters on ℕ (principal filters, the 'nonstandard' points). Explain why no countable cardinal is measurable. Discuss κ-completeness and why measurable cardinals must be regular and inaccessible. Mention applications to ultraproducts and model theory.

Common Misconceptions

Explainer

An ultrafilter on a set X is a maximal filter — a collection of "large" subsets of X closed under supersets and finite intersections, where for every subset either it or its complement belongs to the ultrafilter. From your study of ultrafilters, you know that a nonprincipal ultrafilter on ℕ contains no finite sets and captures a genuine notion of "almost all" that escapes any individual element. The central question motivating measurable cardinals is: can this idea be scaled up dramatically — can we put a nonprincipal ultrafilter on an uncountable cardinal κ that is closed under *κ-many* intersections simultaneously?

The obstacle is κ-completeness. An ultrafilter 𝒰 is κ-complete if it is closed under intersections of fewer than κ many of its members. Every ultrafilter is finitely complete by definition. But no nonprincipal ultrafilter on ω is ω₁-complete: the singletons {0}, {1}, {2}, ... partition ℕ into countably many pieces, and a countably complete nonprincipal ultrafilter would have to contain none of them — contradicting maximality. This argument generalizes: no countable or successors-of-countable cardinal can be measurable. The same logic kills uncountable cardinals built from below in any standard way, which is why measurable cardinals must be inaccessible and, in fact, lie far beyond all cardinals constructible within ZFC.

A measurable cardinal κ is defined precisely as an uncountable cardinal that carries a κ-complete nonprincipal ultrafilter on κ. Equivalently, there exists a two-valued measure on all subsets of κ — assigning 0 or 1 to each — that is κ-additive and assigns 0 to all singletons. Think of it as a {0,1}-valued probability measure that is simultaneously nonatomic (no individual point has positive measure) and closed under κ-many intersections. Such a cardinal must be regular (not reachable by any smaller cardinal via cofinality) and inaccessible (not reachable by power set or union operations from below), yet much larger than a mere inaccessible cardinal.

The deepest consequence is the ultrapower construction. Given measurable κ with ultrafilter 𝒰, one forms the ultrapower Ult(V, 𝒰) of the entire set-theoretic universe V, obtaining a transitive inner model M and a nontrivial elementary embedding j: V → M with critical point κ — meaning j(α) = α for all α < κ but j(κ) > κ. This embedding witnesses that κ cannot be "assembled from below": it is genuinely unreachable from the smaller universe. The existence of measurable cardinals is independent of ZFC (assuming ZFC is consistent, neither "a measurable cardinal exists" nor its negation is provable), but working at this level of the large cardinal hierarchy unlocks deep results about definable sets, determinacy of infinite games, and the structure of inner models — connections that would remain invisible within ZFC alone.

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 → Satisfiability and Unsatisfiability → Consistency and Inconsistency of Theories → Consistency and Inconsistency → Complete First-Order Theories → First-Order Types and Partial Descriptions → Ultrafilters in Logic and Model Theory → Measurable Cardinals and Ultrafilters

Longest path: 93 steps · 569 total prerequisite topics

Prerequisites (4)

Leads To (1)