Hardy–Littlewood maximal function

In mathematics, the Hardy–Littlewood maximal operator M is a significant non-linear operator used in real analysis and harmonic analysis.

Definition

The operator takes a locally integrable function f : R^d → C and returns another function Mf. For any point x ∈ R^d, the function Mf returns the maximum of a set of reals, namely the set of average values of f for all the balls B(x, r) of any radius r at x. Formally,

[math]\displaystyle{ Mf(x)=\sup_{r\gt 0} \frac{1}{|B(x, r)|}\int_{B(x, r)} |f(y)|\, dy }[/math]

where |E| denotes the d-dimensional Lebesgue measure of a subset E ⊂ R^d.

The averages are jointly continuous in x and r, therefore the maximal function Mf, being the supremum over r > 0, is measurable. It is not obvious that Mf is finite almost everywhere. This is a corollary of the Hardy–Littlewood maximal inequality.

Hardy–Littlewood maximal inequality

This theorem of G. H. Hardy and J. E. Littlewood states that M is bounded as a sublinear operator from L^p(R^d) to itself for p > 1. That is, if f ∈ L^p(R^d) then the maximal function Mf is weak L¹-bounded and Mf ∈ L^p(R^d). Before stating the theorem more precisely, for simplicity, let {f > t} denote the set {x | f(x) > t}. Now we have:

Theorem (Weak Type Estimate). For d ≥ 1, there is a constant C_d > 0 such that for all λ > 0 and f ∈ L¹(R^d), we have:

[math]\displaystyle{ \left |\{Mf \gt \lambda\} \right |\lt \frac{C_d}{\lambda} \Vert f\Vert_{L^1 (\mathbf{R}^d)}. }[/math]

With the Hardy–Littlewood maximal inequality in hand, the following strong-type estimate is an immediate consequence of the Marcinkiewicz interpolation theorem:

Theorem (Strong Type Estimate). For d ≥ 1, 1 < p ≤ ∞, and f ∈ L^p(R^d),

there is a constant C_p,d > 0 such that

[math]\displaystyle{ \Vert Mf\Vert_{L^p (\mathbf{R}^d)}\leq C_{p,d}\Vert f\Vert_{L^p(\mathbf{R}^d)}. }[/math]

In the strong type estimate the best bounds for C_p,d are unknown. However subsequently Elias M. Stein used the Calderón-Zygmund method of rotations to prove the following:

Theorem (Dimension Independence). For 1 < p ≤ ∞ one can pick C_p,d = C_p independent of d.

Proof

While there are several proofs of this theorem, a common one is given below: For p = ∞, the inequality is trivial (since the average of a function is no larger than its essential supremum). For 1 < p < ∞, first we shall use the following version of the Vitali covering lemma to prove the weak-type estimate. (See the article for the proof of the lemma.)

Lemma. Let X be a separable metric space and [math]\displaystyle{ \mathcal{F} }[/math] a family of open balls with bounded diameter. Then [math]\displaystyle{ \mathcal{F} }[/math] has a countable subfamily [math]\displaystyle{ \mathcal{F}' }[/math] consisting of disjoint balls such that

[math]\displaystyle{ \bigcup_{B \in \mathcal{F}} B \subset \bigcup_{B \in \mathcal{F'}} 5B }[/math]

where 5B is B with 5 times radius.

If Mf(x) > t, then, by definition, we can find a ball B_x centered at x such that

[math]\displaystyle{ \int_{B_x} |f|dy \gt t|B_x|. }[/math]

By the lemma, we can find, among such balls, a sequence of disjoint balls B_j such that the union of 5B_j covers {Mf > t}. It follows:

[math]\displaystyle{ |\{Mf \gt t\}| \le 5^d \sum_j |B_j| \le {5^d \over t} \int |f|dy. }[/math]

This completes the proof of the weak-type estimate. We next deduce from this the L^p bounds. Define b by b(x) = f(x) if |f(x)| > t/2 and 0 otherwise. By the weak-type estimate applied to b, we have:

[math]\displaystyle{ |\{Mf \gt t\}| \le {2C \over t} \int_{|f| \gt \frac{t}{2}} |f|dx, }[/math]

with C = 5^d. Then

[math]\displaystyle{ \|Mf\|_p^p = \int \int_0^{Mf(x)} pt^{p-1} dt dx = p \int_0^\infty t^{p-1} |\{ Mf \gt t \}| dt }[/math]

By the estimate above we have:

[math]\displaystyle{ \|Mf\|_p^p \leq p \int_0^\infty t^{p-1} \left ({2C \over t} \int_{|f| \gt \frac{t}{2}} |f|dx \right ) dt = 2C p \int_0^\infty \int_{|f| \gt \frac{t}{2}} t^{p-2} |f| dx dt = C_p \|f\|_p^p }[/math]

where the constant C_p depends only on p and d. This completes the proof of the theorem.

Note that the constant [math]\displaystyle{ C=5^d }[/math] in the proof can be improved to [math]\displaystyle{ 3^d }[/math] by using the inner regularity of the Lebesgue measure, and the finite version of the Vitali covering lemma. See the Discussion section below for more about optimizing the constant.

Applications

Some applications of the Hardy–Littlewood Maximal Inequality include proving the following results:

• Lebesgue differentiation theorem
• Rademacher differentiation theorem
• Fatou's theorem on nontangential convergence.
• Fractional integration theorem

Here we use a standard trick involving the maximal function to give a quick proof of Lebesgue differentiation theorem. (But remember that in the proof of the maximal theorem, we used the Vitali covering lemma.) Let f ∈ L¹(Rⁿ) and

[math]\displaystyle{ \Omega f (x) = \limsup_{r \to 0} f_r(x) - \liminf_{r \to 0} f_r(x) }[/math]

where

[math]\displaystyle{ f_r(x) = \frac{1}{|B(x, r)|} \int_{B(x, r)} f(y) dy. }[/math]

We write f = h + g where h is continuous and has compact support and g ∈ L¹(Rⁿ) with norm that can be made arbitrary small. Then

[math]\displaystyle{ \Omega f \le \Omega g + \Omega h = \Omega g }[/math]

by continuity. Now, Ωg ≤ 2Mg and so, by the theorem, we have:

[math]\displaystyle{ \left | \{ \Omega g \gt \varepsilon \} \right | \le \frac{2\,M}{\varepsilon} \|g\|_1 }[/math]

Now, we can let [math]\displaystyle{ \|g\|_1 \to 0 }[/math] and conclude Ωf = 0 almost everywhere; that is, [math]\displaystyle{ \lim_{r \to 0} f_r(x) }[/math] exists for almost all x. It remains to show the limit actually equals f(x). But this is easy: it is known that [math]\displaystyle{ \|f_r - f\|_1 \to 0 }[/math] (approximation of the identity) and thus there is a subsequence [math]\displaystyle{ f_{r_k} \to f }[/math] almost everywhere. By the uniqueness of limit, f_r → f almost everywhere then.

Discussion

It is still unknown what the smallest constants C_p,d and C_d are in the above inequalities. However, a result of Elias Stein about spherical maximal functions can be used to show that, for 1 < p < ∞, we can remove the dependence of C_p,d on the dimension, that is, C_p,d = C_p for some constant C_p > 0 only depending on p. It is unknown whether there is a weak bound that is independent of dimension.

There are several common variants of the Hardy-Littlewood maximal operator which replace the averages over centered balls with averages over different families of sets. For instance, one can define the uncentered HL maximal operator (using the notation of Stein-Shakarchi)

[math]\displaystyle{ f^*(x) = \sup_{x \in B_x} \frac{1}{|B_x|} \int_{B_x} |f(y)| dy }[/math]

where the balls B_x are required to merely contain x, rather than be centered at x. There is also the dyadic HL maximal operator

[math]\displaystyle{ M_\Delta f(x) = \sup_{x \in Q_x} \frac{1}{|Q_x|} \int_{Q_x} |f(y)| dy }[/math]

where Q_x ranges over all dyadic cubes containing the point x. Both of these operators satisfy the HL maximal inequality.

See also

• Rising sun lemma

References

• John B. Garnett, Bounded Analytic Functions. Springer-Verlag, 2006
• Antonios D. Melas, The best constant for the centered Hardy–Littlewood maximal inequality, Annals of Mathematics, 157 (2003), 647–688
• Rami Shakarchi & Elias M. Stein, Princeton Lectures in Analysis III: Real Analysis. Princeton University Press, 2005
• Elias M. Stein, Maximal functions: spherical means, Proc. Natl. Acad. Sci. U.S.A. 73 (1976), 2174–2175
• Elias M. Stein, Singular Integrals and Differentiability Properties of Functions. Princeton University Press, 1971
• Gerald Teschl, Topics in Real and Functional Analysis (lecture notes)