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

Carathéodory's Extension Theorem

Research Depth 74 in the knowledge graph ☐ I know this ☆ Set as goal
10topics build on this
348prerequisites beneath it
See this on the map →
Outer Measure and Carathéodory's TheoremOuter Measure and Carathéodory's Theorem→→Lebesgue Outer Measure on ℝⁿ
measure-theory extension-theorems

Core Idea

Carathéodory's theorem states that any outer measure μ* induces a measure on the σ-algebra of 'μ*-measurable' sets (those satisfying μ*(A) = μ*(A∩E) + μ*(A∩Eᶜ)). This is the standard method for constructing Lebesgue measure from an elementary definition.

How It's Best Learned

Work through the proof that μ*-measurable sets form a σ-algebra and that μ* restricted to it is σ-additive.

Common Misconceptions

The Carathéodory condition is non-obvious; it's not automatic that the μ*-measurable sets form a σ-algebra without this specific requirement.

Explainer

The fundamental challenge in measure theory is getting measure to work on enough sets. You've defined outer measure, which assigns a "size" to every subset of ℝ — but outer measure is too permissive. It's defined on all subsets, and on pathological sets it fails to be additive: μ*(A ∪ B) might not equal μ*(A) + μ*(B) even for disjoint A and B. Carathéodory's theorem provides the key insight for rescuing this: rather than trying to fix outer measure, identify the subcollection of sets where it does behave well, and show that subcollection is a σ-algebra on which outer measure is a genuine measure.

The definition of μ*-measurability is the heart of the theorem. A set E is called μ*-measurable if it "splits" every other set A perfectly in the sense that μ*(A) = μ*(A ∩ E) + μ*(A ∩ Eᶜ). In plain language: E divides every test set A into two pieces whose outer measures add up correctly. For "nice" sets like intervals, this holds — if you split a test set by an interval, the pieces' sizes add up as expected. The condition is designed precisely to exclude the pathological sets where subadditivity fails to be equality.

The theorem then delivers two results in sequence. First, the collection ℳ of all μ*-measurable sets is a σ-algebra: it contains the empty set, is closed under complements (if E works as a splitter, so does Eᶜ), and is closed under countable unions. Second, the restriction of μ* to ℳ is σ-additive — it's a genuine measure. These two facts together mean you've constructed a complete measure space (X, ℳ, μ) starting from nothing more than an outer measure.

For Lebesgue measure specifically, the construction works as follows: define the outer measure of any set by covering it with countable unions of intervals and taking the infimum of total length. Apply Carathéodory's theorem. The resulting σ-algebra contains all open sets, all closed sets, and all their countable unions and intersections — the Borel σ-algebra — plus additional "null sets." Every Borel set is Lebesgue measurable, and the measure agrees with ordinary length on intervals. The theorem transforms an elementary, intuitive definition (length of a covering) into a rigorous, complete measure theory. It's the engine behind the entire Lebesgue integration program you'll build on next.

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 → De Morgan's Laws → Negation of Quantified Statements → Proof by Contradiction → Topological Spaces: Definition and Examples → Sigma-Algebras: Formal Construction → Outer Measure and Carathéodory's Theorem → Carathéodory's Extension Theorem

Longest path: 75 steps · 348 total prerequisite topics

Prerequisites (2)

Leads To (1)