Interpolation space

Last updated

In the field of mathematical analysis, an interpolation space is a space which lies "in between" two other Banach spaces. The main applications are in Sobolev spaces, where spaces of functions that have a noninteger number of derivatives are interpolated from the spaces of functions with integer number of derivatives.

Contents

History

The theory of interpolation of vector spaces began by an observation of Józef Marcinkiewicz, later generalized and now known as the Riesz-Thorin theorem. In simple terms, if a linear function is continuous on a certain space Lp and also on a certain space Lq, then it is also continuous on the space Lr, for any intermediate r between p and q. In other words, Lr is a space which is intermediate between Lp and Lq.

In the development of Sobolev spaces, it became clear that the trace spaces were not any of the usual function spaces (with integer number of derivatives), and Jacques-Louis Lions discovered that indeed these trace spaces were constituted of functions that have a noninteger degree of differentiability.

Many methods were designed to generate such spaces of functions, including the Fourier transform, complex interpolation, [1] real interpolation, [2] as well as other tools (see e.g. fractional derivative).

The setting of interpolation

A Banach space X is said to be continuously embedded in a Hausdorff topological vector space Z when X is a linear subspace of Z such that the inclusion map from X into Z is continuous. A compatible couple(X0, X1) of Banach spaces consists of two Banach spaces X0 and X1 that are continuously embedded in the same Hausdorff topological vector space Z. [3] The embedding in a linear space Z allows to consider the two linear subspaces

and

Interpolation does not depend only upon the isomorphic (nor isometric) equivalence classes of X0 and X1. It depends in an essential way from the specific relative position that X0 and X1 occupy in a larger space Z.

One can define norms on X0X1 and X0 + X1 by

Equipped with these norms, the intersection and the sum are Banach spaces. The following inclusions are all continuous:

Interpolation studies the family of spaces X that are intermediate spaces between X0 and X1 in the sense that

where the two inclusions maps are continuous.

An example of this situation is the pair (L1(R), L(R)), where the two Banach spaces are continuously embedded in the space Z of measurable functions on the real line, equipped with the topology of convergence in measure. In this situation, the spaces Lp(R), for 1 ≤ p ≤ ∞ are intermediate between L1(R) and L(R). More generally,

with continuous injections, so that, under the given condition, Lp(R) is intermediate between Lp0(R) and Lp1(R).

Definition. Given two compatible couples (X0, X1) and (Y0, Y1), an interpolation pair is a couple (X, Y) of Banach spaces with the two following properties:
  • The space X is intermediate between X0 and X1, and Y is intermediate between Y0 and Y1.
  • If L is any linear operator from X0 + X1 to Y0 + Y1, which maps continuously X0 to Y0 and X1 to Y1, then it also maps continuously X to Y.

The interpolation pair (X, Y) is said to be of exponent θ (with 0 < θ < 1) if there exists a constant C such that

for all operators L as above. The notation ||L||X,Y is for the norm of L as a map from X to Y. If C = 1, we say that (X, Y) is an exact interpolation pair of exponent θ.

Complex interpolation

If the scalars are complex numbers, properties of complex analytic functions are used to define an interpolation space. Given a compatible couple (X0, X1) of Banach spaces, the linear space consists of all functions f : CX0 + X1, that are analytic on S = {z : 0 < Re(z) < 1}, continuous on S = {z : 0 ≤ Re(z) ≤ 1}, and for which all the following subsets are bounded:

{f(z) : zS} ⊂ X0 + X1,
{f(it) : tR} ⊂ X0,
{f(1 + it) : tR} ⊂ X1.

is a Banach space under the norm

Definition. [4] For 0 < θ < 1, the complex interpolation space(X0, X1)θ is the linear subspace of X0 + X1 consisting of all values f(θ) when f varies in the preceding space of functions,

The norm on the complex interpolation space (X0, X1)θ is defined by

Equipped with this norm, the complex interpolation space (X0, X1)θ is a Banach space.

Theorem. [5] Given two compatible couples of Banach spaces (X0, X1) and (Y0, Y1), the pair ((X0, X1)θ, (Y0, Y1)θ) is an exact interpolation pair of exponent θ, i.e., if T : X0 + X1Y0 + Y1, is a linear operator bounded from Xj to Yj, j = 0, 1, then T is bounded from (X0, X1)θ to (Y0, Y1)θ and

