Riesz–Thorin theorem

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Template:Short description Script error: No such module "about". In mathematical analysis, 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 Thorin.

This theorem bounds the norms of linear maps acting between LpScript error: No such module "Check for unknown parameters". spaces. Its usefulness stems from the fact that some of these spaces have rather simpler structure than others. Usually that refers to L2Script error: No such module "Check for unknown parameters". which is a Hilbert space, or to L1Script error: No such module "Check for unknown parameters". and L∞Script error: No such module "Check for unknown parameters".. Therefore one may prove theorems about the more complicated cases by proving them in two simple cases and then using the Riesz–Thorin theorem to pass from the simple cases to the complicated cases. The Marcinkiewicz theorem is similar but applies also to a class of non-linear maps.

Motivation

First we need the following definition:

Definition. Let p0, p1Script error: No such module "Check for unknown parameters". be two numbers such that 1 ≤ p0 < p1 ≤ ∞Script error: No such module "Check for unknown parameters".. Then for 0 < θ < 1Script error: No such module "Check for unknown parameters". define pθScript error: No such module "Check for unknown parameters". by:  Template:Sfrac = Template:Sfrac + Template:SfracScript error: No such module "Check for unknown parameters"..

By splitting up the function  f Script error: No such module "Check for unknown parameters". in LpθScript error: No such module "Check for unknown parameters". as the product | f | = | f |1−θ | f |θScript error: No such module "Check for unknown parameters". and applying Hölder's inequality to its pθScript error: No such module "Check for unknown parameters". power, we obtain the following result, foundational in the study of LpScript error: No such module "Check for unknown parameters".-spaces:

Template:Math theorem

This result, whose name derives from the convexity of the map <templatestyles src="Fraction/styles.css" />1⁄p ↦ log || f ||pScript error: No such module "Check for unknown parameters". on [0, ∞]Script error: No such module "Check for unknown parameters"., implies that Lp0 ∩ Lp1 ⊂ LpθScript error: No such module "Check for unknown parameters"..

On the other hand, if we take the layer-cake decomposition  f  =  f 1Template:Mset +  f 1Template:MsetScript error: No such module "Check for unknown parameters"., then we see that  f 1Template:Mset ∈ Lp0Script error: No such module "Check for unknown parameters". and  f 1Template:Mset ∈ Lp1Script error: No such module "Check for unknown parameters"., whence we obtain the following result:

Template:Math theorem

In particular, the above result implies that LpθScript error: No such module "Check for unknown parameters". is included in Lp0 + Lp1Script error: No such module "Check for unknown parameters"., the sumset of Lp0Script error: No such module "Check for unknown parameters". and Lp1Script error: No such module "Check for unknown parameters". in the space of all measurable functions. Therefore, we have the following chain of inclusions:

Template:Math theorem

In practice, we often encounter operators defined on the sumset Lp0 + Lp1Script error: No such module "Check for unknown parameters".. For example, the Riemann–Lebesgue lemma shows that the Fourier transform maps L1(Rd)Script error: No such module "Check for unknown parameters". boundedly into L∞(Rd)Script error: No such module "Check for unknown parameters"., and Plancherel's theorem shows that the Fourier transform maps L2(Rd)Script error: No such module "Check for unknown parameters". boundedly into itself, hence the Fourier transform ℱ extends to (L1 + L2) (Rd)Script error: No such module "Check for unknown parameters". by setting ℱ(f1+f2)=ℱL1(f1)+ℱL2(f2) for all  f1  ∈ L1(Rd)Script error: No such module "Check for unknown parameters". and  f2  ∈ L2(Rd)Script error: No such module "Check for unknown parameters".. It is therefore natural to investigate the behavior of such operators on the intermediate subspaces LpθScript error: No such module "Check for unknown parameters"..

To this end, we go back to our example and note that the Fourier transform on the sumset L1 + L2Script error: No such module "Check for unknown parameters". was obtained by taking the sum of two instantiations of the same operator, namely ℱL1:L1(𝐑d)→L∞(𝐑d), ℱL2:L2(𝐑d)→L2(𝐑d).

