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 TheoremLebesgue 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 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 TheoremCarathéodory's Extension TheoremLebesgue Outer Measure on ℝⁿ

Longest path: 76 steps · 349 total prerequisite topics

Prerequisites (1)

Leads To (1)