The family of Lp spaces (consisting of complex valued functions) behaves well under complex interpolation. [6] If (R, Σ, μ) is an arbitrary measure space, if 1 ≤ p0, p1 ≤ ∞ and 0 < θ < 1, then

with equality of norms. This fact is closely related to the Riesz–Thorin theorem.

Real interpolation

There are two ways for introducing the real interpolation method. The first and most commonly used when actually identifying examples of interpolation spaces is the K-method. The second method, the J-method, gives the same interpolation spaces as the K-method when the parameter θ is in (0, 1). That the J- and K-methods agree is important for the study of duals of interpolation spaces: basically, the dual of an interpolation space constructed by the K-method appears to be a space constructed from the dual couple by the J-method; see below.

K-method

The K-method of real interpolation [7] can be used for Banach spaces over the field R of real numbers.

Definition. Let (X0, X1) be a compatible couple of Banach spaces. For t > 0 and every xX0 + X1, let

Changing the order of the two spaces results in: [8]

Let

The K-method of real interpolation consists in taking Kθ,q(X0, X1) to be the linear subspace of X0 + X1 consisting of all x such that ||x||θ,q;K < ∞.

Example

An important example is that of the couple (L1(R, Σ, μ), L(R, Σ, μ)), where the functional K(t, f; L1, L) can be computed explicitly. The measure μ is supposed σ-finite. In this context, the best way of cutting the function fL1 + L as sum of two functions f0L1 and f1L is, for some s > 0 to be chosen as function of t, to let f1(x) be given for all xR by

The optimal choice of s leads to the formula [9]

where f  is the decreasing rearrangement of f.

J-method

As with the K-method, the J-method can be used for real Banach spaces.

Definition. Let (X0, X1) be a compatible couple of Banach spaces. For t > 0 and for every vector xX0X1, let

A vector x in X0 + X1 belongs to the interpolation space Jθ,q(X0, X1) if and only if it can be written as

where v(t) is measurable with values in X0X1 and such that

The norm of x in Jθ,q(X0, X1) is given by the formula

Relations between the interpolation methods

The two real interpolation methods are equivalent when 0 < θ < 1. [10]

Theorem. Let (X0, X1) be a compatible couple of Banach spaces. If 0 < θ < 1 and 1 ≤ q ≤ ∞, then
with equivalence of norms.

The theorem covers degenerate cases that have not been excluded: for example if X0 and X1 form a direct sum, then the intersection and the J-spaces are the null space, and a simple computation shows that the K-spaces are also null.

When 0 < θ < 1, one can speak, up to an equivalent renorming, about the Banach space obtained by the real interpolation method with parameters θ and q. The notation for this real interpolation space is (X0, X1)θ,q. One has that

For a given value of θ, the real interpolation spaces increase with q: [11] if 0 < θ < 1 and 1 ≤ qr ≤ ∞, the following continuous inclusion holds true:

Theorem. Given 0 < θ < 1, 1 ≤ q ≤ ∞ and two compatible couples (X0, X1) and (Y0, Y1), the pair ((X0, X1)θ,q, (Y0, Y1)θ,q) is an exact interpolation pair of exponent θ. [12]

A complex interpolation space is usually not isomorphic to one of the spaces given by the real interpolation method. However, there is a general relationship.

Theorem. Let (X0, X1) be a compatible couple of Banach spaces. If 0 < θ < 1, then

Examples

When X0 = C([0, 1]) and X1 = C1([0, 1]), the space of continuously differentiable functions on [0, 1], the (θ, ∞) interpolation method, for 0 < θ < 1, gives the Hölder space C0,θ of exponent θ. This is because the K-functional K(f, t; X0, X1) of this couple is equivalent to

Only values 0 < t < 1 are interesting here.

Real interpolation between Lp spaces gives [13] the family of Lorentz spaces. Assuming 0 < θ < 1 and 1 ≤ q ≤ ∞, one has:

with equivalent norms. This follows from an inequality of Hardy and from the value given above of the K-functional for this compatible couple. When q = p, the Lorentz space Lp,p is equal to Lp, up to renorming. When q = ∞, the Lorentz space Lp,∞ is equal to weak-Lp.

The reiteration theorem

An intermediate space X of the compatible couple (X0, X1) is said to be of class θ if [14]

with continuous injections. Beside all real interpolation spaces (X0, X1)θ,q with parameter θ and 1 ≤ q ≤ ∞, the complex interpolation space (X0, X1)θ is an intermediate space of class θ of the compatible couple (X0, X1).

The reiteration theorems says, in essence, that interpolating with a parameter θ behaves, in some way, like forming a convex combination a = (1 − θ)x0 + θx1: taking a further convex combination of two convex combinations gives another convex combination.

Theorem. [15] Let A0, A1 be intermediate spaces of the compatible couple (X0, X1), of class θ0 and θ1 respectively, with 0 < θ0θ1 < 1. When 0 < θ < 1 and 1 ≤ q ≤ ∞, one has

It is notable that when interpolating with the real method between A0 = (X0, X1)θ0,q0 and A1 = (X0, X1)θ1,q1, only the values of θ0 and θ1 matter. Also, A0 and A1 can be complex interpolation spaces between X0 and X1, with parameters θ0 and θ1 respectively.

There is also a reiteration theorem for the complex method.

Theorem. [16] Let (X0, X1) be a compatible couple of complex Banach spaces, and assume that X0X1 is dense in X0 and in X1. Let A0 = (X0, X1)θ0 and A1 = (X0, X1)θ1, where 0 ≤ θ0θ1 ≤ 1. Assume further that X0X1 is dense in A0A1. Then, for every 0 ≤ θ ≤ 1,

The density condition is always satisfied when X0X1 or X1X0.

Duality

Let (X0, X1) be a compatible couple, and assume that X0X1 is dense in X0 and in X1. In this case, the restriction map from the (continuous) dual of Xj, j = 0, 1, to the dual of X0X1 is one-to-one. It follows that the pair of duals is a compatible couple continuously embedded in the dual (X0X1)′.

For the complex interpolation method, the following duality result holds:

Theorem. [17] Let (X0, X1) be a compatible couple of complex Banach spaces, and assume that X0X1 is dense in X0 and in X1. If X0 and X1 are reflexive, then the dual of the complex interpolation space is obtained by interpolating the duals,

In general, the dual of the space (X0, X1)θ is equal [17] to a space defined by a variant of the complex method. [18] The upper-θ and lower-θ methods do not coincide in general, but they do if at least one of X0, X1 is a reflexive space. [19]

For the real interpolation method, the duality holds provided that the parameter q is finite:

Theorem. [20] Let 0 < θ < 1, 1 ≤ q < ∞ and (X0, X1) a compatible couple of real Banach spaces. Assume that X0X1 is dense in X0 and in X1. Then
where

Discrete definitions

Since the function tK(x, t) varies regularly (it is increasing, but 1/tK(x, t) is decreasing), the definition of the Kθ,q-norm of a vector n, previously given by an integral, is equivalent to a definition given by a series. [21] This series is obtained by breaking (0, ∞) into pieces (2n, 2n+1) of equal mass for the measure dt/t,

In the special case where X0 is continuously embedded in X1, one can omit the part of the series with negative indices n. In this case, each of the functions xK(x, 2n; X0, X1) defines an equivalent norm on X1.

The interpolation space (X0, X1)θ,q is a "diagonal subspace" of an q-sum of a sequence of Banach spaces (each one being isomorphic to X0 + X1). Therefore, when q is finite, the dual of (X0, X1)θ,q is a quotient of the p-sum of the duals, 1/p + 1/q = 1, which leads to the following formula for the discrete Jθ,p-norm of a functional x' in the dual of (X0, X1)θ,q:

The usual formula for the discrete Jθ,p-norm is obtained by changing n to n.

The discrete definition makes several questions easier to study, among which the already mentioned identification of the dual. Other such questions are compactness or weak-compactness of linear operators. Lions and Peetre have proved that:

