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

Lebesgue Outer Measure on ℝⁿ

Research Depth 75 in the knowledge graph ☐ I know this ☆ Set as goal
9topics build on this
349prerequisites beneath it
See this on the map →
Carathéodory's Extension Theorem→→Lebesgue Measure on ℝ and ℝⁿ
measure-theory lebesgue-measure

Core Idea

Lebesgue outer measure on ℝⁿ is defined as λ*(A) = inf{Σᵢ vol(Iᵢ) : A ⊆ ∪ᵢ Iᵢ}, where the infimum is over countable covers by open intervals. Applying Carathéodory's theorem yields the Lebesgue measure.

Explainer

The motivating problem is deceptively simple: how do you assign a "size" to an arbitrary subset of ℝⁿ? For intervals and rectangles this is obvious — length, area, volume. But what about a dense countable set like the rationals? Or a Cantor set? The naive approach of summing lengths breaks down quickly on exotic sets, and Banach-Tarski-type paradoxes show that no measure can consistently assign a size to every subset of ℝⁿ. The Lebesgue outer measure is the response: define a notion of size for all sets, accepting that it will only be a true "measure" on a restricted class of well-behaved sets.

The definition of Lebesgue outer measure is: λ*(A) is the infimum of the total volume of all countable collections of open boxes that cover A. Think of it as approximating A from the outside — you are asking, "what is the least total volume I need if I'm allowed to cover A with as many (possibly overlapping) open boxes as I like?" The infimum ensures you are finding the tightest such approximation. For an interval [a, b], this gives b − a exactly, matching your intuition. For a single point, every cover can be made arbitrarily small, so the outer measure is 0. For a countable set of points, the same argument shows outer measure 0, even though such a set can be dense.

This construction is defined for every subset of ℝⁿ — it never fails to produce a value. But outer measure is not additive in general: λ*(A ∪ B) ≤ λ*(A) + λ*(B) (subadditivity holds), but equality for disjoint sets can fail for pathological A and B. This is where your prerequisite, the Carathéodory extension theorem, becomes essential. Carathéodory's criterion identifies exactly which sets E are "measurable" — those for which λ*(A) = λ*(A ∩ E) + λ*(A ∩ Eᶜ) for every test set A. Measurable sets split any test set into two non-interacting pieces, guaranteeing genuine additivity.

The Lebesgue measure is the restriction of λ* to the class of Carathéodory-measurable sets. By applying the Carathéodory extension theorem to λ*, you inherit all the good properties: countable additivity, completeness (subsets of null sets are measurable), and agreement with volume on rectangles. The outer measure plays the role of a pre-measure defined on all sets; the Carathéodory condition is the selection mechanism that picks out the σ-algebra on which it behaves properly. This is why the two ideas are sequential: you need the outer measure to exist everywhere before Carathéodory can select the measurable subcollection.

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 → Lebesgue Outer Measure on ℝⁿ

Longest path: 76 steps · 349 total prerequisite topics

Prerequisites (1)

Leads To (1)