Next Article in Journal
Brain Connectivity Dynamics and Mittag–Leffler Synchronization in Asymmetric Complex Networks for a Class of Coupled Nonlinear Fractional-Order Memristive Neural Network System with Coupling Boundary Conditions
Next Article in Special Issue
Some Statistical and Direct Approximation Properties for a New Form of the Generalization of q-Bernstein Operators with the Parameter λ
Previous Article in Journal
Biequivalent Planar Graphs
Previous Article in Special Issue
An Introduction to Extended Gevrey Regularity
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Theory for Interpolation of Metric Spaces

by
Robledo Mak’s Miranda Sette
1,†,
Dicesar Lass Fernandez
2,† and
Eduardo Brandani da Silva
3,*,†
1
FACET—UFGD (Faculty of Exact Sciences and Technology, Federal University of Grande Dourados), Dourados 79825-070, MS, Brazil
2
IMECC—UNICAMP (Department of Mathematics, Instituto de Matemática, Estatística e Computação Científica da Universidade Estadual de Campinas), Campinas 13083-970, SP, Brazil
3
DMA—UEM (Department of Mathematics, Universidade Estadual de Maringá), Maringá 87020-900, PR, Brazil
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Axioms 2024, 13(7), 439; https://doi.org/10.3390/axioms13070439
Submission received: 27 May 2024 / Revised: 22 June 2024 / Accepted: 24 June 2024 / Published: 28 June 2024
(This article belongs to the Special Issue Research on Functional Analysis and Its Applications)

Abstract

:
In this work, we develop an interpolation theory for metric spaces inspired by the real method of interpolation. These interpolation spaces preserve Lipschitz operators under certain conditions. We also show that this method, valid in metrics spaces, still holds in normed spaces without any algebraic structure required. Furthermore, this interpolation method for metric spaces when applied to normed spaces is equivalent to the K-method, which has been widely studied in the literature. As an application, we interpolate Fréchet sequence spaces.

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 ( X 0 , · X 0 ) , ( X 1 , · X 1 ) , ( Y 0 , · Y 0 ) , and ( Y 1 , · Y 1 ) , with X 0 X 1 and Y 0 Y 1 , there are two families of subspaces:
{ ( X α , · α ) } α L
and
{ ( Y α , · α ) } α L ,
where L is a set of indices such that the following are true:
  • X 0 X 1 X α X 0 + X 1 and Y 0 Y 1 Y α Y 0 + Y 1 , with continuous inclusions for all α L ;
  • If T : X 0 + X 1 Y 0 + Y 1 is a linear and continuous operator, where T | X 0 : X 0 Y 0 and T | X 1 : X 1 Y 1 are also linear and continuous operators, then T | X α : X α Y α is linear and continuous for all α L 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 K M and J M , 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 θ ( 0 , 1 ) and q [ 1 , ) , 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 R nor C . 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 M , a metric on M is a function
d : M × M R
( x , y ) d ( x , y )
such that the following hold:
(i) 
d ( x , y ) = 0 x = y ;
(ii) 
I f x y , t h e n   d ( x , y ) > 0 ;
(iii) 
d ( x , y ) = d ( y , x ) f o r a l l   x , y M ;
(iv) 
d ( x , y ) d ( x , z ) + d ( z , y ) f o r a l l   x , y , z M .
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 ( M , d ) .
When there is no possibility of confusion regarding the metric defined on M, we will refer to the metric space ( M , d ) only by M.
Remark 1.
If a function d satisfies the conditions ( i ) and ( i i ) , we say that d is a distance function.
We recall that a Cauchy sequence is a sequence ( x n ) n N in a metric space ( M , d ) such that for every ε > 0 , there exists an integer N such that d ( x n , x m ) < ε for all n , m N .
Next, we introduce one of our main definitions, which will be used to extend a metric space.
Let ( B , d B ) and ( A , d A ) be metric spaces such that A B , and there is a constant C > 0 so that
d B ( x , y ) C d A ( x , y ) , for   all   x , y A .
Given x B , if there is a Cauchy sequence ( x n ) in ( A , d A ) such that
d B ( x n , x ) 0 ,
we say that ( x n ) is an approximation sequence of x in ( A , d A ) .
Let A B be the set of all points x B such that there is some approximation sequence of x in ( A , d A ) . We have that A A B , because given x A , the sequence ( x , x , x , ) is an approximation sequence of x in ( A , d A ) . On A B × A B , we define the following function:
d A ¯ ( x , y ) : = inf lim n d A ( x n , y n ) ,
where the infimum is taken over all approximation sequences x and y in ( A , d A ) .
We have the following classical result.
Proposition 1.
If ( x n ) and ( y n ) are Cauchy sequences in ( A , d A ) , then the limit lim n d A ( x n , y n ) exists.
Proposition 2.
We have that d A ¯ is a distance function on A B .
Proof. 
For the positivity, we have that d A ¯ ( x , y ) 0 for all x , y A B and d A ¯ ( x , x ) = 0 . Furthermore, from Proposition 1, we have d A ¯ ( x , y ) < . Now, let x , y A B such that d A ¯ ( x , y ) = 0 . From (1),
d B ( x , y ) = inf lim n d B ( x n , y n ) C inf lim n d A ( x n , y n ) = C d A ¯ ( x , y ) ,
where the infimum is taken over all approximation sequences x and y in ( A , d A ) . Then,
d B ( x , y ) C d A ¯ ( x , y ) ,
for all x , y A B . Thus, it follows that d B ( x , y ) = 0 , implying that x = y .
The symmetry follows from the symmetry of d A . Therefore, the function d A ¯ is a distance function and will be called in this case the distance function associated to the metric d A .  □
Definition 3.
Given a non-empty set A and x , y A , we define a linking sequence from x to y in A to any ( n + 1 ) -tuple ( x 0 , x 1 , x 2 , , x n ) of points in A such that x 0 = x and x n = y . Let us denote a sequence of the type ( x , x 1 , x 2 , , x n 1 , y ) by ( x n x , y ) , which links x to y in A, and the set of all linking sequences from x to y in A by [ x , y ] A .
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 ( x , x , x , , x ) they will be linking sequences from x to x in A. We also have that ( x , x 1 , x 2 , , x n 1 , x ) is a linking sequence from x to x in the set A.
We now define the function d in A B × A B , given by
d ( x , y ) : = inf ( x n x , y ) k = 0 n 1 d A ¯ ( x k , x k + 1 ) ,
where the infimum is taken over all sequences ( x n x , y ) [ x , y ] A B .
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 A B .
Proof. 
For the positivity, we have d ( x , y ) 0 for all x , y A B . We also have d ( x , x ) = 0 , since, if we take the linking sequence from x to x in A B given by x 0 = x and x 1 = x , we have d ( x 0 , x 1 ) d A ¯ ( x 0 , x 1 ) = d A ¯ ( x , x ) = 0 . Furthermore, with any x , y A B , we have d ( x , y ) d A ¯ ( x , y ) < just by taking the linking sequence of x to y in A B given by x 0 = x and x 1 = y .
Now, let x , y A B be such that d ( x , y ) = 0 and consider any linking sequence from x to y in A B . We have from inequality (3) that
d B ( x k , x k + 1 ) C d A ¯ ( x k , x k + 1 ) ,
for all k = 0 , 1 , , n 1 . Through summing over k,
d B ( x , y ) k = 0 n 1 d B ( x k , x k + 1 ) C k = 0 n 1 d A ¯ ( x k , x k + 1 ) .
In taking the infimum in the definition of d,
d B ( x , y ) C d ( x , y ) ,
for all x , y A B . Then, it follows that x = y .
For the symmetry, note that given x , y A B , if x 0 = x , x 1 , x 2 , , x n = y is a linking sequence from x to y in A B , then y 0 = x n = y , y 1 = x n 1 , y 2 = x n 2 , , y n = x 0 = x is a linking sequence from y to x in A B , and
k = 0 n 1 d A ¯ ( x k , x k + 1 ) = j = 0 n 1 d A ¯ ( y j , y j + 1 ) .
Therefore, there is a bijection between the linking sequences from x to y in A B and the linking sequences from y to x in A B , where the corresponding sequences in this bijection have the same sum as above. Thus, d ( x , y ) = d ( y , x ) for all x , y A B .
For the triangular inequality, let x , y , z A B and ε > 0 . So there are linking sequences ( x n ε x , y ) and ( y m ε y , z ) from x to y in A B and from y to z in A B , respectively, such that
i = 0 n ε 1 d A ¯ ( x i , x i + 1 ) < d ( x , y ) + ε
and
j = 0 m ε 1 d A ¯ ( y j , y j + 1 ) < d ( y , z ) + ε .
The sequence given by z k = x k , for 0 k n ε and z n ε + r = y r for 0 r m ε , is a linking sequence from x to z in A B , and
d ( x , z ) k = 0 n ε + m ε 1 d A ¯ ( z k , z k + 1 ) = i = 0 n ε 1 d A ¯ ( x i , x i + 1 ) + j = 0 m ε 1 d A ¯ ( y j , y j + 1 ) < d ( x , y ) + d ( y , z ) + 2 ε .
Since ε > 0 is arbitrary, it follows that d ( x , z ) d ( x , y ) + d ( y , z ) . Therefore, d is a metric on A B .  □
Remark 4.
Given x , y A B , taking the linking sequence ( x 0 , x 1 ) with x 0 = x and x 1 = y , we obtain
d ( x , y ) d A ¯ ( x , y ) .
From (5), we obtain that the inclusion of A B in B is continuous in relation to the metrics defined in these spaces.
Definition 4.
The space ( A B , d ) , as constructed above, is called the relative completion of ( A , d A ) in the space ( B , d B ) .
Lemma 2.
If ( A B , d ) is the relative completion of ( A , d A ) with respect to the space ( B , d B ) , then A A B , and the inclusion is continuous, with respect to the metrics defined in those spaces.
Proof. 
Given x , y A , consider the approximate sequences of x in ( A , d A ) and of y in ( A , d A ) , respectively, given by ( x , x , x , ) and ( y , y , y , ) . We have, by equality (2) that
d A ¯ ( x , y ) d A ( x , y ) ,
for all x , y A . Putting together (6) and (7), we obtain
d ( x , y ) d A ¯ ( x , y ) d A ( x , y ) ,
for all x , y A .  □

Relative Completion Properties

We present in this subsection the main properties of the relative completion.
Lemma 3.
If ( A B , d ) is the relative completion of ( A , d A ) in the space ( B , d B ) , then A is dense in ( A B , d ) .
Proof. 
Let x A B . Then, there is a Cauchy sequence ( x n ) in ( A , d A ) so that d B ( x n , x ) 0 . For each k N , we have from (6) that
d ( x , x k ) d A ¯ ( x , x k ) lim n d A ( x n , x k ) .
Taking the limit with k , we have d ( x , x k ) 0 , since ( x n ) is a Cauchy sequence in ( A , d A ) .  □
Proposition 3.
If ( B , d B ) is a complete metric space and ( A B , d ) is the relative completion of ( A , d A ) in the space ( B , d B ) , then ( A B , d ) is complete.
Proof. 
Let ( x N ) N N be a Cauchy sequence in ( A B , d ) . For fixed N, and for every approximation sequence ( x n N ) n N of x N in ( A , d A ) , there is n N N so that, for all m , n n N , one has
d A ( x n N , x m N ) 1 N .
Given ε > 0 , since ( x N ) is a Cauchy sequence, there exists N 0 N such that N 0 1 / ε , and
d ( x N , x M ) ε ,
for all M , N N 0 . For fixed M , N N 0 , there are approximation sequences ( x n N ) from x N and ( x n M ) from x M , respectively, so that
d ( x N , x M ) lim n d A ( x n M , x n N ) < d ( x M , x N ) + ε 2 ε .
Since lim n d A ( x n M , x n N ) 2 ε , there is n ε N such that
d A ( x n M , x n N ) 2 ε , for   all   n n ε .
For all N N , let y N = x n N N , where ( x n N ) and ( x n M ) satisfy (11).
Now, if n max { n ε , n N , n M } , we have
d A ( y N , y M ) d A ( y N , x n N ) + d A ( x n N , x n M ) + d A ( x n M , y M ) = d A ( x n N N , x n N ) + d A ( x n N , x n M ) + d A ( x n M , x n M M ) 1 N + 2 ε + 1 M 4 ε .
Thus, ( y N ) N N is a Cauchy sequence in ( A , d A ) . Now, by the continuity of inclusion, A B B , ( y N ) is a Cauchy sequence in ( B , d B ) , which is complete. Then, there is x B such that d B ( y N , x ) 0 . So, x A B . Let us show that d ( x N , x ) 0 . We have, for all N N 0 ,
d ( x N , x ) lim j d A ( x j N , y j ) = lim j d A ( x j N , x n j j ) .
If N max { N 0 , n ε } , we have d ( x N , x ) 2 ε and, therefore, d ( x N , x ) 0 , completing the proof.  □
We also need the following technical lemma.
Lemma 4.
Let ( B , d B ) be a metric space and A B . Let m 1 and m 2 be metrics on A with
d B ( x , y ) μ m 1 ( x , y ) ν m 2 ( x , y ) ,
for all x , y A , where μ and ν are positive constants. If A B 1 and A B 2 are the relative completions of ( A , m 1 ) and ( A , m 2 ) , respectively, in ( B , d B ) , then A B 2 A B 1 with continuous inclusion. We also have that
μ d 1 ( x , y ) ν d 2 ( x , y ) ,
for all x , y A B 2 , where d i is the metric of the completion of ( A , m i ) in ( B , d B ) , with i = 0 , 1 .
Proof. 
Let x A B 2 . Then, there is a Cauchy sequence ( x n ) in ( A , m 2 ) such that d B ( x n , x ) 0 . As μ m 1 ν m 2 , we have that ( x n ) is a Cauchy sequence in ( A , m 1 ) . So, x A B 1 . We also have
μ m 1 ¯ ( x , y ) inf lim n μ m 1 ( x n , y n ) ν inf lim n m 2 ( x n , y n ) = ν m 2 ¯ ( x , y ) ,
where the infimum is taken over all approximation sequences x and y in ( A , m 2 ) . Then, it follows that μ d 1 ( x , y ) ν m 2 ¯ ( x , y ) , for all x , y A B 2 .
Now, let x 0 = x , x 1 , , x n = y be a linking sequence from x to y in A B 2 . We have
μ d 1 ( x , y ) μ k = 0 n 1 d 1 ( x k , x k + 1 ) ν k = 0 n 1 m 2 ¯ ( x k , x k + 1 ) .
Taking the infimum over all linking sequences from x to y in A B 2 , we have μ d 1 ( x , y ) ν d 2 ( x , y ) for all x , y A B 2 .  □

3. Compatible Metric Space Couple

