1. Introduction
The theory of the interpolation of Banach spaces was inspired by two specific theorems for function spaces, which are the Riesz–Thorin Theorem and the Marcinkiewicz Theorem; see [
1]. The essence of the theory of interpolation of the Banach spaces is to establish conditions and guarantees so that the following holds.
Given Banach spaces
,
,
, and
, with
and
, there are two families of subspaces:
and
where
L is a set of indices such that the following are true:
and , with continuous inclusions for all ;
If is a linear and continuous operator, where and are also linear and continuous operators, then is linear and continuous for all with respect to the norms of these spaces.
In the early sixties of the last century, Lions, Peetre, Calderón, Gagliardo, Krein, and other authors were investigating the validity of Riesz–Thorin and the Marcinkiewicz Theorems for pairs of Banach spaces more general than function spaces. Two main interpolation methods were developed, the complex method of Calderón [
2] and the real method from the work of Lions and Peetre [
3]. At the same time, other methods were created, such as the mean method and the trace method.
These works had a great impact, and in the mid-sixties and early seventies, new works appeared generalizing the real method in several directions. A very general construction for Banach spaces was obtained by Aronszajn and Gagliardo in [
4], where they introduced an abstract construction of interpolation spaces encompassing the real and complex methods.
In environments more general than Banach spaces, Peetre, in [
5], developed an interpolation theory for normed spaces. The real interpolation method for normed spaces is characterized by two interpolation methods, the
J method and the
K method, obtained through the functionals
J and
K. The methods
K and
J are equivalent in the case of normed spaces in the sense that they generate the same family of interpolated spaces, and these spaces maintain equivalent norms among themselves. Still in this direction, the trace and mean methods are also equivalent to the
K method and, consequently, equivalent to each other.
In another direction, Peetre and Sparr in [
6] developed an interpolation theory for normed abelian groups. Quasi-Banach spaces are also often considered in interpolation methods. A very general real interpolation theory for Banach spaces was developed in [
7].
We also have in Lions-Peetre’s paper [
3] has a section where the interpolation of locally convex spaces is briefly considered. This calls attention to the possibilities of constructing interpolation theories beyond the normed space framework. The first systematic study in this direction appeared in the paper [
8] by P. Krée.
On the other hand, a theory of interpolation spaces for metric spaces has been seldom considered in the literature. In [
9], Peetre makes some comments on the interpolation of Lipschits operators, but with few details. A more serious attempt was made by Jan Gustavsson in [
10], which is unpublished material as an article. His text has excellent ideas but also unclear points. However, it is the only material we could find on the subject, and it is our main reference and source of inspiration.
Current work follows the suggestive lines of Gustavsson’s work [
10]. Inspired by the real method, we also introduce the
K and
J methods for metric spaces. For the
J method, we follow a similar approach to Gustavsson’s, but for the
K case, we introduce a new method. So, even though the statement of the results for the
K method is similar to the ones of ref. [
10], it must be clear that we are using a different definition. These interpolation methods have the advantage of relying only on the metric structure of the ambient space and do not require any algebraic structure.
The method developed in this work provides a way to interpolate Lipschitz operators between metric spaces, which is a more general case than a linear operator between normed spaces. To build interpolation spaces, we use the technique of completing metric spaces relative to others, using the ideas of Frink [
11] to create metrics through distance functions. We also create new interpolation methods for normed spaces.
Among the main results of this work are Proposition 13 on the compactness of Lipschitz operators and all the results of
Section 8, where we present a comparative analysis between the usual real interpolation for normed spaces and the interpolation for metric spaces developed here. We prove that the method of interpolation of metric spaces extends the real method of the interpolation of normed spaces. Furthermore, we show that it is possible to increase, in the sense of inclusion, the real normed interpolated space as long as there is a normed space greater than the space sums so that the component spaces are continuously included in this space.
In
Section 2,
Section 3,
Section 4,
Section 5 and
Section 6, we introduce the theory of interpolation in metric spaces, defining and exploring the basic properties of the introduced methods. Throughout these sections, we seek to prove the properties common to the interpolation of normed spaces, that is, the properties that could be generalized to metric spaces. In
Section 2, we provide the definition of the relative completion of a metric space in relation to another metric space, and we prove several properties. In
Section 3, we introduce the functionals
and
, proving several properties that are similar to the ones in the normed case. With these functionals, in
Section 4, we define the two interpolation methods for couples of metric spaces, also studying their properties and relations. The behaviors of Lipschitz operators acting on couples of metric spaces is studied in
Section 5.
Section 6 is dedicated to the study of the interpolation of compact operators. We show that it is possible to generalize an important compactness result from linear operators between normed spaces to compact Lipschitz operators between metric spaces.
Section 7 makes the connection between the interpolation in normed spaces and in metric spaces. We show that, with a fixed
and
, the
K-functional of the metric case generates an interpolation space when the metric is given by the norm, which continuously contains the usual interpolation space, provided by the functionals
K and
J of the normed case. Therefore, metric interpolation, in addition to generalizing the interpolation in normed spaces, also creates a new method of interpolation for normed spaces that does not depend on any algebraic structure.
In the last section we present several examples. Initially, we show that the metric interpolation, in addition to generalizing the interpolation in normed spaces, still works for cases of interpolation of normed spaces that cannot be approached using the usual theory since the field of scalars is neither nor . After, we work with metric Fréchet sequence spaces, obtaining an interesting interpolated space.
2. Relative Completion
In this section, we introduce some important definitions that will be constantly used throughout the rest of this work. For definitions and results of the theory of interpolation in Banach spaces, we suggest [
1]. In particular, for the theory of interpolation in normed spaces, the main reference is [
9].
Definition 1. Given a set , a metric on M is a functionsuch that the following hold: - (i)
- (ii)
- (iii)
- (iv)
Definition 2. A metric space is a pair consisting of a non-empty set M and a metric d on M. We denote it by .
When there is no possibility of confusion regarding the metric defined on M, we will refer to the metric space only by M.
Remark 1. If a function d satisfies the conditions and , we say that d is a distance function.
We recall that a Cauchy sequence is a sequence in a metric space such that for every , there exists an integer N such that for all .
Next, we introduce one of our main definitions, which will be used to extend a metric space.
Let
and
be metric spaces such that
, and there is a constant
so that
Given
, if there is a Cauchy sequence
in
such that
we say that
is an approximation sequence of
x in
.
Let
be the set of all points
such that there is some approximation sequence of
x in
. We have that
, because given
, the sequence
is an approximation sequence of
x in
. On
, we define the following function:
where the infimum is taken over all approximation sequences
x and
y in
.
We have the following classical result.
Proposition 1. If and are Cauchy sequences in , then the limit exists.
Proposition 2. We have that is a distance function on .
Proof. For the positivity, we have that
for all
and
. Furthermore, from Proposition 1, we have
. Now, let
such that
. From (
1),
where the infimum is taken over all approximation sequences
x and
y in
. Then,
for all
. Thus, it follows that
, implying that
.
The symmetry follows from the symmetry of . Therefore, the function is a distance function and will be called in this case the distance function associated to the metric . □
Definition 3. Given a non-empty set A and , we define a linking sequence from x to y in A to any -tuple of points in A such that and . Let us denote a sequence of the type by , which links x to y in A, and the set of all linking sequences from x to y in A by .
Remark 2. In particular, n-tuples with repeated elements, and even those with all the same elements, are linking sequences. For the case where the linking sequences are of type they will be linking sequences from x to x in A. We also have that is a linking sequence from x to x in the set A.
We now define the function
d in
, given by
where the infimum is taken over all sequences
.
Remark 3. Definition 6 appears in [10], but the function d in (4) is original from the current work. Lemma 1. The function d is a metric on .
Proof. For the positivity, we have for all . We also have , since, if we take the linking sequence from x to x in given by and , we have . Furthermore, with any , we have just by taking the linking sequence of x to y in given by and .
Now, let
be such that
and consider any linking sequence from
x to
y in
. We have from inequality (
3) that
for all
. Through summing over
k,
In taking the infimum in the definition of
d,
for all
. Then, it follows that
.
For the symmetry, note that given
, if
is a linking sequence from
x to
y in
, then
is a linking sequence from
y to
x in
, and
Therefore, there is a bijection between the linking sequences from x to y in and the linking sequences from y to x in , where the corresponding sequences in this bijection have the same sum as above. Thus, for all .
For the triangular inequality, let
and
. So there are linking sequences
and
from
x to
y in
and from
y to
z in
, respectively, such that
and
The sequence given by
, for
and
for
, is a linking sequence from
x to
z in
, and
Since is arbitrary, it follows that . Therefore, d is a metric on . □
Remark 4. Given , taking the linking sequence with and , we obtain From (5), we obtain that the inclusion of in B is continuous in relation to the metrics defined in these spaces. Definition 4. The space , as constructed above, is called the relative completion of in the space .
Lemma 2. If is the relative completion of with respect to the space , then , and the inclusion is continuous, with respect to the metrics defined in those spaces.
Proof. Given
, consider the approximate sequences of
x in
and of
y in
, respectively, given by
and
. We have, by equality (
2) that
for all
. Putting together (
6) and (
7), we obtain
for all
. □
Relative Completion Properties
We present in this subsection the main properties of the relative completion.
Lemma 3. If is the relative completion of in the space , then A is dense in .
Proof. Let
. Then, there is a Cauchy sequence
in
so that
. For each
, we have from (
6) that
Taking the limit with , we have , since is a Cauchy sequence in . □
Proposition 3. If is a complete metric space and is the relative completion of in the space , then is complete.
Proof. Let
be a Cauchy sequence in
. For fixed
N, and for every approximation sequence
of
in
, there is
so that, for all
, one has
Given
, since
is a Cauchy sequence, there exists
such that
, and
for all
. For fixed
, there are approximation sequences
from
and
from
, respectively, so that
Since
, there is
such that
For all
, let
, where
and
satisfy (
11).
Now, if
, we have
Thus,
is a Cauchy sequence in
. Now, by the continuity of inclusion,
,
is a Cauchy sequence in
, which is complete. Then, there is
such that
. So,
. Let us show that
. We have, for all
,
If , we have and, therefore, , completing the proof. □
We also need the following technical lemma.
Lemma 4. Let be a metric space and . Let and be metrics on A withfor all , where μ and ν are positive constants. If and are the relative completions of and , respectively, in , then with continuous inclusion. We also have thatfor all , where is the metric of the completion of in , with .
Proof. Let
. Then, there is a Cauchy sequence
in
such that
. As
, we have that
is a Cauchy sequence in
. So,
. We also have
where the infimum is taken over all approximation sequences
x and
y in
. Then, it follows that
, for all
.
Now, let
be a linking sequence from
x to
y in
. We have
Taking the infimum over all linking sequences from x to y in , we have for all . □
3. Compatible Metric Space Couple
Here, we begin to introduce the interpolation of metric spaces.
Definition 5. Let and be two sets such that , and both are subsets of a set X. Also, assume that , and are metrics on the sets , , and X, respectively, such that there are positive constants and satisfyingfor all , . The pair is called a compatible metric space couple, or a pair of compatible metric spaces, and it is denoted by or . Remark 5. It is always possible to obtain a compatible pair from two metric spaces and , as we can see in the following.
Let
and
be metric spaces with
. Consider
, and over
X, consider the function
given by
We have the following results.
Proposition 4. The function is a metric over X.
Proof. The triangle inequality is the only metric property that is not obvious. To prove it, let
. We have
□
Proposition 5. Let . Then, there exists an isometry between and with the metric induced by .
Proof. Consider the function
given by
. It is clear that
f is a bijection. Let us prove that
f is an isometry. Indeed, let
. Then,
□
By Proposition 5, we can identify
with
, and analogously, if
, there exists an isometry between
and
. This allows us to write, by identification,
with
Given a metric space
M, we denote the space
by
. Let
be a compatible metric space couple and
. For
, let
be the function defined by
Definition 6. Let and be sets such that . Given , an admissible linking sequence from x to y in is a finite sequence of points that satisfies the following:
and ;
For each , we have .
Let us denote an admissible linking sequence from x to y in by .
Remark 6. Note that given any , there is always an admissible linking sequence from x to y in , because if , then and is an admissible linking sequence from x to y in , for . And when and , since , in choosing an element , the sequence , , and is an admissible linking sequence from x to y in , for .
3.1. The Functional
In this section and in the next we introduce functionals analogous to the functionals K and J defined for normed spaces. These new functionals are suitable for the environment of metric spaces as they fulfill the same function as the functionals of normed spaces, without, however, depending on the sum or the scalar product.
Definition 7. Let be a compatible metric space couple and . Given , the functional is defined bywhere the infimum is taken over all admissible linking sequences from x to y in the set . Remark 7. Using the function in the definition of the functional , we will obtain an interpolation method that is fundamentally different from the K method developed in Gustavsson’s work, ref. [10], because changing the functional K changes the interpolated space. Gustavsson’s K functional is finer in the sense that , where is the functional K defined in Gustavsson’s original text. This inequality stems from the fact that the definition of the functional admits more sequences than the definition of the functional. The main advantage of the current work’s K method over Gustavsson’s K method is that his method is not necessarily equivalent to the usual K method for normed spaces, whereas the method developed in this text for metric spaces generalizes the usual K method.
Proposition 6. If is a compatible metric space couple, then the functional is a metric on .
Proof. Given
, if
is an admissible linking sequence of
x in
y, then
For the positivity, let
. So,
and
is an admissible linking sequence from
x to
x in
. Then, we have
. From this, it follows that
for all
. Now, let
such that
. Let
be an admissible linking sequence from
x to
y in
. We have, for
,
Taking the infimum over all admissible linking sequences from
x to
y in
, we have
for all
. Since
is a metric, then
.
For the symmetry, if
is an admissible linking sequence from
x to
y in
, then
is an admissible linking sequence from
y to
x such that
Thus, there is a bijection between the admissible linking sequences from
x to
y in
and the admissible linking sequences from
y to
x in
. Furthermore, the sums of the images of each pair by the function
of sequences corresponding by such a bijection are equal. Thus,
for every admissible linking sequence
from
y to
x in
. From this, it follows that
. We also have
for every admissible linking sequence
from
x to
y in
. Thus,
. And consequently,
.
For the triangular inequality, let
and
. So there are
and
admissible linking sequences from
x to
z and from
z to
y, respectively, in
such that
and
Define
, for
, and
, for
. Note that
is an admissible linking sequence from
x to
y in
and that
Since
is arbitrary, we have
which completes the proof. □
Lemma 5. If is a compatible metric spaces couple, thenfor all , with . Proof. Let
, with
. So, for the admissible linking sequence
and
from
x to
y in
, we have
□
Henceforth, unless otherwise noted and where there is no possibility of confusion, and will be considered a pair of compatible metric spaces with respect to the space .
Lemma 6. If , thenfor all . Proof. It suffices to note that given an admissible linking sequence
from
x to
y in
, we have
This result follows from taking the infimum over all admissible linking sequences from x to y in . □
Lemma 7. If and , then Proof. If
, we have
. Then,
from Lemma 6.
If
,
, and given any admissible linking sequence
from
x to
y in
,
since
for all
.
The result follows from taking the infimum over all admissible linking sequences from x to y in . □
Using Proposition 23 and Lemmas 24 to 26, we obtain the following result.
Theorem 1. If , then the function is a metric on .
Proof. Let
. By Lemma 7, with
and
, we have
since
. From this follows the positivity of
, since
is a metric in
.
Also from Lemma 7, with
and
, we have
for all
and
.
For symmetry, let
be an admissible linking sequence from
x to
y in
. Consider the admissible linking sequence from
y to
x in
given by
. We have
Taking the infimum and noting that this relationship between admissible linking sequences is one-to-one, we have the equality .
For the triangular inequality, let
and
. Then, there are admissible linking sequences
from
x to
z in
and
from
z to
y in
such that
and
Consider the sequence given by
if
and
if
. Note that
is an admissible linking sequence from
x to
y in
. So, we can write
Since
is arbitrary, we obtain
□
3.2. The Functional
If
and
, we define the functional as follows:
Proposition 7. is a metric on .
Proof. We have
for all
and also
for any
. Now, let
such that
. Then,
, that is,
The symmetry is immediate and follows from the symmetry of
and
. For the triangular inequality, given
,
and
Thus, . □
Lemma 8. If and , then Proof. Let
. Then,
. Since
is not decreasing in
t, we have
Now, if
, one has
. Then,
□
Lemma 9. If and , then Proof. The sequence
and
links
x to
y in
and is admissible. Soon,
and
□
4. Interpolation Spaces
In this section we make a connection between relative completion and the and functionals defined in the previous section. Such a connection will be made through the functionals and defined below, which are the same as the functionals of the normed case.
Definition 8. Given , , and a real measurable function ϕ, let be the functional We will also need the following result, which we adapted from [
1].
Lemma 10. If is a measurable function and , then Proof. Let
. We have that, with
□
Definition 9. Given , , and a sequence , let be the functional The set of sequences such that is a normed vector space that we denote by , with norm .
Our objective is to build metric interpolation spaces using the relative completion of the intersection of convenient metrics adapted to the spaces in question.
Theorem 2. If and , thenis a metric on , where is given in Definition 8. Proof. Let
. We have
for all
and
for all
. Furthermore, by Lemma 9, with
and
, we have
for all
, and
. Applying the functional
:
where
Thus, if , then .
Now, let
be such that
. Putting together inequalities (
14) and (
16), and applying the functional
, we obtain
Since is a metric, then .
The symmetry follows from the symmetry of in the second and third inputs.
For the triangular inequality, given
, for all
, we have
In applying the functional
in the above inequality,
that is,
where the inequality in
is due to Minkowski’s inequality applied to the functions
and
. So,
as we want. Therefore,
is a metric on
.
If
, we have
and
. Let
such that
. Again, from inequalities (
14) and (
16),
In taking the supremum over all
,
Since is a metric, . Symmetry is immediate.
Let
. We have
for all
. In taking the supreme,
□
Proposition 8 (Discretization of ). If , , and , then is a metric equivalent to .
Proof. Let
. For all
, we have
Then, for every
, there is
such that
. Thus,
Taking into account that
and that
is non-decreasing, we have
Integrating each member with respect to
in the interval
, we have
Through summing in
,
If
, since for all
we have
and for each
, there exists
such that
, we have
, and since
is not decreasing, we obtain
for
. For fixed
, for all
such that
, one has
Since
is arbitrary, it holds for all
. Soon,
By similar reasoning, we have
□
Definition 10. Given , let be a linking sequence from x to y in and be an n-tuple of integers, both fixed. We define A sequence as above is called a derived sequence from x to y, associated with the linking sequence in and the sequence .
Remark 8. The definition of the sequence c given in [10], used to define the J method, is not the same one of Definition 10. The zero elements in c, such that there is no term in the n-tuple equal to the index i, was introduced in the current work. Therefore, we cannot compare the J method developed by Gustavsson and the one developed in this text. Example 1. Let be a linking sequence from x to y and be a sequence of integers with four terms. For , we have Since no term of the sequence is equal to zero, it follows that . For , Since occurs in the zeroth and second positions of the sequence , it follows that The sequence for this case is , , , and all other terms are zero.
Proposition 9. If , , , and , then for every derived sequence from x to y in , we havewhere is a constant that depends only on θ, q, and t. Proof. Let
,
be a linking sequence from
x to
y in
and
be an
n-tuple of integers. So, for every
,
By Hölder’s inequality,
with
and
where
is the smallest integer such that
. □
Theorem 3. If and , thenis a metric over , where the infimum is taken over all derived sequences obtained by all linking sequences from x to y and all sequences , as in the Definition 10. Proof. For each
, we have that
is a linking sequence from
x to
x in
. For the set
, we have
This means that only the term cannot be null. However, by choosing this linking sequence, we have . Therefore, .
It is also immediate that , because for the sequence and and , we have and for all .
From Proposition 9, taking the infimum over all sequences derived from
x to
y, we obtain
where
is a constant that only depends on
,
q, and
t. This inequality guarantees the positivity of
in
.
For the symmetry of
, let
be a linking sequence from
x to
y in
and
be an
n-tuple of integers. Consider the sequence
given by
and
be an
n-tuple of integers given by
. If
is the derived sequence from
x to
y associated with the linking sequence
and the
n-tuple
and
is the derived sequence from
y to
x associated with the linking sequence
and
n-tuple
, we have
Thus, if
is any derived sequence from
x to
y, we have
Conversely, if
is any derived sequence from
y to any
x, we have
Thus, it follows that .
For the triangular inequality, let
and
. So, there are linking sequences
and
from
x to
z and from
z to
y, respectively, both in
, and finite integer sequences
and
, such that if
is the derived sequence from
x to
z associated with the linking sequence
and the
-tuple
and
is the derived sequence from
z to
y associated with the linking sequence
and the
-tuple
, then we have
and
We define the linking sequence
from
x to
y in
given by
if
, and
if
, as well as an
-tuple
given by
if
and
, if
. If
is the derived sequence from
x to
y associated with the linking sequence
in
and with
-tuple
, we have
where
is due to the Minkowski inequality for the sequence spaces
. Since
is arbitrary,
□
Remark 9. Inequality (22) tells us that is continuously contained in . This follows from inequalities (14) and (16).
Interpolation Spaces
Here, inspired by the normed case and [
10], we introduce two interpolated metric spaces.
Definition 11 (The -space). Given a metric couple , and , we define the -space as the relative completion of in the space . We will denote this space by and the metric of this space by .
Definition 12 (The -space). Given a metric couple , and , we define the -space as the relative completion of in the space . We will denote this space by and the metric of this space by .
The interpolation of metric spaces generates spaces with basic properties that are analogous to those of the normed case.
Definition 13. Let be a pair of compatible metric spaces and E be a subset of X. We say that is an intermediate metric space for the pair ifand the inclusions are continuous, considering endowed with the metric . Lemma 11. If and is the J-space endowed with the metric , thenfor all . Proof. Given
, let
,
, and
be given. So, by definition, if
,
From inequality (
8),
for all
. □
Proposition 10. If or , there are such thatfor all , andfor all . Proof. These statements follow directly from inequality (
5) and from Lemmas 9 and 11 and remain valid if
. □
Remark 10. From Lemma 3, we have that is dense in and in . And by Proposition 3, we have that and are complete whenever is complete.
As a consequence of Proposition 10, we have that and are intermediate spaces.
Proposition 11. If or , then it holds thatfor all . Proof. If
, since
, for all
, then by applying
, in relation to
s, we have
In
we have
. So,
and the result follows taking
.
If
, given
, there exists
such that
. Since
is non-decreasing on its first entry, it follows that
From
, we have
Putting together these inequalities,
From Lemma 11, the result follows, with □
Corollary 1. Proposition 11 is equivalent tofor all , where or . Proof. If we assume (
25), it is enough consider
. For the contrary equivalence, for all
, we have that
and
. Thus,
□
Now, one of our main results follows.
Theorem 4. We have thatwithfor all . Proof. It is enough to prove that
for some constant
. For this, let
,
be a linking sequence from
x to
y in
and
be an
n-tuple of integers. As it was shown in Lemma 9, we have
for all
. In particular, if
,
If
, we have
Now, we apply the functional
with respect to the variable
j:
From Proposition 8, we may write
Now, we apply Lemma 4 for , , , and with . □
This inclusion is valid for the interpolation of normed spaces. However, in the normed case, we have the fundamental lemma of interpolation, which guarantees the opposite inclusion. For the metric case, we do not know whether there is an analogue to the fundamental lemma.
Proposition 12. Given a pair of compatible metric spaces , and , if the inclusion of in is continuous, thenfor all , where or . Proof. Let
. We know that
for all
. So,
Applying
in the variable
s and using Lemma 10, we have
or
for all
. Now, let
. Then, there are Cauchy sequences
and
in
such that
. So,
for all
. This inequality is valid for any approximating sequences of
x and
y in
. So,
where the infimum is taken over all approximating sequences of
x and
y in
. From the continuous inclusion of the hypothesis, it follows that
. If
is a linking sequence from
x to
y in
, we have
Taking the infimum over all linking sequences from
x to
y in
, we have
Now, if
, the proof follows from
and the previous theorem, since
for all
. □
Definition 14. We say that satisfies the condition if for all , there is a linking sequence , from x to y in and a n-tuple of integers , such that for some constant γ, the following holds:with being the derived sequence from x to y in associated with the linking sequence and the n-tuple of integers above. It is immediate that for pairs of metric spaces satisfying the condition
we have
with equivalent metrics.
Spaces where some kind of theorem as the fundamental lemma of interpolation for normed spaces holds necessarily satisfy the condition .
Theorem 5. Let be a pair of compatible metric spaces. Then, we have the following:
- (a)
If denotes the interpolated space of , then with equal metrics.
- (b)
If , then andfor all . - (c)
If (continuous Lipschitz inclusion) and with , then for all and .
Proof. Let
and
be an admissible linking sequence from
x to
y in
. We have that
for all
, where the labels
and
are used to differentiate the order in which the spaces compatible metrics is being considered. Then,
Taking the infimum over all admissible linking sequences from
x to
y, we have
In applying the functional
,
Thus, we obtain the same relative completion and both have the same metric, i.e.,
Let
. We will use the equivalent discrete version of
. Indeed, if
, we have that
. For fixed
, consider the sequence with its general term given by
We have
for all
. Since
and
are equivalent for all
, all
, and also
, for all
, the result follows from putting together the inequalities. Furthermore, by Lemma 4, we have
for all
.
From the inclusion in the hypothesis, there is
such that
for all
. Let
be an admissible linking sequence from
x to
y in
. For all
, we have
where
S is the set of indices
s for which
, and
R is the set of indices for which
. This implies that
for all
. Since the opposite inequality is true, it follows that
for all
. Now, we have that
Since
for all
, it follows from the previous equality that
The first part of the second member of the last inequality satisfies
for
. Thus,
where
. This inequality shows that
. □
5. Interpolation of Lipschitz Operators
In this section, we study Lipschitz operators acting on the interpolation spaces of metric spaces. In general, we will show that the Lipschitzian property of an operator is invariant under metric interpolation.
This result is important because through it, we will show that under some conditions, the compactness of these operators can also be preserved. Many problems in analysis rely on properties of compact operators, as in the particular case of compact linear operators, which play an important role in approximation theory.
In this section, let us consider compatible metric space couples and .
Definition 15. Let and be metric spaces, and let . Then, T is a Lipschitiz operator if there is a constant such thatfor all . Furthermore if T is a Lipschitz operator,is called the Lipschitz constant of T. To avoid confusion, when we are dealing with two pairs of compatible metric spaces and , we will use the symbols to refer to the pair and to refer to the pair in each functional or notation that makes this distinction necessary.
Theorem 6. Let and be two pairs of compatible metric spaces, and and be metrics spaces, such that Y is a complete metric space. For fixed and , is an operator that satisfies the following:
- (a)
and imply that .
- (b)
- (c)
, where and , .
Proof. From properties
and
, we claim that
Indeed, let
be an admissible linking sequence from
x to
z in
. For every
, we have
and always that
. In the same way,
and and always that
. Finally, if
,
Therefore, for every admissible linking sequence
, we have
In the above inequality, the indices in the operator T indicating its restrictions were removed, since the operator T is defined in the entire space .
Taking the infimum over all admissible linking sequences from
x to
z in
, we have
Applying the operator
on the last inequality and using Lemma 10, we have
Now, let
. We must prove that
. In fact, let
be an approximating sequence of
x. Since
is a Cauchy sequence in
, it follows from inequality (
30) that
is a Cauchy sequence in
. From the inclusion of
in
, it follows that
is a Cauchy sequence in
. As this last space is complete, there exists
such that
From property (a),
. Thus,
. Now, let
. We have, for any approximating sequences
of
x and
of
y, that
where
is the distance associated with the metric
. Taking the infimum over all approximating sequences
x and
y in
, we have
for all
. Now, consider a linking sequence
from
x to
y. We have
Taking the infimum over all linking sequences from
x to
y in
, we have
□
Remark 11. In Theorem 6, we do not require continuity of T from to , but we require the operator T to satisfy (a), and we also require that be complete. In the next theorem, we obtain the same result as the previous theorem, but we exchange the completeness of and the property (a) for the continuity of T of in .
Theorem 7. If the operator T is continuous from to and satisfies conditions (b) and (c) of Theorem 6, thenand Proof. We just need to prove that because the conclusion of the statement is proved in the same way as for the previous theorem.
In fact, let
. Then, there exists a Cauchy sequence
in
such that
. Let us show that
. For each
, define
. We have, for all
,
By condition (b), we have that
,
, and it follows that
, for all
. By inequality (
30), we have that
is a Cauchy sequence in
. Furthermore, from the continuity of
, it follows that
Therefore, is an approximate sequence of , whenever is an approximate sequence of x. Consequently, . □
Corollary 2. Under the conditions of Theorem 7, consider , with , , with equal metrics and complete. If , then T has a single fixed point at .
Proof. Since is complete, it follows that is complete by Proposition 3. Then, we can apply the Banach contraction principle. □
Next, we have a technical lemma that we will need for the following results.
Lemma 12. If , , is a linking sequence from x to y in , and is an n-tuple of integers, then Proof. Since
, for all
and
we have
or equivalently,
Then, for
and
,
for any
. Thus, if
is a linking sequence from
x to
y in
and
is an
n-tuple of integers,
or
□
Theorem 8. If is an operator with properties (a), (b), and (c), thenand Proof. Let
,
be a linking sequence from
x to
y in
and
be a sequence of integers. So,
In applying
to the derived sequences obtained above,
From Lemma 12, with
, we have
for all
. Now, let
. We want to prove that
.
Indeed, as
, there is an approximating sequence
of
x in
. Since
for all
, it follows that
is a Cauchy sequence in
. Since
is a Cauchy sequence in
, which is continuously embedded in
, which is complete, there is
such that
. From (a), it follows that
, yielding
.
The rest of the proof is analogous to the one of Theorem 6. □
6. Interpolation of Compact Lipschitz Operators in Metric Spaces
The study of the interpolation of compact operators is one of the most important topics within interpolation theory. In the classical article by Lions-Peetre [
5], we have the two most famous results for the case of Banach spaces. These were followed by several generalizations over the years, such as the theorems of Persson [
12]; Hayakawa [
13]; Cobos and Fernandez [
14]; Cobos, Edmunds, and Potter [
15]; and Cwikel [
16,
17]. All these results are for linear operators, except for one of Cwikel’s papers, which deals with Lipschitz operators in normed spaces. Here, we present results for Lipschtiz operators, along the lines of the Lions-Peetre theorems.
Definition 16. Let and be metric spaces and be an operator. Then, T is a compact operator if T is continuous and if for every bounded set , we have that is a compact set.
The above definition is equivalent to saying that T is compact when the range with the T of a bounded sequence in has a convergent subsequence in .
Lemma 13. If and , given and , then and .
Proof. Taking the infimum over all admissible linking sequences from
x to
y in
, we have
for all
. Since
, one has
On the other hand,
. Thus,
In applying the functional
,
Now, since , we have . □
Proposition 13. Let be a compatible metric space couple, with and , and let be a metric space. If T is an operator that satisfies the following three conditions, then is a compact Lipschitzian operator:
- (i)
;
- (ii)
is a compact Lipschitizan operator;
- (iii)
is Lipschitzian.
Proof. From Lemma 13, we have
and
. By (
29) of Theorem 6, we have
where
is the Lipschitz constant of
T in each space
,
. So,
is well defined.
Let be a bounded sequence in . As is dense in , without loss of generality, we can consider that for all . From the compactness of , there is a subsequence that converges, according to the metric , to a point .
We must prove that
and that
when
. For all
, we have, from Proposition 11 and from Corollary 1, that
where
is a positive constant arising from the combination of the constant
C of Corollary 1 with the constant of Lemma 13. Since
is bounded in
and
is a Cauchy sequence in
, it follows that
is a Cauchy sequence in
. As
, for all
, we have
. So,
. Now, for each
, we have
where
is a constant that does not depend on
k. Taking the limit with
in the above inequality, we have the target result, since
is a Cauchy sequence in
. Therefore,
T is a compact operator. □
7. Interpolation of Metric Spaces vs. Interpolation of Normed Spaces
In this section, we draw a parallel between the interpolation of metric spaces and the usual interpolation of normed spaces. We show that the interpolation of metric spaces developed in this work is still a valid interpolation method for normed spaces, with the advantage of not being dependent on the algebraic structure of the space, whereas Peetre’s methods K and J are strongly linked to decomposition into algebraic components for method K and convergent series for method J.
Lemma 14. Let and be normed vector spaces such that X is a vector subspace of , and there is a constant with , for all . Then, the relative completion of in , denoted by is a vector subspace of that contains the subspace X, for which its norm satisfiesand Proof. Let and ( or ). Since is a normed vector space, it follows that is an approximation sequence of whenever and are sequences that approximate x and y in . Thus, we obtain that is a vector subspace of .
Now, let us show that the metric d defined for the relative completion of in is a norm for this completion, which we will denote by . To do so, it is only necessary to show that this metric is invariant by translation and satisfies the property . Let . We prove the translation invariance with two statements:
Claim 1:The distance function associated with is translation invariant.
Let us denote this distance by
. We have
where the infimum is taken over all approximating sequences of
and
in
. Given the approximating sequences
,
, and
of
x,
y, and
z, respectively, in
, one has
On the other hand, given the approximation sequences
,
, and
of
,
, and
z, respectively, one has
Taking the infimum over all approximating sequences of
x and
y in (
33), we have
. Note that
is a Cauchy sequence in
and
and the same reasoning can be used for
. Therefore,
is an approximating sequence of
x in
, and likewise,
is an approximating sequence of
y in
. Taking the infimum over all approximating sequences of
and
in (
34), we have
. So,
for all
, and we have the invariance by translation.
Claim 2:For all and , .
Indeed, if
is an approximating sequence
x in
, then
is an approximating sequence of
in
, and we also have the reciprocal for
. The case of
is trivial. Then, let
. We have
where the infimum is taken over all approximating sequences of
x and 0 in the space
.
Finally, we prove that the metric of the relative completion is a norm. For
, given any linking sequence
, we have that
is a linking sequence from
to
in
, and
Now, if
is a linking sequence from
to
, we have that
, for
, is a linking sequence from
x to
y in
, and
Thus, we obtain the translation invariance of , taking the infimum over the linking sequences consecutively. Using similar reasoning, we have that . □
Definition 17. Let and be normed vector spaces. We say that and are a pair of compatible normed spaces if there exists a topological vector space U with a Hausdorff topology, such that and are vector subspaces of U, and each inclusion is continuous. We use to denote a pair of compatible normed spaces.
Proposition 14. If is a pair of compatible normed spaces and is the K-functional defined for metric spaces, then is a norm in , considering and for .
Proof. We just need to show that , for all and , and also that , for all (
Let
be any admissible linking sequence from
x to
y in
. Consider the admissible sequence
, given by
, for
. We have
Hence, we can obtain that by just taking the infimum over all admissible linking sequences from x to y in , and then over all admissible linking sequences from to in , obtaining the inverse inequality.
Now, let
. If
is any admissible linking sequence from
x to
y in
, we have that
is an admissible linking sequence from
to
in
. Then,
Thus, . □
From Proposition 14, in the next theorem, we obtain another interpolation method for normed spaces.
Theorem 9. If is a pair of compatible normed spaces and is the K-functional defined for metric spaces, then for fixed and , the space , defined for the metric spaces, is an exact interpolation space for the pair , considering , where the metric in X is given by .
Proof. Let
be the relative completion of
with respect to the norm
in the space
with norm
. By Proposition 14 and by Lemma 14, the result follows, completing the normed space
in the normed space
. Finally, it is enough to observe that continuous linear operators in normed spaces are Lipschitzian operators. □
Lemma 15. For every and every , we havewhere , and is a functional K defined for the usual normed space interpolation. Proof. Let
and
. Consider the admissible linking sequence from
x to 0 in
:
and in
, consider the norm
. We have
Therefore, taking the infimum over all the decompositions
in the space
, we obtain
for all
and for all
. Now, let
be an admissible linking sequence from
x to 0 in
. We have
For each pair
that belongs to the intersection, one has
and
If
, with
, we have
Taking the infimum over all admissible linking sequences from x to 0 in , we obtain . □
Proposition 15. Given a pair of compatible normed spaces , and , let be equipped with the usual norm of the K-normed interpolated space: If in , we consider the norm , and M is the relative completion of Z in , then , where is the usual normed interpolated space.
Proof. Let
. By the definition of
M, there is a sequence
of points in
such that
Since
and
is equivalent to
, for all
, it follows that
for all
, or
, for all
. For each
and each
let
. Since
is a Cauchy sequence in
, there is
so that for all
,
since, in a metric space, every Cauchy sequence is bounded. Therefore, each
is measurable, and
From Fatou’s Lemma,
that is,
Thus, .
Consider now
. As
, then for
, and by the density of
in
, we conclude that there is a sequence
such that
Then, by
we have
because the interpolated space is continuously included in
. Since every convergent sequence is a Cauchy sequence,
is a Cauchy sequence on
X such that
This shows that . So, we obtain . □
Lemma 16. Given a pair of compatible normed spaces , , and , consider equipped with the usual norm Consider in the norm . If is the norm of the relative completion of in , then for all , Proof. Let
. By Proposition 15, there is a sequence
of points in
such that
Since
and
is equivalent to
, for all
, it follows that
, or
, for all
. For each
and each
, let
. Since
is a Cauchy sequence in
, it follows that there is
such that for all
,
Therefore, each
is measurable, and
From Fatou’s Lemma,
that is,
Taking the infimum over all approximating sequences
x in
, we have
where
is the distance associated with the metric
. As this inequality is valid for all
, it follows that
for all
. Since
is dense in the completion of
in
, for all
x, there is a sequence
of points in
such that
Hence, from (
36),
is a sequence convergent to
x in the norm
. Since
is continuously embedded in the relative completion
, for all
, we have
Taking
in the above inequality, we have
for any
. So, we obtain
as we wanted. □
Corollary 3. Let be a pair of compatible normed spaces, and , and let be the interpolated space obtained with the functional , with norm . If is the usual interpolated space of normed spaces, with norm , then, considering with metric , we havewith continuous inclusion and norms satisfying Proof. The proof follows from Lemmas 4, 15, and 16. □
The J-Metric Method in the Context of Normed Spaces
Another question that arises is whether the J-space of the normed case coincides with the J-space of the metric case when is a pair of compatible normed spaces. In what follows, denotes the usual J functional.
Lemma 17. Let be a compatible pair of normed spaces. So, is a norm over .
Proof. Since is a metric over , we only need to show that it is translation invariant, and that given
Given
, let
be a linking sequence from
x to
y in
and let
be a sequence of integers. Then,
Therefore, the sequence derived from
x to
y is equal to the sequence derived from
to
. This shows that
is translation invariant on
. Now, if
Consequently, . □
Proposition 16. Let be a compatible pair of normed spaces. Then,andfor all . Proof. We have that
follows from
Now, let be such that the following hold:
- (i)
for all ,
- (ii)
,
- (iii)
.
Consider the following linking sequence from 0 to
a,
and the triple of integers given by
. For each
, we have
The result follows by taking the infimum over all discrete canonical representations of a. □
8. Examples of Metric Interpolation
This section provides examples of the method of the interpolation of metric spaces that cannot be applied with the interpolation of usual normed spaces. We also present normed vector spaces, but with scalar fields different from and , which appear in the
literature and which lack a specific treatment in interpolation theory
8.1. The Spaces and
Given a prime number
p, we define the set
This set appears frequently in algebra, especially in field extension theory. It is a field obtained by isomorphism with the quotient of the ring of polynomials with rational coefficients , by the maximal ideal generated by the irreducible polynomial . This set is a normed vector space, of dimension 2, over the field of rational numbers.
We will show that although this set cannot be considered under the interpolation of normed spaces, because it is not a real vector space, we can consider it in the theory of interpolation in metric spaces.
Let
be distinct prime numbers. Consider
,
, and
provided with the induced metric of the absolute value of
. We have that
and, for
and
,
Note that
and
. Then,
Consequently,
where
.
This gives that the interpolated space is the whole line, because if , there is a
Cauchy sequence in such that . Consequently, is a Cauchy
sequence in and . So, . Since the reverse inclusion
is immediate from the definition of Cauchy completion, we have
Let us now determine what is the interpolated space
. From the inclusion of
-space in
-space, it follows that
for all
. We know that
and
for all
and for all
. From these inequalities, we have, for
,
If for the values of and q, we have , then for all . Then, with equivalent metrics.
8.2. Two Examples of Metric Interpolation in Sequence Spaces
Here, we will consider a Fréchet sequence space. For more details on Fréchet spaces, see [
18]. Let
. Over
, consider the pointwise operations of sum and scalar multiplication. Endowed with these operations,
is a linear space over
.
Definition 18 (The pointwise convergence in
).
Let be a sequence in . We say that converges to in , if for every , the numeric sequence , formed by the k-th coordinates of the sequence points , converges to the k-th coordinate of x, that is,for all . Proposition 17. Consider in the pointwise convergence. Then, does not admit a norm.
Proof. Suppose that there is a norm
on
that represents its pointwise convergence; that is, if
converges to
x, then
if
. For every
, let
be the sequence with 1 in the
i-th coordinate and 0 in all the others. Now, define
. Then, we have that
converges to the null sequence
since
Therefore, no norm can define pointwise convergence in . □
Proposition 18. The space endowed with the functionwhere , is a complete metric space, and then, is a Fréchet space. Furthermore, this metric is compatible with its pointwise convergence. Proof. We only prove the triangular inequality and the completeness of the space, since the other properties follow from the definition. For the triangular inequality, consider the function
Then, we have
and the result comes straight from this.
For the completeness, let
be a Cauchy sequence in
. Let
stand for the
j-th coordinate of the
k-th term of the sequence
. We have that the function
is increasing for
. Since
is a Cauchy sequence, given
, there is
such that for
and
, we have
. Thus,
That is,
implies that
for every
and
. Thus, we have that
is a Cauchy sequence of real numbers for every
and all
. Since
is complete,
for every
, there is
such that
as
. If we set
, we have
as
. This concludes the proof. □
Proposition 19. Then, , and this inclusion is Lipschitz-continuous.
Proof. For a sequence
, we set
This is the usual norm for this space, and
is a Banach space. Let
and
be two sequences in
. Now, for a fixed
, we have
Taking the limit as
, we have
□
8.2.1. First Example
Let
be the space of the sequences with only finitely many non-null terms. It is clear that
. Now, set
and
and
with
. For
and
, we have
with Lipschitz-continuous inclusions.
Proposition 20. is not a dense subspace of .
Proof. It is sufficient to prove that
is closed in
, since
. Let
be a sequence of points in
such that
for some
. If
stands for the
j-th coordinate of the
k-th term of
and
, from
, we can write
Then, since
it follows that
. This proves that
is a closed set in the metric topology. □
Corollary 4. .
Proof. It is easy to see that , where stands for the metric closure of . The sequence . Then, we have , as desired. □
Proposition 21. .
Proof. Consider the inequality
where
are suitable constants depending only on
and
q.
Since
is dense in
(for
) and
in
, where
is a suitable constant, it follows that if
, then there is a sequence
in
such that
. Due to inequality (
40), we have that
for all
. Then,
. Since
, we have the result. □
As the final result, we have with strict inclusions.
Remark 12. Actually, we proved more above. We also have that Remark 13. If we want to generate spaces that are strictly intermediary, we have to seek the case where is neither dense nor closed in . Observe that it does not depend directly on the metric .
8.2.2. Second Example: A Trivial Interpolation
Now, we interpolate itself to search for what kind of new elements we can gain.
Proposition 22. is closed in .
Proof. Let
be a convergent sequence of points in
such that
as
, for some
. Then, if
stands for the
j-th coordinate of the
k-th term of
and
, from
, we have
Since is convergent, it follows that for all . Then, for all . The result is straightforward based on these statements. □
Since is closed in with respect to the metric , if we interpolate in , we obtain , which follows from .
8.3. Non-Trivial Interpolation: Conditions
Analyzing the examples, we obtain some conditions to guarantee that the interpolation space does not get stuck in and does not increase to the whole space X. We can call these cases trivial since we do not obtain a new space.
Proposition 23. If is closed in , then the interpolation space is equal to .
Proof. We have the inclusions for and . This statement arises from observing that if is a Cauchy sequence in , then is a Cauchy sequence in , and it gives that the interpolation space is contained in the closure of in . □
Proposition 24. If is not dense in , then .
Proof. If is not dense, then . Since , we have the result. □
Corollary 5. If is not dense and not closed in , then for all and , we haveand these inclusions are strict. Remark 14. It is worth mentioning that due to Corollary 3, the same conditions are valid for normed spaces in the cases where and .