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 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.
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.
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.
No topics depend on this one yet.