Hardy–Littlewood maximal theorem
Statement
is of weak type : for a universal constant (one can always take ). Consequently, by interpolation, is also bounded on for every — but itself is never bounded on .
Why is it true?
bounds, in one stroke, every average of that could ever be taken over an interval around — the running mean at every possible scale. Controlling that single quantity turns out to be exactly what is needed to prove the Lebesgue differentiation theorem (the average of over shrinking intervals around converges to for almost every ): once is known to be finite almost everywhere, a short soft argument upgrades that to the full differentiation statement. This is the real-variable engine behind the Calderón–Zygmund theory below, playing the role that Plancherel's identity played for the easy estimate.
Proof sketch
Step 1 (a cover by good balls). Fix . For every with , by definition of the supremum there is some interval centered at with . These balls cover the set .
Step 2 (Vitali -covering lemma). From any collection of balls of bounded radius, one can always extract a countable disjoint subcollection such that the -times dilated balls still cover the union of the whole original collection. Apply this to to get a disjoint subfamily with .
Step 3 (sum the disjoint pieces). Each satisfies by construction. Since the are pairwise disjoint, summing over gives , so . Finally , which is exactly .
Topics that use this theorem
Step-by-step proofs
No step-by-step proof yet for this theorem.
References
- Terence Tao (2003). Recent progress on the restriction conjecture · arXiv:math/0311181
- Elias M. Stein, Guido Weiss (1971). Introduction to Fourier Analysis on Euclidean Spaces
- Loukas Grafakos (2014). Classical Fourier Analysis · DOI:10.1007/978-1-4939-1194-3