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 moreConsistency 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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesBoolean AlgebraIntroduction to Propositional LogicIntroduction to Predicate Logic (First-Order Logic)First-Order Logic SyntaxTerms and Atomic Formulas in FOLVariable Binding and ScopeOpen and Closed Formulas in First-Order LogicVariable Substitution and Capture-Avoidance in First-Order LogicQuantifier Instantiation Rules in First-Order Proof SystemsUniversal Quantification: Meaning and ScopeFree Variables and Bound VariablesSubstitution and Instantiation in Predicate LogicTerms and Atomic FormulasFormulas and Well-Formed ExpressionsStructures and InterpretationsModel Interpretation and SatisfactionInterpretation, Truth, and Satisfaction of FormulasLogical Consequence and EntailmentSatisfiability and UnsatisfiabilityConsistency and Inconsistency of TheoriesConsistency and InconsistencyComplete First-Order TheoriesFirst-Order Types and Partial DescriptionsUltrafilters in Logic and Model TheoryMeasurable Cardinals and Ultrafilters

Longest path: 93 steps · 569 total prerequisite topics

Prerequisites (4)

Leads To (1)