These really are the same operator, in the sense that they agree on the subspace (L1 ∩ L2) (Rd)Script error: No such module "Check for unknown parameters".. Since the intersection contains simple functions, it is dense in both L1(Rd)Script error: No such module "Check for unknown parameters". and L2(Rd)Script error: No such module "Check for unknown parameters".. Densely defined continuous operators admit unique extensions, and so we are justified in considering ℱL1 and ℱL2 to be the same.

Therefore, the problem of studying operators on the sumset Lp0 + Lp1Script error: No such module "Check for unknown parameters". essentially reduces to the study of operators that map two natural domain spaces, Lp0Script error: No such module "Check for unknown parameters". and Lp1Script error: No such module "Check for unknown parameters"., boundedly to two target spaces: Lq0Script error: No such module "Check for unknown parameters". and Lq1Script error: No such module "Check for unknown parameters"., respectively. Since such operators map the sumset space Lp0 + Lp1Script error: No such module "Check for unknown parameters". to Lq0 + Lq1Script error: No such module "Check for unknown parameters"., it is natural to expect that these operators map the intermediate space LpθScript error: No such module "Check for unknown parameters". to the corresponding intermediate space LqθScript error: No such module "Check for unknown parameters"..

Statement of the theorem

There are several ways to state the Riesz–Thorin interpolation theorem;[1] to be consistent with the notations in the previous section, we shall use the sumset formulation.

Template:Math theorem

In other words, if Template:Mvar is simultaneously of type (p0, q0)Script error: No such module "Check for unknown parameters". and of type (p1, q1)Script error: No such module "Check for unknown parameters"., then Template:Mvar is of type (pθ, qθ)Script error: No such module "Check for unknown parameters". for all 0 < θ < 1Script error: No such module "Check for unknown parameters".. In this manner, the interpolation theorem lends itself to a pictorial description. Indeed, the Riesz diagram of Template:Mvar is the collection of all points (Template:Sfrac, Template:Sfrac)Script error: No such module "Check for unknown parameters". in the unit square [0, 1] × [0, 1]Script error: No such module "Check for unknown parameters". such that Template:Mvar is of type (p, q)Script error: No such module "Check for unknown parameters".. The interpolation theorem states that the Riesz diagram of Template:Mvar is a convex set: given two points in the Riesz diagram, the line segment that connects them will also be in the diagram.

The interpolation theorem was originally stated and proved by Marcel Riesz in 1927.[2] The 1927 paper establishes the theorem only for the lower triangle of the Riesz diagram, viz., with the restriction that p0 ≤ q0Script error: No such module "Check for unknown parameters". and p1 ≤ q1Script error: No such module "Check for unknown parameters".. Olof Thorin extended the interpolation theorem to the entire square, removing the lower-triangle restriction. The proof of Thorin was originally published in 1938 and was subsequently expanded upon in his 1948 thesis.[3]

Proof

We will first prove the result for simple functions and eventually show how the argument can be extended by density to all measurable functions.

Simple functions

By symmetry, let us assume p0<p1 (the case p0=p1 trivially follows from (1)). Let f be a simple function, that is f=∑j=1maj𝟏Aj for some finite m∈ℕ, aj=|aj|eiαj∈ℂ and Aj∈Σ1, j=1,2,…,m. Similarly, let g denote a simple function Ω2→ℂ, namely g=∑k=1nbk𝟏Bk for some finite n∈ℕ, bk=|bk|eiβk∈ℂ and Bk∈Σ2, k=1,2,…,n.

Note that, since we are assuming Ω1 and Ω2 to be σ-finite metric spaces, f∈Lr(μ1) and g∈Lr(μ2) for all r∈[1,∞]. Then, by proper normalization, we can assume ‖f‖pθ=1 and ‖g‖qθ′=1, with qθ′=qθ(qθ−1)−1 and with pθ, qθ as defined by the theorem statement.

