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

The Lebesgue Differentiation Theorem

Research Depth 95 in the knowledge graph ☐ I know this ☆ Set as goal
445prerequisites beneath it
See this on the map →
Introduction to the Lebesgue IntegralLebesgue Measure on ℝⁿ+2 more→
measure-theory lebesgue-integral differentiation maximal-function absolute-continuity lebesgue-points

Core Idea

The Lebesgue differentiation theorem says that for a locally integrable function f on ℝⁿ, the average of f over the ball B(x, r) converges to f(x) as r → 0 for almost every x. In one dimension this gives the fundamental theorem of calculus for Lebesgue integrals: if F(x) = ∫ from a to x of f, then F'(x) = f(x) almost everywhere. The proof rests on the Hardy-Littlewood maximal function and a covering lemma. The theorem also explains which functions are integrals of their derivatives, namely the absolutely continuous ones.

How It's Best Learned

Start with the continuous case, where averages converge to f(x) at every point by uniform continuity, and ask what can go wrong for an integrable f. Introduce the maximal function Mf(x) = sup over r > 0 of the average of |f| on B(x, r), and prove the weak-type estimate with the Vitali covering lemma. Then follow the standard pattern: approximate f by continuous functions in L¹ and use the maximal estimate to control the error. Close with the Cantor function as an example of a continuous increasing function that is not the integral of its derivative.

Common Misconceptions

Explainer

For a continuous function f on ℝ, the fundamental theorem of calculus says that d/dx ∫ from a to x of f = f(x) at every point. The difference quotient (F(x + h) - F(x))/h is the average of f over an interval of length |h|, and continuity makes these averages converge to f(x). Lebesgue integration allows far rougher functions. The natural question is whether averages still recover the function.

Theorem. If f is locally integrable on ℝⁿ, then for almost every x,

lim as r → 0 of (1/|B(x, r)|) ∫ over B(x, r) of f(y) dy = f(x).

In fact, almost every x is a Lebesgue point, meaning the average of |f(y) - f(x)| over B(x, r) tends to 0.

"Almost every" cannot be improved to "every." Changing f on a null set leaves every integral unchanged, so averages cannot detect the values of f on such a set.

The proof has a standard structure. If f is continuous with compact support, the result holds at every point. Continuous functions with compact support are dense in L¹, so write f = g + (f - g) with g continuous and ‖f - g‖₁ small. The error term needs a uniform bound on averages, supplied by the Hardy-Littlewood maximal function

Mf(x) = sup over r > 0 of (1/|B(x, r)|) ∫ over B(x, r) of |f(y)| dy.

The key estimate is weak type (1, 1): |{Mf > α}| ≤ (3ⁿ/α)‖f‖₁. It follows from the Vitali covering lemma. From any finite family of balls one can choose disjoint ones whose threefold enlargements cover the union. With this estimate, the set where the limit superior of |average of f - f(x)| exceeds 2α has outer measure at most a constant times ‖f - g‖₁/α. Letting ‖f - g‖₁ → 0 and then α → 0 shows the bad set has measure zero.

In one dimension the theorem gives the Lebesgue version of the fundamental theorem: if f ∈ L¹[a, b] and F(x) = ∫ from a to x of f, then F' = f almost everywhere. The reverse direction needs care. A function F satisfies F(x) = F(a) + ∫ from a to x of F' exactly when F is absolutely continuous. The Cantor function shows the condition is needed: it is continuous and increasing, rises from 0 to 1, and has derivative 0 at every point outside the Cantor set, which has measure zero.

Practice Questions 4 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 → Combining Small Groups Within 5 → Number Bonds Within 5 → Number Bonds to 10 → Tens and Ones Place Value → Reading and Writing Three-Digit Numbers → Comparing Three-Digit Numbers → Comparing and Ordering Three-Digit Quantities → Comparing and Ordering Whole Numbers → Comparing Numbers 1 to 20 → Ordering Numbers to 20 → Number Line 0 to 20 → 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 → Opposites and Additive Inverses → 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 → Measurable Functions → Simple Functions and Approximation → Lebesgue Integral for Simple Functions → Lebesgue Integral for Non-Negative Functions → Lebesgue Integral: General Definition → Lebesgue Integral (Full Construction) → Fatou's Lemma → Dominated Convergence Theorem → The Lebesgue Differentiation Theorem

Longest path: 96 steps · 445 total prerequisite topics

Prerequisites (4)

Leads To (0)

No topics depend on this one yet.