Marcinkiewicz interpolation theorem

From HandWiki
Short description: Mathematical theory by discovered by Józef Marcinkiewicz

In mathematics, the Marcinkiewicz interpolation theorem, discovered by Józef Marcinkiewicz (1939), is a result bounding the norms of non-linear operators acting on Lp spaces.

Marcinkiewicz' theorem is similar to the Riesz–Thorin theorem about linear operators, but also applies to non-linear operators.

Preliminaries

Let f be a measurable function with real or complex values, defined on a measure space (X, F, ω). The distribution function of f is defined by

[math]\displaystyle{ \lambda_f(t) = \omega\left\{x\in X\mid |f(x)| \gt t\right\}. }[/math]

Then f is called weak [math]\displaystyle{ L^1 }[/math] if there exists a constant C such that the distribution function of f satisfies the following inequality for all t > 0:

[math]\displaystyle{ \lambda_f(t)\leq \frac{C}{t}. }[/math]

The smallest constant C in the inequality above is called the weak [math]\displaystyle{ L^1 }[/math] norm and is usually denoted by [math]\displaystyle{ \|f\|_{1,w} }[/math] or [math]\displaystyle{ \|f\|_{1,\infty}. }[/math] Similarly the space is usually denoted by L1,w or L1,∞.

(Note: This terminology is a bit misleading since the weak norm does not satisfy the triangle inequality as one can see by considering the sum of the functions on [math]\displaystyle{ (0,1) }[/math] given by [math]\displaystyle{ 1/x }[/math] and [math]\displaystyle{ 1/(1-x) }[/math], which has norm 4 not 2.)

Any [math]\displaystyle{ L^1 }[/math] function belongs to L1,w and in addition one has the inequality

[math]\displaystyle{ \|f\|_{1,w}\leq \|f\|_1. }[/math]

This is nothing but Markov's inequality (aka Chebyshev's Inequality). The converse is not true. For example, the function 1/x belongs to L1,w but not to L1.

Similarly, one may define the weak [math]\displaystyle{ L^p }[/math] space as the space of all functions f such that [math]\displaystyle{ |f|^p }[/math] belong to L1,w, and the weak [math]\displaystyle{ L^p }[/math] norm using

[math]\displaystyle{ \|f\|_{p,w}= \left \||f|^p \right \|_{1,w}^{\frac{1}{p}}. }[/math]

More directly, the Lp,w norm is defined as the best constant C in the inequality

[math]\displaystyle{ \lambda_f(t) \le \frac{C^p}{t^p} }[/math]

for all t > 0.

Formulation

Informally, Marcinkiewicz's theorem is

Theorem. Let T be a bounded linear operator from [math]\displaystyle{ L^p }[/math] to [math]\displaystyle{ L^{p,w} }[/math] and at the same time from [math]\displaystyle{ L^q }[/math] to [math]\displaystyle{ L^{q,w} }[/math]. Then T is also a bounded operator from [math]\displaystyle{ L^r }[/math] to [math]\displaystyle{ L^r }[/math] for any r between p and q.

In other words, even if one only requires weak boundedness on the extremes p and q, regular boundedness still holds. To make this more formal, one has to explain that T is bounded only on a dense subset and can be completed. See Riesz-Thorin theorem for these details.

Where Marcinkiewicz's theorem is weaker than the Riesz-Thorin theorem is in the estimates of the norm. The theorem gives bounds for the [math]\displaystyle{ L^r }[/math] norm of T but this bound increases to infinity as r converges to either p or q. Specifically (DiBenedetto 2002), suppose that

[math]\displaystyle{ \|Tf\|_{p,w} \le N_p\|f\|_p, }[/math]
[math]\displaystyle{ \|Tf\|_{q,w} \le N_q\|f\|_q, }[/math]

so that the operator norm of T from Lp to Lp,w is at most Np, and the operator norm of T from Lq to Lq,w is at most Nq. Then the following interpolation inequality holds for all r between p and q and all f ∈ Lr:

[math]\displaystyle{ \|Tf\|_r\le \gamma N_p^\delta N_q^{1-\delta}\|f\|_r }[/math]

where

[math]\displaystyle{ \delta=\frac{p(q-r)}{r(q-p)} }[/math]

and