Theorem. [22] If the linear operator T is compact from X0 to a Banach space Y and bounded from X1 to Y, then T is compact from (X0, X1)θ,q to Y when 0 < θ < 1, 1 ≤ q ≤ ∞.

Davis, Figiel, Johnson and Pełczyński have used interpolation in their proof of the following result:

Theorem. [23] A bounded linear operator between two Banach spaces is weakly compact if and only if it factors through a reflexive space.

A general interpolation method

The space q used for the discrete definition can be replaced by an arbitrary sequence space Y with unconditional basis, and the weights an = 2θn, bn = 2(1−θ)n, that are used for the Kθ,q-norm, can be replaced by general weights

The interpolation space K(X0, X1, Y, {an}, {bn}) consists of the vectors x in X0 + X1 such that [24]

where {yn} is the unconditional basis of Y. This abstract method can be used, for example, for the proof of the following result:

Theorem. [25] A Banach space with unconditional basis is isomorphic to a complemented subspace of a space with symmetric basis.

Interpolation of Sobolev and Besov spaces

Several interpolation results are available for Sobolev spaces and Besov spaces on Rn, [26]

These spaces are spaces of measurable functions on Rn when s ≥ 0, and of tempered distributions on Rn when s < 0. For the rest of the section, the following setting and notation will be used:

Complex interpolation works well on the class of Sobolev spaces (the Bessel potential spaces) as well as Besov spaces:

Real interpolation between Sobolev spaces may give Besov spaces, except when s0 = s1,

When s0s1 but p0 = p1, real interpolation between Sobolev spaces gives a Besov space:

Also,

See also

Notes

  1. The seminal papers in this direction are Lions, Jacques-Louis (1960), "Une construction d'espaces d'interpolation", C. R. Acad. Sci. Paris (in French), 251: 1853–1855 and Calderón (1964).
  2. first defined in Lions, Jacques-Louis; Peetre, Jaak (1961), "Propriétés d'espaces d'interpolation", C. R. Acad. Sci. Paris (in French), 253: 1747–1749, developed in Lions & Peetre (1964), with notation slightly different (and more complicated, with four parameters instead of two) from today's notation. It was put later in today's form in Peetre, Jaak (1963), "Nouvelles propriétés d'espaces d'interpolation", C. R. Acad. Sci. Paris (in French), 256: 1424–1426, and Peetre, Jaak (1968), A theory of interpolation of normed spaces, Notas de Matemática, vol. 39, Rio de Janeiro: Instituto de Matemática Pura e Aplicada, Conselho Nacional de Pesquisas, pp. iii+86.
  3. see Bennett & Sharpley (1988), pp. 96105.
  4. see p. 88 in Bergh & Löfström (1976).
  5. see Theorem 4.1.2, p. 88 in Bergh & Löfström (1976).
  6. see Chapter 5, p. 106 in Bergh & Löfström (1976).
  7. see pp. 293–302 in Bennett & Sharpley (1988).
  8. see Proposition 1.2, p. 294 in Bennett & Sharpley (1988).
  9. see p. 298 in Bennett & Sharpley (1988).
  10. see Theorem 2.8, p. 314 in Bennett & Sharpley (1988).
  11. see Proposition 1.10, p. 301 in Bennett & Sharpley (1988)
  12. see Theorem 1.12, pp. 301–302 in Bennett & Sharpley (1988).
  13. see Theorem 1.9, p. 300 in Bennett & Sharpley (1988).
  14. see Definition 2.2, pp. 309310 in Bennett & Sharpley (1988)
  15. see Theorem 2.4, p. 311 in Bennett & Sharpley (1988)
  16. see 12.3, p. 121 in Calderón (1964).
  17. 1 2 see 12.1 and 12.2, p. 121 in Calderón (1964).
  18. Theorem 4.1.4, p. 89 in Bergh & Löfström (1976).
  19. Theorem 4.3.1, p. 93 in Bergh & Löfström (1976).
  20. see Théorème 3.1, p. 23 in Lions & Peetre (1964), or Theorem 3.7.1, p. 54 in Bergh & Löfström (1976).
  21. see chap. II in Lions & Peetre (1964).
  22. see chap. 5, Théorème 2.2, p. 37 in Lions & Peetre (1964).
  23. Davis, William J.; Figiel, Tadeusz; Johnson, William B.; Pełczyński, Aleksander (1974), "Factoring weakly compact operators", Journal of Functional Analysis, 17 (3): 311–327, doi: 10.1016/0022-1236(74)90044-5 , see also Theorem 2.g.11, p. 224 in Lindenstrauss & Tzafriri (1979).
  24. Johnson, William B.; Lindenstrauss, Joram (2001), "Basic concepts in the geometry of Banach spaces", Handbook of the geometry of Banach spaces, Vol. I, Amsterdam: North-Holland, pp. 1–84, and section 2.g in Lindenstrauss & Tzafriri (1979).
  25. see Theorem 3.b.1, p. 123 in Lindenstrauss, Joram; Tzafriri, Lior (1977), Classical Banach Spaces I, Sequence Spaces, Ergebnisse der Mathematik und ihrer Grenzgebiete, vol. 92, Berlin: Springer-Verlag, pp. xiii+188, ISBN   978-3-540-08072-5 .
  26. Theorem 6.4.5, p. 152 in Bergh & Löfström (1976).

