Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Marcinkiewicz interpolation theorem
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Mathematical theory by discovered by Józef Marcinkiewicz}} In [[mathematics]], particularly in [[functional analysis]], the '''Marcinkiewicz interpolation theorem''', discovered by {{harvs|txt|authorlink=Józef Marcinkiewicz|first=Józef |last=Marcinkiewicz|year=1939}}, is a result bounding the norms of non-linear operators acting on [[lp space|''L''<sup>p</sup> 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 [[cumulative distribution function|distribution function]] of ''f'' is defined by :<math>\lambda_f(t) = \omega\left\{x\in X\mid |f(x)| > t\right\}.</math> Then ''f'' is called '''weak <math>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>\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 <math>\|f\|_{1,w}</math> or <math>\|f\|_{1,\infty}.</math> Similarly the space is usually denoted by ''L''<sup>1,''w''</sup> or ''L''<sup>1,∞</sup>. (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.) Any <math>L^1</math> function belongs to ''L''<sup>1,''w''</sup> and in addition one has the inequality :<math>\|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 ''L''<sup>1,''w''</sup> but not to ''L''<sup>1</sup>. Similarly, one may define the [[Lp space#Weak Lp|'''weak <math>L^p</math> space''']] as the space of all functions ''f'' such that <math>|f|^p</math> belong to ''L''<sup>1,''w''</sup>, and the '''weak <math>L^p</math> norm''' using :<math>\|f\|_{p,w}= \left \||f|^p \right \|_{1,w}^{\frac{1}{p}}.</math> More directly, the ''L''<sup>''p'',''w''</sup> norm is defined as the best constant ''C'' in the inequality :<math>\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>L^p</math> to <math>L^{p,w}</math> and at the same time from <math>L^q</math> to <math>L^{q,w}</math>. Then ''T'' is also a bounded operator from <math>L^r</math> to <math>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 set|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>L^r</math> norm of ''T'' but this bound increases to infinity as ''r'' converges to either ''p'' or ''q''. Specifically {{harv|DiBenedetto|2002|loc=Theorem VIII.9.2}}, suppose that :<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''</sub>, and the operator norm of ''T'' from ''L''<sup>''q''</sup> to ''L''<sup>''q'',''w''</sup> is at most ''N''<sub>''q''</sub>. Then the following '''interpolation inequality''' holds for all ''r'' between ''p'' and ''q'' and all ''f'' ∈ ''L''<sup>''r''</sup>: :<math>\|Tf\|_r\le \gamma N_p^\delta N_q^{1-\delta}\|f\|_r</math> where :<math>\delta=\frac{p(q-r)}{r(q-p)}</math> and :<math>\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>|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 γ replaced by :<math>\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>\|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 ''L<sup>p</sup>'' to ''L<sup>q</sup>'': :<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</sub>, ''q''<sub>1</sub>) where ''q''<sub>0</sub> ≠ ''q''<sub>1</sub>, then for each θ ∈ (0,1), ''T'' is of type (''p'',''q''), for ''p'' and ''q'' with ''p'' ≤ ''q'' of the form ::<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.{{Citation needed|reason=How to use Hölder's inequality and the special case?|date=June 2016}} ==Applications and examples== 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'' < ∞. 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>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. The weak (1,1) estimate can be obtained from the [[Vitali covering lemma]]. ==History== The theorem was first announced by {{harvtxt|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 operator]]s. Later {{harvtxt|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 Allen Hunt|Richard A. Hunt]] and [[Guido Weiss]] published a new proof of the Marcinkiewicz interpolation theorem.<ref name="HuntWeiss1964">{{cite journal|last1=Hunt|first1=Richard A.|last2=Weiss|first2=Guido|title=The Marcinkiewicz interpolation theorem|journal=Proceedings of the American Mathematical Society|volume=15|issue=6|year=1964|pages=996–998|issn=0002-9939|doi=10.1090/S0002-9939-1964-0169038-4|doi-access=free}}</ref> == See also == * [[Interpolation space]] ==References== {{reflist}} * {{citation | last=DiBenedetto|first=Emmanuele|title=Real analysis|publisher=Birkhäuser|year=2002|isbn=3-7643-4231-5}}. * {{citation|title=Elliptic partial differential equations of second order|first1=David|last1=Gilbarg|authorlink1=David Gilbarg|first2=Neil S.|last2=Trudinger|authorlink2=Neil Trudinger|publisher=Springer-Verlag|year=2001|isbn=3-540-41160-7| url=https://books.google.com/books?id=eoiGTf4cmhwC}}. *{{Citation | last1=Marcinkiewicz | first1=J. | title=Sur l'interpolation d'operations | year=1939 |url=https://gallica.bnf.fr/ark:/12148/bpt6k6238835z/f16.item#| journal=C. R. Acad. Sci. Paris | volume=208 | pages=1272–1273}} * {{citation|title=Introduction to Fourier analysis on Euclidean spaces|first1=Elias|last1=Stein|authorlink1=Elias Stein|first2=Guido|last2=Weiss|publisher=Princeton University Press|year=1971|isbn=0-691-08078-X|url-access=registration|url=https://archive.org/details/introductiontofo0000stei}}. *{{Citation | last1=Zygmund | first1=A. | title=On a theorem of Marcinkiewicz concerning interpolation of operations |mr=0080887 | year=1956 | journal=[[Journal de Mathématiques Pures et Appliquées]]|series= Neuvième Série | issn=0021-7824 | volume=35 | pages=223–248}} {{Lp spaces}} {{Functional analysis}} [[Category:Fourier analysis]] [[Category:Theorems in functional analysis]] [[Category:Lp spaces]]
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)
Pages transcluded onto the current version of this page
(
help
)
:
Template:Citation
(
edit
)
Template:Citation needed
(
edit
)
Template:Cite journal
(
edit
)
Template:Functional analysis
(
edit
)
Template:Harv
(
edit
)
Template:Harvs
(
edit
)
Template:Harvtxt
(
edit
)
Template:Lp spaces
(
edit
)
Template:Reflist
(
edit
)
Template:Short description
(
edit
)