[math]\displaystyle{ \gamma=2\left(\frac{r(q-p)}{(r-p)(q-r)}\right)^{1/r}. }[/math]

The constants δ and γ can also be given for q = ∞ by passing to the limit.

A version of the theorem also holds more generally if T is only assumed to be a quasilinear operator in the following sense: there exists a constant C > 0 such that T satisfies

[math]\displaystyle{ |T(f+g)(x)| \le C(|Tf(x)|+|Tg(x)|) }[/math]

for almost every x. The theorem holds precisely as stated, except with γ replaced by

[math]\displaystyle{ \gamma=2C\left(\frac{r(q-p)}{(r-p)(q-r)}\right)^{1/r}. }[/math]

An operator T (possibly quasilinear) satisfying an estimate of the form

[math]\displaystyle{ \|Tf\|_{q,w}\le C\|f\|_p }[/math]

is said to be of weak type (p,q). An operator is simply of type (p,q) if T is a bounded transformation from Lp to Lq:

[math]\displaystyle{ \|Tf\|_q\le C\|f\|_p. }[/math]

A more general formulation of the interpolation theorem is as follows:

  • If T is a quasilinear operator of weak type (p0, q0) and of weak type (p1, q1) where q0 ≠ q1, then for each θ ∈ (0,1), T is of type (p,q), for p and q with p ≤ q of the form
[math]\displaystyle{ \frac{1}{p} = \frac{1-\theta}{p_0}+\frac{\theta}{p_1},\quad \frac{1}{q} = \frac{1-\theta}{q_0} + \frac{\theta}{q_1}. }[/math]

The latter formulation follows from the former through an application of Hölder's inequality and a duality argument.[citation needed]

Applications and examples

A famous application example is the Hilbert transform. Viewed as a multiplier, the Hilbert transform of a function f can be computed by first taking the Fourier transform of f, then multiplying by the sign function, and finally applying the inverse Fourier transform.

Hence Parseval's theorem easily shows that the Hilbert transform is bounded from [math]\displaystyle{ L^2 }[/math] to [math]\displaystyle{ L^2 }[/math]. A much less obvious fact is that it is bounded from [math]\displaystyle{ L^1 }[/math] to [math]\displaystyle{ L^{1,w} }[/math]. Hence Marcinkiewicz's theorem shows that it is bounded from [math]\displaystyle{ L^p }[/math] to [math]\displaystyle{ L^p }[/math] for any 1 < p < 2. Duality arguments show that it is also bounded for 2 < p < ∞. In fact, the Hilbert transform is really unbounded for p equal to 1 or ∞.

Another famous example is the Hardy–Littlewood maximal function, which is only sublinear operator rather than linear. While [math]\displaystyle{ L^p }[/math] to [math]\displaystyle{ L^p }[/math] bounds can be derived immediately from the [math]\displaystyle{ L^1 }[/math] to weak [math]\displaystyle{ L^1 }[/math] estimate by a clever change of variables, Marcinkiewicz interpolation is a more intuitive approach. Since the Hardy–Littlewood Maximal Function is trivially bounded from [math]\displaystyle{ L^\infty }[/math] to [math]\displaystyle{ L^\infty }[/math], strong boundedness for all [math]\displaystyle{ p\gt 1 }[/math] follows immediately from the weak (1,1) estimate and interpolation. The weak (1,1) estimate can be obtained from the Vitali covering lemma.

History

The theorem was first announced by (Marcinkiewicz 1939), who showed this result to Antoni Zygmund shortly before he died in World War II. The theorem was almost forgotten by Zygmund, and was absent from his original works on the theory of singular integral operators. Later (Zygmund 1956) realized that Marcinkiewicz's result could greatly simplify his work, at which time he published his former student's theorem together with a generalization of his own.

In 1964 Richard A. Hunt and Guido Weiss published a new proof of the Marcinkiewicz interpolation theorem.[1]

See also

References

  1. ↑ Hunt, Richard A.; Weiss, Guido (1964). "The Marcinkiewicz interpolation theorem". Proceedings of the American Mathematical Society 15 (6): 996–998. doi:10.1090/S0002-9939-1964-0169038-4. ISSN 0002-9939. 



Retrieved from "https://handwiki.org/wiki/index.php?title=Marcinkiewicz_interpolation_theorem&oldid=3007013"