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

Outer Measure and Carathéodory's Theorem

Research Depth 73 in the knowledge graph I know this Set as goal
75topics build on this
347prerequisites beneath it
See this on the map →
Sigma-Algebras: Formal ConstructionSupremum and InfimumCarathéodory's Extension TheoremCarathéodory's Extension Theorem+1 more
measure-theory construction

Core Idea

An outer measure is a countably subadditive function μ*: P(X) → [0,∞]. Carathéodory's theorem constructs a measure from an outer measure by restricting to Carathéodory-measurable sets, which satisfy the splitting property. This is the key tool for building Lebesgue measure.

How It's Best Learned

First verify that any outer measure satisfying the countability axiom induces a σ-algebra. Apply to concrete examples like length on intervals to see how outer measure becomes Lebesgue measure.

Common Misconceptions

Explainer

You know from σ-algebras that a measure is defined on a carefully chosen collection of "measurable" sets, not on every subset of X. But where does that σ-algebra come from in the first place? The construction begins with a more primitive object: an outer measure μ*: P(X) → [0,∞], defined on *all* subsets of X, not just the nice ones. The cost of this generality is that μ* is only countably subadditive — μ*(⋃Aₙ) ≤ Σμ*(Aₙ) — rather than countably additive. You give up equality in exchange for universality.

The standard way to build an outer measure is from below: for any set E, define μ*(E) = inf{Σμ(Aₙ) : E ⊆ ⋃Aₙ}, where the Aₙ come from some generating collection (like open intervals) with known lengths. The infimum of all covering costs is precisely the "outer approximation" of the size of E — which connects to your prerequisite on suprema and infima. For a single interval (a,b), covering it by itself gives μ*(a,b) ≤ b−a, and any cover cannot do better, so μ*(a,b) = b−a. This is the intuition: outer measure recovers the right answer on simple sets.

Carathéodory's theorem solves the key problem: which sets can be assigned a *genuine* measure (one that is actually additive, not just subadditive)? Carathéodory's criterion says E is measurable if for every test set T, we have μ*(T) = μ*(T ∩ E) + μ*(T ∩ Eᶜ). This is the splitting property: a set E is measurable precisely when it splits every test set T additively. Geometrically, E has a "sharp enough" boundary that it doesn't create measurement ambiguity. The remarkable fact is that the collection of all measurable sets automatically forms a σ-algebra, and the restriction of μ* to this σ-algebra is countably additive — a genuine measure.

Why does this matter? Because it gives a complete construction of Lebesgue measure without assuming from the outset what the measurable sets are. Start with interval lengths, build the outer measure via coverings, and let Carathéodory's criterion identify which sets are measurable. The resulting σ-algebra turns out to contain all open and closed sets, all countable unions and intersections of these, and far more — essentially everything you would want to measure. The non-measurable sets (like the Vitali set) are exactly those that fail the splitting property, and their existence is precisely why we cannot naively assign a size to every subset of ℝ.

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 EquivalencesDe Morgan's LawsNegation of Quantified StatementsProof by ContradictionTopological Spaces: Definition and ExamplesSigma-Algebras: Formal ConstructionOuter Measure and Carathéodory's Theorem

Longest path: 74 steps · 347 total prerequisite topics

Prerequisites (2)

Leads To (3)