Next, we define the two complex functions u:ℂ→ℂv:ℂ→ℂz↦u(z)=1−zp0+zp1z↦v(z)=1−zq0+zq1. Note that, for z=θ, u(θ)=pθ−1 and v(θ)=qθ−1. We then extend f and g to depend on a complex parameter z as follows: fz=∑j=1m|aj|u(z)u(θ)eiαj𝟏Ajgz=∑k=1n|bk|1−v(z)1−v(θ)eiβk𝟏Bk so that fθ=f and gθ=g. Here, we are implicitly excluding the case q0=q1=1, which yields v≡1: In that case, one can simply take gz=g, independently of z, and the following argument will only require minor adaptations.

Let us now introduce the function Φ(z)=∫Ω2(Tfz)gzdμ2=∑j=1m∑k=1n|aj|u(z)u(θ)|bk|1−v(z)1−v(θ)γj,k where γj,k=ei(αj+βk)∫Ω2(T𝟏Aj)𝟏Bkdμ2 are constants independent of z. We readily see that Φ(z) is an entire function, bounded on the strip 0≤ℝe⁡z≤1. Then, in order to prove (2), we only need to show that Template:NumBlk for all fz and gz as constructed above. Indeed, if (3) holds true, by Hadamard three-lines theorem, |Φ(θ+i0)|=|∫Ω2(Tf)gdμ2|≤‖T‖Lp0→Lq01−θ‖T‖Lp1→Lq1θ for all f and g. This means, by fixing f, that supg|∫Ω2(Tf)gdμ2|≤‖T‖Lp0→Lq01−θ‖T‖Lp1→Lq1θ where the supremum is taken with respect to all g simple functions with ‖g‖qθ′=1. The left-hand side can be rewritten by means of the following lemma.[4]

Template:Math theorem

In our case, the lemma above implies ‖Tf‖qθ≤‖T‖Lp0→Lq01−θ‖T‖Lp1→Lq1θ for all simple function f with ‖f‖pθ=1. Equivalently, for a generic simple function, ‖Tf‖qθ≤‖T‖Lp0→Lq01−θ‖T‖Lp1→Lq1θ‖f‖pθ.

Proof of (3)

Let us now prove that our claim (3) is indeed certain. The sequence (Aj)j=1m consists of disjoint subsets in Σ1 and, thus, each ξ∈Ω1 belongs to (at most) one of them, say Aȷ^. Then, for z=iy, |fiy(ξ)|=||aȷ^|u(iy)u(θ)|=|exp⁡(log⁡|aȷ^|pθp0)exp⁡(−iylog⁡|aȷ^|pθ(1p0−1p1))|=|aȷ^|pθp0=|f(ξ)|pθp0 which implies that ‖fiy‖p0≤‖f‖pθpθp0. With a parallel argument, each ζ∈Ω2 belongs to (at most) one of the sets supporting g, say Bk^, and |giy(ζ)|=|bk^|1−1/q01−1/qθ=|g(ζ)|1−1/q01−1/qθ=|g(ζ)|qθ′q0′⟹‖giy‖q0′≤‖g‖qθ′qθ′q0′.

We can now bound Φ(iy): By applying Hölder’s inequality with conjugate exponents q0 and q0′, we have |Φ(iy)|≤‖Tfiy‖q0‖giy‖q0′≤‖T‖Lp0→Lq0‖fiy‖p0‖giy‖q0′=‖T‖Lp0→Lq0‖f‖pθpθp0‖g‖qθ′qθ′q0′=‖T‖Lp0→Lq0.

We can repeat the same process for z=1+iy to obtain |f1+iy(ξ)|=|f(ξ)|pθ/p1, |g1+iy(ζ)|=|g(ζ)|qθ′/q1′ and, finally, |Φ(1+iy)|≤‖T‖Lp1→Lq1‖f1+iy‖p1‖g1+iy‖q1′=‖T‖Lp1→Lq1.

Extension to all measurable functions in Lpθ

So far, we have proven that Template:NumBlk when f is a simple function. As already mentioned, the inequality holds true for all f∈Lpθ(Ω1) by the density of simple functions in Lpθ(Ω1).