Here, we begin to introduce the interpolation of metric spaces.
Definition 5.
Let X 0 and X 1 be two sets such that X 0 X 1 , and both are subsets of a set X. Also, assume that d 0 , d 1 , and d X are metrics on the sets X 0 , X 1 , and X, respectively, such that there are positive constants C 0 and C 1 satisfying
d X ( x , y ) C i d i ( x , y ) , .
for all x , y X i , i { 0 , 1 } . The pair ( X 0 , X 1 ) is called a compatible metric space couple, or a pair of compatible metric spaces, and it is denoted by X or ( X 0 , X 1 ) X .
Remark 5.
It is always possible to obtain a compatible pair from two metric spaces X 0 and X 1 , as we can see in the following.
Let ( X 0 , d 0 ) and ( X 1 , d 1 ) be metric spaces with X 0 X 1 . Consider X = X 0 × X 1 , and over X, consider the function d X given by
d X ( ( x 0 , x 1 ) ; ( y 0 , y 1 ) ) : = d 0 ( x 0 , y 0 ) + d 1 ( x 1 , y 1 ) .
We have the following results.
Proposition 4.
The function d X is a metric over X.
Proof. 
The triangle inequality is the only metric property that is not obvious. To prove it, let ( x 0 , x 1 ) , ( y 0 , y 1 ) , ( z 0 , z 1 ) X . We have
d X ( ( x 0 , x 1 ) ; ( y 0 , y 1 ) ) = d 0 ( x 0 , y 0 ) + d 1 ( x 1 , y 1 ) [ d 0 ( x 0 , z 0 ) + d 0 ( z 0 , y 0 ) ] + [ d 1 ( x 1 , z 1 ) + d 1 ( z 1 , y 1 ) ] = [ d 0 ( x 0 , z 0 ) + d 1 ( x 1 , z 1 ) ] + [ d 0 ( z 0 , y 0 ) + d 1 ( z 1 , y 1 ) ] = d X ( ( x 0 , x 1 ) ; ( z 0 , z 1 ) ) + d X ( ( z 0 , z 1 ) ; ( y 0 , y 1 ) ) .
Proposition 5.
Let x 0 X 0 . Then, there exists an isometry between ( X 1 , d 1 ) and { x 0 } × X 1 with the metric induced by ( X , d X ) .
Proof. 
Consider the function
f : X 1 { x 0 } × X 1
given by f ( x ) = ( x 0 , x ) { x 0 } × X 1 . It is clear that f is a bijection. Let us prove that f is an isometry. Indeed, let x , y X 1 . Then,
d X ( f ( x ) , f ( y ) ) = d X ( ( x 0 , x ) ; ( x 0 , y ) ) = d 0 ( x 0 , x 0 ) + d 1 ( x , y ) = d 1 ( x , y ) .
By Proposition 5, we can identify ( X 1 , d 1 ) with ( { x 0 } × X 1 , d X ) , and analogously, if x 1 X 1 , there exists an isometry between ( X 0 , d 0 ) and ( X 0 × { x 1 } , d X ) . This allows us to write, by identification,
X k X ,
with
d X ( x , y ) d k ( x , y ) , x , y X k , k = 0 , 1 .
Given a metric space M, we denote the space M × M by M 2 . Let ( X 0 , X 1 ) X be a compatible metric space couple and t > 0 . For ( x , y ) X 0 2 X 1 2 , let h t : X 0 2 X 1 2 R + be the function defined by
h t ( x , y ) = min { d 0 ( x , y ) , t d 1 ( x , y ) } , i f x , y X 0 X 1 ; d 0 ( x , y ) , i f ( x , y ) X 0 2 X 1 2 ; t d 1 ( x , y ) , i f ( x , y ) X 1 2 X 0 2 .
Definition 6.
Let X 0 and X 1 be sets such that X 0 X 1 . Given x , y X 0 X 1 , an admissible linking sequence from x to y in X 0 X 1 is a finite sequence of points x 0 , x 1 , , x n X 0 X 1 that satisfies the following:
  • x 0 = x and x n = y ;
  • For each k { 0 , 1 , , n 1 } , we have ( x k , x k + 1 ) X 0 2 X 1 2 .
Let us denote an admissible linking sequence ( x , x 1 , x 2 , , x n 1 , y ) from x to y in X 0 X 1 by ( x n x , y ) a d m .
Remark 6.
Note that given any x , y X 0 X 1 , there is always an admissible linking sequence from x to y in X 0 X 1 , because if x , y X i , then x 0 = x and x 1 = y is an admissible linking sequence from x to y in X 0 X 1 , for i = 0 , 1 . And when x X i X 1 i and y X 1 i X i , since X 0 X 1 , in choosing an element z X 0 X 1 , the sequence x 0 = x , x 1 = z , and x 2 = y is an admissible linking sequence from x to y in X 0 X 1 , for i = 0 , 1 .

3.1. The Functional K M

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 ( X 0 , X 1 ) X be a compatible metric space couple and t > 0 . Given x , y X 0 X 1 , the functional K M is defined by
K M ( t , x , y ) : = inf k = 0 n 1 h t ( x k , x k + 1 ) ,
where the infimum is taken over all admissible linking sequences from x to y in the set X 0 X 1 .
Remark 7.
Using the function h t in the definition of the functional K M , 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 K G ( t , x , y ) K M ( t , x , y ) , where K G is the functional K defined in Gustavsson’s original text. This inequality stems from the fact that the definition of the K G functional admits more sequences than the definition of the K M 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 ( X 0 , X 1 ) X is a compatible metric space couple, then the functional K M ( 1 , · , · ) is a metric on X 0 X 1 .
Proof. 
Given x , y X 0 X 1 , if ( x n x , y ) a d m is an admissible linking sequence of x in y, then
K M ( 1 , x , y ) k = 0 n 1 h 1 ( x k , x k + 1 ) < .
For the positivity, let x X 0 X 1 . So, x 0 = x and x 1 = x is an admissible linking sequence from x to x in X 0 X 1 . Then, we have 0 K M ( 1 , x , x ) h 1 ( x , x ) = 0 . From this, it follows that
K M ( 1 , x , x ) = 0 ,
for all x X 0 X 1 . Now, let x , y X 0 X 1 such that K M ( 1 , x , y ) = 0 . Let ( x n x , y ) a d m be an admissible linking sequence from x to y in X 0 X 1 . We have, for C = max { C 0 , C 1 } ,
d X ( x , y ) k = 0 n 1 d X ( x k , x k + 1 ) C k = 0 n 1 h 1 ( x k , x k + 1 ) .
Taking the infimum over all admissible linking sequences from x to y in X 0 X 1 , we have
d X ( x , y ) C K M ( 1 , x , y ) ,
for all x , y X 0 X 1 . Since d X is a metric, then x = y .
For the symmetry, if ( x n x , y ) a d m is an admissible linking sequence from x to y in X 0 X 1 , then
y 0 = x n = y , y 1 = x n 1 , y 2 = x n 2 , , y n = x 0 = x X 0 X 1
is an admissible linking sequence from y to x such that
i = 0 n 1 h 1 ( x i , x i + 1 ) = j = 0 n 1 h 1 ( y j , y j + 1 ) .
Thus, there is a bijection between the admissible linking sequences from x to y in X 0 X 1 and the admissible linking sequences from y to x in X 0 X 1 . Furthermore, the sums of the images of each pair by the function h 1 of sequences corresponding by such a bijection are equal. Thus,
K M ( 1 , x , y ) i = 0 n 1 h 1 ( x i , x i + 1 ) = j = 0 n 1 h 1 ( y j , y j + 1 ) ,
for every admissible linking sequence ( y n y , x ) a d m from y to x in X 0 X 1 . From this, it follows that K M ( 1 , x , y ) K M ( 1 , y , x ) . We also have
K M ( 1 , y , x ) j = 0 n 1 h 1 ( y j , y j + 1 ) = i = 0 n 1 h 1 ( x i , x i + 1 ) ,
for every admissible linking sequence ( x n x , y ) a d m from x to y in X 0 X 1 . Thus, K M ( 1 , y , x ) K M ( 1 , x , y ) . And consequently, K M ( 1 , x , y ) = K M ( 1 , y , x ) .
For the triangular inequality, let x , y , z X 0 X 1 and ε > 0 . So there are a 0 = x , a 1 , , a n = z and b 0 = z , b 1 , , b m = y admissible linking sequences from x to z and from z to y, respectively, in X 0 X 1 such that
i = 0 n 1 h 1 ( a i , a i + 1 ) < K M ( 1 , x , z ) + ε
and
j = 0 m 1 h 1 ( b j , b j + 1 ) < K M ( 1 , z , y ) + ε .
Define c k = a k , for 0 k n , and c n + r = b r , for 0 r m . Note that ( c m + n + 1 x , y ) a d m is an admissible linking sequence from x to y in X 0 X 1 and that
K M ( 1 , x , y ) k = 0 m + n 1 h 1 ( c k , c k + 1 ) = = i = 0 n 1 h 1 ( a i , a i + 1 ) + j = 0 m 1 h 1 ( b j , b j + 1 ) < K M ( 1 , x , z ) + K M ( 1 , z , y ) + 2 ε .
Since ε > 0 is arbitrary, we have
K M ( 1 , x , y ) K M ( 1 , x , z ) + K M ( 1 , z , y ) ,
which completes the proof.  □
Lemma 5.
If ( X 0 , X 1 ) X is a compatible metric spaces couple, then
K M ( 1 , x , y ) d i ( x , y ) ,
for all x , y X i , with i { 0 , 1 } .
Proof. 
Let x , y X i , with i = 0 , 1 . So, for the admissible linking sequence x 0 = x and x 1 = y from x to y in X 0 X 1 , we have
K M ( 1 , x , y ) h 1 ( x , y ) d i ( x , y ) .
Henceforth, unless otherwise noted and where there is no possibility of confusion, ( X 0 , d 0 ) and ( X 1 , d 1 ) will be considered a pair of compatible metric spaces with respect to the space ( X , d X ) .
Lemma 6.
If 0 < a < b , then
K M ( a , x , y ) K M ( b , x , y ) ,
for all x , y X 0 X 1 .
Proof. 
It suffices to note that given an admissible linking sequence ( x n x , y ) a d m from x to y in X 0 X 1 , we have
k = 0 n 1 h a ( x k , x k + 1 ) k = 0 n 1 h b ( x k , x k + 1 ) .
This result follows from taking the infimum over all admissible linking sequences from x to y in X 0 X 1 .  □
Lemma 7.
If a , b ( 0 , ) and x , y X 0 X 1 , then
K M ( a , x , y ) max { 1 , a b } K M ( b , x , y ) .
Proof. 
If a < b , we have max { 1 , a b } = 1 . Then,
max { 1 , a b } K M ( b , x , y ) = K M ( b , x , y ) K M ( a , x , y ) ,
from Lemma 6.
If a > b , max { 1 , a b } = a b , and given any admissible linking sequence ( x n x , y ) a d m from x to y in X 0 X 1 ,
a b k = 0 n 1 h b ( x k + 1 , x k ) k = 0 n 1 h a ( x k + 1 , x k ) ,
since h a ( x k , x k + 1 ) a b h b ( x k , x k + 1 ) for all k = 0 , 1 , 2 , , n 1 .
The result follows from taking the infimum over all admissible linking sequences from x to y in X 0 X 1 .  □
Using Proposition 23 and Lemmas 24 to 26, we obtain the following result.
Theorem 1.
If t ( 0 , ) , then the function K M ( t , · , · ) is a metric on X 0 X 1 .
Proof. 
Let t > 0 . By Lemma 7, with a = 1 and b = t , we have
min { 1 , t } K M ( 1 , x , y ) K M ( t , x , y ) ,
since ( min { 1 , t } ) 1 = max { 1 , 1 / t } . From this follows the positivity of K M ( t , · , · ) , since K M ( 1 , · , · ) is a metric in X 0 X 1 .
Also from Lemma 7, with a = t and b = 1 , we have
K M ( t , x , y ) max { 1 , t } K M ( 1 , x , y ) < ,
for all t > 0 and x , y X 0 X 1 .
For symmetry, let ( x n x , y ) a d m be an admissible linking sequence from x to y in X 0 X 1 . Consider the admissible linking sequence from y to x in X 0 X 1 given by y k = x n k . We have
k = 0 n 1 h t ( x k , x k + 1 ) = j = 0 n 1 h t ( y j , y j + 1 ) .
Taking the infimum and noting that this relationship between admissible linking sequences is one-to-one, we have the equality K M ( t , x , y ) = K M ( t , y , x ) .
For the triangular inequality, let x , y , z X 0 X 1 and ε > 0 . Then, there are admissible linking sequences ( x n x , z ) a d m from x to z in X 0 X 1 and ( y m z , y ) a d m from z to y in X 0 X 1 such that
i = 0 n 1 h t ( x i , x i + 1 ) < K M ( t , x , z ) + ε
and
j = 0 m 1 h t ( y j , y j + 1 ) < K M ( t , z , y ) + ε .
Consider the sequence given by z k = x k if 0 k n and z k + j = y j if 0 j m . Note that ( z m + n x , y ) a d m is an admissible linking sequence from x to y in X 0 X 1 . So, we can write
K M ( t , x , y ) i = 0 m + n 1 h t ( z i , z i + 1 ) = = k = 0 n 1 h t ( x k , x k + 1 ) + j = 0 m 1 h t ( y j , y j + 1 ) < < K M ( t , x , z ) + K M ( t , z , y ) + 2 ε .
Since ε > 0 is arbitrary, we obtain
K M ( t , x , y ) K M ( t , x , z ) + K M ( t , z , y ) .

3.2. The Functional J M