Related Research Articles

In mathematics, more specifically in functional analysis, a Banach space is a complete normed vector space. Thus, a Banach space is a vector space with a metric that allows the computation of vector length and distance between vectors and is complete in the sense that a Cauchy sequence of vectors always converges to a well-defined limit that is within the space.

The Hahn–Banach theorem is a central tool in functional analysis. It allows the extension of bounded linear functionals defined on a vector subspace of some vector space to the whole space, and it also shows that there are "enough" continuous linear functionals defined on every normed vector space to make the study of the dual space "interesting". Another version of the Hahn–Banach theorem is known as the Hahn–Banach separation theorem or the hyperplane separation theorem, and has numerous uses in convex geometry.

<span class="mw-page-title-main">Normed vector space</span> Vector space on which a distance is defined

In mathematics, a normed vector space or normed space is a vector space over the real or complex numbers on which a norm is defined. A norm is a generalization of the intuitive notion of "length" in the physical world. If is a vector space over , where is a field equal to or to , then a norm on is a map , typically denoted by , satisfying the following four axioms:

  1. Non-negativity: for every ,.
  2. Positive definiteness: for every , if and only if is the zero vector.
  3. Absolute homogeneity: for every and ,
  4. Triangle inequality: for every and ,

The likelihood function is the joint probability mass of observed data viewed as a function of the parameters of a statistical model. Intuitively, the likelihood function is the probability of observing data assuming is the actual parameter.

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, although according to the Bourbaki group they were first introduced by Frigyes Riesz.

In mathematics, the Banach fixed-point theorem is an important tool in the theory of metric spaces; it guarantees the existence and uniqueness of fixed points of certain self-maps of metric spaces, and provides a constructive method to find those fixed points. It can be understood as an abstract formulation of Picard's method of successive approximations. The theorem is named after Stefan Banach (1892–1945) who first stated it in 1922.

In statistics, a statistic is sufficient with respect to a statistical model and its associated unknown parameter if "no other statistic that can be calculated from the same sample provides any additional information as to the value of the parameter". In particular, a statistic is sufficient for a family of probability distributions if the sample from which it is calculated gives no additional information than the statistic, as to which of those probability distributions is the sampling distribution.

<span class="mw-page-title-main">Jensen's inequality</span> Theorem of convex functions

In mathematics, Jensen's inequality, named after the Danish mathematician Johan Jensen, relates the value of a convex function of an integral to the integral of the convex function. It was proved by Jensen in 1906, building on an earlier proof of the same inequality for doubly-differentiable functions by Otto Hölder in 1889. Given its generality, the inequality appears in many forms depending on the context, some of which are presented below. In its simplest form the inequality states that the convex transformation of a mean is less than or equal to the mean applied after convex transformation; it is a simple corollary that the opposite is true of concave transformations.

In multivariable calculus, the implicit function theorem is a tool that allows relations to be converted to functions of several real variables. It does so by representing the relation as the graph of a function. There may not be a single function whose graph can represent the entire relation, but there may be such a function on a restriction of the domain of the relation. The implicit function theorem gives a sufficient condition to ensure that there is such a function.