Formally, let f∈Lpθ(Ω1) and let (fn)n be a sequence of simple functions such that |fn|≤|f|, for all n, and fn→f pointwise. Let E={x∈Ω1:|f(x)|>1} and define g=f𝟏E, gn=fn𝟏E, h=f−g=f𝟏Ec and hn=fn−gn. Note that, since we are assuming p0≤pθ≤p1, ‖f‖pθpθ=∫Ω1|f|pθdμ1≥∫Ω1|f|pθ𝟏Edμ1≥∫Ω1|f𝟏E|p0dμ1=∫Ω1|g|p0dμ1=‖g‖p0p0‖f‖pθpθ=∫Ω1|f|pθdμ1≥∫Ω1|f|pθ𝟏Ecdμ1≥∫Ω1|f𝟏Ec|p1dμ1=∫Ω1|h|p1dμ1=‖h‖p1p1 and, equivalently, g∈Lp0(Ω1) and h∈Lp1(Ω1).

Let us see what happens in the limit for n→∞. Since |fn|≤|f|, |gn|≤|g| and |hn|≤|h|, by the dominated convergence theorem one readily has ‖fn‖pθ→‖f‖pθ‖gn‖p0→‖g‖p0‖hn‖p1→‖h‖p1. Similarly, |f−fn|≤2|f|, |g−gn|≤2|g| and |h−hn|≤2|h| imply ‖f−fn‖pθ→0‖g−gn‖p0→0‖h−hn‖p1→0 and, by the linearity of T as an operator of types (p0,q0) and (p1,q1) (we have not proven yet that it is of type (pθ,qθ) for a generic f) ‖Tg−Tgn‖p0≤‖T‖Lp0→Lq0‖g−gn‖p0→0‖Th−Thn‖p1≤‖T‖Lp1→Lq1‖h−hn‖p1→0.

It is now easy to prove that Tgn→Tg and Thn→Th in measure: For any ϵ>0, Chebyshev’s inequality yields μ2(y∈Ω2:|Tg−Tgn|>ϵ)≤‖Tg−Tgn‖q0q0ϵq0 and similarly for Th−Thn. Then, Tgn→Tg and Thn→Th a.e. for some subsequence and, in turn, Tfn→Tf a.e. Then, by Fatou’s lemma and recalling that (4) holds true for simple functions, ‖Tf‖qθ≤lim infn→∞‖Tfn‖qθ≤‖T‖Lpθ→Lqθlim infn→∞‖fn‖pθ=‖T‖Lpθ→Lqθ‖f‖pθ.

Interpolation of analytic families of operators

The proof outline presented in the above section readily generalizes to the case in which the operator Template:Mvar is allowed to vary analytically. In fact, an analogous proof can be carried out to establish a bound on the entire function φ(z)=∫(Tzfz)gzdμ2, from which we obtain the following theorem of Elias Stein, published in his 1956 thesis:[5]

Template:Math theorem

The theory of real Hardy spaces and the space of bounded mean oscillations permits us to wield the Stein interpolation theorem argument in dealing with operators on the Hardy space H1(Rd)Script error: No such module "Check for unknown parameters". and the space BMOScript error: No such module "Check for unknown parameters". of bounded mean oscillations; this is a result of Charles Fefferman and Elias Stein.[6]

Applications

Hausdorff–Young inequality

Script error: No such module "Labelled list hatnote". It has been shown in the first section that the Fourier transform ℱ maps L1(Rd)Script error: No such module "Check for unknown parameters". boundedly into L∞(Rd)Script error: No such module "Check for unknown parameters". and L2(Rd)Script error: No such module "Check for unknown parameters". into itself. A similar argument shows that the Fourier series operator, which transforms periodic functions  f  : T → CScript error: No such module "Check for unknown parameters". into functions f^:𝐙→𝐂 whose values are the Fourier coefficients f^(n)=12π∫−ππf(x)e−inxdx, maps L1(T)Script error: No such module "Check for unknown parameters". boundedly into ℓ∞(Z)Script error: No such module "Check for unknown parameters". and L2(T)Script error: No such module "Check for unknown parameters". into ℓ2(Z)Script error: No such module "Check for unknown parameters".. The Riesz–Thorin interpolation theorem now implies the following: ‖ℱf‖Lq(𝐑d)≤‖f‖Lp(𝐑d)‖f^‖ℓq(𝐙)≤‖f‖Lp(𝐓) where 1 ≤ p ≤ 2Script error: No such module "Check for unknown parameters". and Template:Sfrac + Template:Sfrac = 1Script error: No such module "Check for unknown parameters".. This is the Hausdorff–Young inequality.