If x , y X 0 X 1 and t > 0 , we define the functional as follows:
J M ( t , x , y ) : = max { d 0 ( x , y ) , t d 1 ( x , y ) } .
Proposition 7.
J M ( t , · , · ) is a metric on X 0 X 1 .
Proof. 
We have 0 J M ( t , x , y ) < for all x , y X 0 X 1 and also J M ( t , x , x ) = 0 for any x X 0 X 1 . Now, let x , y X 0 X 1 such that J M ( t , x , y ) = 0 . Then, 0 = J M ( t , x , y ) = max { d 0 ( x , y ) , t d 1 ( x , y ) } , that is,
d 0 ( x , y ) = t d 1 ( x , y ) = 0 x = y .
The symmetry is immediate and follows from the symmetry of d 0 and d 1 . For the triangular inequality, given x , y , z X 0 X 1 ,
J M ( t , x , z ) + J M ( t , z , y ) d 0 ( x , z ) + d 0 ( z , y ) d 0 ( x , y )
and
J M ( t , x , z ) + J M ( t , z , y ) t d 1 ( x , z ) + t d 1 ( z , y ) t d 1 ( x , y ) .
Thus, J M ( t , x , z ) + J M ( t , z , y ) max { d 0 ( x , y ) , t d 1 ( x , y ) } = J M ( t , x , y ) .  □
Lemma 8.
If a , b ( 0 , ) and x , y X 0 X 1 , then
J M ( a , x , y ) max { 1 , a b } J M ( b , x , y ) .
Proof. 
Let a < b . Then, max { 1 , a b } = 1 . Since J M is not decreasing in t, we have
J M ( a , x , y ) 1 J M ( b , x , y ) = max { 1 , a b } J M ( b , x , y ) .
Now, if b < a , one has max { 1 , a b } = a b . Then,
max { 1 , a b } J M ( b , x , y ) = a b J M ( b , x , y ) = max { a b d 0 ( x , y ) , a b b d 1 ( x , y ) } max { d 0 ( x , y ) , a d 1 ( x , y ) } = J M ( a , x , y ) .
Lemma 9.
If x , y X 0 X 1 and a , b ( 0 , ) , then
K M ( a , x , y ) min { 1 , a b } J M ( b , x , y ) .
Proof. 
The sequence x 0 = x and x 1 = y links x to y in X 0 X 1 and is admissible. Soon,
K M ( a , x , y ) h a ( x , y ) d 0 ( x , y ) J M ( b , x , y ) = max { d 0 ( x , y ) , b d 1 ( x , y ) } ,
and
K M ( a , x , y ) h a ( x , y ) a d 1 ( x , y ) max { a b d 0 ( x , y ) , a d 1 ( x , y ) } = a b J M ( b , x , y ) .
Thus,
K M ( a , x , y ) min { 1 , a b } J M ( b , x , y ) .

4. Interpolation Spaces