In mathematics, a Sobolev space is a vector space of functions equipped with a norm that is a combination of Lp-norms of the function together with its derivatives up to a given order. The derivatives are understood in a suitable weak sense to make the space complete, i.e. a Banach space. Intuitively, a Sobolev space is a space of functions possessing sufficiently many derivatives for some application domain, such as partial differential equations, and equipped with a norm that measures both the size and regularity of a function.

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 Thorin.

In mathematics, the (linear) Peetre theorem, named after Jaak Peetre, is a result of functional analysis that gives a characterisation of differential operators in terms of their effect on generalized function spaces, and without mentioning differentiation in explicit terms. The Peetre theorem is an example of a finite order theorem in which a function or a functor, defined in a very general way, can in fact be shown to be a polynomial because of some extraneous condition or symmetry imposed upon it.

<span class="mw-page-title-main">Characteristic function (probability theory)</span> Fourier transform of the probability density function

In probability theory and statistics, the characteristic function of any real-valued random variable completely defines its probability distribution. If a random variable admits a probability density function, then the characteristic function is the Fourier transform of the probability density function. Thus it provides an alternative route to analytical results compared with working directly with probability density functions or cumulative distribution functions. There are particularly simple results for the characteristic functions of distributions defined by the weighted sums of random variables.

In mathematics, a real or complex-valued function f on d-dimensional Euclidean space satisfies a Hölder condition, or is Hölder continuous, when there are real constants C ≥ 0, > 0, such that

<span class="mw-page-title-main">Monotone likelihood ratio</span> Statistical property

In statistics, the monotone likelihood ratio property is a property of the ratio of two probability density functions (PDFs). Formally, distributions and bear the property if

In operator theory, a branch of mathematics, a positive-definite kernel is a generalization of a positive-definite function or a positive-definite matrix. It was first introduced by James Mercer in the early 20th century, in the context of solving integral operator equations. Since then, positive-definite functions and their various analogues and generalizations have arisen in diverse parts of mathematics. They occur naturally in Fourier analysis, probability theory, operator theory, complex function-theory, moment problems, integral equations, boundary-value problems for partial differential equations, machine learning, embedding problem, information theory, and other areas.

The Kantorovich theorem, or Newton–Kantorovich theorem, is a mathematical statement on the semi-local convergence of Newton's method. It was first stated by Leonid Kantorovich in 1948. It is similar to the form of the Banach fixed-point theorem, although it states existence and uniqueness of a zero rather than a fixed point.

In functional analysis, the dual norm is a measure of size for a continuous linear function defined on a normed vector space.

In mathematics, singular integral operators of convolution type are the singular integral operators that arise on Rn and Tn through convolution by distributions; equivalently they are the singular integral operators that commute with translations. The classical examples in harmonic analysis are the harmonic conjugation operator on the circle, the Hilbert transform on the circle and the real line, the Beurling transform in the complex plane and the Riesz transforms in Euclidean space. The continuity of these operators on L2 is evident because the Fourier transform converts them into multiplication operators. Continuity on Lp spaces was first established by Marcel Riesz. The classical techniques include the use of Poisson integrals, interpolation theory and the Hardy–Littlewood maximal function. For more general operators, fundamental new techniques, introduced by Alberto Calderón and Antoni Zygmund in 1952, were developed by a number of authors to give general criteria for continuity on Lp spaces. This article explains the theory for the classical operators and sketches the subsequent general theory.

In mathematics, and in particular in mathematical analysis, the Gagliardo–Nirenberg interpolation inequality is a result in the theory of Sobolev spaces that relates the -norms of different weak derivatives of a function through an interpolation inequality. The theorem is of particular importance in the framework of elliptic partial differential equations and was originally formulated by Emilio Gagliardo and Louis Nirenberg in 1958. The Gagliardo-Nirenberg inequality has found numerous applications in the investigation of nonlinear partial differential equations, and has been generalized to fractional Sobolev spaces by Haim Brezis and Petru Mironescu in the late 2010s.

References