The Hausdorff–Young inequality can also be established for the Fourier transform on locally compact Abelian groups. The norm estimate of 1 is not optimal. See the main article for references.

Convolution operators

Script error: No such module "Labelled list hatnote". Let  f Script error: No such module "Check for unknown parameters". be a fixed integrable function and let Template:Mvar be the operator of convolution with  f Script error: No such module "Check for unknown parameters"., i.e., for each function Template:Mvar we have Tg =  f  ∗ gScript error: No such module "Check for unknown parameters"..

It follows from Fubini's theorem that Template:Mvar is bounded from L1Script error: No such module "Check for unknown parameters". to L1Script error: No such module "Check for unknown parameters". and it is trivial that it is bounded from L∞Script error: No such module "Check for unknown parameters". to L∞Script error: No such module "Check for unknown parameters". (both bounds are by || f ||1Script error: No such module "Check for unknown parameters".). Therefore the Riesz–Thorin theorem gives ‖f*g‖p≤‖f‖1‖g‖p.

We take this inequality and switch the role of the operator and the operand, or in other words, we think of Template:Mvar as the operator of convolution with Template:Mvar, and get that Template:Mvar is bounded from L1Script error: No such module "Check for unknown parameters". to Lp. Further, since Template:Mvar is in LpScript error: No such module "Check for unknown parameters". we get, in view of Hölder's inequality, that Template:Mvar is bounded from LqScript error: No such module "Check for unknown parameters". to L∞Script error: No such module "Check for unknown parameters"., where again Template:Sfrac + Template:Sfrac = 1Script error: No such module "Check for unknown parameters".. So interpolating we get ‖f*g‖s≤‖f‖r‖g‖p where the connection between p, r and s is 1r+1p=1+1s.

The Hilbert transform

Script error: No such module "Labelled list hatnote".

The Hilbert transform of  f  : R → CScript error: No such module "Check for unknown parameters". is given by ℋf(x)=1πp.v.∫−∞∞f(x−t)tdt=(1πp.v.1t∗f)(x), where p.v. indicates the Cauchy principal value of the integral. The Hilbert transform is a Fourier multiplier operator with a particularly simple multiplier: ℋf^(ξ)=−isgn⁡(ξ)f^(ξ).

It follows from the Plancherel theorem that the Hilbert transform maps L2(R)Script error: No such module "Check for unknown parameters". boundedly into itself.

Nevertheless, the Hilbert transform is not bounded on L1(R)Script error: No such module "Check for unknown parameters". or L∞(R)Script error: No such module "Check for unknown parameters"., and so we cannot use the Riesz–Thorin interpolation theorem directly. To see why we do not have these endpoint bounds, it suffices to compute the Hilbert transform of the simple functions 1(−1,1)(x)Script error: No such module "Check for unknown parameters". and 1(0,1)(x) − 1(0,1)(−x)Script error: No such module "Check for unknown parameters".. We can show, however, that (ℋf)2=f2+2ℋ(fℋf) for all Schwartz functions  f  : R → CScript error: No such module "Check for unknown parameters"., and this identity can be used in conjunction with the Cauchy–Schwarz inequality to show that the Hilbert transform maps L2n(Rd)Script error: No such module "Check for unknown parameters". boundedly into itself for all n ≥ 2Script error: No such module "Check for unknown parameters".. Interpolation now establishes the bound ‖ℋf‖p≤Ap‖f‖p for all 2 ≤ p < ∞Script error: No such module "Check for unknown parameters"., and the self-adjointness of the Hilbert transform can be used to carry over these bounds to the 1 < p ≤ 2Script error: No such module "Check for unknown parameters". case.

Comparison with the real interpolation method

