Content deleted Content added
Geometry guy (talk | contribs) subcat |
m clean up using AWB |
||
Line 4:
==Preliminaries==
Let ''f'' be a [[measurable function]] with real or complex values, defined on a [[measure space]] (''X'', ''F'',
:<math>\lambda_f(t) = \omega\left\{x\in X\mid |f(x)| > t\right\}.</math>
Line 12:
:<math>\lambda_f(t)\leq \frac{C}{t}.</math>
The smallest constant ''C'' in the inequality above is called the '''weak <math>L^1</math> norm''' and is usually denoted by ||''f''||<sub>1,''w''</sub> or ||''f''||<sub>1,
(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> (0,1) </math> given by <math> 1/x </math> and <math> 1/(1-x) </math>, which has norm 4 not 2.)
Line 42:
:<math>\|Tf\|_{p,w} \le N_p\|f\|_p,</math>
:<math>\|Tf\|_{q,w} \le N_q\|f\|_q,</math>
so that the [[operator norm]] of ''T'' from ''L''<sup>''p''</sup> to ''L''<sup>''p'',''w''</sup> is at most ''N''<sub>''p''</sup>, and the operator norm of ''T'' from ''L''<sup>''q''</sup> to ''L''<sup>''q'',''w''</sup> is at most ''N''<sub>''q''</sup>. Then the following '''interpolation inequality''' holds for all ''r'' between ''p'' and ''q'' and all ''f''
:<math>\|Tf\|_r\le \gamma N_p^\delta N_q^{1-\delta}\|f\|_r</math>
where
Line 48:
and
:<math>\gamma=2\left(\frac{r(q-p)}{(r-p)(q-r)}\right)^{1/r}.</math>
The constants
A version of the theorem also holds more generally if ''T'' is only assumed to be a [[quasilinear]] operator. That is, there exists a constant ''C'' > 0 such that ''T'' satisfies
:<math>|T(f+g)(x)| \le C(|Tf(x)|+|Tg(x)|)</math>
for [[almost everywhere|almost every]] ''x''. The theorem holds precisely as stated, except with
:<math>\gamma=2C\left(\frac{r(q-p)}{(r-p)(q-r)}\right)^{1/r}.</math>
Line 60:
:<math>\|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 (''p''<sub>0</sub>, ''q''<sub>0</sub>) and of weak type (''p''<sub>1</sup>, ''q''<sub>1</sub>) where ''q''<sub>0</sub> ≠ ''q''<sub>1</sub>, then for each
:<math>\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.
Line 67:
A famous application example is the [[Hilbert transform]]. Viewed as a [[multiplier (Fourier analysis)|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>L^2</math> to <math>L^2</math>. A much less obvious fact is that it is bounded from <math>L^1</math> to <math>L^{1,w}</math>. Hence Marcinkiewicz's theorem shows that it is bounded from <math>L^p</math> to <math>L^p</math> for any 1 < ''p'' < 2. [[dual space|Duality]] arguments show that it is also bounded for 2 < ''p'' <
Another famous example is the [[Hardy–Littlewood maximal function]], which is only quasilinear rather than linear. While <math>L^p</math> to <math>L^p</math> bounds can be derived immediately from the <math>L^1</math> to weak <math>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>L^\infty</math> to <math>L^\infty</math>, strong boundedness for all <math>p>1</math> follows immediately from the weak (1,1) estimate and interpolation.
|