In this section we make a connection between relative completion and the K M and J M functionals defined in the previous section. Such a connection will be made through the functionals Φ θ , q and Γ θ , q defined below, which are the same as the functionals of the normed case.
Definition 8.
Given 0 < θ < 1 , q [ 1 , ] , and a real measurable function ϕ, let Φ θ , q be the functional
Φ θ , q ( ϕ ) : = [ 0 [ t θ | ϕ ( t ) | ] q d t t ] 1 q , i f q < sup t > 0 { t θ | ϕ ( t ) | } , i f q = .
We will also need the following result, which we adapted from [1].
Lemma 10.
If f : ( 0 , ) [ 0 , ) is a measurable function and s > 0 , then
Φ θ , q ( f ( t / s ) ) = s θ Φ θ , q ( f ( t ) ) .
Proof. 
Let q < . We have that, with s > 0
Φ θ , q ( f ( t / s ) ) = ( 0 ( t θ f ( t / s ) ) q d t / t ) 1 / q = s θ ( 0 ( ( t / s ) θ f ( t / s ) ) q d ( t / s ) / ( t / s ) ) 1 / q = s θ Φ θ , q ( f ( t ) ) .
Definition 9.
Given 0 < θ < 1 , q [ 1 , ] , and a sequence c = ( c k ) k Z , let Γ θ , q ( c ) be the functional
Γ θ , q ( c ) : = ( k = [ 2 k θ | c k | ] q ) 1 q , i f q < sup k Z [ 2 k θ | c k | ] , i f q = .
The set of sequences c = ( c k ) k Z such that Γ θ , q ( c ) < is a normed vector space that we denote by λ θ , q , with norm ( c k ) λ θ , q = Γ θ , q ( ( c k ) ) .
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 θ ( 0 , 1 ) and q [ 1 , ] , then
β θ , q ( x , y ) : = Φ θ , q ( K M ( · , x , y ) ) ,
is a metric on X 0 X 1 , where Φ θ , q is given in Definition 8.
Proof. 
Let q < . We have β θ , q ( x , y ) 0 for all x , y X 0 X 1 and β θ , q ( x , x ) = 0 for all x X 0 X 1 . Furthermore, by Lemma 9, with a = t and b = 1 , we have
K M ( t , x , y ) min { 1 , t } J M ( 1 , x , y ) ,
for all x , y X 0 X 1 , and t > 0 . Applying the functional Φ θ , q :
β θ , q ( x , y ) M θ , q J M ( 1 , x , y ) ,
where
M θ , q = Φ θ , q ( min { 1 , · } ) R + .
Thus, if x , y X 0 X 1 , then β θ , q ( x , y ) < .
Now, let x , y X 0 X 1 be such that β θ , q ( x , y ) = 0 . Putting together inequalities (14) and (16), and applying the functional Φ θ , q , we obtain
C 1 M θ , q d X ( x , y ) β θ , q ( x , y ) .
Since d X is a metric, then x = y .
The symmetry follows from the symmetry of K M ( · , · , · ) in the second and third inputs.
For the triangular inequality, given x , y , z X 0 X 1 , for all t > 0 , we have
K M ( t , x , y ) K M ( t , x , z ) + K M ( t , z , y ) .
In applying the functional Φ θ , q in the above inequality,
Φ θ , q ( K M ( · , x , y ) ) Φ θ , q ( K M ( · , x , z ) + K M ( · , z , y ) ) ,
that is,
[ 0 [ t θ K M ( t , x , y ) ] q d t t ] 1 / q [ 0 [ t θ ( K M ( t , x , z ) + K M ( t , z , y ) ) ] q d t t ] 1 / q = [ 0 [ t θ 1 / q K M ( t , x , z ) + t θ 1 / q K M ( t , z , y ) ] q d t ] 1 / q ( * ) [ 0 [ t θ K M ( t , x , z ) ] q d t t ] 1 / q + + [ 0 [ t θ K M ( t , z , y ) ] q d t t ] 1 / q ,
where the inequality in ( * ) is due to Minkowski’s inequality applied to the functions f ( t ) = t θ 1 / q K M ( t , x , z ) and g ( t ) = t θ 1 / q K M ( t , z , y ) . So,
β θ , q ( x , y ) β θ , q ( x , z ) + β θ , q ( z , y ) ,
as we want. Therefore, β θ , q is a metric on X 0 X 1 .
If q = , we have β θ , ( x , y ) = sup t > 0 t θ K ( t , x , y ) 0 and β θ , ( x , x ) = 0 . Let x , y X 0 X 1 such that β θ , ( x , y ) = 0 . Again, from inequalities (14) and (16),
t θ min { 1 , t } d X ( x , y ) C t θ K ( t , x , y ) .
In taking the supremum over all t > 0 ,
d X ( x , y ) C β θ , ( x , y ) = 0 .
Since d X is a metric, x = y . Symmetry is immediate.
Let x , y , z X 0 X 1 . We have
t θ K ( t , x , y ) t θ K ( t , x , z ) + t θ K ( t , z , y ) ,
for all t > 0 . In taking the supreme,
β θ , ( x , y ) β θ , ( x , z ) + β θ , ( z , y ) .
Proposition 8
(Discretization of β θ , q ). If θ ( 0 , 1 ) , q [ 1 , ] , and x , y X 0 X 1 , then ( K M ( 2 i , x , y ) ) i Z λ θ , q is a metric equivalent to β θ , q ( x , y ) .
Proof. 
Let q < . For all i Z , we have
K M ( 2 i + 1 , x , y ) max { 1 , 2 i + 1 / 2 i } K M ( 2 i , x , y ) = 2 K M ( 2 i , x , y ) .
Then, for every t > 0 , there is i Z such that 2 i t 2 i + 1 . Thus,
β θ , q q ( x , y ) = i Z 2 i 2 i + 1 [ t θ K M ( t , x , y ) ] q d t t .
Taking into account that 2 i θ t θ 2 i θ 2 θ and that K M ( · , x , y ) is non-decreasing, we have
[ 2 θ 2 i θ K M ( 2 i , x , y ) ] q [ t θ K M ( t , x , y ) ] q [ 2 i θ + 1 K M ( 2 i , x , y ) ] q .
Integrating each member with respect to d t t in the interval [ 2 i , 2 i + 1 ] , we have
2 i 2 i + 1 [ 2 θ 2 i θ K M ( 2 i , x , y ) ] q d t t 2 i 2 i + 1 [ t θ K M ( t , x , y ) ] q d t t 2 i 2 i + 1 [ 2 i θ + 1 K M ( 2 i , x , y ) ] q d t t .
And we obtain
2 θ q ln 2 [ 2 i θ K M ( 2 i , x , y ) ] q 2 i 2 i + 1 [ t θ K M ( t , x , y ) ] q d t t 2 q ln 2 [ 2 i θ K M ( 2 i , x , y ) ] q .
Through summing in i Z ,
2 θ ( ln 2 ) 1 / q ( K M ( 2 i , x , y ) ) λ θ , q β θ , q ( x , y ) 2 ( ln 2 ) 1 / q ( K M ( 2 i , x , y ) ) λ θ , q .
If q = , since for all i Z we have
K M ( 2 i + 1 , x , y ) max { 1 , 2 i + 1 / 2 i } K M ( 2 i , x , y ) = 2 K M ( 2 i , x , y ) ,
and for each t > 0 , there exists i Z such that 2 i t 2 i + 1 , we have 2 i θ t θ 2 i θ 2 θ , and since K M ( · , x , y ) is not decreasing, we obtain
2 θ 2 i θ K M ( 2 i , x , y ) t θ K M ( t , x , y ) 2 i θ + 1 K M ( 2 i , x , y ) ,
for 2 i t 2 i + 1 . For fixed t > 0 , for all i Z such that 2 i t 2 i + 1 , one has
2 θ 2 j θ K M ( 2 j , x , y ) t θ K M ( t , x , y ) β θ , ( x , y ) .
Since t > 0 is arbitrary, it holds for all j Z . Soon,
2 θ ( K ( 2 j , x , y ) ) j Z λ θ , β θ , ( x , y ) .
By similar reasoning, we have
β θ , ( x , y ) 2 ( K M ( 2 j , x , y ) ) j Z λ θ , .
Definition 10.
Given x , y X 0 X 1 , let ( x n x , y ) be a linking sequence from x to y in X 0 X 1 and ( k j ) j = 0 n 1 be an n-tuple of integers, both fixed. We define
c i = c i ( ( x n x , y ) , ( k j ) ) = k j = i J M ( 2 i , x j , x j + 1 ) 0 , i f   k j i , f o r   a l l j { 0 , 1 , , n 1 } .
A sequence c = ( c i ) i Z as above is called a derived sequence from x to y, associated with the linking sequence ( x n x , y ) in X 0 X 1 and the sequence ( k j ) .
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 c i 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 x 0 = x , x 1 , x 2 , x 3 , x 4 = y X 0 X 1 be a linking sequence from x to y and ( 5 , 2 , 5 , 7 ) be a sequence of integers with four terms. For i = 0 , we have
c 0 = k j = 0 J M ( 2 0 , x j , x j + 1 ) 0 , s e   k j i , j { 0 , 1 , , n 1 } .
Since no term of the sequence ( 5 , 2 , 5 , 7 ) is equal to zero, it follows that c 0 = 0 . For i = 5 ,
c 5 = k j = 5 J M ( 2 5 , x j , x j + 1 ) 0 , s e   k j i , j { 0 , 1 , , n 1 } .
Since 5 occurs in the zeroth and second positions of the sequence ( 5 , 2 , 5 , 7 ) , it follows that
c 5 = J M ( 2 5 , x 0 , x 1 ) + J M ( 2 5 , x 2 , x 3 ) .
The sequence ( c i ) for this case is c 5 = J M ( 2 5 , x 0 , x 1 ) + J M ( 2 5 , x 2 , x 3 ) , c 2 = J M ( 2 2 , x 1 , x 2 ) , c 7 = J M ( 2 7 , x 3 , x 4 ) , and all other terms are zero.
Proposition 9.
If x , y X 0 X 1 , θ ( 0 , 1 ) , q [ 1 , ) , and t > 0 , then for every derived sequence ( c i ) from x to y in X 0 X 1 , we have
K M ( t , x , y ) γ θ , q , t Γ θ , q ( ( c i ) i Z ) ,
where γ θ , q , t > 0 is a constant that depends only on θ, q, and t.
Proof. 
Let x , y X 0 X 1 , ( x n x , y ) be a linking sequence from x to y in X 0 X 1 and ( k 0 , k 1 , , k n 1 ) be an n-tuple of integers. So, for every t > 0 ,
K M ( t , x , y ) j = 0 n 1 K M ( t , x j , x j + 1 ) j = 0 n 1 min { 1 , t / 2 k j } J M ( 2 k j , x j , x j + 1 ) = i Z min { 1 , t / 2 i } c i .
By Hölder’s inequality,
i Z min { 1 , t / 2 i } c i = i Z ( 2 i θ min { 1 , t / 2 i } ) ( 2 i θ c i ) [ i Z [ 2 i θ min { 1 , t / 2 i } ] p ] 1 p [ i Z [ 2 i θ c i ] q ] 1 q = γ θ , q , t Γ θ , q ( c ) ,
with 1 p + 1 q = 1 and
γ θ , q , t = [ i Z [ 2 i θ min { 1 , t / 2 i } ] q q 1 ] q 1 q = t p 2 N t ( θ 1 ) p 1 2 ( θ 1 ) p + 2 ( N t 1 ) θ p 2 θ p 1 1 / p ,
where N t is the smallest integer such that t 2 N t .  □
Theorem 3.
If θ ( 0 , 1 ) and q [ 1 , ) , then
α θ , q ( x , y ) : = inf ( c i ) i Z Γ θ , q ( ( c i ) i Z )
is a metric over X 0 X 1 , where the infimum is taken over all derived sequences ( c i ) obtained by all linking sequences from x to y and all sequences ( k j ) j = 0 n 1 , as in the Definition 10.
Proof. 
For each x X 0 X 1 , we have that z 0 = x = z 1 is a linking sequence from x to x in X 0 X 1 . For the set { k 0 = 0 } , we have
c i = 0 = i J M ( 2 0 , z j , z j + 1 ) .
This means that only the term c 0 cannot be null. However, by choosing this linking sequence, we have c 0 = J M ( 2 0 , x , x ) = 0 . Therefore, α θ , q ( x , x ) = 0 .
It is also immediate that α θ , q ( x , y ) R for all x , y X 0 X 1 , because for the sequence z 0 = x and z 1 = y and { k 0 = 0 } , we have c 0 = J M ( 1 , x , y ) R and c i = 0 for all i Z { 0 } .
From Proposition 9, taking the infimum over all sequences derived from x to y, we obtain
K M ( t , x , y ) γ θ , q , t α θ , q ( x , y ) ,
where γ θ , q , t > 0 is a constant that only depends on θ , q, and t. This inequality guarantees the positivity of α θ , q in X 0 X 1 .
For the symmetry of α θ , q , let ( x n x , y ) be a linking sequence from x to y in X 0 X 1 and ( k 0 , k 1 , , k n 1 ) be an n-tuple of integers. Consider the sequence ( y n y , x ) given by y j = x n j and ( τ 0 , τ 1 , , τ n 1 ) be an n-tuple of integers given by τ r = k n 1 r . If ( c i ) i Z is the derived sequence from x to y associated with the linking sequence ( x n x , y ) and the n-tuple ( k 0 , k 1 , , k n 1 ) and ( d j ) j Z is the derived sequence from y to x associated with the linking sequence ( y n y , x ) and n-tuple ( τ 0 , τ 1 , , τ n 1 ) , we have
Γ θ , q ( ( c i ) i Z ) = Γ θ , q ( ( d j ) j Z ) .
Thus, if ( c i ) is any derived sequence from x to y, we have
α θ , q ( y , x ) α θ , q ( x , y ) .
Conversely, if ( d j ) is any derived sequence from y to any x, we have
α θ , q ( x , y ) α θ , q ( y , x ) .
Thus, it follows that α θ , q ( x , y ) = α θ , q ( y , x ) .
For the triangular inequality, let x , y , z X 0 X 1 and ε > 0 . So, there are linking sequences ( a n ε x , z ) and ( b m ε z , y ) from x to z and from z to y, respectively, both in X 0 X 1 , and finite integer sequences ( k 0 , k 1 , , k n ε 1 ) and ( l 0 , l 1 , , l m ε 1 ) , such that if ( c i ε ) is the derived sequence from x to z associated with the linking sequence ( a n ε x , z ) and the n ε -tuple ( k 0 , k 1 , , k n ε 1 ) and ( d j ε ) is the derived sequence from z to y associated with the linking sequence ( b m ε x , z ) and the m ε -tuple ( l 0 , l 1 , , l m ε 1 ) , then we have
Γ θ , q ( ( c i ) ) < α θ , q ( x , z ) + ε
and
Γ θ , q ( ( d j ) ) < α θ , q ( z , y ) + ε .
We define the linking sequence ( e s x , y ) from x to y in X 0 X 1 given by e s = a s if 0 s n ε , and e n ε + r = b r if 0 r m ε , as well as an ( m ε + n ε ) -tuple ( τ 0 , τ 1 , τ 2 , , τ m ε + n ε 1 ) given by τ j = k j if 0 j n ε 1 and τ n ε + i = l i , if 0 i m ε 1 . If ( f k ) is the derived sequence from x to y associated with the linking sequence ( e s x , y ) in X 0 X 1 and with ( m ε + n ε ) -tuple ( τ 0 , τ 1 , , τ m ε + n ε 1 ) , we have
α θ , q ( x , y ) Γ θ , q ( ( f i ) ) Γ ( 2 ) θ , q ( ( a i ) ) + Γ θ , q ( ( b i ) ) α θ , q ( x , z ) + α θ , q ( z , y ) + 2 ε ,
where ( 2 ) is due to the Minkowski inequality for the sequence spaces q . Since ε > 0 is arbitrary,
α θ , q ( x , y ) α θ , q ( x , z ) + α θ , q ( z , y ) .
Remark 9.
Inequality (22) tells us that ( X 0 X 1 , α θ , q ) is continuously contained in ( X , d X ) . 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 K M -space). Given a metric couple ( X 0 , X 1 ) X , θ ( 0 , 1 ) and q [ 1 , ] , we define the K M -space as the relative completion of ( X 0 X 1 , β θ , q ) in the space ( X , d X ) . We will denote this space by X θ , q K and the metric of this space by D θ , q .
Definition 12
(The J M -space). Given a metric couple ( X 0 , X 1 ) X , θ ( 0 , 1 ) and q [ 1 , ] , we define the J M -space as the relative completion of ( X 0 X 1 , α θ , q ) in the space ( X , d X ) . We will denote this space by X θ , q J and the metric of this space by d θ , q .
The interpolation of metric spaces generates spaces with basic properties that are analogous to those of the normed case.
Definition 13.
Let ( X 0 , X 1 ) X be a pair of compatible metric spaces and E be a subset of X. We say that ( E , d E ) is an intermediate metric space for the pair ( X 0 , X 1 ) X if
X 0 X 1 E X
and the inclusions are continuous, considering X 0 X 1 endowed with the metric J M ( 1 , · , · ) .
Lemma 11.
If x , y X 0 X 1 and X θ , q J is the J-space endowed with the metric d θ , q , then
d θ , q ( x , y ) α θ , q ( x , y ) 2 m θ J M ( 2 m , x , y ) ,
for all m Z .
Proof. 
Given x , y X 0 X 1 , let x 0 = x , x 1 = y , and m Z be given. So, by definition, if q < ,
α θ , q q ( x , y ) i Z [ 2 i θ m = i J M ( 2 i , x , y ) ] q = [ 2 m θ J M ( 2 m , x , y ) ] q , λ Z .
From inequality (8),
d θ , q q ( x , y ) α θ , q , X q ( x , y ) i Z [ 2 i θ m = i J M ( 2 i , x , y ) ] q = [ 2 m θ J M ( 2 m , x , y ) ] q ,
for all m Z .  □
Proposition 10.
If E = X θ , q K or E = X θ , q J , there are μ , η > 0 such that
d X ( x , y ) μ d E ( x , y )
for all x , y E , and
d E ( x , y ) η J ( 1 , x , y ) ,
for all x , y X 0 X 1 .
Proof. 
These statements follow directly from inequality (5) and from Lemmas 9 and 11 and remain valid if q = .  □
Remark 10.
From Lemma 3, we have that X 0 X 1 is dense in ( X θ , q K , D θ , q ) and in ( X θ , q J , d θ , q ) . And by Proposition 3, we have that ( X θ , q K , D θ , q ) and ( X θ , q J , d θ , q ) are complete whenever ( X , d X ) is complete.
As a consequence of Proposition 10, we have that X θ , q K and X θ , q J are intermediate spaces.
Proposition 11.
If E = X θ , q K or E = X θ , q J , then it holds that
d E ( x , y ) C t θ J M ( t , x , y ) ,
for all x , y X 0 X 1 .
Proof. 
If E = X θ , q K , since K M ( s , x , y ) min { 1 , s / t } J M ( t , x , y ) , for all x , y X 0 X 1 , then by applying Φ θ , q , in relation to s, we have
β θ , q ( x , y ) t θ M θ , q J M ( t , x , y ) .
In X 0 X 1 we have β θ , q D θ , q . So,
D θ , q ( x , y ) t θ M θ , q J M ( t , x , y )
and the result follows taking C = M θ , q .
If E = X θ , q J , given t > 0 , there exists λ 0 Z such that 2 λ 0 t 2 λ 0 + 1 . Since J M ( · , · , · ) is non-decreasing on its first entry, it follows that
J M ( 2 λ 0 , x , y ) J M ( t , x , y ) J M ( 2 λ 0 + 1 , x , y ) .
From 2 λ 0 t 2 λ 0 + 1 , we have
t 2 λ 0 + 1 2 θ λ 0 2 θ t θ .
Putting together these inequalities,
( 2 λ 0 ) θ J M ( 2 λ 0 , x , y ) 2 θ t θ J M ( t , x , y ) .
From Lemma 11, the result follows, with C = 2 θ   □
Corollary 1.
Proposition 11 is equivalent to
d E ( x , y ) C ( d 0 ( x , y ) ) 1 θ ( d 1 ( x , y ) ) θ ,
for all x , y X 0 X 1 , where E = X θ , q J or E = X θ , q K .
Proof. 
If we assume (25), it is enough consider t = d 0 ( x , y ) / d 1 ( x , y ) . For the contrary equivalence, for all t > 0 , we have that d 0 ( x , y ) J M ( t , x , y ) and d 1 ( x , y ) J M ( t , x , y ) / t . Thus,
d E ( x , y ) C ( J M ( t , x , y ) ) 1 θ ( ( J M ( t , x , y ) / t ) θ = C t θ J M ( t , x , y ) .
Now, one of our main results follows.
Theorem 4.
We have that
X θ , q J X θ , q K
with
D θ , q ( x , y ) 2 γ θ , , 1 d θ , q ( x , y ) ,
for all x , y X θ , q J .
Proof. 
It is enough to prove that
β θ , q ( x , y ) c α θ , q , x , y X 0 X 1 ,
for some constant c > 0 . For this, let x , y X 0 X 1 , ( x n x , y ) be a linking sequence from x to y in X 0 X 1 and ( k 0 , k 1 , , k n 1 ) be an n-tuple of integers. As it was shown in Lemma 9, we have
K M ( t , x , y ) j = 0 n 1 K M ( t , x j , x j + 1 ) j = 0 n 1 min { 1 , t / 2 k j } J M ( 2 k j , x j , x j + 1 ) i Z min { 1 , t / 2 i } c i ,
for all t > 0 . In particular, if t = 2 j ,
K M ( 2 j , x , y ) i Z min { 1 , 2 j i } c i .
If i = k + j , we have
K M ( 2 j , x , y ) i Z min { 1 , 2 j i } c i = k Z min { 1 , 2 k } c k + j = k Z [ 2 k θ min { 1 , 2 k } ] [ 2 k θ c k + j ] .
Now, we apply the functional Γ θ , q with respect to the variable j:
Γ θ , q ( K M ( 2 j , x , y ) j Z ) Γ θ , q ( ( c k + j ) j Z ) ) k Z 2 k θ min { 1 , 2 k } .
From Proposition 8, we may write
β θ , q ( x , y ) 2 γ θ , , 1 α θ , q ( x , y ) .
Now, we apply Lemma 4 for A = X 0 X 1 , m 1 = β θ , q , m 2 = α θ , q , and B = X with d X = d B .  □
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 ( X 0 , X 1 ) X , θ ( 0 , 1 ) and q [ 1 , ] , if the inclusion of ( X 0 X 1 , d X ) in ( X 0 X 1 , K ( 1 , · , · ) ) is continuous, then
K M ( t , x , y ) C t θ d E ( x , y ) ,
for all x , y E ( X 0 X 1 ) , where E = X θ , q K or E = X θ , q J .
Proof. 
Let E = X θ , q K . We know that K M ( t , a , b ) max { 1 , t / s } K M ( s , a , b ) for all a , b X 0 X 1 . So,
min { 1 , s / t } K M ( t , a , b ) K M ( s , a , b ) .
Applying Φ θ , q in the variable s and using Lemma 10, we have
t θ M θ , q K M ( t , a , b ) β θ , q ( a , b ) ,
or
K M ( t , a , b ) M θ , q 1 t θ β θ , q ( a , b ) ,
for all a , b X 0 X 1 . Now, let x , y X θ , q K ( X 0 X 1 ) . Then, there are Cauchy sequences ( x n ) and ( y n ) in ( X 0 X 1 , β θ , q ) such that lim n d X ( x n , x ) = lim n d X ( y n , y ) = 0 . So,
K M ( t , x n , y n ) M θ , q 1 t θ β θ , q ( x n , y n ) ,
for all n N . This inequality is valid for any approximating sequences of x and y in ( X 0 X 1 , β θ , q ) . So,
inf lim n K M ( t , x n , y n ) inf lim n M θ , q 1 t θ β θ , q ( x n , y n ) ,
where the infimum is taken over all approximating sequences of x and y in ( X 0 X 1 , β θ , q ) . From the continuous inclusion of the hypothesis, it follows that K M ( t , x , y ) M θ , q 1 t θ β θ , q ¯ ( x , y ) . If x 0 = x , x 1 , , x n = y is a linking sequence from x to y in X θ , q K , we have
K M ( t , x , y ) k = 0 n 1 K M ( t , x k , x k + 1 ) M θ , q 1 t θ k = 0 n 1 β θ , q ¯ ( x k , x k + 1 ) .
Taking the infimum over all linking sequences from x to y in X θ , q K , we have
K M ( t , x , y ) M θ , q 1 t θ D θ , q ( x , y ) .
Now, if E = X θ , q J , the proof follows from K M ( t , x , y ) C t θ and the previous theorem, since
D θ , q ( x , y ) 2 γ θ , , 1 d θ , q ( x , y ) ,
for all x , y X θ , q J .  □
Definition 14.
We say that ( X 0 , X 1 ) X satisfies the condition H if for all x , y X 0 X 1 , there is a linking sequence ( x n x , y ) , from x to y in X 0 X 1 and a n-tuple of integers ( k 0 , k 1 , , k n 1 ) , such that for some constant γ, the following holds:
c i γ K M ( 2 i , x , y ) ,
with c = ( c i ) being the derived sequence from x to y in X 0 X 1 associated with the linking sequence ( x n x , y ) and the n-tuple of integers above.
It is immediate that for pairs of metric spaces satisfying the condition H we have
X θ , q J = X θ , q K ,
with equivalent metrics.
Spaces where some kind of theorem as the fundamental lemma of interpolation for normed spaces holds necessarily satisfy the condition H .
Theorem 5.
Let ( X 0 , X 1 ) X be a pair of compatible metric spaces. Then, we have the following:
(a) 
If ( X 0 , X 1 ) θ , q K denotes the K M interpolated space of ( X 0 , X 1 ) X , then
( X 0 , X 1 ) θ , q K = ( X 1 , X 0 ) 1 θ , q K ,
with equal metrics.
(b) 
If q r , then X θ , q K X θ , r K and
D θ , q ( x , y ) C D θ , r ( x , y ) ,
for all x , y X θ , r K .
(c) 
If X 1 X 0 (continuous Lipschitz inclusion) and X = X 0 with d X = d 0 , then X θ 1 , q K X θ 0 , q K for all q [ 1 , ] and 0 < θ 0 < θ 1 < 1 .
Proof. 
( a ) Let x , y X 0 X 1 and ( x n x , y ) be an admissible linking sequence from x to y in X 0 X 1 . We have that h t ( x k , x k + 1 ; ( X 0 , X 1 ) ) = t h t 1 ( x k , x k + 1 ; ( X 1 , X 0 ) ) for all k = 0 , 1 , , n 1 , where the labels ( X 0 , X 1 ) and ( X 1 , X 0 ) are used to differentiate the order in which the spaces compatible metrics is being considered. Then,
t k = 0 n 1 h t 1 ( x k , x k + 1 ; ( X 0 , X 1 ) ) = k = 0 n 1 h t ( x k , x k + 1 ; ( X 1 , X 0 ) ) .
Taking the infimum over all admissible linking sequences from x to y, we have
t K M ( t 1 , x , y ; ( X 0 , X 1 ) ) = K M ( t , x , y ; ( X 1 , X 0 ) ) .
In applying the functional Φ θ , q ,
β 1 θ , q ( x , y ; ( X 0 , X 1 ) ) = β θ , q ( x , y ; ( X 1 , X 0 ) ) .
Thus, we obtain the same relative completion and both have the same metric, i.e.,
D 1 θ , q ( x , y ; ( X 0 , X 1 ) ) = D θ , q ( x , y ; ( X 1 , X 0 ) ) .
( b ) Let x , y X 0 X 1 . We will use the equivalent discrete version of β θ , q . Indeed, if q r , we have that q ( Z ) r ( Z ) . For fixed θ ( 0 , 1 ) , consider the sequence with its general term given by
c k = 2 k θ K M ( 2 k , x , y ) , k Z .
We have ( c k ) k Z p = ( K M ( 2 k , x , y ) ) k Z λ θ , p for all p [ 1 , ] . Since β θ , q ( x , y ) and ( K M ( 2 k , x , y ) ) k Z λ θ , q are equivalent for all θ ( 0 , 1 ) , all q [ 1 , ] , and also ( K M ( 2 k , x , y ) ) k Z λ θ , q ( K M ( 2 k , x , y ) ) k Z λ θ , r , for all θ ( 0 , 1 ) , the result follows from putting together the inequalities. Furthermore, by Lemma 4, we have
D θ , q ( x , y ) C D θ , r ( x , y ) ,
for all x , y X θ , r .
( c ) From the inclusion in the hypothesis, there is λ > 0 such that d 0 ( x , y ) λ d 1 ( x , y ) for all x , y X 1 . Let ( x n x , y ) a d m be an admissible linking sequence from x to y in X 0 X 1 . For all t λ , we have
d 0 ( x , y ) k = 0 n 1 d 0 ( x k , x k + 1 ) s S d 0 ( x s , x s + 1 ) + ( t / λ ) r R d 0 ( x r , x r + 1 ) s S d 0 ( x s , x s + 1 ) + t r R d 1 ( x r , x r + 1 ) = k = 0 n 1 h t ( x k , x k + 1 ) ,
where S is the set of indices s for which h t ( x s , x s + 1 ) = d 0 ( x s , x s + 1 ) , and R is the set of indices for which h t ( x r , x r + 1 ) = t d 1 ( x r , x r + 1 ) . This implies that d 0 ( x , y ) K M ( t , x , y ) for all t λ . Since the opposite inequality is true, it follows that d 0 ( x , y ) = K M ( t , x , y ) for all t λ . Now, we have that
D θ , q q ( x , y ) = 0 1 [ t θ K M ( t , x , y ) ] q d t t + 1 λ [ t θ K M ( t , x , y ) ] q d t t + λ [ t θ d 0 ( x , y ) ] q d t t .
Since K M ( t , x , y ) d 0 ( x , y ) for all t > 0 , it follows from the previous equality that
D θ , q q ( x , y ) = 0 1 [ t θ K M ( t , x , y ) ] q d t t + 1 λ [ t θ K M ( t , x , y ) ] q d t t + + λ [ t θ d 0 ( x , y ) ] q d t t 0 1 [ t θ K M ( t , x , y ) ] q d t t + d 0 ( x , y ) 1 t θ q 1 d t .
The first part of the second member of the last inequality satisfies
0 1 [ t θ 0 K M ( t , x , y ) ] q d t t 0 1 [ t θ 1 K M ( t , x , y ) ] q d t t ,
for 0 < θ 0 < θ 1 < 1 . Thus,
D θ 0 , q q ( x , y ) D θ 1 , q q ( x , y ) + μ θ 0 , q d 0 ( x , y ) ,
where μ θ 0 , q = 1 t θ 0 q 1 d t . This inequality shows that X θ 1 , q X θ 0 , q .  □

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 ( X 0 , X 1 ) X and ( Y 0 , Y 1 ) Y .
Definition 15.
Let ( M , d M ) and ( N , d N ) be metric spaces, and let T : M N . Then, T is a Lipschitiz operator if there is a constant γ > 0 such that
d N ( T ( x ) , T ( y ) ) γ d M ( x , y ) ,
for all x , y M . Furthermore if T is a Lipschitz operator,
κ = inf x y x , y M d N ( T ( x ) , T ( y ) ) d M ( x , y )
is called the Lipschitz constant of T.
To avoid confusion, when we are dealing with two pairs of compatible metric spaces ( X 0 , X 1 ) X and ( Y 0 , Y 1 ) Y , we will use the symbols X to refer to the pair ( X 0 , X 1 ) X and Y to refer to the pair ( Y 0 , Y 1 ) Y in each functional or notation that makes this distinction necessary.
Theorem 6.
Let ( X 0 , X 1 ) X and ( Y 0 , Y 1 ) Y be two pairs of compatible metric spaces, and ( X , d X ) and ( Y , d Y ) be metrics spaces, such that Y is a complete metric space. For fixed θ ( 0 , 1 ) and q [ 1 , ] , T : X Y is an operator that satisfies the following:
(a) 
lim n d X ( x n , x ) = 0 and lim n d Y ( T ( x n ) , y ) = 0 imply that T ( x ) = y .
(b) 
T i = T | X i : X i Y i , ( i = 0 , 1 ) .
(c) 
d Y i ( T i ( x ) , T i ( z ) ) ω i d X i ( x , z ) , where ω i > 0 and x , z X i , i = 0 , 1 .
Then,
T θ , q = T | X θ , q K : X θ , q K Y θ , q K
and
D θ , q , Y ( T θ , q ( x ) , T θ , q ( z ) ) ω 0 1 θ ω 1 θ D θ , q , X ( x , z ) , x , z X θ , q K .
Proof. 
From properties ( b ) and ( c ) , we claim that
K M ( t , T ( x ) , T ( z ) , Y ) ω 0 K M ( t ω 1 ω 0 , x , z , X ) , x , z X 0 X 1 .
Indeed, let ( x n x , z ) a d m be an admissible linking sequence from x to z in X 0 X 1 . For every k = 0 , 1 , , n 1 , we have
ω 0 h t ω 1 ω 0 ( x k , x k + 1 ; X ) = ω 0 d X 0 ( x k , x k + 1 ) ω 0 ω 0 1 d Y 0 ( T 0 ( x k ) , T 0 ( x k + 1 ) ) h t ( T 0 ( x k ) , T 0 ( x k + 1 ) ; Y )
and always that { x k , x k + 1 } X 0 e { x k , x k + 1 } X 1 . In the same way,
ω 0 h t ω 1 ω 0 ( x k , x k + 1 ; X ) = ω 1 t ω 0 ω 0 d X 1 ( x k , x k + 1 ) = ω 1 t d X 1 ( x k , x k + 1 ) ω 1 t ω 1 1 d Y 1 ( T 1 ( x k ) , T 1 ( x k + 1 ) ) h t ( T 1 ( x k ) , T 1 ( x k + 1 ) ; Y )
and and always that { x k , x k + 1 } X 1 e { x k , x k + 1 } X 0 . Finally, if x k , x k + 1 X 1 X 0 ,
ω 0 h t ω 1 ω 0 ( x k , x k + 1 ; X ) = ω 0 min { d X 0 ( x k , x k + 1 ) , ω 1 t ω 0 d X 1 ( x k , x k + 1 ) } min { d Y 0 ( T 0 ( x k ) , T 0 ( x k + 1 ) ) , t d Y 1 ( T 1 ( x k ) , T 1 ( x k + 1 ) ) } = h t ( T ( x k ) , T ( x k + 1 ) ; Y ) .
Therefore, for every admissible linking sequence ( x n x , z ) a d m , we have
k = 0 n 1 h t ( T ( x k ) , T ( x k + 1 ) ; Y ) ω 0 k = 0 n 1 h ω 1 t ω 0 ( x k , x k + 1 ; X ) .
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 ( X , d X ) .
Taking the infimum over all admissible linking sequences from x to z in X 0 X 1 , we have
K M ( t , T ( x ) , T ( z ) ; Y ) ω 0 K M ( ω 1 t ω 0 , x , z ; X ) .
Applying the operator Φ θ , q on the last inequality and using Lemma 10, we have
β θ , q , Y ( T ( x ) , T ( z ) ) ω 0 1 θ ω 1 θ β θ , q , X ( x , z ) , x , z X 0 X 1 .
Now, let x X θ , q K . We must prove that T ( x ) Y θ , q K . In fact, let ( x n ) be an approximating sequence of x. Since ( x n ) is a Cauchy sequence in ( X 0 X 1 , β θ , q , X ) , it follows from inequality (30) that ( T ( x n ) ) is a Cauchy sequence in ( Y 0 Y 1 , β θ , q , Y ) . From the inclusion of ( Y 0 Y 1 , β θ , q , Y ) in ( Y , d Y ) , it follows that ( T ( x n ) ) is a Cauchy sequence in ( Y , d Y ) . As this last space is complete, there exists y Y such that
lim n d Y ( T ( x n ) , y ) = 0 .
From property (a), T ( x ) = y . Thus, T ( x ) Y θ , q K . Now, let x , y X θ , q K . We have, for any approximating sequences ( x n ) of x and ( y n ) of y, that
D θ , q , Y ( T ( x ) , T ( y ) ) β θ , q , Y ¯ ( T ( x ) , T ( y ) ) lim n β θ , q , Y ( T ( x n ) , T ( y n ) ) lim n ω 0 1 θ ω 1 θ β θ , q , X ( x n , y n ) ,
where β θ , q , Y ¯ is the distance associated with the metric β θ , q , Y . Taking the infimum over all approximating sequences x and y in ( X 0 X 1 , β θ , q , X ) , we have
D θ , q , Y ( T ( x ) , T ( y ) ) ω 0 1 θ ω 1 θ β θ , q , X ¯ ( x , y ) ,
for all x , y X θ , q K . Now, consider a linking sequence x 0 = x , x 1 , x 2 , , x n = y X θ , q K from x to y. We have
D θ , q , Y ( T ( x ) , T ( y ) ) k = 0 n 1 D θ , q , Y ( T ( x k ) , T ( x k + 1 ) ) k = 0 n 1 β θ , q , Y ¯ ( T ( x k ) , T ( x k + 1 ) ) ω 0 1 θ ω 1 θ k = 0 n 1 β θ , q , X ¯ ( x k , x k + 1 ) .
Taking the infimum over all linking sequences from x to y in X θ , q K , we have
D θ , q , Y ( T ( x ) , T ( y ) ) ω 0 1 θ ω 1 θ D θ , q , X ( x , y ) .
Remark 11.
In Theorem 6, we do not require continuity of T from ( X , d X ) to ( Y , d Y ) , but we require the operator T to satisfy (a), and we also require that ( Y , d Y ) be complete. In the next theorem, we obtain the same result as the previous theorem, but we exchange the completeness of ( Y , d Y ) and the property (a) for the continuity of T of ( X , d X ) in ( Y , d Y ) .
Theorem 7.
If the operator T is continuous from ( X , d X ) to ( Y , d Y ) and satisfies conditions (b) and (c) of Theorem 6, then
T θ , q = T | X θ , q K : X θ , q K Y θ , q K
and
D θ , q , Y ( T ( x ) , T ( z ) ) ω 0 1 θ ω 1 θ D θ , q , X ( x , z ) , x , z X θ , q K .
Proof. 
We just need to prove that T ( X θ , q K ) Y θ , q K because the conclusion of the statement is proved in the same way as for the previous theorem.
In fact, let x X θ , q K . Then, there exists a Cauchy sequence ( x k ) k N in ( X 0 X 1 , β θ , q , X ) such that lim k d X ( x k , x ) = 0 . Let us show that w = T ( x ) Y θ , q K . For each k N , define w k = T ( x k ) . We have, for all k N ,
x k X 0 X 1 w k = T ( x k ) T ( X 0 X 1 ) T ( X 0 ) T ( X 1 ) .
By condition (b), we have that T ( X i ) Y i , i = 0 , 1 , and it follows that w k = T ( x k ) Y 0 Y 1 , for all k N . By inequality (30), we have that ( w k ) is a Cauchy sequence in ( Y 0 Y 1 , β θ , q , Y ) . Furthermore, from the continuity of T : X Y , it follows that
lim k d X ( x k , x ) = 0 lim k d Y ( T ( x k ) , T ( x ) ) = lim k d Y ( w k , w ) = 0 .
Therefore, ( w k = T ( x k ) ) is an approximate sequence of w = T ( x ) , whenever ( x k ) is an approximate sequence of x. Consequently, w = T ( x ) Y θ , q K .  □
Corollary 2.
Under the conditions of Theorem 7, consider X i = Y i , with i = 0 , 1 , X = Y , with equal metrics and ( X , d X ) complete. If ω 0 1 θ ω 1 θ < 1 , then T has a single fixed point at X θ , q K .
Proof. 
Since ( X , d X ) is complete, it follows that ( X θ , q K , D θ , q ) 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 a > 0 , x , y X 0 X 1 , ( x n x , y ) is a linking sequence from x to y in X 0 X 1 , and ( k 0 , k 1 , , k n 1 ) is an n-tuple of integers, then
[ a θ min { 1 , a } ] q i Z [ 2 i θ k j = i J M ( 2 i , x j , x j + 1 ) ] q i Z [ ( 2 i a ) θ k j = i J M ( 2 i a , x j , x j + 1 ) ] q [ a θ max { 1 , a } ] q i Z [ 2 i θ k j = i J M ( 2 i , x j , x j + 1 ) ] q .
Proof. 
Since J M ( A , x , y ) max { 1 , A / B } J M ( B , x , y ) , for all A , B ( 0 , ) and
min { 1 , B / A } = 1 max { 1 , A / B } ,
we have
min { 1 , B / A } J M ( B , x , y ) J M ( A , x , y ) max { 1 , B / A } ,
or equivalently,
min { 1 , B / A } J M ( A , x , y ) J M ( B , x , y ) max { 1 , B / A } J M ( A , x , y ) .
Then, for A = 2 i and B = 2 i a ,
min { 1 , a } J M ( 2 i , x , y ) J M ( 2 i a , x , y ) max { 1 , a } J M ( 2 i , x , y ) ,
for any i Z . Thus, if ( x n x , y ) is a linking sequence from x to y in X 0 X 1 and ( k 0 , k 1 , , k n 1 ) is an n-tuple of integers,
min { 1 , a } k j = i J ( 2 i , x j , x j + 1 ) k j = i J M ( 2 i a , x j , x j + 1 ) max { 1 , a } k j = i J M ( 2 i , x j , x j + 1 ) .
or
a θ min { 1 , a } 2 i θ k j = i J M ( 2 i , x j , x j + 1 ) ( 2 i a ) θ k j = i J M ( 2 i a , x j , x j + 1 ) a θ max { 1 , a } 2 i θ k j = i J M ( 2 i , x j , x j + 1 ) .
Thus,
[ a θ min { 1 , a } ] q i Z [ 2 i θ k j = i J M ( 2 i , x j , x j + 1 ) ] q i Z [ ( 2 i a ) θ k j = i J M ( 2 i a , x j , x j + 1 ) ] q [ a θ max { 1 , a } ] q i Z [ 2 i θ k j = i J M ( 2 i , x j , x j + 1 ) ] q .
Theorem 8.
If T : X Y is an operator with properties (a), (b), and (c), then
T : X θ , q J Y θ , q J
and
d θ , q , Y ( T ( x ) , T ( y ) ) max { ω 0 , ω 1 } d θ , q , X ( x , y ) , x , y X θ , q J .
Proof. 
Let x , y X 0 X 1 , ( x n x , y ) be a linking sequence from x to y in X 0 X 1 and ( k 0 , k 1 , , k n 1 ) be a sequence of integers. So,
k j = i J M ( 2 i , T ( x j ) , T ( x j + 1 ) ; Y ) = k j = i max { d Y 0 ( T 0 ( x j ) , T 0 ( x j + 1 ) ) , 2 i d Y 1 ( T 1 ( x j ) , T 1 ( x j + 1 ) ) } k j = i max { ω 0 d X 0 ( x j , x j + 1 ) , 2 i ω 1 d X 1 ( x j , x j + 1 ) } ω 0 k j = i max { d X 0 ( x j , x j + 1 ) , 2 i ω 1 / ω 0 d X 1 ( x j , x j + 1 ) } = ω 0 k j = 1 J M ( 2 i ω 1 / ω 0 , x j , x j + 1 ; X ) .
In applying Γ θ , q to the derived sequences obtained above,
α θ , q , Y q ( T ( x ) , T ( y ) ) ω 0 q i Z [ 2 θ i k j = i J M ( 2 i ω 1 / ω 0 , x j , x j + 1 ; X ) ] q = ω 0 q ( ω 1 / ω 0 ) θ q i Z [ ( 2 i ω 1 / ω 0 ) θ k j = i J M ( 2 i ω 1 / ω 0 , x j , x j + 1 ; X ) ] q = ω 0 ( 1 θ ) q ω 1 θ q i Z [ ( 2 i ω 1 / ω 0 ) θ k j = i J M ( 2 i ω 1 / ω 0 , x j , x j + 1 ; X ) ] q .
From Lemma 12, with a = ω 1 / ω 0 , we have
α θ , q , Y ( T ( x ) , T ( y ) ) max { ω 0 , ω 1 } α θ , q , X ( x , y ) ,
for all x , y X 0 X 1 . Now, let x X θ , q J . We want to prove that T ( x ) Y θ , q J .
Indeed, as x X θ , q J , there is an approximating sequence ( x n ) of x in X 0 X 1 . Since
α θ , q , Y ( T ( x ) , T ( y ) ) max { ω 0 , ω 1 } α θ , q , X ( x , y ) ,
for all x , y X 0 X 1 , it follows that ( T ( x n ) ) is a Cauchy sequence in Y 0 Y 1 . Since ( y n = T ( x n ) ) is a Cauchy sequence in ( Y 0 Y 1 , α θ , q , Y ) , which is continuously embedded in ( Y , d Y ) , which is complete, there is y Y such that lim n d Y ( y n , y ) = 0 . From (a), it follows that T ( x ) = y , yielding T ( x ) Y θ , q J .
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 ( A , d A ) and ( B , d B ) be metric spaces and T : A B be an operator. Then, T is a compact operator if T is continuous and if for every bounded set L A , we have that T ( L ) ¯ B 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 ( A , d A ) has a convergent subsequence in ( B , d B ) .
Lemma 13.
If X 0 = X 1 = X and d 0 = d 1 = d X , given θ ( 0 , 1 ) and q [ 1 , ] , then X θ , q K = X 0 and M θ , q d 0 = D θ , q .
Proof. 
We have
d 0 ( x , y ) k = 0 n 1 d 0 ( x k , x k + 1 ) = k = 0 n 1 h 1 ( x k , x k + 1 ) .
Taking the infimum over all admissible linking sequences from x to y in X 0 X 1 , we have d 0 ( x , y ) K ( 1 , x , y ) for all x , y X 0 . Since K ( 1 , x , y ) max { 1 , 1 / t } K ( t , x , y ) , one has
min { 1 , t } d 0 ( x , y ) K ( t , x , y ) .
On the other hand, K ( t , x , y ) min { 1 , t } J ( 1 , x , y ) = d 0 ( x , y ) . Thus,
K ( t , x , y ) = min { 1 , t } d 0 ( x , y ) .
In applying the functional Φ θ , q ,
β θ , q = M θ , q d 0 .
Now, since X 0 = X 0 X 1 X θ , q K X = X 0 , we have X θ , q K = X 0 .  □
Proposition 13.
Let ( X 0 , X 1 ) X be a compatible metric space couple, with θ ( 0 , 1 ) and q [ 1 , ] , and let ( F , d F ) be a metric space. If T is an operator that satisfies the following three conditions, then T : F X θ , q K is a compact Lipschitzian operator:
(i) 
T : F X ;
(ii) 
T : F X 0 is a compact Lipschitizan operator;
(iii) 
T : F X 1 is Lipschitzian.
Proof. 
From Lemma 13, we have F = F θ , q K and d F = ( M θ , q ) 1 D θ , q , F . By (29) of Theorem 6, we have
D θ , q , X ( T ( x ) , T ( y ) ) ω 0 1 θ ω 1 θ D θ , q , F ( x , y ) , x , y F ,
where ω i is the Lipschitz constant of T in each space X i , i = 0 , 1 . So, T : F X θ , q K is well defined.
Let ( x n ) be a bounded sequence in ( F , d F ) . As X 0 X 1 is dense in X θ , q K , without loss of generality, we can consider that T ( x n ) = y n X 0 X 1 for all n N . From the compactness of T : F X 0 , there is a subsequence ( y n k ) that converges, according to the metric d 0 , to a point y X 0 .
We must prove that y X θ , q K and that D θ , q , X ( T ( x n k ) , y ) 0 when k . For all r , s N , we have, from Proposition 11 and from Corollary 1, that
β θ , q , X ( T ( x n r ) , T ( x n s ) ) C ¯ [ d 0 ( T ( x n r ) , T ( x n s ) ) ] 1 θ [ d 1 ( T ( x n r ) , T ( x n s ) ) ] θ C ¯ [ d 0 ( T ( x n r ) , T ( x n s ) ) ] 1 θ [ ω 1 d F ( x n r , x n s ) ] θ ,
where C ¯ is a positive constant arising from the combination of the constant C of Corollary 1 with the constant of Lemma 13. Since ( x n ) is bounded in ( F , d F ) and ( y n k ) is a Cauchy sequence in ( X 0 , d 0 ) , it follows that ( y n k ) is a Cauchy sequence in ( X 0 X 1 , β θ , q , X ) . As d X ( x , y ) C 0 d 0 ( x , y ) , for all x , y X 0 , we have lim k d X ( y n k , y ) = 0 . So, y X θ , q K . Now, for each k N , we have
D θ , q ( y n k , y ) lim j β θ , q ( y n k , y n j ) lim j C ¯ [ d 0 ( y n k , y n j ) ] 1 θ [ d 1 ( y n k , y n j ) ] θ C ¯ lim j [ d 0 ( y n k , y n j ) ] 1 θ [ ω 1 d F ( x n k , x n j ) ] θ M C ¯ lim j [ d 0 ( y n k , y n j ) ] 1 θ ,
where M > 0 is a constant that does not depend on k. Taking the limit with k in the above inequality, we have the target result, since ( y n k ) is a Cauchy sequence in ( X 0 , d 0 ) . 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 ( X , · X ) and ( X , · X ) be normed vector spaces such that X is a vector subspace of X , and there is a constant C > 0 with x X C x X , for all x X . Then, the relative completion of ( X , · X ) in ( X , · X ) , denoted by ( X X , · X X ) is a vector subspace of X that contains the subspace X, for which its norm · X X satisfies
x X C x X X , x X X
and
x X X x X , x X .
Proof. 
Let x , y , z X X and λ K ( R or C ). Since ( X , · X ) is a normed vector space, it follows that ( x n + λ y n ) is an approximation sequence of x + λ y whenever ( x n ) and ( y n ) are sequences that approximate x and y in ( X , · X ) . Thus, we obtain that X X is a vector subspace of X .
Now, let us show that the metric d defined for the relative completion of ( X , · X ) in ( X , · X ) is a norm for this completion, which we will denote by · X X . To do so, it is only necessary to show that this metric is invariant by translation and satisfies the property λ x X X = | λ | x X X . Let x , y , z X X . We prove the translation invariance with two statements:
Claim 1:The distance function associated with · X is translation invariant.
Let us denote this distance by d X ¯ . We have
d X ¯ ( x + z , z + y ) = inf lim n r n s n X ,
where the infimum is taken over all approximating sequences of x + z and z + y in ( X , · X ) . Given the approximating sequences ( x n ) , ( y n ) , and ( z n ) of x, y, and z, respectively, in ( X , · X ) , one has
lim n x n y n X = lim n ( x n + z n ) ( z n + y n ) X .
On the other hand, given the approximation sequences ( r n ) , ( s n ) , and ( z n ) of x + z , z + y , and z, respectively, one has
lim n ( r n z n ) ( s n z n ) X = lim n r n s n X .
Taking the infimum over all approximating sequences of x and y in (33), we have d X ¯ ( x , y ) d X ¯ ( x + z , z + y ) . Note that ( r n z n ) is a Cauchy sequence in ( X , · X ) and
r n z n x X x + z z x X = 0
and the same reasoning can be used for ( s n z n ) . Therefore, ( r n z n ) is an approximating sequence of x in ( X , · X ) , and likewise, ( s n z n ) is an approximating sequence of y in ( X , · X ) . Taking the infimum over all approximating sequences of x + z and z + y in (34), we have d X ¯ ( x , y ) d X ¯ ( x + z , z + y ) . So, d X ¯ ( x , y ) = d X ¯ ( x + z , z + y ) for all x , y , z X X , and we have the invariance by translation.
Claim 2:For all x X X and λ K , d X ¯ ( λ x , 0 ) = | λ | d X ¯ ( x , 0 ) .
Indeed, if ( x n ) is an approximating sequence x in ( X , · X ) , then ( λ x n ) is an approximating sequence of λ x in ( X , · X ) , and we also have the reciprocal for λ 0 . The case of λ = 0 is trivial. Then, let λ 0 . We have
d X ¯ ( λ x , 0 ) = inf lim n λ x n λ z n X = | λ | inf lim n x n z n X = | λ | d X ¯ ( x , 0 ) ,
where the infimum is taken over all approximating sequences of x and 0 in the space ( X , · X ) .
Finally, we prove that the metric of the relative completion is a norm. For x , y , z X X , given any linking sequence x 0 = x , x 1 , , x n = y X X , we have that z 0 = x 0 + z , z 1 = x 1 + z , , z n = x n + z is a linking sequence from x + z to z + y in X X , and
k = 0 n 1 d X ¯ ( x k , x k + 1 ) = k = 0 n 1 d X ¯ ( x k + z , x k + 1 + z ) = k = 0 n 1 d X ¯ ( z k , z k + 1 ) .
Now, if m 0 = x + z , m 1 , , m s = z + y X X is a linking sequence from x + z to z + y , we have that c i = m i z X X , for i = 0 , 1 , , s 1 , is a linking sequence from x to y in X X , and
k = 0 s 1 d X ¯ ( m k , m k + 1 ) = k = 0 s 1 d X ¯ ( m k z , m k + 1 z ) = k = 0 s 1 d X ¯ ( c k , c k + 1 ) .
Thus, we obtain the translation invariance of · X ¯ X , taking the infimum over the linking sequences consecutively. Using similar reasoning, we have that λ x X X = | λ | x X X .  □
Definition 17.
Let A 0 and A 1 be normed vector spaces. We say that A 0 and A 1 are a pair of compatible normed spaces if there exists a topological vector space U with a Hausdorff topology, such that A 0 and A 1 are vector subspaces of U, and each inclusion is continuous. We use ( A 0 , A 1 ) U to denote a pair of compatible normed spaces.
Proposition 14.
If ( X 0 , X 1 ) X is a pair of compatible normed spaces and K M ( · , · , · ) is the K-functional defined for metric spaces, then K M ( t , · , · ) is a norm in X 0 X 1 , considering X = X 0 + X 1 and d X ( x , y ) = x y X 0 + X 1 for x , y X 0 + X 1 .
Proof. 
We just need to show that K M ( t , x + z , y + z ) = K M ( t , x , y ) , for all x , y X 0 X 1 and z X 0 X 1 , and also that K M ( t , λ x , λ y ) = | λ | K M ( t , x , y ) , for all λ K ( R   or   C ) .
Let ( x n x , y ) a d m be any admissible linking sequence from x to y in X 0 X 1 . Consider the admissible sequence ( z n x + z , y + z ) a d m , given by z k = x k + z , for 0 k n . We have
k = 0 n 1 h t ( x k , x k + 1 ) = k = 0 n 1 h t ( z k , z k + 1 ) .
Hence, we can obtain that K M ( t , x + z , y + z ) = K M ( t , x , y ) by just taking the infimum over all admissible linking sequences from x to y in X 0 X 1 , and then over all admissible linking sequences from x + z to z + y in X 0 X 1 , obtaining the inverse inequality.
Now, let λ K . If ( p m x , y ) a d m is any admissible linking sequence from x to y in X 0 X 1 , we have that ( λ p m λ x , λ y ) a d m is an admissible linking sequence from λ x to λ y in X 0 X 1 . Then,
k = 0 m 1 h t ( λ p k , λ p k + 1 ) = | λ | k = 0 m 1 h t ( p k , p k + 1 ) .
Thus, K M ( t , λ x , λ y ) = | λ | K M ( t , x , y ) .  □
From Proposition 14, in the next theorem, we obtain another interpolation method for normed spaces.
Theorem 9.
If ( X 0 , X 1 ) X is a pair of compatible normed spaces and K M ( · , · , · ) is the K-functional defined for metric spaces, then for fixed θ ( 0 , 1 ) and q [ 1 , ] , the space X θ , q K , defined for the metric spaces, is an exact interpolation space for the pair ( X 0 , X 1 ) X , considering X = X 0 + X 1 , where the metric in X is given by · X 0 + X 1 .
Proof. 
Let X θ , q K M be the relative completion of X 0 X 1 with respect to the norm
· θ , q , K M = [ 0 [ t θ K M ( t , · , · ) ] q d t / t ] 1 / q ,
in the space X = X 0 + X 1 with norm · X 0 + X 1 . By Proposition 14 and by Lemma 14, the result follows, completing the normed space ( X 0 X 1 , β θ , q ) in the normed space ( X 0 + X 1 , · X 0 + X 1 ) . Finally, it is enough to observe that continuous linear operators in normed spaces are Lipschitzian operators.  □
Lemma 15.
For every t > 0 and every x X 0 X 1 , we have
K N ( t , x ) K M ( t , x ) 3 K N ( t , x ) ,
where K M ( t , x ) : = K M ( t , x , 0 ) , and K N is a functional K defined for the usual normed space interpolation.
Proof. 
Let x X 0 X 1 and x = x 0 + x 1 X 0 + X 1 . Consider the admissible linking sequence from x to 0 in X 0 X 1 :
y 0 = x , y 1 = x 0 , y 2 = 0 , y 3 = x 1 , y 4 = 0
and in X 1 , consider the norm t · 1 . We have
K M ( t , x ) k = 0 3 h t ( y k , y k + 1 ) = h t ( y 0 , y 1 ) + h t ( y 1 , y 2 ) + h t ( y 2 , y 3 ) + h t ( y 3 , y 4 ) = h t ( x 1 , 0 ) + h t ( x 0 , 0 ) + h t ( x 1 , 0 ) + h t ( x 1 , 0 ) 3 ( x 0 0 + t x 1 1 ) .
Therefore, taking the infimum over all the decompositions x 0 + x 1 = x in the space X 0 + X 1 , we obtain
K M ( t , x ) 3 K N ( t , x ) ,
for all x X 0 X 1 and for all t > 0 . Now, let ( x n x , 0 ) be an admissible linking sequence from x to 0 in X 0 X 1 . We have
k = 0 n 1 ( x k x k + 1 ) = x , w i t h s u m i n X 0 + X 1 .
For each pair x k , x k + 1 that belongs to the intersection, one has
K N ( t , x k x k + 1 ) x k x k + 1 0 + t 0 1 , i f x k , x k + 1 X 0
and
K N ( t , x k x k + 1 ) 0 0 + t x k x k + 1 1 , i f x k , x k + 1 X 1 .
Thus, we can write
K N ( t , x k x k + 1 ) h t ( x k , x k + 1 ) = min { x k x k + 1 0 , t x k x k + 1 1 } .
If x k , x k + 1 X i X 1 i , with i { 0 , 1 } , we have
K N ( t , x k x k + 1 ) t i x k x k + 1 i = h t ( x k , x k + 1 ) .
Then,
K N ( t , x ) = K N ( t , k = 0 n 1 x k x k + 1 ) k = 0 n 1 K N ( t , x k x k + 1 ) k = 0 n 1 h t ( x k , x k + 1 ) .
Taking the infimum over all admissible linking sequences from x to 0 in X 0 X 1 , we obtain K N ( t , x ) K M ( t , x ) .  □
Proposition 15.
Given a pair of compatible normed spaces ( X 0 , X 1 ) X , θ ( 0 , 1 ) and 1 q < , let Z = X 0 X 1 be equipped with the usual norm of the K-normed interpolated space:
z θ , q , K N = ( 0 [ t θ K N ( t , z ) ] q d t t ) 1 / q .
If in X = X 0 + X 1 , we consider the norm K N ( 1 , · ) , and M is the relative completion of Z in X = X 0 + X 1 , then M = X ¯ θ , q K N , where X ¯ θ , q K N is the usual normed interpolated space.
Proof. 
Let x M . By the definition of M, there is a sequence ( x n ) of points in Z = X 0 X 1 such that
( 1 ) x n x X 0 + X 1 0 ,
( 2 ) lim m , n x m x n θ , q , K N = 0
Since
lim n K N ( 1 , x n x ) = lim n x n x X 0 + X 1 = 0
and K N ( 1 , · ) is equivalent to K N ( t , · ) , for all t > 0 , it follows that lim n K N ( t , x n x ) = 0 for all t > 0 , or lim n K N ( t , x n ) = K N ( t , x ) , for all t > 0 . For each t > 0 and each n N let f n ( t ) = ( t θ K N ( t , x n ) ) q / t . Since ( x n ) is a Cauchy sequence in ( X 0 X 1 , · θ , q , K N ) , there is γ > 0 so that for all n N ,
0 f n ( t ) d t = x n θ , q , K N q γ ,
since, in a metric space, every Cauchy sequence is bounded. Therefore, each f n is measurable, and
lim n f n ( t ) = lim n ( t θ K N ( t , x n ) ) q / t = ( t θ K N ( t , x ) ) q / t : = f ( t ) .
From Fatou’s Lemma,
0 lim n inf f n ( t ) d t lim n inf 0 f n ( t ) d t ,
that is,
x θ , q , K N q = 0 [ t θ K N ( t , x ) ] q d t t lim n inf x n θ , q , K N q γ < .
Thus, x X ¯ θ , q K N .
Consider now x X ¯ θ , q K N . As q < , then for x X ¯ θ , q K N , and by the density of X 0 X 1 in X ¯ θ , q K N , we conclude that there is a sequence ( x n ) X 0 X 1 such that
( * ) x n x θ , q , K N 0 .
Then, by ( * ) we have x n x X 0 + X 1 0 because the interpolated space is continuously included in X 0 + X 1 . Since every convergent sequence is a Cauchy sequence, ( x n ) is a Cauchy sequence on X such that
lim n d X ( x n , x ) = lim n x n x X 0 + X 1 = 0 .
This shows that x M . So, we obtain M = X ¯ θ , q K N .  □
Lemma 16.
Given a pair of compatible normed spaces ( X 0 , X 1 ) X , θ ( 0 , 1 ) , and 1 q < , consider X 0 X 1 equipped with the usual norm
β θ , q , X ¯ = z θ , q , K N = ( 0 [ t θ K N ( t , z ) ] q d t t ) 1 / q .
Consider in X = X 0 + X 1 the norm d X ( x , y ) = K N ( 1 , x y ) . If · θ , q , X ¯ is the norm of the relative completion of ( X 0 X 1 , β θ , q , X ¯ ) in ( X , d X ) , then for all x X ¯ θ , q K N ,
x θ , q , X ¯ = x θ , q , K N .
Proof. 
Let x X ¯ θ , q K N . By Proposition 15, there is a sequence ( x n ) of points in X = X 0 X 1 such that
( 1 ) x n x X 0 + X 1 0 ,
( 2 ) lim m , n x m x n θ , q , K N = 0 .
Since
lim n K N ( 1 , x n x ) = lim n x n x X 0 + X 1 = 0
and K N ( 1 , · ) is equivalent to K N ( t , · ) , for all t > 0 , it follows that lim n K N ( t , x n x ) = 0 , or lim n K N ( t , x n ) = K N ( t , x ) , for all t > 0 . For each t > 0 and each n N , let f n ( t ) = ( t θ K N ( t , x n ) ) q / t . Since ( x n ) is a Cauchy sequence in ( X 0 X 1 , · θ , q , K N ) , it follows that there is γ > 0 such that for all n N ,
0 f n ( t ) d t = x n θ , q , K N q γ .
Therefore, each f n is measurable, and
lim n f n ( t ) = lim n ( t θ K N ( t , x n ) ) q / t = ( t θ K N ( t , x ) ) q / t : = f ( t ) .
From Fatou’s Lemma,
0 lim n inf f n ( t ) d t lim n inf 0 f n ( t ) d t ,
that is,
x θ , q , K N q = 0 [ t θ K N ( t , x ) ] q d t t lim n inf x n θ , q , K N q = lim n x n θ , q , K N q .
Taking the infimum over all approximating sequences x in ( X 0 X 1 , β θ , q , X ¯ ) , we have
x θ , q , K N q β θ , q , X ¯ ¯ ( x , 0 ) ,
where β θ , X ¯ ¯ is the distance associated with the metric β θ , q , X ¯ . As this inequality is valid for all x X ¯ θ , q K N , it follows that
x θ , q , K N x θ , q , X ¯ ,
for all x X ¯ X . Since X 0 X 1 is dense in the completion of ( X 0 X 1 , β θ , q , X ¯ ) in ( X , d X ) , for all x, there is a sequence ( x n ) of points in X 0 X 1 such that
x n x θ , q , X ¯ 0 .
Hence, from (36), ( x n ) is a sequence convergent to x in the norm · θ , q , K N . Since ( X 0 X 1 , · θ , q , K N ) is continuously embedded in the relative completion ( X ¯ θ , q K N , · θ , q , X ¯ ) , for all n N , we have
x n θ , q , X ¯ x n θ , q , K N .
Taking n in the above inequality, we have
x θ , q , X ¯ x θ , q , K N ,
for any x X ¯ X . So, we obtain x θ , q , X ¯ = x θ , q , K N as we wanted.  □
Corollary 3.
Let ( X 0 , X 1 ) be a pair of compatible normed spaces, θ ( 0 , 1 ) and q [ 1 , ) , and let X θ , q K M be the interpolated space obtained with the functional K M , with norm · θ , q , K M . If X ¯ θ , q K N is the usual interpolated space of normed spaces, with norm · θ , q , K N , then, considering X = X 0 + X 1 with metric · X 0 + X 1 , we have
X ¯ θ , q K N = X θ , q K M ,
with continuous inclusion and norms satisfying
x θ , q , K N x θ , q , K M 3 x θ , q , K N .
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 X = ( X 0 , X 1 ) is a pair of compatible normed spaces. In what follows, J N denotes the usual J functional.
Lemma 17.
Let X = ( X 0 , X 1 ) be a compatible pair of normed spaces. So, α θ , q , X is a norm over X 0 X 1 .
Proof. 
Since α θ , q , X is a metric over X 0 X 1 , we only need to show that it is translation invariant, and that given λ R , we   have   α θ , q , X ( λ x , y ) = | λ | α θ , q , X ( x , y ) .
Given x , y , z X 0 X 1 , let ( x n x , y ) be a linking sequence from x to y in X 0 X 1 and let ( k 0 , k 1 , , k n 1 ) be a sequence of integers. Then,
k j = i J M ( 2 i , x j , x j + 1 ) = k j = i J M ( 2 i , x j + z , x j + 1 + z ) .
Therefore, the sequence derived from x to y is equal to the sequence derived from x + z to y + z . This shows that α θ , q , X is translation invariant on X 0 X 1 . Now, if λ R ,
k j = i J M ( 2 i , λ x j , λ x j + 1 ) = | λ | k j = i J M ( 2 i , x j , x j + 1 ) .
Consequently, α θ , q , X ( λ x , y ) = | λ | α θ , q , X ( x , y ) .  □
Proposition 16.
Let X = ( X 0 , X 1 ) be a compatible pair of normed spaces. Then,
α θ , q ( a , 0 ) C a θ , q , J N
and
α θ , q ( a , 0 ) ( 1 + 2 ( 1 θ ) q ) 1 / q a θ , q , J N + J N ( 1 , a ) ,
for all a X 0 X 1 .
Proof. 
We have that α θ , q ( a , 0 ) C a θ , q , J N follows from
α θ , q ( a , 0 ) γ β θ , q ( a , 0 ) a θ , q , K a θ , q , J N .
Now, let ( a j ) j Z be such that the following hold:
(i) 
a j X 0 X 1 for all j Z ,
(ii) 
j Z a j = a , ( convergence   in   X 0 + X 1 ) ,
(iii) 
( J N ( 2 j , a j ) ) λ θ , q < .
Consider the following linking sequence from 0 to a,
x 0 = 0 , x 1 = a 1 , x 2 = 0 e x 3 = a ,
and the triple of integers given by { ( 1 , 2 , 0 ) } . For each i Z , we have
c i = J M ( 2 1 , x 0 , x 1 ) , if   i = 1 J M ( 2 2 , x 1 , x 2 ) , if   i = 2 J M ( 1 , x 2 , x 3 ) , if   i = 0 0 a . o .
Note that
Φ θ , q ( ( c ) ) = ( i Z [ 2 i θ c i ] q ) 1 / q = ( [ 2 θ c 1 ] q + [ 2 2 θ c 2 ] q + [ c 0 ] q ) 1 / q = ( [ 2 θ J M ( 2 1 , 0 , x 1 ) ] q + [ 2 2 θ J M ( 2 2 , x 1 , 0 ) ] q + [ J M ( 1 , 0 , a ) ] q ) 1 / q ( [ 2 θ J N ( 2 1 , a 1 ) ] q + [ 2 2 θ J N ( 2 2 , a 1 ) ] q + [ J N ( 1 , a ) ] q ) 1 / q [ ( 1 + 2 ( 1 θ ) q ) [ 2 θ J N ( 2 1 , a 1 ) ] q + [ J N ( 1 , a ) ] q ] 1 / q [ ( 1 + 2 ( 1 θ ) q ) i Z [ 2 i θ J N ( 2 i , a i ) ] q ] 1 / q + J N ( 1 , a ) = ( 1 + 2 ( 1 θ ) q ) 1 / q ( J N ( 2 i , a i ) ) i Z λ θ , q + J N ( 1 , a ) , n Z .
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 R and C , which appear in the literature and which lack a specific treatment in interpolation theory

