Marcinkiewicz interpolation theorem

Marcinkiewicz interpolation theorem

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.

Contents

Preliminaries

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

\lambda_f(t) = \omega\left\{x\in X\mid |f(x)| > t\right\}.

Then f is called weak L1 if there exists a constant C such that the distribution of f satisfies the following inequality for all t > 0:

\lambda_f(t)\leq \frac{C}{t}.

The smallest constant C in the inequality above is called the weak L1 norm and is usually denoted by ||f||1,w or ||f||1,∞. 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 (0,1) given by 1 / x and 1 / (1 − x), which has norm 4 not 2.)

Any L1 function belongs to L1,w and in addition one has the inequality

\|f\|_{1,w}\leq \|f\|_1.

This is nothing but Markov'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 Lp space as the space of all functions f such that | f | p belong to L1,w, and the weak Lp norm using

\|f\|_{p,w}=\|\,|f|^p \|_{1,w}^{1/p}.

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

\lambda_f(t) \le \frac{C^p}{t^p}

for all t > 0.

Formulation

Informally, Marcinkiewicz's theorem is

Theorem: Let T be a bounded linear operator from Lp to Lp,w and at the same time from Lq to Lq,w. Then T is also a bounded operator from Lr to Lr for any r between p and q.

In other words, even if you only require weak boundedness on the extremes p and q, you still get regular boundedness inside. 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 Lr norm of T but this bound increases to infinity as r converges to either p or q. Specifically (DiBenedetto 2002, Theorem VIII.9.2), suppose that

\|Tf\|_{p,w} \le N_p\|f\|_p,
\|Tf\|_{q,w} \le N_q\|f\|_q,

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:

\|Tf\|_r\le \gamma N_p^\delta N_q^{1-\delta}\|f\|_r

where

\delta=\frac{p(q-r)}{r(q-p)}

and

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

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. That is, there exists a constant C > 0 such that T satisfies

|T(f+g)(x)| \le C(|Tf(x)|+|Tg(x)|)

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

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

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

\|Tf\|_{q,w}\le C\|f\|_p

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:

\|Tf\|_q\le C\|f\|_p.

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 pq of the form
\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}.

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

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 L2 to L2. A much less obvious fact is that it is bounded from L1 to L1,w. Hence Marcinkiewicz's theorem shows that it is bounded from Lp to Lp 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 quasilinear rather than linear. While Lp to Lp bounds can be derived immediately from the L1 to weak L1 estimate by a clever change of variables, Marcinkiewicz interpolation is a more intuitive approach. Since the Hardy–Littlewood Maximal Function is trivially bounded from L^\infty to L^\infty, strong boundedness for all p > 1 follows immediately from the weak (1,1) estimate and interpolation.

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.

References

  • DiBenedetto, Emmanuele (2002), Real analysis, Birkhäuser, ISBN 3-7643-4231-5 .
  • Gilbarg, David; Trudinger, Neil S. (2001), Elliptic partial differential equations of second order, Springer-Verlag, ISBN 3-540-41160-7 .
  • Marcinkiewicz, J. (1939), "Sur l'interpolation d'operations", C. R. Acad. des Sciences, Paris 208: 1272–1273 
  • Stein, Elias; Weiss, Guido (1971), Introduction to Fourier analysis on Euclidean spaces, Princeton University Press, ISBN 0-691-08078-X .
  • Zygmund, A. (1956), "On a theorem of Marcinkiewicz concerning interpolation of operations", Journal de Mathématiques Pures et Appliquées. Neuvième Série 35: 223–248, ISSN 0021-7824, MR0080887 

Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Józef Marcinkiewicz — (né le 30 mars 1910 à Cimoszka, près de Białystok, Empire russe (aujourd hui Pologne) – décédé en 1940 à Kharkiv, Ukraine) est un mathématicien polonais[1]. Il a été étudiant d Antoni Zygmund et plus tard a travaillé avec Juliusz… …   Wikipédia en Français

  • Interpolation space — In the field of mathematical analysis, an interpolation space is a space which lies in between two other spaces. The main applications are in Sobolev spaces, where spaces of functions that have a noninteger number of derivatives are interpolated… …   Wikipedia

  • Interpolation — In the mathematical subfield of numerical analysis, interpolation is a method of constructing new data points within the range of a discrete set of known data points. In engineering and science one often has a number of data points, as obtained… …   Wikipedia

  • Riesz–Thorin theorem — In mathematics, the Riesz–Thorin theorem, often referred to as the Riesz–Thorin interpolation theorem or the Riesz–Thorin convexity theorem is a result about interpolation of operators. It is named after Marcel Riesz and his student G. Olof… …   Wikipedia

  • Riesz-Thorin theorem — In mathematics, the Riesz Thorin theorem, often referred to as the Riesz Thorin Interpolation Theorem or the Riesz Thorin Convexity Theorem is a result about interpolation of operators . This should not be confused with somewhat different… …   Wikipedia

  • Espace d'interpolation — En analyse, un espace d interpolation ou espace interpolé est un espace qui se trouve entre deux autres espaces. Les applications les plus importantes de cette notion ont lieu pour les espaces de Sobolev de fonctions qui sont dérivables un nombre …   Wikipédia en Français

  • Liste de théorèmes — par ordre alphabétique. Pour l établissement de l ordre alphabétique, il a été convenu ce qui suit : Si le nom du théorème comprend des noms de mathématiciens ou de physiciens, on se base sur le premier nom propre cité. Si le nom du théorème …   Wikipédia en Français

  • Multiplier (Fourier analysis) — In Fourier analysis, a multiplier operator is a type of linear operator, or transformation of functions. These operators act on a function by altering its Fourier transform. Specifically they multiply the Fourier transform of a function by a… …   Wikipedia

  • List of mathematics articles (M) — NOTOC M M estimator M group M matrix M separation M set M. C. Escher s legacy M. Riesz extension theorem M/M/1 model Maass wave form Mac Lane s planarity criterion Macaulay brackets Macbeath surface MacCormack method Macdonald polynomial Machin… …   Wikipedia

  • Lp space — In mathematics, the Lp spaces are function spaces defined using a natural generalization of the p norm for finite dimensional vector spaces. They are sometimes called Lebesgue spaces, named after Henri Lebesgue (Dunford Schwartz 1958, III.3),… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”