fbpx
Wikipedia

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 Edit

The operator takes a locally integrable function f : RdC and returns another function Mf. For any point xRd, 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,

 

where |E| denotes the d-dimensional Lebesgue measure of a subset ERd.

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 Edit

This theorem of G. H. Hardy and J. E. Littlewood states that M is bounded as a sublinear operator from Lp(Rd) to itself for p > 1. That is, if fLp(Rd) then the maximal function Mf is weak L1-bounded and MfLp(Rd). 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 Cd > 0 such that for all λ > 0 and f ∈ L1(Rd), we have:

 

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 ∈ Lp(Rd),

there is a constant Cp,d > 0 such that

 

In the strong type estimate the best bounds for Cp,d are unknown.[1] 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 Cp,d = Cp independent of d.[1][2]

Proof Edit

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   a family of open balls with bounded diameter. Then   has a countable subfamily   consisting of disjoint balls such that

 

where 5B is B with 5 times radius.

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

 

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

 

This completes the proof of the weak-type estimate. We next deduce from this the Lp 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:

 

with C = 5d. Then

 

By the estimate above we have:

 

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

Note that the constant   in the proof can be improved to   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 Edit

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

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 fL1(Rn) and

 

where

 

We write f = h + g where h is continuous and has compact support and gL1(Rn) with norm that can be made arbitrary small. Then

 

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

 

Now, we can let   and conclude Ωf = 0 almost everywhere; that is,   exists for almost all x. It remains to show the limit actually equals f(x). But this is easy: it is known that   (approximation of the identity) and thus there is a subsequence   almost everywhere. By the uniqueness of limit, frf almost everywhere then.

Discussion Edit

It is still unknown what the smallest constants Cp,d and Cd 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 Cp,d on the dimension, that is, Cp,d = Cp for some constant Cp > 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)

 

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

 

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

See also Edit

References Edit

  1. ^ a b Tao, Terence. "Stein's spherical maximal theorem". What's New. Retrieved 22 May 2011.
  2. ^ Stein, E. M. (1982). "The development of square functions in the work of A. Zygmund". Bulletin of the American Mathematical Society. New Series. 7 (2): 359–376. doi:10.1090/s0273-0979-1982-15040-6.
  • 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)