8.1. The Spaces Q [ r ] and Q [ s ]

Given a prime number p, we define the set
Q [ p ] : = { a + b p ; a , b Q } .
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 Q [ x ] , by the maximal ideal generated by the irreducible polynomial x 2 p . 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 r , s N be distinct prime numbers. Consider X 0 = Q [ r ] , X 1 = Q [ s ] , and X = R provided with the induced metric of the absolute value of R . We have that X 0 X 1 = Q and, for x , y X 0 X 1 and t > 0 ,
min { 1 , t } d X ( x , y ) K M ( t , x , y ) min { 1 , t } J M ( 1 , x , y ) .
Note that d X ( x , y ) = | x y | and J M ( 1 , x , y ) = | x y | . Then,
min { 1 , t } | x y | K M ( t , x , y ) min { 1 , t } | x y | .
Consequently,
D θ , q ( x , y ) = M θ , q | x y | ,
where M θ , q = Φ θ , q ( min { 1 , · } ) .
This gives that the interpolated space is the whole line, because if z R , there is a Cauchy sequence ( z n ) in ( Q , | · | ) such that | z n z | 0 . Consequently, ( z n ) is a Cauchy sequence in ( Q , M θ , q | · | ) and M θ , q | z n z | 0 . So, z X θ , q K . Since the reverse inclusion is immediate from the definition of Cauchy completion, we have R = X θ , q K M
Let us now determine what is the interpolated space X θ , q J M . From the inclusion of J M -space in K M -space, it follows that
1 2 γ θ , , 1 D θ , q ( x , y ) d θ , q ( x , y ) ,
for all x , y Q . We know that D θ , q ( x , y ) = M θ , q | x y | and
d θ , q ( x , y ) 2 θ t θ J M ( t , x , y ) ,
for all x , y Q and for all t > 0 . From these inequalities, we have, for x , y Q ,
M θ , q 2 γ θ , , 1 | x y | d θ , q ( x , y ) 2 θ t θ J M ( t , x , y ) , t > 0 .
For
t = 2 [ 4 2 2 θ + 2 2 θ 1 ] 1 / θ [ ( 1 θ ) θ q ] 1 / ( θ q ) ,
we have
M θ , q 2 γ θ , , 1 | x y | d θ , q ( x , y ) M θ , q 2 γ θ , , 1 J M ( t , x , y ) .
If for the values of θ and q, we have t 1 , then d θ , q ( x , y ) = M θ , q 2 , γ θ , , 1 | x y | for all x , y Q . Then, R = X θ , q K M = X θ , q J M 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 R ω = { ( x 1 , x 2 , x 3 , ) ; x k R , k N } . Over R ω , consider the pointwise operations of sum and scalar multiplication. Endowed with these operations, R ω is a linear space over R .
Definition 18
(The pointwise convergence in R ω ). Let ( x i ) be a sequence in R ω . We say that ( x i ) converges to x = ( x k ) k N in R ω , if for every k N , the numeric sequence ( x k i ) , formed by the k-th coordinates of the sequence points ( x i ) , converges to the k-th coordinate of x, that is,
lim i x i = x lim i x k i = x k ,
for all k N .
Proposition 17.
Consider in R ω the pointwise convergence. Then, R ω does not admit a norm.
Proof. 
Suppose that there is a norm · on R ω that represents its pointwise convergence; that is, if ( x i ) converges to x, then x x i 0 if i . For every i N , let e i be the sequence with 1 in the i-th coordinate and 0 in all the others. Now, define x i = e i e i . Then, we have that x i converges to the null sequence ( 0 , 0 , ) since
lim i x i = ( 0 , 0 , ) .
But
lim i x i = 1 0 .
Therefore, no norm can define pointwise convergence in R ω .  □
Proposition 18.
The space R ω endowed with the function
d ω ( ( x k ) , ( y k ) ) : = k = 1 | x k y k | 2 k ( 1 + | x k y k | ) ,
where ( x k ) , ( y k ) R ω , is a complete metric space, and then, ( R ω , d ω ) 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
f ( x ) = x x + 1 .
Then, we have
f ( x + y ) f ( x ) + f ( y ) x + y 1 + x + y x 1 + x + y 1 + y 1 1 1 + x + y 2 1 1 + x 1 1 + y 1 1 + x + 1 1 + y 1 + 1 1 + x + y ( 1 + x + y ) ( 1 + y ) + ( 1 + x + y ) ( 1 + x ) ( 2 + x + y ) ( 1 + x ) ( 1 + y ) 1 + x + y ( 1 + x ) ( 1 + y ) x y 0 ,
and the result comes straight from this.
For the completeness, let ( x k ) be a Cauchy sequence in ( R ω , d ω ) . Let x j k stand for the j-th coordinate of the k-th term of the sequence ( x k ) . We have that the function f ( x ) is increasing for x 0 . Since ( x k ) is a Cauchy sequence, given ε > 0 , there is k 0 N such that for m , n k 0 and j N , we have d ω ( x m , x n ) < 2 j ε 1 + ε . Thus,
2 j | x j m x j n | 1 + | x j m x j n | k = 1 2 k | x k m x k n | 1 + | x k m x k n | = d ω ( x m , x n ) < 2 j ε 1 + ε .
That is,
f ( | x j m x j n | ) = | x j m x j n | 1 + | x j m x j n | < ε 1 + ε = f ( ε ) ,
implies that | x j m x j n | < ε for every j N and m , n k 0 . Thus, we have that ( x j m ) is a Cauchy sequence of real numbers for every m k 0 and all j N . Since R is complete, for every m k 0 , there is x m R such that | x j m x m | 0 as j . If we set x = ( x 1 , x 2 , x 3 , ) , we have d ω ( x k , x ) 0 as k . This concludes the proof.  □
Proposition 19.
Let
: = { ( x n ) R ω ; ( x n )   i s   b o u n d e d } .
Then, R ω , and this inclusion is Lipschitz-continuous.
Proof. 
For a sequence ( z n ) , we set
( z n ) : = sup n N | z n | .
This is the usual norm for this space, and ( , · ) is a Banach space. Let ( x i ) and ( y i ) be two sequences in . Now, for a fixed j N , we have
k = 1 j | x k y k | 2 k ( 1 + | x k y k | ) k = 1 j ( x i ) ( y i ) 2 k ( 1 + | x k y k | ) k = 1 j ( x i ) ( y i ) 2 k .
Taking the limit as j , we have
d ω ( ( x i ) , ( y i ) ) ( x i ) ( y i ) .

