Math 2.0

Harmonic analysis on Euclidean spaces Maximal functions and weights Theorem

Rubio de Francia extrapolation theorem

Builds on Muckenhoupt weightsLp spaceHardy–Littlewood maximal functionMuckenhoupt's theorem

Statement

Let n≥1n \ge 1 and 1≤p0<∞1 \le p_0 < \infty. For a weight ww on ℝn\R^n and 1≤p<∞1 \le p < \infty, write ∥g∥Lp(w)=(∫ℝn∣g∣p w dx)1/p\norm{g}_{L^p(w)} = \left( \int_{\R^n} \abs{g}^p \, w \, dx \right)^{1/p}, and let [w]Ap[w]_{A_p} be the constant of the Muckenhoupt class ApA_p. Let ℱ\mathcal{F} be a family of pairs (f,g)(f, g) of nonnegative measurable functions on ℝn\R^n. Assume that there is an increasing function N ⁣:[1,∞)→[0,∞)N \colon [1, \infty) \to [0, \infty) such that ∥f∥Lp0(w)≤N([w]Ap0) ∥g∥Lp0(w)\norm{f}_{L^{p_0}(w)} \le N([w]_{A_{p_0}}) \, \norm{g}_{L^{p_0}(w)} for every w∈Ap0w \in A_{p_0} and every (f,g)∈ℱ(f, g) \in \mathcal{F} with ∥f∥Lp0(w)<∞\norm{f}_{L^{p_0}(w)} < \infty. Then let 1<p<∞1 < p < \infty and w∈Apw \in A_p. There is a constant CC, depending only on nn, pp, p0p_0, NN and [w]Ap[w]_{A_p}, such that ∥f∥Lp(w)≤C∥g∥Lp(w)\norm{f}_{L^p(w)} \le C \norm{g}_{L^p(w)} for every (f,g)∈ℱ(f, g) \in \mathcal{F} with ∥f∥Lp(w)<∞\norm{f}_{L^p(w)} < \infty.

Remarks

In the typical use, the pairs are (∣Tf∣,∣f∣)(\abs{Tf}, \abs{f}) for an operator TT. Assume TT is bounded on Lp0(w)L^{p_0}(w) for all w∈Ap0w \in A_{p_0}, with a bound depending only on [w]Ap0[w]_{A_{p_0}}. Then TT is bounded on Lp(w)L^p(w) for all 1<p<∞1 < p < \infty and all w∈Apw \in A_p. In particular, taking w=1w = 1, one exponent p0p_0 gives unweighted bounds for all 1<p<∞1 < p < \infty.

The proof uses the Rubio de Francia algorithm. Let vv be a weight and q>1q > 1 such that the maximal operator MM is bounded on Lq(v)L^q(v), with norm ∥M∥\norm{M}. For h≥0h \ge 0 in Lq(v)L^q(v), set Rh=∑k≥0Mkh(2∥M∥)kRh = \sum_{k \ge 0} \frac{M^k h}{(2\norm{M})^k}, where MkM^k is the kk-th iterate. Then h≤Rhh \le Rh, ∥Rh∥Lq(v)≤2∥h∥Lq(v)\norm{Rh}_{L^q(v)} \le 2 \norm{h}_{L^q(v)}, and M(Rh)≤2∥M∥ RhM(Rh) \le 2 \norm{M} \, Rh, so RhRh is an A1A_1 weight. These A1A_1 weights are combined into an Ap0A_{p_0} weight to which the hypothesis applies, and Muckenhoupt's theorem controls the constants.

Going deeper

For a student

The theorem is a main reason to prove weighted inequalities. A single weighted L2L^2 bound for a Calderón–Zygmund operator, a commutator or a square function yields all the LpL^p bounds, weighted and unweighted. It also gives vector-valued inequalities almost for free, since a sum (∑j∣Tfj∣q)1/q\left( \sum_j \abs{T f_j}^q \right)^{1/q} can be treated by applying the pair formulation to suitable functions. It relies on the theory of ApA_p weights, in particular on Muckenhoupt's theorem and on the factorization of ApA_p weights as w=w1w21−pw = w_1 w_2^{1 - p} with w1,w2∈A1w_1, w_2 \in A_1.

Reading path

To understand this page from the ground up, read these 10 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Hardy–Littlewood maximal function concept
  2. Hilbert transform concept
  3. Lp space concept
  4. Muckenhoupt weights concept
  5. Sigma-finite measure concept
  6. Weak Lp space concept
  7. Weak-type estimate concept
  8. Marcinkiewicz interpolation theorem statement
  9. Muckenhoupt's theorem statement
  10. Rubio de Francia extrapolation theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Muckenhoupt_weights
About this page
TagQADCFWETJC
URIm2://QADCFWETJC
Kindstatement, theorem
WritingW0 stub
MSC42B25, 42B20
StatusThis copy of the site has no build data. Run m2 status QADCFWETJC.
AboutMuckenhoupt weights
UsesMuckenhoupt weights, Lp space, Hardy–Littlewood maximal function, Muckenhoupt's theorem

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.