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

Lebesgue Measure on ℝ and ℝⁿ

Research Depth 78 in the knowledge graph ☐ I know this ☆ Set as goal
8topics build on this
370prerequisites beneath it
See this on the map →
Lebesgue Outer Measure on ℝⁿMeasure Spaces+1 more→→Comparison of Riemann and Lebesgue IntegralsLebesgue Measure on ℝⁿ
measure-theory lebesgue-measure

Core Idea

The Lebesgue measure on ℝ is the unique measure on the Borel σ-algebra satisfying μ([a,b]) = b - a. The Carathéodory measurable sets form a σ-algebra strictly larger than Borel sets (including all null sets). Lebesgue measure is translation-invariant and extends naturally to ℝⁿ.

Explainer

In your study of Lebesgue outer measure, you built a function μ* that assigns a non-negative real number (or ∞) to every subset of ℝ by covering the set with countable unions of open intervals and taking the infimum of the total length. The outer measure works for every set, but it doesn't behave well enough for integration: it fails to be countably additive on arbitrary collections of sets. Lebesgue measure fixes this by restricting attention to the sets where outer measure does behave well — the Carathéodory measurable sets.

A set E is Carathéodory measurable if it splits every other set A "cleanly": μ*(A) = μ*(A ∩ E) + μ*(A ∩ Ec) for all A. This condition says E acts as a perfect partition tool — it neither loses nor double-counts measure when used to split anything. The collection of all such sets forms a σ-algebra (closed under countable unions and complements), and the restriction of μ* to this σ-algebra is Lebesgue measure μ. This σ-algebra is strictly larger than the Borel σ-algebra you've studied: it includes all subsets of null sets (sets with measure zero), making Lebesgue measure complete in the technical sense.

The key properties to internalize are: (1) μ([a,b]) = b − a for any closed interval, consistent with ordinary length; (2) countable additivity — if E₁, E₂, ... are disjoint measurable sets, then μ(∪Eₙ) = Σμ(Eₙ); and (3) translation invariance — shifting a set E by a constant doesn't change its measure, μ(E + t) = μ(E). These properties uniquely characterize Lebesgue measure on the Borel sets: it is the only Borel measure on ℝ that assigns b − a to every interval [a, b] and is translation-invariant.

In ℝⁿ the construction extends naturally: open boxes (products of open intervals) serve as the covering sets, and their "volume" is the product of the edge lengths. The Lebesgue measure in ℝ² assigns area, in ℝ³ assigns volume, and so on. Null sets — sets of measure zero — are sets that can be covered by countable unions of intervals with total length less than any ε > 0. The rationals ℚ are a null set in ℝ despite being dense everywhere, a fact that sharply separates Lebesgue theory from Riemann integration and motivates the next step: integrating functions that are only well-behaved "almost everywhere."

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 → Set Operations: Union, Intersection, and Complement → Cartesian Products and Relations → Partial Orders → Binary Relations → Equivalence Relations → Injective, Surjective, and Bijective Functions → Cardinality and Countability → Sigma-Algebras and Measurable Sets → Measurable Sets and σ-Algebra Properties → Measure Spaces → Lebesgue Measure on ℝ and ℝⁿ

Longest path: 79 steps · 370 total prerequisite topics

Prerequisites (3)

Leads To (2)