8.2.1. First Example

Let c 00 be the space of the sequences with only finitely many non-null terms. It is clear that c 00 . Now, set X 0 = c 00 and d X 0 = · · and X = R ω with d X = d ω . For θ ( 0 , 1 ) and q [ 1 , ) , we have
c 00 ( X , X 0 ) θ , q , K R ω ,
with Lipschitz-continuous inclusions.
Proposition 20.
X 0 is not a dense subspace of ( X , d X ) .
Proof. 
It is sufficient to prove that
c 0 : = { ( x n ) R ω ; x n 0 }
is closed in ( R ω , d ω ) , since c 00 c 0 . Let ( x k ) be a sequence of points in c 0 such that d X ( x k , x ) 0 for some x X . If x j k stands for the j-th coordinate of the k-th term of ( x k ) and x = ( x j ) , from d X ( x k , x ) 0 , we can write
lim j | x j k x j | = 0 , k N .
Then, since
| x j | | x j k x j | + | x j k | , j , k N ,
it follows that x c 0 . This proves that c 0 is a closed set in the metric topology.  □
Corollary 4.
( X , X 0 ) θ , q , K M X .
Proof. 
It is easy to see that c 00 ( X , X 0 ) θ , q , K M c 00 ¯ c 0 , where c 00 ¯ stands for the metric closure of c 00 . The sequence ( 1 , 1 , 1 , ) R ω c 0 . Then, we have ( X , X 0 ) θ , q , K M X , as desired.  □
Proposition 21.
c 00 ( X , X 0 ) θ , q , K M .
Proof. 
Consider the inequality
C θ , q d X ( x , y ) β θ , q ( x , y ) B θ , q x y , x , y X 0 ,
where C θ , q , B θ , q > 0 are suitable constants depending only on θ and q.
Since c 00 is dense in ( r , · r ) (for 1 r < + ) and · η r · r in r , where η r > 0 is a suitable constant, it follows that if x r , then there is a sequence ( x k ) in c 00 such that x k x 0 . Due to inequality (40), we have that x ( X , X 0 ) θ , q , K M for all x r . Then, r ( X , X 0 ) θ , q , K M . Since r c 00 , we have the result.  □
As the final result, we have c 00 ( X , X 0 ) θ , q , K M R ω with strict inclusions.
Remark 12.
Actually, we proved more above. We also have that
c 00 r 1 r ( X , X 0 ) θ , q , K M R ω .
Remark 13.
If we want to generate spaces that are strictly intermediary, we have to seek the case where X 0 is neither dense nor closed in ( X , d X ) . Observe that it does not depend directly on the metric d X 0 .

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 ( R ω , d ω ) .
Proof. 
Let ( x k ) be a convergent sequence of points in such that d ω ( x k , x ) 0 as k , for some x R ω . Then, if x j k stands for the j-th coordinate of the k-th term of ( x k ) and x = ( x j ) , from d ω ( x k , x ) 0 , we have
lim j | x j k x j | = 0 , k N .
Notice that
| x j | | x j x j k | + | x j k | , j , k N .
Since ( x k ) is convergent, it follows that d ω ( x k , 0 ) M for all k N . Then, | x j k | M for all j , k N . The result is straightforward based on these statements.  □
Since is closed in R ω with respect to the metric d ω , if we interpolate in R ω , we obtain = ( R ω , ) θ , q , K M , which follows from ( R ω , ) θ , q , K M ¯ = .