While the Riesz–Thorin interpolation theorem and its variants are powerful tools that yield a clean estimate on the interpolated operator norms, they suffer from numerous defects: some minor, some more severe. Note first that the complex-analytic nature of the proof of the Riesz–Thorin interpolation theorem forces the scalar field to be CScript error: No such module "Check for unknown parameters".. For extended-real-valued functions, this restriction can be bypassed by redefining the function to be finite everywhere—possible, as every integrable function must be finite almost everywhere. A more serious disadvantage is that, in practice, many operators, such as the Hardy–Littlewood maximal operator and the Calderón–Zygmund operators, do not have good endpoint estimates.[7] In the case of the Hilbert transform in the previous section, we were able to bypass this problem by explicitly computing the norm estimates at several midway points. This is cumbersome and is often not possible in more general scenarios. Since many such operators satisfy the weak-type estimates μ({x:Tf(x)>α})≤(Cp,q‖f‖pα)q, real interpolation theorems such as the Marcinkiewicz interpolation theorem are better-suited for them. Furthermore, a good number of important operators, such as the Hardy-Littlewood maximal operator, are only sublinear. This is not a hindrance to applying real interpolation methods, but complex interpolation methods are ill-equipped to handle non-linear operators. On the other hand, real interpolation methods, compared to complex interpolation methods, tend to produce worse estimates on the intermediate operator norms and do not behave as well off the diagonal in the Riesz diagram. The off-diagonal versions of the Marcinkiewicz interpolation theorem require the formalism of Lorentz spaces and do not necessarily produce norm estimates on the LpScript error: No such module "Check for unknown parameters".-spaces.

Mityagin's theorem

B. Mityagin extended the Riesz–Thorin theorem; this extension is formulated here in the special case of spaces of sequences with unconditional bases (cf. below).

Assume: ‖A‖ℓ1→ℓ1,‖A‖ℓ∞→ℓ∞≤M.

Then ‖A‖X→X≤M

for any unconditional Banach space of sequences Template:Mvar, that is, for any (xi)∈X and any (εi)∈{−1,1}∞, ‖(εixi)‖X=‖(xi)‖X.

The proof is based on the Krein–Milman theorem.

See also

Notes

<templatestyles src="Reflist/styles.css" />

  1. ↑ Stein and Weiss (1971) and Grafakos (2010) use operators on simple functions, and Muscalu and Schlag (2013) uses operators on generic dense subsets of the intersection Lp0 ∩ Lp1Script error: No such module "Check for unknown parameters".. In contrast, Duoanddikoetxea (2001), Tao (2010), and Stein and Shakarchi (2011) use the sumset formulation, which we adopt in this section.
  2. ↑ Riesz (1927). The proof makes use of convexity results in the theory of bilinear forms. For this reason, many classical references such as Stein and Weiss (1971) refer to the Riesz–Thorin interpolation theorem as the Riesz convexity theorem.
  3. ↑ Thorin (1948)
  4. ↑ Script error: No such module "citation/CS1".
  5. ↑ Stein (1956). As Charles Fefferman points out in his essay in Fefferman, Fefferman, Wainger (1995), the proof of Stein interpolation theorem is essentially that of the Riesz–Thorin theorem with the letter Template:Mvar added to the operator. To compensate for this, a stronger version of the Hadamard three-lines theorem, due to Isidore Isaac Hirschman, Jr., is used to establish the desired bounds. See Stein and Weiss (1971) for a detailed proof, and a blog post of Tao for a high-level exposition of the theorem.
  6. ↑ Fefferman and Stein (1972)
  7. ↑ Elias Stein is quoted for saying that interesting operators in harmonic analysis are rarely bounded on L1Script error: No such module "Check for unknown parameters". and L∞Script error: No such module "Check for unknown parameters"..

Script error: No such module "Check for unknown parameters".

References

  • Script error: No such module "citation/CS1"..
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".. Translated from the Russian and edited by G. P. Barker and G. Kuerti.
  • Script error: No such module "citation/CS1"..
  • Script error: No such module "citation/CS1"..
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".

External links

Template:Lp spaces Template:Functional analysis