This is the set of notes I wrote up for the talk I gave at the student analysis seminar on December 1 and December 8.
* * * * *
Let be an operator between vector spaces satisfying some linearity condition. We fix Banach subspaces
and
fo
and
and
of
. If the restrictions
and
are operators into
and
, respectively, satisfying some norm estimates, then an interpolation theorem tells us that we can often find “intermediate” Banach spaces
between
and
such that
, for each
, is a bounded operator into
with its norm depending canonically on the norm estimates at the endpoints.
Contents
- Lecture 1 – Strong Endpoint Estimates: The theorems of Riesz-Thorin and Stein. If a linear map
is bounded as an operator from
to
and from
to
, respectively, the the Riesz-Thorin interpolation theorem establishes the boundedness of
as an operator from
to
, where
and
depend on the exponents and the parameter
. As an immediate application, we shall prove the Hausdorff-Young inequality for the Fourier transform and the generalized Young’s inequality. We also mention the variable-parameter version of Riesz-Throin, proven by E. Stein in his 1955 thesis.
- Lecture 2 – Weak Endpoint Estimates: The theorems of Marcinkiewicz and Fefferman-Stein. What if an operator
just fails to be bounded at the endpoints? In the second part of the talk, we shall consider the weak-type operators, which are bounded as an operator from a Lebesgue space to a weak Lebesgue space. The prototypical examples of such operators are the Hardy-Littlewood maximal function in the theory of differentiation and the Hilbert transform in the theory of singular integrals. We also mention an extension of Stein’s interpolation theorem by C. Fefferman, which allows the endpoint-operator to be bounded from a Lebesgue space to a Hardy space.
Lecture 1. Strong Endpoint Estimates: The theorems of Riesz-Throin and Stein
The first theorem on our list is the interpolation theorem of M. Riesz and Thorin, concerning operators on Lebesgue spaces. The theorem depends on complex-analytic methods for its proof, whence the operators must take complex scalars. The general theorems of its kind, pioneered by Calderón, are known as complex interpolation.
To motivate the Riesz-Thorin interpolation theorem, we briefly review the and
theory of the Fourier transform on Euclidean spaces. For each
, we define the Fourier transform
by setting
where is the standard dot product of
and
. We immediately see that
which shows that the Fourier transform is a bounded operator from to
. Straightforward computation yields the following basic properties of the Fourier transform—here we let
and
:
- If
, then
.
- If
, then
.
- If
, then
.
A natural setting for the study of the Fourier transform is the Schwartz space , which is the collection of smooth functions on
that are rapidly decreasing. The formal definition is stated succinctly with the aid of multi-indices, which are vectors in
with nonnegative integer components. Each multi-index
comes with the following set of shorthand notations:
We are now ready to state the
Definition. The Schwartz space on
is the collection of
-functions
such that
for every pair of multi-indices and
.
We remark that contains
, hence there are plenty of Schwartz functions. In fact,
is dense in
for
. Furthermore, the Fourier transform of a Schwartz function is again a Schwartz function.
An important result in the theory of the Fourier transform is the Fourier inversion theorem. We shall only need a simple case of the theorem: see pp.5-17 of [SW71] for a discussion of the general version.
Theorem 1 (Fourier inversion theorem). If and
, then
for almost every .
Proof. We first note that the Fourier transform of the Gaussican is again the Gaussian, whence Theorem 1 holds for
. Setting
for each , we see that
whereby the theorem also holds for all .
We also observe that a simple application of the Fubini-Tonelli theorem yields the following multiplication formula for :
Lastly, we will need the following standard fact, whose proof can be found, for example, in page 243 of [Fol99] or page 63 of [Ste70].
Lemma 2 (Approximation to the identity).Let and set
for each . If
for each
, then
for every with a fixed
.
We are now ready to prove Theorem 1. Consider the following modification of the inversion formula:
.
Since , the dominated convergence theorem implies that
.
We set and note that
by the multiplication formula. Since , we see that
where . Observing that
we conclude from Lemma 2 that
The theorem now follows.
Note that the inversion theorem can be reformulated as
If , then the inversion theorem implies that
Therefore,
whence by the multiplication formula we obtain
This implies that the Fourier transform restricted to is an isometry in the
-norm. Since the Schwartz space
is dense in
, there exists a unique norm-preserving extension of the Fourier transform onto all of
. We concede that
- 2. The Riesz-Thorin interpolation theorem -
We have thus seen that the Fourier transform is a bounded linear operator from
to
and from
to
, each with the operator norm at most 1. Since the natural “intermediate Banach spaces” of
and
are
for
, an interpolation theorem for our example should give us a norm estimate of the Fourier transform operator on
.
Note, however, that the Fourier transform and the
Fourier transform are, formally speaking, two different operators. We must find a way to describe an operator that takes, in a suitable sense, multiple domains. Taking a cue from how we defined the
Fourier transform, we shall consider an operator defined on a collection of functions that is dense in each
.
Definition. Let and
be
-finite measure spaces and fix a vector space
of
-measurable complex-valued functions on
that
- contains characteristic functions of sets of finite measure, and
- is closed under truncation of
, viz., a
-measurable complex-valued function
defined by
for some nonnegative real numbers and
. Given
, a linear operator
on
into a vector space of
-measurable complex-valued functions on
is of type
if there exists a constant
such that
for all . The smallest such
is the
-norm of
.
Since is dense in
, each linear operator
of type
can be extended uniquely to the operator
with the same operator norm. With this definition, we can now state the Riesz-Thorin interpolation theorem as follows:
Theorem 3 (Riesz-Thorin). If a linear operator is of type
with
-norm
and of type
with
-norm
, then
is of type
with
-norm
for each
, where
We shall need the following lemma, which is the complex-analytic method we have advertised:
Lemma 4 (Hadamard’s three lines lemma). Let be a holomorphic function in the interior of the closed strip
and a bounded continuous function on . If
on the line
and if
on the line
, then, for each
, we have the inequality
on the line .
The proof of the lemma is an instance of a widely-used maximum modulus principle argument, known as the Phragmén–Lindelöf principle.
Proof of Lemma. We define holomorphic functions
so that as
. We wish to show that
on
.
We first note that on the lines
and
. Moreover,
is bounded above on
, and
is bounded below on
, hence we have the bound
on
. Noting the inequality
,
we see that converges uniformly to 0 as
. We can therefore find
such that
for all
and
, whence by the maximum modulus principle we have
on the rectangle
.
It follows that on
for each
, and letting
yields the desired result.
We are now ready to present a proof of the Riesz-Thorin interpolation theorem. We write to denote the conjugate exponent of
, so that
The following proof is taken from pp. 181-183 of [SW71]:
Proof of Theorem 3. Fix . For notational convenience, we let
With this notation, we set
so that
We shall first prove the theorem for simple functions, which evidently belong to . By the Riesz representation theorem, we have
for each simple function , where the supremum is taken over all simple functions
of
-norm at most one. Therefore, it suffices to show that
for each such . If
, then there is nothing to prove, and so we can assume by renormalization of
that
. We therefore set out to establish
for all simple functions
with
.
We now suppose that
are two simple functions satisfying the above conditions. We also assume without loss of generality that and
, so that
and
. Write
and
and set
for each . Then
is an entire function such that
We note, in particular, that is holomorphic in the interior of
and is continuous on
. Since
is linear, we see that
whence is bounded on
.
We now furnish a bound for on the lines
and
. Note first that
by Hölder’s inequality. Observing the identities
and
on the line
, we see that
Since is of type
, it thus follows that
on the line . A similar computation establishes the bound
on the line
, whence by Hadamard’s three lines theorem we have the inequality
on the line . Setting
, we have
which is the desired inequality.
Having established the theorem for simple functions, we now prove the theorem for the general . To this end, we shall furnish a sequence
of simple functions such that
for then Fatou’s lemma yields the inequality
Therefore, the task of proving the theorem reduces to finding such a sequence.
We assume without loss of generality that and
. Let
be the truncation of
, defined as
and another truncation.
contains all truncations of
, and
and
are bounded by
, hence
and
. We can find a monotonically increasing sequence
converging to
, which satisfies
by the monotone convergence theorem. If and
are truncations of
defined in the same way as
and
, then we have
Since is of types
and
, we have
We can then find a subsequence of converging almost everywhere to
, whence we may as well assume that the full sequence converges almost everywhere to
. Similarly, we can find a subsequence
of
such that
converges almost everywhere to
, whence the sequence
defined by setting
is the desired sequence. This completes the proof of the Riesz-Thorin interpolation theorem.
- 3. Applications: two inequalities -
We now return to the task of establishing the -boundedness of the Fourier transform. The Fourier transform operator on
is of type
and of type
with the norm at most one in each case. It then follows from the Riesz-Thorin interpolation theorem that the Fourier transform operator is of type
with
-norm at most one for all
. We therefore have the following inequality:
Corollary 5 (Hausdorff-Young). If , then
for all .
We also extend the classical inequality of Young, which can be stated as follows:
Theorem 6 (Young). If , then
for all and
.
This implies that the convolution operator is of type
with
-norm at most
. We also note that Hölder’s inequality yields the estimate
whence is of type
with
-norm at most
. It then follows that
is of type
with the operator norm at most
for all
. We therefore have the following inequality:
Corollary 7 (Young). If such that
then
for all and
- 4. Interpolation on analytic families of operators -
We note that the proof of Riesz-Thorin was a study of the function
where was holomorphic in virtue of
and
depending holomorphically on the complex variable
. The two endpoint norm estimates on the operator
gave bounds on the lines
and
, whence the three lines lemma yielded the interpolated bound on
. The corresponding bound for
was then obtained by a “duality argument”, using the Riesz representation theorem.
What if we add the to the operator
and study
instead? If the operator “varies holomorphically” over the strip
so that is holomorphic in
, then we could argue as above to obtain an interpolation theorem that allows for varying operators. A collection of such operators is called an analytic family of operators, following the traditional practice of referring to complex analysis as the theory of analytic functions.
Formally, we suppose that , for each
, is a linear operator on the space of simple functions in
into measurable functions on
such that
for all simple functions
in
and all simple functions
in
. The family
of operators is said to be admissible if the function
is holomorphic in the interior of , continuous on
, and admits a constant
such that
The interpolation theorem of Stein can then be stated as follows:
Theorem 8 (Stein). If is an admissible family of linear operators with the norm estimates
for all simple functions in
such that
and
satisfies
for all and some
, then, for
, there exists a constant
such that
for all such simple functions f, where
In fact, we can take
We will not discuss the formal proof here: see, for example, pp.206-209 of [SW71]. See also Terry Tao’s blog post, which offers a detailed discussion of the theorem.
Lecture 2. Weak Endpoint Estimates: The theorems of Marcinkiewicz and Fefferman-Stein
We now shift gears to study the classical real interpolation theorem of Marcinkiewicz. Unlike Stein’s interpolation theorem, the Marcinkiewicz interpolation theorem does not allow the operator to vary. The improvement, however, is that we may now interpolate with weaker endpoint conditions—the extent of which we shall make precise in what follows. Due to the real-variable nature of the proof, we may take the scalars to be either real or complex.
- 1. The Hardy-Littlewood maximal function -
Recall the differentiation theorem of Lebesgue, which states that we have the almost-everywhere pointwise convergence
for all . Crucial in establishing this theorem is the Hardy-Littlewood maximal function
and the corresponding weak-type inequality
where is a constant independent of
and
. This inequality cannot be improved for general
-functions. Consider, for example, the action of the maximal operator on
, a one-dimensional characteristic function. Since
setting yields the equality.
Surprisingly, the weak -bound, combined with the
-bound
is sufficient to guarantee that the maximal operator can be extended to a bounded operator for all
. The proof of this fact can be generalized considerably, and we are led to yet another interpolation theorem—the Marcinkiewicz interpolation theorem.
- 2. The Marcinkiewicz interpolation theorem -
Before we state the interpolation theorem, let us introduce a way to measure the size of a measurable function in a global manner.
Definition. The distribution function of a measurable function on a
-finite measure space is
.
With this notation, we can write the weak-type inequality of the Hardy-Littlewood maximal function as
In general, we define weak-type operators as follows:
Definition. Let and
be
-finite measure spaces and fix a vector space
of
-measurable functions on
that
- contains characteristic functions of sets of finite measure, and
- is closed under truncation of
.
An operator on
into a vector space of
-measurable functions is subadditive if
for almost every , whenever
. Given
and
, a subadditive operator
is of weak type
if there exists a constant
such that
for all . If
, the above inequality is replaced by the condition
The smallest such is the weak
-norm of
.
Of course, is dense in
, and so each subadditive operator
of weak type
can be extended uniquely to a “bounded” operator on
with the same norm. What, then, is the target space of
? Evidently, we need a larger space than the classical Lebesgue spaces. Natural substitutes in this case are the weak Lebesgue spaces, which we define below:
Definition. For , the weak Lebesgue space
is the collection of all
-measurable functions
such that
is finite.
We remark that is not a norm. In fact, the weak Lebesgue spaces are merely quasi-normed vector spaces. A subadditive operator
of weak type
can nevertheless be extended uniquely to an operator
, which is bounded in the sense that
for all
, where
is the weak
-norm of
.
We also note that the definition of linear operators of type can be extended in an obvious manner to include subadditive operators. Every operator of type
is then of weak type
. The interpolation theorem of Marcinkiewicz can now be stated as follows:
Theorem 9 (Marcinkiewicz). Fix such that
,
,
, and
.
If a subadditive operator is of weak type
with weak $(p_0,q_0)$-norm
and of weak type
with weak
-norm
, then
is of type
for each
, where
In the interest of time, we will not present a proof of the interpolation theorem. Instead, we merely point out a few key features of the theorem. We first note that, unlike Riesz-Thorin, there is no nice estimate for the interpolated bound. It is known, for example, that the -norm
satisfies the inequality
provided that and
. see, for example, pp. 31-34 of [Gra10] for a proof of this bound.
The classical proof of the theorem makes use of Hardy’s inequality and relies heavily on the notion of non-increasing rearrangement of a measurable function on
that preserves the distribution function and the
-norm of $h$. Such a rearrangement is given by
on . Appendix B of [Ste70] contains a proof of the interpolation theorem for
.
The proper setting for the weak-type endpoint estimates is theLorentz space , which is a collection of
-measurable functions on
such that the Lorentz norm
is finite—here $0 < p,q \leq \infty$. The off-diagonal Marcinkiewicz interpolation theorem, due to Zygmund, provides an interpolation result over Lorentz spaces and can be found in Chapter 5, section 3 of [SW71]. An improvement of this result, due to Grakafos, can be found in of [Gra10].
- 3. Application: the Hilbert transform -
We now apply the interpolation theorem to the study of the Hilbert transform, which is, in a sense, the only singular integral operator in one dimension. First, a definition:
Definition. The Hilbert transform of is
If we set , then the Hilbert transform can be written as a convolution operator
.
In the sense of tempered distributions, the Fourier transform of is
, and so
It thus follows from Plancherel’s theorem that
and so the Hilbert transform is of type (2,2).
It can also be shown that the Hilbert transform is of weak type (1,1). The proof, which can be found in pp. 187-188 of [SW71], requires a basic knowledge of Fourier analysis on tempered distributions and will not be reproduced here. We assume the weak bound here and apply the Marcinkiewicz interpolation theorem to obtain the interpolated bound
for .
Using the above result, we can obtain, “by duality”, the -bound for all
. Recall that if
such that
then and
. We fix
,
, and
such that
. Since $latex K \in latex L^2(\mathbb{R})$, the double integral
converges absolutely. Therefore, we may rewrite the above integral as the iterated integral
Using the bound for —with the kernel
instead of
but with the same constant
—we can check that
belongs to
. Furthermore, its
norm is bounded by
, which is at most
. By Hölder’s inequality, we have
whence taking the supremum over all yields
The duality argument presented above is quite general and can be applied to a large class of operators known as singular integrals. Indeed, we have the following theorem:
Theorem 10 (Calderón–Zygmund). Let . If
for almost every
and
, then the operator
is of type for all
. The
-norm of
only depends on p, B, and d; in particular, it does not depend on
.
The idea of the proof is as follows. The weak-type (2,2) bound is established via a Plancherel argument, and the famous Calderón–Zygmund decomposition is used to establish the weak-type (1,1) bound. Marcinkiewicz establishes the interpolated bound between (1,1) and (2,2), and a duality argument gives a bound for the rest. For a detailed discussion, see Chapter 2 of [Ste70].
- 4. Interpolation on Hardy spaces: and
-
The idea of allowing for weaker endpoint estimates can be applied in the context of complex interpolation as well. As a concluding remark, we mention here the Fefferman’s extension of Stein’s interpolation theorem, which allows for varying operators. The natural substitutes for the Lebesgue spaces in this setting are the (real-variable) Hardy spaces, which behave much nicer under the action of various operators used frequently in harmonic analysis. Formally, the Hardy space is a collection of tempered distributions
such that, for some
with
, the maximal function
is in . It turns out that
for
.
Note, however, that . In particular, the Hilbert transform maps
into
. The interpolation theorem, as was introduced in [FS72], replaces the
bound in Stein’s interpolation theorem with an
bound. By a similar duality argument as the one given above, this interpolation theorem can be extended to
for all
. The key fact is that the dual of
is the John-Nirenberg space of bounded mean oscillation (BMO)—this was one of the main theorems in [FS72].
We will not discuss the interpolation theory on Hardy spaces any further. See Chapters 3 and 4 of [Ste93] for a detailed exposition of real-variable Hardy-space theory: a Fefferman-Stein type interpolation theorem is proved in Chapter 4, section 5.
References
- [FS72] Charles Fefferman and Elias M. Stein, “
spaces of several variables”, Acta Math. 129 (1972), no. 3-4, 137-193.
- [Fol99] Gerald B. Folland, Real Analysis: Modern Techniques and Their Applications, second ed., John Wiley & Sons, 1999.
- [Gra10] Loukas Grafakos, Classical Fourier Analysis, Springer, 2010.
- [SS05] Elias M. Stein and Rami Shakarchi, Real Analysis: Measure Theory, Integration, and Hilbert Spaces, Princeton University Press, 2005.
- [SS11] Elias M. Stein and Rami Shakarchi, Functional Analysis: Introduction to Further Topics in Analysis, Princeton University Press, 2011.
- [Ste70] Elias M. Stein, Singular Integrals and Differentiability Properties of Functions, Princeton University Press, 1970.
- [Ste93] Elias M. Stein, Harmonic Analysis, Princeton University Press, 1993.
- [SW71] Elias M. Stein and Guido Weiss, Introduction to Fourier Analysis on Euclidean Spaces, Princeton University Press, 1971.
- [Tao11] Terence Tao, “Stein’s interpolation theorem“, What’s new (http://terrytao.wordpress.com/), May 3, 2011.
- [Wol03] Thomas H. Wolff, Lectures on Harmonic Analysis, American Mathematical Society, 2003.
Recent Comments