8.3. Non-Trivial Interpolation: Conditions

Analyzing the examples, we obtain some conditions to guarantee that the interpolation space does not get stuck in X 0 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 X 0 is closed in ( X , d X ) , then the interpolation space is equal to X 0 .
Proof. 
We have the inclusions X 0 ( X , X 0 ) θ , q , K M X 0 ¯ for θ ( 0 , 1 ) and q 1 . This statement arises from observing that if ( x k ) is a Cauchy sequence in ( X 0 , d X 0 ) , then ( x k ) is a Cauchy sequence in ( X , d X ) , and it gives that the interpolation space is contained in the closure of X 0 in ( X , d X ) .  □
Proposition 24.
If X 0 is not dense in ( X , d X ) , then ( X , X 0 ) θ , q , K M X .
Proof. 
If X 0 is not dense, then X 0 ¯ X . Since X 0 ( X , X 0 ) θ , q , K M X 0 ¯ , we have the result.  □
Corollary 5.
If X 0 is not dense and not closed in ( X , d X ) , then for all 0 < θ < 1 and 1 q < , we have
X 0 ( X , X 0 ) θ , q , K M X
and these inclusions are strict.
Proof. 
Immediate.  □
Remark 14.
It is worth mentioning that due to Corollary 3, the same conditions are valid for normed spaces in the cases where θ ( 0 , 1 ) and q [ 1 , ) .