hardy, littlewood, maximal, function, mathematics, hardy, littlewood, maximal, operator, significant, linear, operator, used, real, analysis, harmonic, analysis, contents, definition, hardy, littlewood, maximal, inequality, proof, applications, discussion, als. In mathematics the Hardy Littlewood maximal operator M is a significant non linear operator used in real analysis and harmonic analysis Contents 1 Definition 2 Hardy Littlewood maximal inequality 3 Proof 4 Applications 5 Discussion 6 See also 7 ReferencesDefinition EditThe operator takes a locally integrable function f Rd C and returns another function Mf For any point x Rd 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 M f x sup r gt 0 1 B x r B x r f y d y displaystyle Mf x sup r gt 0 frac 1 B x r int B x r f y dy where E denotes the d dimensional Lebesgue measure of a subset E Rd The averages are jointly continuous in x and r therefore the maximal function Mf being the supremum over r gt 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 EditThis theorem of G H Hardy and J E Littlewood states that M is bounded as a sublinear operator from Lp Rd to itself for p gt 1 That is if f Lp Rd then the maximal function Mf is weak L1 bounded and Mf Lp Rd Before stating the theorem more precisely for simplicity let f gt t denote the set x f x gt t Now we have Theorem Weak Type Estimate For d 1 there is a constant Cd gt 0 such that for all l gt 0 and f L1 Rd we have M f gt l lt C d l f L 1 R d displaystyle left Mf gt lambda right lt frac C d lambda Vert f Vert L 1 mathbf R d 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 lt p and f Lp Rd there is a constant Cp d gt 0 such that M f L p R d C p d f L p R d displaystyle Vert Mf Vert L p mathbf R d leq C p d Vert f Vert L p mathbf R d In the strong type estimate the best bounds for Cp d are unknown 1 However subsequently Elias M Stein used the Calderon Zygmund method of rotations to prove the following Theorem Dimension Independence For 1 lt p one can pick Cp d Cp independent of d 1 2 Proof EditWhile 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 lt p lt 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 F displaystyle mathcal F a family of open balls with bounded diameter Then F displaystyle mathcal F has a countable subfamily F displaystyle mathcal F consisting of disjoint balls such that B F B B F 5 B displaystyle bigcup B in mathcal F B subset bigcup B in mathcal F 5B where 5B is B with 5 times radius If Mf x gt t then by definition we can find a ball Bx centered at x such that B x f d y gt t B x displaystyle int B x f dy gt t B x By the lemma we can find among such balls a sequence of disjoint balls Bj such that the union of 5Bj covers Mf gt t It follows M f gt t 5 d j B j 5 d t f d y displaystyle Mf gt t leq 5 d sum j B j leq 5 d over t int f dy This completes the proof of the weak type estimate We next deduce from this the Lp bounds Define b by b x f x if f x gt t 2 and 0 otherwise By the weak type estimate applied to b we have M f gt t 2 C t f gt t 2 f d x displaystyle Mf gt t leq 2C over t int f gt frac t 2 f dx with C 5d Then M f p p 0 M f x p t p 1 d t d x p 0 t p 1 M f gt t d t displaystyle Mf p p int int 0 Mf x pt p 1 dtdx p int 0 infty t p 1 Mf gt t dt By the estimate above we have M f p p p 0 t p 1 2 C t f gt t 2 f d x d t 2 C p 0 f gt t 2 t p 2 f d x d t C p f p p 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 2Cp int 0 infty int f gt frac t 2 t p 2 f dxdt C p f p p where the constant Cp depends only on p and d This completes the proof of the theorem Note that the constant C 5 d displaystyle C 5 d in the proof can be improved to 3 d displaystyle 3 d 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 EditSome 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 theoremHere 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 L1 Rn and W f x lim sup r 0 f r x lim inf r 0 f r x displaystyle Omega f x limsup r to 0 f r x liminf r to 0 f r x where f r x 1 B x r B x r f y d y displaystyle f r x frac 1 B x r int B x r f y dy We write f h g where h is continuous and has compact support and g L1 Rn with norm that can be made arbitrary small Then W f W g W h W g displaystyle Omega f leq Omega g Omega h Omega g by continuity Now Wg 2Mg and so by the theorem we have W g gt e 2 M e g 1 displaystyle left Omega g gt varepsilon right leq frac 2 M varepsilon g 1 Now we can let g 1 0 displaystyle g 1 to 0 and conclude Wf 0 almost everywhere that is lim r 0 f r x displaystyle lim r to 0 f r x exists for almost all x It remains to show the limit actually equals f x But this is easy it is known that f r f 1 0 displaystyle f r f 1 to 0 approximation of the identity and thus there is a subsequence f r k f displaystyle f r k to f almost everywhere By the uniqueness of limit fr f almost everywhere then Discussion EditIt is still unknown what the smallest constants Cp d and Cd are in the above inequalities However a result of Elias Stein about spherical maximal functions can be used to show that for 1 lt p lt we can remove the dependence of Cp d on the dimension that is Cp d Cp for some constant Cp gt 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 f x sup x B x 1 B x B x f y d y displaystyle f x sup x in B x frac 1 B x int B x f y dy where the balls Bx are required to merely contain x rather than be centered at x There is also the dyadic HL maximal operator M D f x sup x Q x 1 Q x Q x f y d y displaystyle M Delta f x sup x in Q x frac 1 Q x int Q x f y dy where Qx ranges over all dyadic cubes containing the point x Both of these operators satisfy the HL maximal inequality See also EditRising sun lemmaReferences Edit a b Tao Terence Stein s spherical maximal theorem What s New Retrieved 22 May 2011 Stein E M 1982 The development of square functions in the work of A Zygmund Bulletin of the American Mathematical Society New Series 7 2 359 376 doi 10 1090 s0273 0979 1982 15040 6 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 amp 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 Retrieved from https en wikipedia org w index php title Hardy Littlewood maximal function amp oldid 1151481568, wikipedia, wiki, book, books, library,

article

, read, download, free, free download, mp3, video, mp4, 3gp, jpg, jpeg, gif, png, picture, music, song, movie, book, game, games.