9. Conclusions

In this work, we developed an interpolation theory for metric spaces inspired by the real method of interpolation. Under certain conditions, these interpolation spaces preserve Lipschitz operators. We also demonstrate that this method, while valid in metric spaces, retains its validity in normed spaces without requiring any algebraic structure. Furthermore, we applied this metric space interpolation method to normed spaces and found that it is equivalent to the K-method widely studied in the literature. As an application, we considered the interpolation of Fréchet sequence spaces. For future research, we suggest obtaining more general results for the interpolation of compact operators, as well as a reiteration-like theorem.
Also, fixed point theory is a very important research topic in metric and Banach spaces. Recent works have obtained fixed-point results for multi-valued mappings in b-metric spaces as well as in some contexts of interpolation theory; see [19,20]. Thus, we suggest studying possible connections between these works and the theory developed in the current work.

Author Contributions

Conceptualization, E.B.d.S.; Methodology, R.M.M.S.; Validation, D.L.F. and E.B.d.S.; Formal analysis, R.M.M.S., D.L.F. and E.B.d.S.; Investigation, R.M.M.S.; Writing—original draft, R.M.M.S.; Writing—review & editing, E.B.d.S. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Data is contained within the article.

Acknowledgments

The authors thank the referees for their valuable feedback and suggestions.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Bergh, J.; Löfström, J. Interpolation Spaces: An Introduction; Springer: Berlin/Heidelberg, Germany, 1976. [Google Scholar]
  2. Calderón, A.P. Intermediate spaces and interpolation. Studia Math. 1964, 1, 31–34. [Google Scholar]
  3. Lions, J.L.; Peetre, J. Sur une classe d’espaces d’interpolation. Inst. Hautes Etudes Sci. Publ. Math. 1964, 253, 5–68. [Google Scholar] [CrossRef]
  4. Aronszajn, N.; Gagliardo, E. Interpolation space and interpolation methods. Ann. Mat. Pura Appl. 1965, 68, 51–117. [Google Scholar] [CrossRef]
  5. Peetre, J. Theory of Interpolation of Normed Spaces; Notes de Brasilia; Instituto de Matemática Pura e Aplicada, Conselho Nacional de Pesquisas: Rio de Janeiro, Brazil, 1968; Volume 39. [Google Scholar]
  6. Peetre, J.; Sparr, G. Interpolation of normed Abelian groups. Ann. Mat. Pura Appl. 1972, 92, 217–262. [Google Scholar] [CrossRef]
  7. Brudnyî, Y.; Krugljak, Y.N. Interpolation Functors and Interpolation Spaces; Elsevier: Amsterdam, The Netherlands, 1991. [Google Scholar]
  8. Krée, P. Interpolation d’espaces qui ne sont ni norés ni complets. Ann. Inst. Fourier 1968, 17, 137–174. [Google Scholar] [CrossRef]
  9. Peetre, J. Interpolation of Lipschitz operators and metric spaces. Mathematica 1970, 12, 325–334. [Google Scholar]
  10. Gustavsson, J. Interpolation of Metric Spaces; Technical Report; Lund University: Lund, Sweden, 1971. [Google Scholar]
  11. Chrzaszcz, K.; Jachymski, J.; Turobos, F. Two refinements of Frink’s metrization theorem and fixed point results for Lipschitzian mappings on quasimetric spaces. Aequat. Math. 2019, 93, 277–297. [Google Scholar] [CrossRef]
  12. Persson, A. Compact linear mappings between interpolation spaces. Ark. Mat. 1964, 5, 215–219. [Google Scholar] [CrossRef]
  13. Hayakawa, K. Interpolation by the real method preserves compactness of operators. J. Math. Soc. Jpn. 1969, 21, 31–34. [Google Scholar] [CrossRef]
  14. Cobos, F.; Fernandez, D.L. On interpolation of compact operators. Ark. Mat. 1989, 27, 211–217. [Google Scholar] [CrossRef]
  15. Cobos, F.; Edmunds, D.E.; Potter, A.J.B. Real interpolation and compact linear operators. J. Func. Anal. 1990, 88, 351–365. [Google Scholar] [CrossRef]
  16. Cwikel, M. Real and complex interpolation and extrapolation of compact operators. Duke Math. J. 1992, 65, 333–343. [Google Scholar] [CrossRef]
  17. Cwikel, M.; Kalton, N. Interpolation of compact operators by the methods of Calderón and Gustavsson-Peetre. arXiv 1992, arXiv:math/9210206. [Google Scholar] [CrossRef]
  18. Meise, R.; Vogt, D. Introduction to Functional Analysis; Oxford University Press: Oxford, UK, 1997. [Google Scholar]
  19. Abbas, M.; Anjum, R.; Riasat, S. A new type of fixed point theorem via interpolation of operators with application in homotopy theory. Arab. J. Math. 2023, 12, 277–288. [Google Scholar] [CrossRef]
  20. Ćirić, L.; Abbas, M.; Rajovic, M.; Ali, B. Suzuki type fixed point theorems for generalized multi-valued mappings on a set endowed with two b-metrics. App. Math. Comp. 2012, 219, 1712–1723. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Sette, R.M.M.; Fernandez, D.L.; da Silva, E.B. A Theory for Interpolation of Metric Spaces. Axioms 2024, 13, 439. https://doi.org/10.3390/axioms13070439

AMA Style

Sette RMM, Fernandez DL, da Silva EB. A Theory for Interpolation of Metric Spaces. Axioms. 2024; 13(7):439. https://doi.org/10.3390/axioms13070439

Chicago/Turabian Style

Sette, Robledo Mak’s Miranda, Dicesar Lass Fernandez, and Eduardo Brandani da Silva. 2024. "A Theory for Interpolation of Metric Spaces" Axioms 13, no. 7: 439. https://doi.org/10.3390/axioms13070439

APA Style

Sette, R. M. M., Fernandez, D. L., & da Silva, E. B. (2024). A Theory for Interpolation of Metric Spaces. Axioms, 13(7), 439. https://doi.org/10.3390/axioms13070439

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop