Você está na página 1de 27

# Algebra i analiz Tom.

17 (2005), 2

## INTERPOLATION OF INTERSECTIONS BY THE REAL METHOD

S. V. ASTASHKIN Abstract. Let (X0 , X1 ) be a Banach couple with X0 X1 dense both in X0 and in X1 , and let (X0 , X1 ),q (0 < < 1, 1 q < ) denote the real interpolation spaces. Suppose is a linear functional dened on some linear subspace M X0 +X1 and satisfying (X0 X1 ) , = 0. Conditions are considered that ensure the natural identity (X0 Ker, X1 Ker),q = (X0 , X1 ),q Ker. The results obtained provide a solution for the problem posed by N. Kruglyak, L. Maligranda, and L.-E. Persson and pertaining to interpolation of couples of intersections that are generated by an integral functional in a weighted Lp -scale. Furthermore, an expression is found for the K-functional on a couple of intersections corresponding to a linear functional, and some other related questions are treated.

Introduction Let (X0 , X1 ) be a normed couple, i.e., a couple of normed spaces embedded linearly and continuously in a Hausdor linear topological space T . For x X0 + X1 and t > 0, we dene the Peetre K-functional K(t, x; X0, X1 ) = inf{ x0
X0

+ t x1

X1

: x = x0 + x1 , x0 X0 , x1 X1 }.

If 0 < < 1 and 1 q < , the real interpolation space X,q = (X0 , X1 ),q consists of all x X0 + X1 with

,q

=
0

t K(t, x : X0 , X1 )

q dt

1/q

< .

Next, if (X0 , X1 ) is a Banach couple, then each linear subspace N T determines the normed (in general, non-Banach) couple (X0 N, X1 N ) of intersections. The norm on Xi N is simply the restriction of the norm of Xi (i = 0, 1). Now, it is natural to look for conditions ensuring the natural identity (0.1) (X0 N, X1 N ),q = (X0 , X1 ),q N (with equivalence of the norms). This formula is true if, for instance, (X0 , X1 ) is a couple of Banach function lattices and N is a linear space of functions (on the same measure space) with the lattice property: if g N and |f| |g|, then f N (see [1, Remark 2]). On the other hand, if we take the couple (L1 [0, 1], L[0, 1]) for (X0 , X1 ) and the closed linear span [rn ] of the Rademacher system in L1 [0, 1] for N , then (0.1) fails. Indeed, by the Khinchin inequality, Lp [rn] l2 for 1 p < , and L [rn ] l1 . Thus, calculating the interpolation
2000 Mathematics Subject Classication. Primary 46B70. Key words and phrases. Interpolation space, real interpolation method, K-functional, dilation indices of a function, spaces of measurable functions, weighted spaces.
c 2004 American Mathematical Society

S. V. ASTASHKIN

2 spaces in (0.1) for arbitrary 0 < < 1 and q = 1+ (see [2, Theorem 5.2.1]), we arrive at (X0 N, X1 N ),q lq , and (X0 , X1 ),q N l2 . In this paper we are interested in the case where N is the kernel of a linear functional dened on some linear subspace D T . An important particular case of this problem was treated in . Namely, in that paper certain conditions on (0, 1), p [1, ), and on weight functions w0 (x) and w1 (x) were found ensuring the formula

(0.2)

## (Lp (w0 ) N, Lp (w1 ) N ),p = (Lp (w0 ), Lp (w1 )),p N,

where Lp (w) is the weighted Lp -space on (0, ) with the usual norm, and N is the space of all functions f : (0, ) R satisfying

(0.3)
0

f(x) dx = 0.

It turned out that the validity of (0.2) is closely related to the possibility to interpolate certain Hardy-type integral inequalities. In the same paper , the following more general question was asked: Under what conditions on w0 (x), w1 (x), p0 , p1 [1, ), (0, 1), and q [1, ] do we have the identity (0.4) (Lp0 (w0 ) N, Lp1 (w1 ) N ),q = (Lp0 (w0 ), Lp1 (w1 )),q N ? (Generally speaking, here p0 = p1 , but N is still determined by (3).) It is well known (see [2, Chapter 5]) that the standard equivalent expressions for the K-functional on the couple (Lp0 (w0 ), Lp1 (w1 )) dier substantially in the cases of p0 = p1 and of p0 = p1 ; as a result, the latter question is highly more complicated than that treated in . This was the origin for the following general problem. Suppose (X0 , X1 ) is a Banach couple with Xi T (i = 0, 1) and such that X0 X1 is dense both in X0 and in X1 . Next, let be a linear functional dened on some linear space D T , let belong to (X0 X1 ) , and let (x) = 0 for some x X0 X1 . We shall see that, for the validity of the formula (0.5) (X0 Ker , X1 Ker ),q = (X0 , X1 ),q Ker , of primary importance are four indices , , 0, and , related to the Peetre K-functional K(t, ; X0 , X1 ) in the couple (X0 , X1 ) of dual spaces. These indices satisfy the inequalities 0 min(0 , ) max(0 , ) 1. It will be shown that, under the additional condition 0 , the norms of the interpolation spaces X,q = (X0 , X1 ),q and N,q = (N0 , N1 ),q are equivalent on N := X0 X1 Ker if and only if (0, ) ( , 0) (, 1) (see Theorem 1). Here Ni is the space N endowed with the norm of Xi (i = 0, 1). So, the latter condition is necessary for (0.5) to be true. Furthermore, we shall show that if is dened on X0 X1 , (X0 X1 ) , then for every (0, ) ( , 0 ) (, 1) the functional admits extension by continuity to some space M X0 X1 such that (0.5) is fullled for the kernel of this extension (see Theorem 2). In the proof of Theorem 1, an approach developed by Ivanov and Kalton in  is used. The rst part of  was devoted to comparison of the interpolation spaces (X0 , X1 ),q and (Y0 , X1 ),q (0 < < 1, 1 q < ), where Y0 = Ker , X0 . The essence of that approach is in reduction of the general interpolation problem for subspaces to the study of the shift operator in a certain weighted lp -space. At the same time, the results of  are consequences of those obtained here (see Corollary 3 and Remark 2). It should be noted that interpolation of intersections and the problem studied in  are only partial (though important) cases of the general subspace interpolation problem formulated as early as in the monograph  by Lions and Magenes. Various aspects of

## INTERPOLATION OF INTERSECTIONS BY THE REAL METHOD

this general problem have been treated in  (the author is very far from claiming the completeness of this citation list). Under certain conditions, the results of the rst part of the paper allow us to answer the question from  mentioned above. In this setting, N is the kernel of the integral functional (f) = 0 f(x) dx. Not entering in the details, we only signalize that the answer depends essentially on p0 and p1 and has the simplest form in the case of powertype weights w1 and w2 . Specically (see Corollary 8), if 1 p0 p1 < and either (a) l > p0 1 and m 0, or (b) l > p0 1, l > m, and 0 m < p1 1, then (0.4) is p1 (lp0 +1) fullled with w0 (x) = xl and w1 (x) = xm if and only if = p1 lp0 m+p1 p0 . For general weights, the situation is dierent. For instance, it is shown (see Corollary 7) that for every numbers 0 a b c d 1 there exist weights w0 (x) and w1 (x) such that, for p0 = p1 = 1 and q [1, ), relation (0.4) is true if and only if (0, a) (b, c) (d, 1). Thus, the values of for which the natural interpolation identity (0.1) fails may ll one or two arbitrary subsegments of (0, 1) (cf. [1, Corollary 2, Remark 8]). Surely, a most natural approach to the subspace interpolation problem is via calculation of the K-functional for the couple of subspaces in question; see [1, 8, 12]. This problem proves to be interesting in itself and is treated in 3. In Theorem 3 an expression for K(t, x; X0 N, X1 N ) is found under the condition that the functional in question is dened on the set {y0 (t) X0 : y X0 N + X1 N, t > 0}, where y0 (t) is the rst summand in an optimal decomposition y = y0 (t) + y1 (t), yi (t) Xi (i = 0, 1), i.e., in a decomposition for which 1 ( y0 (t) 2
X0

+ t y1 (t)

X1 )

K(t, y; X0 , X1 ) y0 (t)

X0

+ t y1 (t)

X1

(t > 0).

Note that this condition is fullled in the case of weighted Lp -spaces that was treated in . Therefore, the theorem proved in the present paper extends the expressions for K(t, f; Lp(w0 ) N, Lp (w1 ) N ) obtained in  by direct inspection. In conclusion, we mention that a similar result for the couple (Y0 , X1 ), Y0 = Ker , X0 , was obtained by Wallsten  (see also [12, Theorem 2.1]). Denitions and notation. Let (X0 , X1 ) be an arbitrary normed couple. The denitions of the Peetre K-functional K(t, x; X0, X1 ) (x X0 + X1 , t > 0) and of the real interpolation spaces X,q = (X0 , X1 ),q (0 < < 1, 1 q < ) were given at the beginning of the paper. Analyzing the proof of the equivalence theorem [2, 3], we see that it remains true for normed (rather than merely for Banach) couples. Thus, the space X,q (with an equivalent norm) can be dened in terms of the J -functional J (t, x; X0 , X1 ) = max{ x
X0 , t

X1 }

(x X0 X1 ).

## Specically, X,q consists of all x X0 + X1 representable in the form x=

kZ

2k xk (convergence in X0 + X1 )

## with the norm inf

kZ

J (2k , xk ; X0 , X1 )

1/q

where the inmum is taken over all representation indicated above. Next, it will be tacitly assumed that X0 X1 is dense in X0 and in X1 . Therefore, we may consider the Banach couple (X0 , X1 ) of conjugate spaces, and if (X0 X1 ) ,

S. V. ASTASHKIN

then X0 + X1 (see [2, 3.7]). The function k(t) = K(t, ; X0 , X1 ) will play a crucial role in what follows; we have

(0.6)

s>0

k(ts) , k(s)

M0 (t) =

M (t) =

## k(ts) , smax(1,1/t) k(s) sup

which are semimultiplicative for t > 0, and so the following numbers are well dened: log2 M (t) log2 M (t) , = lim , t log2 t log2 t log2 M0 (t) log2 M (t) , = lim . 0 = lim t t0 log2 t log2 t = lim
t0

This numbers are called the dilation indices of k(t). It is easily seen that 0 min(0 , ) max(0 , ) 1. Now, putting n = (k(2n ))1 (n Z), we see that n > 0, and, since k(t) is monotone increasing and concave on (0, ), also (0.7) Furthermore, 1 k k 1 log2 sup , = lim log2 sup , n n n kZ n+k kZ kn 1 k k 1 0 = lim log2 sup , = lim log2 sup . n n n n n+k kn k0 k0 = lim
n

n n+1 2n

(n Z).

(0.8)

Let ek (k Z) denote the standard unit vectors in a sequence space, and let lq () be the space of two-sided numerical sequences a = (ak ) k= with the norm
1/q

q,

=
kZ

|ak |q q k

In what follows, we shall study the shift operator S(ak ) = (ak1 ), its inverse S 1 , and also the operators T = S 2 I (0 < < 1), where I is the identity mapping. By (0.7), both S and S 1 are bounded on lq (), and S 2, S 1 1. Next, by P+ and P we denote the projections

P+ (ak ) =
k=1

ak ek ,

P (ak ) =
k=1

ak ek ,

and r(T ) stands for the spectral radius of an operator T on lq (). Finally, writing F1 F2 we mean that there exist two constants c > 0, C > 0 with cF1 F2 CF1 . Usually, c and C do not depend on all (or some) of the arguments of the functions F1 and F2 .

## INTERPOLATION OF INTERSECTIONS BY THE REAL METHOD

1. Auxiliary results

Lemma 1. We have r(S) = 2 , r(S 1 ) = 2 , r(SP ) = 2 , and r(S 1 P+ ) = 20 . Proof. Since S n (ak ) = (akn ) and S n (ak ) = (ak+n ), we have k k , S n lq ()lq () = sup . S n lq ()lq () = sup kZ k+n kZ kn Thus, by (0.8), we see that r(S) = lim r(S 1 ) = lim Similarly,
n

sup
kZ

k kn k k+n

1/n

= 2 ,
1/n

sup
kZ

= 2 .

(SP )n (ak ) =
k=n

ak ek+n ,

(S 1 P+ )n (ak ) =
k=n

ak ekn ,

n = 1, 2, . . . ,

## and, therefore, (SP )n This results in r(SP ) = lim r(S 1 P+ ) = lim

n lq ()lq ()

= sup
k0

k , kn

(S 1 P+ )n

lq ()lq ()

= sup
k0

k . k+n

sup
k0

k kn k k+n

1/n

= 2 ,
1/n

sup
k0

= 20 .

The next key statement about properties of T = S2 I (I is the identity) is similar to Lemma 2.2 in . However, there is an important point of dierence. In  the functional belonged to X , which resulted in inf nZ n > 0. The latter condition implies that T is injective for every (0, 1). In the present more general setting, where (X0 X1 ) , the operator T may fail to be injective because inf nZ n may happen to be zero. Lemma 2. Suppose 0 < < 1 and 1 q < . Then T is an isomorphic embedding of lq () into lq () if and only if (0, ) ( , 0) (, 1). Moreover, if (0, ) (, 1), then Im T = lq (); if ( , 0), then Im T is the closed subspace of codimension 1 in lq () consisting of all (ak )kZ lq () with (1.1)
kZ

2kak = 0.

Proof. First, if (, 1), then Lemma 1 implies the inequality 2 > r(S), whence T is an automorphism of lq () onto lq (). The same is true for (0, ) because then r(S 1 ) < 2 (again by Lemma 1) and (1.2) T = 2 S(2 I S 1 ). We show that neither T nor T is an isomorphism of lq () onto lq (). Indeed, for every C with || = 1 the operators Q (ai ) = (i ai ) and Q (ai ) = (i+1 ai ) are isometries of lq (). Since S 2 I = Q1 T Q , the supposition that T is an isomorphism onto lq () would imply that all operators S 2 I ( C, || = 1) have the same property.

S. V. ASTASHKIN

But this contradicts the relation r(S) = 2 . Similarly, the supposition that T is an isomorphism onto lq () would imply the same property for S 1 2 I (apply (1.2) with = and take the relation S 1 2 I = Q (S 1 2 I)Q1 into account). This contradicts the fact that r(S 1 ) = 2 . Now we determine the possible form of Im T . Since
n1

T
i=0

2(n1i)ei

= en 2n e0 ,

we have en 2n e0 Im T for all n Z. Suppose f is a linear functional vanishing at every b Im T . Then f (en ) = 2n C. Thus, we may assume that f corresponds to the sequence (2n )nZ . Clearly, the condition f lq () is equivalent to the condition (1.3)
kZ q 2kq k < ,

where

1 1 + =1 q q

(with the usual modication if q = ). If f is a bounded functional, the HahnBanach theorem and the preceding arguments imply (1.4)

Im T = Ker f .

## On the other hand, if f lq () , then (1.5) Im T = lq ().

We show that if ( , 0 ), then the functional f is bounded and Im T is closed. Let + < < 0 for some > 0. By (0.8), we have k k sup C1 2n(0) , sup C2 2n(+) (n = 1, 2, . . . ), k0 k+n k0 kn whence (1.6) Therefore,

1 1 C1 2n(0) , n 0

1 1 C2 2n(+) n 0

(n = 1, 2, . . . ).

2n 1 1 C1 n 0
nZ n=0

2n(0+) + 1 C2 0
n=1

2n() < ,

i.e., (1.3) is true for every 1 q < , yielding f lq () . In order to prove that Im T , is closed, we represent lq () as follows: lq () = E + E0 + E+ , where E = [{en }n1 ]q, , E0 = [{e0 }]q, , and E+ = [{en }n1]q, (here [F ]q, is the closed linear span of a set F in the space lq ()). Since Im T = T (E ) + T (E0 ) + T (E+ ), T (E ) T (E+ ) = {0}, and the space T (E0 ) is one-dimensional, we see that it suces to prove that T (E) and T (E+ ) are closed. Since < < 0 , and r(SP ) = 2 , r(S 1 P+ ) = 20 by Lemma 1, it follows that the operators SP 2 I and S 1 P+ 2 I map lq () onto lq () isomorphically. Therefore, the image T (E ) = (SP 2 I)(E ) of the closed set E is also closed. Similarly, T (E+ ) is closed because S is an isomorphism of lq () and T (E+ ) = 2 S(S 1 P+ 2 I)(E+ ).

## INTERPOLATION OF INTERSECTIONS BY THE REAL METHOD

Furthermore, it is easily seen that T is injective for (0, 0) ( , 1). Indeed, the relation T a = 0 means that an1 = 2 an , i.e., an = 2n a0 (n Z). Since a lq (), we must have (1.7) |a0 |q
kZ

2kq q < . k

If, for instance, < 0 , then the rst inequality in (1.6) with 0 < < 0 shows that (1.7) is true only if a0 = 0, i.e., a = 0. But if > , we can argue similarly by using the second inequality in (1.6) with 0 < < . Thus, for < < 0 the operator T maps lq () isomorphically onto the subspace of codimension 1 consisting of all (ak ) lq () that satisfy (1.1). Next, suppose (0, ] [, 1) and T : lq () Im T is an isomorphism. Then there exists c > 0 such that (1.8) T a
lq ()

c a

lq ()

for all a lq (). For arbitrary (for the moment) n N and k Z, put a = (I +2 S + +2n S n )2 ek . Direct inspection shows that a n2n ek+n , whence (1.9)
2 T (I

lq () lq ()

n2n k+n .

n 2

+2

S ++ 2

S )

## = 2 (S 2 I)(2(n+1) S n+1 I)(I + 2 S + + 2n S n ) = 22 I 21(n1)S n+1 + 22nS 2n+2 . Consequently,

2 T a = 22 ek 21(n1)en+k+1 + 22ne2n+k+2 ,

## and inequalities (0.7) imply that

2 T a lq () 2qn q = (22 q 2q 2(n1)q q 2n+k+2 )1/q k n+k+1 + 2

2 T a lq ()

## 8 2n n+k 4(k + 22n2n+k ) 8 max(k , 22n2n+k ).

2 T a

Now we choose n with nc2 > 16. Then (1.8) and (1.9) imply yield
lq ()

c2 n2n n+k ,

n

## n+k < max(k , 2n+k ) (k Z)

with n = 2 n . Since < by assumption, for the number n chosen above we can nd k Z with n+k > 2n k , i.e., k+n > k . Therefore, k+2n > k+n by (1.10). Substituting k + n for k in (1.10) and arguing in the same way, we obtain k+3n > k+2n , and so on. Thus, the sequence (k+rn ) is monotone increasing. r=0 Let j k and m n. We nd 0 r1 r2 with k + (r1 1)n j k + r1 n, k + r2 n j + m k + (r2 + 1)n.

S. V. ASTASHKIN

k+r2 n 2r2 n k+r2 n j+m = r1 n 2n(r2 r1 ) . j k+r1 n 2 k+r1 n Since m 2n (r2 r1 )n, we see that j+m 2(m2n) (j k, m n), j or j sup C2m (m n). jk j+m But by (0.7), for k > 0 and 0 j k we have k k+m k j 2k , j+m k+m j+m k+m j C 2m j+m Taking (0.8) into account, we obtain sup
j0

Then

implying

(m n).

0 . n2n kn .

lq ()

by (0.7) we have
2 T b lq ()

## 22 k2n + 4 2n kn+1 + 22nk+2 4k2n + 8 2n kn + 4 22n k .

Again, if nc2 > 16, then (1.8) and (1.13) imply 2n kn < max(k2n, 22nk ), so that (1.14)
n

## kn < max(k , k2n)

(k Z),

where n = 2 n , as before. If > , then for n chosen above there exists k Z with kn > 2n k . Consequently, k < kn . Applying (1.14), we obtain kn < k2n. Repeating the arguments, we show that the sequence (krn ) is monotone increasing. r=0 If j k and m n, there exist 0 r1 r2 with k (r1 + 1)n j k r1 n, Then j k r2 n j m k (r2 1)n.

kr1 n 2r1 n kr1 n = r n 2n(r2r1 ) , mj kr2 n 2 2 kr2 n and since (r2 r1 )n m + 2n, we obtain j sup C2m (m n). jm jk As before, from this we deduce the estimate j C 2m sup j0 jm (m n).

## INTERPOLATION OF INTERSECTIONS BY THE REAL METHOD

This implies (1.12) by (0.8). Summarizing, we see that the operator T : lq () Im T is an isomorphism for (0, )( , 0 )(, 1), and it is not an isomorphism for (, )(0 , ) by (1.11) and (1.12). Furthermore, the operator T is Fredholm with index 0 for (0, ) (, 1) and it is Fredholm with index 1 for ( , 0). Since the set of all Fredholm operators with xed index is open, and for = and = the operator T is not an isomorphism onto lq (), the lemma is proved by (1.4) and (1.5). Remark 1. Lemma 2 and its proof show that, under the condition 0 , the operator T is an isomorphic embedding of lq () into lq () if and only if the image of T is closed. Indeed, since T is injective for (0, 0) ( , 1), it suces to consider the case where = 0 and show that T0 must be injective if its image is closed. But otherwise T is a Fredholm operator of constant index in some small neighborhood of 0 ; since it is injective for = 0 , it is an isomorphic embedding of lq () into lq (). However, its index can only be equal to zero, i.e., T (lq ()) = lq (). In particular, the index of T0 is also equal to zero, whence T0 (lq ()) is a closed subspace of codimension 1 in lq (). But this implies (1.3), consequently, (1.7) may only be fullled if a = 0, that is, T0 is injective, a contradiction. The following simple statement is contained in fact in [15, Lemma 3.2]. We include it for completeness. Lemma 3. For every Banach couple (Y0 , Y1 ), every y Y0 + Y1 , and t (0, 1] we have 1 K(t, y; Y0 , Y1 ) K(t, y; Y0 + Y1 , Y1 ) K(t, y; Y0 , Y1 ). 4 Proof. It suces to verify the left-hand inequality. By the denition of the K-functional, for every t > 0 there is a representation y = ut + vt with ut Y0 + Y1 , vt Y1 , and 1 K(t, y; Y0 + Y1 , Y1 ) ( ut Y0 +Y1 + t vt Y1 ). 2 For a similar reason, ut = ut + ut , where ut Y0 , ut Y1 and 0 1 0 1 1 t t u Y0+Y1 ( u0 Y0 + ut Y1 ). 1 2 Since t 1, it follows that K(t, y; Y0 + Y1 , Y1 ) 1 ( ut Y 0 + t ut + v t 1 0 4 1 K(t, y; Y0, Y1 ). 4

Y1 )

Lemma 4. For every Banach couple (X0 , X1 ) and arbitrary 0 < < 1 and 1 q we have (1.15) and (1.16) (X0 , X0 X1 ),q = (X0 , X1 ),q X0 . (X0 X1 , X1 ),q (X0 , X1 ),q X1 is obvious. Thus, the lemma will be proved if we show that (1.17) K(t, x; X0 X1 , X1 ) 2(K(t, x; X0, X1 ) + min(1, t) x
X1 )

## (X0 X1 , X1 ),q = (X0 , X1 ),q X1

Proof. Since (A0 , A1 ),q = (A1 , A0 )1,q , if suces to verify (1.15). The embedding

10

S. V. ASTASHKIN

for all x X1 and t > 0. If 0 < t 1, then K(t, x; X0 X1 , X1 ) = t x X1 , and (1.17) is fullled. Now, let t > 1. For x X1 and > 0, we nd a decomposition x = x0 + x1 , xi Xi (i = 0, 1), such that K(2t, x; X0, X1 ) (1 )( x0
X0

+ 2t x1

X1 ).

Then x0 X0 X1 . Since the K-functional is concave in t, the preceding inequality implies K(t, x; X0 X1 , X1 ) max( x0 x0
X0 1 X0 ,

x0

X1 )

+ t x1 + x

X1 X1

+ (t + 1) x1

X1

(1 ) K(2t, x; X0, X1 ) + x X1 2 (K(t, x; X0, X1 ) + x X1 ). 1 Since > 0 is arbitrary, (1.17) follows. A statement close to the above was obtained in . 2. Real interpolation for couples of intersections In what follows, (X0 , X1 ) is a Banach couple with X0 X1 dense both in X0 and in X1 , and X,q = (X0 , X1 ),q (0 < < 1, 1 q < ). Let be a linear functional with (X0 X1 ) , and let , , 0 , and be the dilation indices of the function k(t) = K(t, , X0 , X1 ). We denote N = Ker and N,q = (N0 , N1 ),q , where Ni is the space N endowed with the norm of Xi (i = 0, 1). Clearly, N,q X,q and x X,q x N,q (x N,q ). Theorem 1. If (2.1) (0, ) ( , 0 ) (, 1),

then the norms of the spaces N,q and X,q are equivalent on N. Under the condition 0 , the converse is also true: if the norms of N,q and X,q are equivalent on N, then (2.1) is fullled. Moreover, if (0, ) (, 1), then N,q is dense in X,q , and if ( , 0), then N,q is dense in some subspace of codimension 1 in X,q . Proof. First, suppose (2.1) is fullled. In the previous notation, by Lemma 2 we have (2.2) a
lq ()

B T a

lq () ,

a lq (),

with some B > 0. Furthermore, if a) (0, ) (, 1), then Im T = lq (), and if b) ( , 0 ), then Im T = Ker f , where the functional f lq () is dened by f (a) =
nZ

2n an ,

a = (an ) lq ().

## In case b) condition (1.3) is fullled, i.e.,

q 2kq K(2k , )q = C0 < ,

kZ

1 1 + =1 q q

(here and below K(t, ) := K(t, , X0 , X1 ), J (t, x) := J (t, x, X0, X1 )); therefore, can be extended up to a functional X,q [16, Theorem 3.7.2].

11

X,q

## = 1. Then there is a sequence {xk } X0 X1 such (J (2k , xk ))k

q

2k xk ,
kZ

2.

Since (X0 X1 ) by assumption, formula (0.6) implies |(xk )| K(2k , )J (2k , xk ) = 1 J (2k , xk ) k By (2.3), it follows that
1/q

(k Z).

(2.4)
kZ

|(xk )|q q k

(J (2k , xk ))k

2,

i.e., ((xk )) lq (). In case b) we assume additionally that x Ker . Since the series in (2.3) converges in k X,q , we have X,q and kZ 2 (xk ) = 0. Now, Lemma 2 shows that ((xk )) Im T both in case a) and in case b). Thus, there exists a sequence a lq () such that T a = ((xk )) and, moreover, a lq () 2B by (2.2) and (2.4). Using (0.6) once again, we nd a sequence {u } X0 X1 such that J (2n , u ) 2 n n and (u ) = 1 (n Z). Putting un = an n u , we see that un X0 X1 , J (2n , un ) n n n 2|an |n , and (un ) = an (n Z). Consequently, (2.5) (J (2n , un ))n
q

2 a

lq ()

4B.
kZ 2 k

## In particular, it follows immediately that the series Indeed, 2n un

nN X1 n

uk converges in X0 + X1 .

nN

2(1)n2n un
1/q q nN 1/q

X1 1/q

nN

(2

un

X1 )

n(1)q

C
nN

(J (2n , un ))q

0 as N ,

and similarly 2n un
nN X0

nN

2n un
1/q

X0

C
nN

(J (2n , un ))q

0 as N .
kZ 2 k

## Therefore, putting vn = un1 2 un , we obtain (2.6) x=

kZ

vk = 0, whence

2k yk

with yk = xk vk , by (2.3). Furthermore, (yk ) = (xk ) (uk1 ) + 2 (uk ) = (T a)k ak1 + 2 ak = 0, i.e., yk N (k Z). Since the series in (2.6) converges in X,q ,, the second part of the theorem is proved.

12

S. V. ASTASHKIN

## Next, by (2.3) and (2.5) we obtain (J (2n , yn ))n 2+ +2

q

(J (2n , xn ))n
X0 , 2 k

+ (J (2n , vn ))n
1/q q X1 ) 1/q

(max( uk1
kZ

uk1
q X1 )

(max( uk
kZ

X0 , 2

uk

2 + 16B. Consequently, for x N formula (2.6) implies x N,q 16B + 2. Thus, the norms of X,q and N,q are equivalent on N. We prove the converse under the condition 0 . By assumption, there exists D > 0 such that (2.7) x
N,q

D x

X,q

for all x N . By Lemma 2, it suces to prove that the operator T : lq () Im T , T = S 2 I, is an isomorphism. Again, we distinguish two cases: a) the functional is not bounded on X0 X1 in the norm of X,q ; b) is bounded on X0 X1 in the norm of X,q . In the second case, we let X,q denote the extension of . So, let a = (an ) lq (), a lq () 1. As before, there exists a sequence {xn } X0 X1 (n Z) with J (2n , xn ) 2|an |n , (xn ) = an Therefore, (J (2n , xn))n whence the series (2.8) x=
kZ q

(n Z). 2,

2 a 2k xk

lq ()

converges in X0 + X1 , x X,q , and x X,q 2. Moreover, in case b) we have |(x)| C x X,q 2C. Since the series in (2.8) converges in norm in X,q , we are led to the conclusion that |f (a)| =
kZ

2k ak =
kZ

2k (xk ) = |(x)| 2C

for every a lq () with a lq () 1, i.e., f lq () . By the facts proved above, f (a) = 0 in this case, i.e., x X,q N , where N := Ker . In the next lemma, Z,q is the closure of N in X,q . Lemma 5. We have Z,q = X,q in case a) and Z,q = X,q N in case b). Proof. If the functional is not bounded on X0 X1 in the norm of X,q , then N is dense in X0 X1 , and, consequently, also in X,q (relative to the same norm), see [2, Theorem 3.4.2]. Therefore, Z,q = X,q . In case b), if x Z,q , then (x) = 0, and, consequently, Z,q X,q N . To prove the reverse inclusion, take x X,q with (x) = 0. There exists a sequence {xn } X0 X1 such that xn x in X,q . Since (X0 X1 ) , we have xn = yn + n z, where yn N, z X0 X1 , (z) = 1, and n R. Then (xn ) = n (z) = n (x) = 0. Therefore, yn x in X,q , whence x Z,q .

## INTERPOLATION OF INTERSECTIONS BY THE REAL METHOD

13

We continue the proof of the theorem. We remind the reader that the vector x dened by (2.8) with (xk ) = ak belongs to X,q in case a) and to X,q N in case b). In both cases, Lemma 5 implies the existence of a sequence {zn } N such that (2.9) It follows that

zn x X,q , zn+1 zn

X,q

2n ,

n = 1, 2, . . . .

(2.10)

x=
n=0

(zn+1 zn ),

z0 = 0,

where the series converges absolutely in X,q . Since zn+1 zn N,q 2n D by (2.7), we see that for every n = 0, 1, 2, . . . there exists a sequence {zn,i }iZ N with (2.11) Consequently,

zn+1 zn =
iZ

2i zn,i ,

< 21n D.

zn,i
n=0

X0 X1

max(1, 2i )
n=0

J (2i , zn,i )

n=0 i

## (J (2i , zn,i ))i

(2.12)

yi =
n=0

zn,i

converges absolutely in X0 X1 for every i Z. But zn,i N and N is the kernel of the functional (X0 X1 ) ; therefore, yi N , i Z. Moreover, (2.11) and the Minkowski inequality show that
q 1/q

(J (2i , yi ))i

iZ n=0

J (2i , zn,i )
1/q

n=0 iZ

## (J (2i , zn,i ))q

4D.

i Therefore, the series iZ 2 yi converges in X0 + X1 to a vector y X,q . We show that y = x. By (2.10)(2.12), it suces to prove that the double series

2i zn,i
n=0 iZ

converges absolutely in X0 + X1 . To do this, we apply the Hlder inequality and (2.12), o obtaining

2i zn,i
i=0

X1

i=0

1/q

i=0

2i(1)q

(J (2i , zn,i))i

C,q 21nD

14

S. V. ASTASHKIN

and

1/q

2i zn,i
i=

X0

i=

2iq

## (J (2i , zn,i ))i

C,q 21nD,

whence

2i zn,i
n=0 iZ

X0 +X1

4D max(C,q , C,q ).

Thus, along with (2.8), both in case a) and in case b) we have a representation of the form (2.13) x=
nZ

2n yn ,

4D.

## Next, as in , consider the vectors

un = xn yn and vn =
k=n+1

2(kn1)uk .

## Then (2.14) (2.15)

nZ

(un ) = (xn ) = an , 2n un = 0,

n Z, 4D + 2.

q

## Moreover, 2n vn and by (2.15) we have

n X1

k=n+1

2(kn1)(1) uk

X1 2

vn

X0

k=

2(kn1)uk
X0

k=

2(kn1) uk

X0 .

Now, the elementary inequality max(a, b) a+b (a, b > 0) combined with the Minkowski inequality and (2.15) yields (J (2n , vn ))n
nZ k=n+1 q n q 1/q

2(kn1)(1)J (2k , uk ) +
k= 1

2(kn1)J (2k , uk )
q 1/q

=
nZ l=0

## 2l(1) J (2l+n+1 , ul+n+1 ) +

l= 1

2l J (2l+n+1 , ul+n+1 )

l=0

2l(1) +
l=

2l

(J (2n , un ))n

C (4D + 2).

So, vn X0 X1 , v = nZ 2n vn X,q , and v X,q C (4D + 2). By (0.6), we have (vn ) 1 J (2n , vn ). Consequently, the element b = ((vn ))n belongs to lq () n and b lq () C (4D + 2). Furthermore, by (2.14) we have (T b)n = bn1 2 bn = (vn1 ) 2 (vn )

=
k=n

2(kn)uk
k=n+1

2(kn1)uk

= (un ) = an

## INTERPOLATION OF INTERSECTIONS BY THE REAL METHOD

15

for all n Z. Thus, the operator T : lq () lq () is closed. Moreover, Im T = lq () in case a) and Im T = Ker f in case b). Since 0 by assumption, Remark 1 implies that T is an isomorphic embedding, and the theorem is proved. Now, we present some corollaries. The rst of them is a direct consequence of the proof of Theorem 1. Corollary 1. The following statements are equivalent: 1) the norms of X,q and N,q are equivalent on N, and extends up to a functional X,q ; 2) ( , 0). Corollary 2. Suppose a linear functional is dened on some linear space D X0 X1 . Let be the restriction of to X0 X1 , and suppose that (X0 X1 ) , = 0. Let , , 0, and be the dilation indices of the function k(t) = K(t, ; X0 , X1 ). We assume that 0 . If (2.16) then (2.1) is true. Proof. Relations (2.16) imply, in particular, that the norms of (X0 , X1 ),q and (X0 Ker , X1 Ker ),q are equivalent on N := Ker . On the other hand, the norms of (X0 Ker , X1 Ker ),q and (N0 , N1 ),q coincide on N . Therefore, the norms of (X0 , X1 ),q and (N0 , N1 ),q are equivalent on N , and Theorem 1 applies. The last corollary is also a direct consequence of the proof of Theorem 1. Corollary 3. Suppose (X0 X1 ) , = 0, and let N = Ker . If (0, ) (, 1), then for every x X,q there exists a representation

## (X0 Ker , X1 Ker ),q = (X0 , X1 ),q Ker ,

x=
k=

2k xk ,

xk N,

with (J (2k , xk ; X0 , X1 ))k lq C x X,q , where the constant C > 0 does not depend on x. A similar statement is true also for ( , 0) if we replace X,q with the intersection X,q N , where N is the kernel of the extension of to X,q . Remark. Corollary 3 readily implies the results of  that guarantee the identity of the spaces (X0 , X1 ),q and (N0 , X1 ),q . In that situation, X0 and N0 := Ker is endowed with the norm of X0 . First, we observe that presently k(t) := K(t, ; X0 , X1 ) C (t > 0), whence = = 0. Next, (X0 , X1 ),q N0 + X1 because, if x X,q and x = x0 + x1 with xi Xi , then also x = y0 + y1 , where y0 = x0 (x0 )z N0 , and y1 = x1 + (x0 )z X1 ; here z is an element of X0 Z1 satisfying (z) = 1. By Corollary 3 and the equivalence of the K- and J -methods (see [2, Theorem 3.3.1]), we see that (N0 , X1 ),q = (X0 , X1 ),q and (N0 , X1 ),q = (X0 , X1 ),q N if (0, 0 ), where N is the kernel of the extension of to (X0 , X1 ),q . Theorem 1 implies in addition that (N0 , X1 ),q is not closed in (X0 , X1 ),q for [0 , ]. if (, 1),

16

S. V. ASTASHKIN

Theorem 2. Suppose (X0 X1 ) , = 0. If ( , 0 ), then extends by continuity up to a functional ((X0 , X1 ),q ) . If (0, ) (respectively, (, 1)), then extends by continuity up to a functional ((X0 , X1 ),q X1 ) (respectively, up to a functional ((X0 , X1 ),q X0 ) ). Moreover, if N := Ker , then in the three cases we have (2.17) (X0 N , X1 N ),q = (X0 , X1 ),q N . Proof. If ( , 0), then extends up to ((X0 , X1 ),q ) by Corollary 1. We prove (2.17) in this case. For N := N , the inclusion (X0 N , X1 N ),q (X0 , X1 ),q N is obvious. So, by Corollary 3, it suces to prove the inclusion (2.18) First, we observe that (2.19) X,q X,q X0 + X,q X1 .

X,q N X0 N + X1 N .

Indeed, for every x X,q there exists a sequence {xn } X0 X1 such that x=
k= k

2k xk (convergence in X0 + X1 )

## and (J (2 , xk ))k lq . As before, it is easily seen that

1

2n xn = x0 X0 (convergence in X0 )
n=

and

2n xn = x1 X1 (convergence in X1 ).
n=0

At the same time, the J -method denition of X,q yields xi X,q (i = 0, 1), and (2.19) follows from the relation x = x0 + x1 . Passing to the proof of (2.18), we take z X0 X1 with (z) = 1. If x X,q N and x = x0 + x1 , xi X,q Xi (i = 0, 1), we put (2.20) y0 = x0 + (x1 )z, y1 = x1 (x1 )z.

Then yi Xi N (i = 0, 1), and (2.18) follows. Now, let (0, ) (, 1). If (0, ), we use Lemmas 3 and 4. For this, consider the Banach couple (X0 X1 , X1 ) and the corresponding K-functional
k (t) := K(t, ; (X0 X1 ) , X1 ) = K(t, ; X0 + X1 , X1 ). The dilation indices for the function k (t) will be denoted by , , , and . Since 0 (X0 X1 ) , we have k (t) C (t > 0) and, therefore, = = 0. Applying Lemma 3 to the couple (X0 , X1 ), we obtain k (t) k(t) := K(t, ; X0 , X1 ) for t (0, 1]. So, the denition of the dilation indices implies 0 . Thus, ( , ), and by the 0 rst statement of the theorem (which has already been proved) we see that extends by continuity up to a functional ((X0 X1 , X1 ),q ) . But the latter space coincides with ((X0 , X1 ),q X1 ) by Lemma 4. The case where (, 1) reduces to the preceding case. We put k (t) := K(t, ; X0 , (X0 X1 ) ),

## INTERPOLATION OF INTERSECTIONS BY THE REAL METHOD

17

and denote by , , , and the dilation indices for k . Then k (t) Ct (t > 0) 0 and, therefore, 0 = = 1. Next, we observe that 1 1 , k (t) = tm , k(t) = tl t t where l(t) := K(t, ; X1 , X0 ), m(t) := K(t, ; (X0 X1 ) , X0 ). It is easily seen that

(2.21)

+ l = 1,

+ m = 1, 0

where l and m stand for dilation indices of l(t) and m(t), respectively. From the above 0 it is clear that m l . But then (2.21) immediately implies the inequality . 0 Thus, if (, 1), then ( , 0 ), and again Lemma 4 shows that extends up to a functional ((X0 , X1 ),q X0 ) . It remains to prove (2.17) for (0, ) or (, 1). For deniteness, let (0, ) (the other case is treated similarly). By Corollary 3, it again suces to prove (2.18), in which N := N is the kernel of the extension of . If x X,q N , we use (2.19) to represent x in the form x = x0 + x1 , where xi X,q Xi (i = 0, 1). It follows that x1 and, with it, x0 belong to the domain of . Consequently, dening y0 and y1 by (2.20), we obtain x = y0 + y1 , where yi Xi N (i = 0, 1). Thus, we arrive at (2.18) and, therefore, also at (2.17). Corollary 4. Suppose a linear functional is dened on a linear space D, D X0 X1 , the restriction of to X0 X1 is a bounded functional on X0 X1 , and = 0. For every satisfying (2.1), let denote a continuous extension of with domain M (equal either to X,q , or to X,q X1 , or to X,q X0 ), as in Theorem 2. If M D and (x) = (x) for x M , then (2.16) is fullled. Proof. If (0, ) (, 1), then, again by Corollary 3, it suces to show that (2.22) X,q Ker X0 Ker + X1 Ker . Let (0, ) for deniteness. If x X,q Ker , then (2.19) shows that x = x0 + x1 , where xi X,q Xi (i = 0, 1). Then x1 M := X,q X1 . Dening y0 and y1 by (2.20), we obtain x = y0 + y1 , hence y1 and, with it, y0 belong to Ker . Thus, (2.22) is proved. The case of (, 1) is treated similarly. Now, let ( , 0 ). If X,q Ker = X,q N , where N := Ker , then the result follows from Theorem 2 (or Corollary 3). Suppose X,q Ker X,q N . Since N is a subspace of codimension 1 in X,q , we have X,q Ker , i.e., (x) = 0 for all x X,q . This contradicts the assumptions of the corollary. 3. The K-functional on couples of intersections Let (X0 , X1 ) be a Banach couple with X0 X1 dense in X0 and in X1 , and let Y0 be a closed subspace of codimension 1 in X0 . In  a formula connecting K(t, x; Y0, X1 ) and K(t, x; X0, X1 ) was found (see also [12, Theorem 2.1]). We show that, under a certain additional assumption, a similar result holds true also for a normed couple of intersections generated by a linear functional. Let be a linear functional dened on a subspace M X0 X1 , and let N = Ker . Moreover, we assume that the restriction of to X0 X1 is a bounded nonzero functional on this space. We put Yi = Xi N (i = 0, 1).
=

18

S. V. ASTASHKIN

For every y Y0 + Y1 and every t > 0, there exists an optimal decomposition (3.1) with the property (3.2) 1 ( y0 (t) 2
X0

y = y0 (t) + y1 (t),

yi (t) Xi , i = 0, 1,

+ t y1 (t)

X1 )

K(t, y; X0 , X1 ) y0 (t)

X0

+ t y1 (t)

X1 .

Theorem 3. Suppose X0 X1 is dense both in X0 and in X1 , and for every y Y0 + Y1 an optimal decomposition (3.1) can be chosen in such a way that y0 (t) M for all t > 0. Then |(y0 (t))| K(t, y; Y0 , Y1 ) K(t, y; X0 , X1 ) + , 1 , ; X , X ) K(t 0 1 where the constants of equivalence do not depend on y Y0 + Y1 and t > 0. Proof. Take h X0 X1 with (h) = 0. For y Y0 + Y1 , consider a decomposition (3.1) satisfying the assumptions of the theorem. Putting z0 (t) = y0 (t) (y0 (t))h , (h) z1 (t) = y1 (t) + (y0 (t))h , (h)

we see that zi (t) Yi and y = z0 (t) + z1 (t). Consequently, K(t, y; Y0 , Y1 ) z0 (t) y0 (t)
X0 X0

+ t z1 (t) + t y1 (t)

X1 X1

## +t h |(h)| J (t, h; X0 , X1 ) 2K(t, y; X0 , X1 ) + 2|(y0 (t))| |(h)| + |(y0 (t))| h

X0

X1

by (3.2). Applying (0.6) and passing to the inmum over all h X0 X1 with (h) = 0 in the second term on the right, we obtain K(t, y; Y0 , Y1 ) 2 K(t, y; X0 , X1 ) + |(y0 (t))| . K(t1 , ; X0 , X1 )

To prove the reverse inequality, if suces to show that (3.3) |(y0 (t))| 4K(t, y; Y0 , Y1 ). K(t1 , ; X0 , X1 )

We may assume that (y0 (t)) = 0 (otherwise there is nothing to prove). For t > 0, we nd a decomposition y = z0 (t) + z1 (t), zi (t) Yi , such that (3.4) K(t, y; Y0 , Y1 ) 1 ( z0 (t) 2
X0

+ t z1 (t)

X1 )

(an optimal decomposition of y in the couple (Y0 , Y1 )). Using it and also the decomposition (3.1), we dene h = y0 (t) z0 (t) = z1 (t) y1 (t). Then h X0 X1 , and the relation z0 (t) Y0 N implies (h) = (y0 (t)) (z0 (t)) = (y0 (t)) = 0. Therefore, z0 (t) = y0 (t) (y0 (t))h , (h) z1 (t) = y1 (t) + (y0 (t))h , (h)

## INTERPOLATION OF INTERSECTIONS BY THE REAL METHOD

19

and by (3.4), (3.2), and (0.6) we obtain K(t, y; Y0 , Y1 ) (y0 (t)) (y0 (t)) h h + t y1 (t) + (h) (h) X0 h X0 + t h X1 1 |(y0 (t))| ( y0 (t) X0 + t y1 (t) X1 ) 2 |(h)| J (t, ; X0 , X1 ) 1 inf K(t, y; X0 , X1 ) |(y0 (t))| 2 |(h)| hX0 X1 ,(h)=0 1 |(y0 (t))| = K(t, y; X0 , X1 ). 2 K(t1 , ; X0 , X1 ) 1 2 y0 (t)
X1

Now, (3.4) follows immediately, because K(t, y; X0 , X1 ) K(t, y; Y0, Y1 ). 4. Interpolation of intersections of weighted Lp -spaces generated by an integral functional As usual, for a positive measurable function w(x) on (0, ), we dene Lp (w) as the space of measurable functions f : (0, ) R with the norm
1/p

f and

w,p

=
0

|f(x)|p w(x) dx

if 1 p < ,

f w, = ess sup x>0 (|f(x)|w(x)). For an arbitrary measurable function g : (0, ) R, consider the linear functional

g (f) =
0

f(x)g(x) dx

with the domain Dg consisting of all measurable functions f : (0, ) R such that b a |f(x)g(x)| dx < for all 0 < a < b < and the following limit exists:
b a0,b a

lim

f(x)g(x) dx.

Basically, we shall be interested in the case where g(x) 1. Then we use the notations and D, respectively. First, we nd conditions ensuring the relation (4.1) (Lp0 (w0 ) Ker , Lp1 (w1 ) Ker ),q = (Lp0 (w0 ), Lp1 (w1 )),q Ker . Thus, g(x) 1, and we consider three cases distinguished in terms of p0 and p1 . a) 1 p0 < p1 < . We denote by the restriction of the functional (f) = f(x) dx to Lp0 (w0 ) Lp1 (w1 ). For every Banach couple (X0 , X1 ) with X0 X1 dense 0 both in X0 and in X1 , we have (X0 X1 ) = X0 + X1 isometrically (see [2, 2.7]). Thus, 1 1 if p + pi = 1 (i = 0, 1), then the condition (Lp0 (w0 ) Lp1 (w1 )) is equivalent to the i condition 1/(p0 1) 1/(p1 1) 1 Lp (w0 ) + Lp (w1 ) (p0 > 1) 0 1 or 1/(p1 1) 1 ) (p0 = 1). 1 L (w0 ) + Lp (w1 1 It its turn, this is equivalent to the niteness of the function k(t) = K(t, 1; Lp (w0 0 or
1/(p0 1)

), Lp (w1 1

1/(p1 1)

## 1 k (t) = K(t, 1; L(w0 ), Lp (w1 1

1/(p11)

))

20

S. V. ASTASHKIN

for some (all) t > 0. Assume rst that p0 > 1. After reduction to one weight function, we can write k(t) = K(t, u; Lp (v), Lp (v)), 0 1 where (4.2) u(x) = w0 (x)
p 1 p
p 1 1 0

w1 (x) p1 p0 ,

p0 1

p1

p0 1 p0

## Applying the Holmstedt formula , we obtain 1 k(t) = tK , u; Lp (v), Lp (v) 1 0 t

tr

t
0

u(s)p1 ds

1/p 1

+
tr

u (s)p0 ds

1/p 0

1 where r = p1 p1 , and u (s) is a nonincreasing rearrangement of u(x) with respect to 0 1 the measure (E) = E v(x) dx. Putting

(4.3)

## Ft = {x > 0 : u(x) > u (tr )},

1/p 1

Ftc = (0, ) \ Ft ,
1/p 0

## we have k(t) k1 (t), where k1 (t) = t

Ft

w1 (x)1/(p11) dx

+
c Ft

w0 (x)1/(p0 1) dx

Much in the same way, it can be shown that for p0 = 1 we have k (t) k1 (t), where k1 (t)

=t
Ft

w1 (x)

1/(p1 1)

1/p 1

dx

## 1 We also note that r = p and u(x) = w0 (x) in the latter case. 1

Theorem 4. Suppose 1 p0 < p1 < , and let functions u(x) and v(x) and sets Ft , Ftc (t > 0) be dened by (4.2) and (4.3), respectively. Suppose the function k1 (t) = t
Ft

w1 (x)

1/(p1 1)

1/p 1

dx

+
c Ft

w0 (x)

1/(p0 1)

1/p 0

dx

(if p0 = 1, the second term on the right should be suppressed) is nite for some (all) t > 0, and let , , 0 , and denote its dilation indices. If 0 , 0 < < 1, and 1 q < , then (4.1) is true if and only if (2.1) is true. Proof. If (4.1) is fullled, then Corollary 2 is applicable by the assumptions of the theorem, and we obtain (2.1). Conversely, let (2.1) be fullled. By the arguments preceding the theorem, the restriction of to Lp0 (w0 ) Lp1 (w1 ) belongs to (Lp0 (w0 ) Lp1 (w1 )) . Moreover, = 0. Consequently, by Theorem 2, there is a continuous extension of up to a functional M , where M is either (Lp0 (w0 ), Lp1 (w1 )),q , or (Lp0 (w0 ), Lp1 (w1 )),q Lp1 (w1 ), or (Lp0 (w0 ), Lp1 (w1 )),q Lp0 (w0 ), depending on whether belongs to ( , 0), (0, ), or (, 1). We show that M D for every (0, ) ( , 0) (, 1), and for f M we have (4.4) (f) = (f) =
0

f(x) dx.

First, Lp0 (w0 ) Lp1 (w1 ) D by assumption, and for f Lp0 (w0 ) Lp1 (w1 ) we have the estimate

(4.5)
0

|f(x)| dx C f

M .

## INTERPOLATION OF INTERSECTIONS BY THE REAL METHOD

21

Now, let f M , and let a sequence {fn } Lp0 (w0 ) Lp1 (w1 ) satisfy fn f M 0 as n . Then fn [0,b] f[0,b] as n in measure for every b > 0 (here and below F stands for the characteristic function of a set F R). By (4.5) we obtain
b

|fn (x)| dx C fn
0

M ,

## and the Fatou lemma shows that

|f(x)| dx C lim fn
0 n

= C f

M ,

## |fn (x) fm (x)| dx C fn fm

0

(n, m = 1, 2, . . .).

Consequently, the sequence {fn } has a limit in L1 (0, ), which must coincide with f. Since fn (x) dx = (fn ) (f)
0

at the same time, we arrive at (4.4). Now, all conditions of Corollary 4 are satised. Applying this corollary, we obtain (4.1). If the numbers p0 , p1 and the weight functions w0 (x) and w1 (x) satisfy some additional conditions, we can obtain more specic results. First, let p0 > 1, and assume that () w0 (x) is monotone increasing, w0 (2x) C1 w0 (x) (x > 0), and
x

## w0 (s) 1p0 ds C2 xw0 (x) 1p0 ,

x > 0;

next, either w1 (x) is monotone decreasing and w1 (x) C3 w1 (2x) (x > 0), or both w1 (x) w (x) and w(x) = w0 (x) are monotone increasing and 1
x 0

## w1 (s) 1p1 ds C4 xw1 (x) 1p1

(x > 0).

It is easily seen that, under condition (), u(x) is monotone decreasing and v(x) is monotone increasing. In particular, it follows that Ft = (0, s(t)), where s(t) is a solution of the equation
x

(4.6)

V (x) :=
0

v(s) ds = tr ,

1 1 1 = . r p0 p1

Moreover, it is easily seen that V (x) xv(x). Therefore, (4.7) Now, on one hand, we have
2s(t)

s(t)v(s(t)) tr .
1/p 0

k1 (t)
s(t)

w0 (x)

1/(p0 1)

dx

C1

1/p0

s(t)1/p0 w0 (s(t))1/p0

by (). On the other hand, () and (4.7) imply k1 (t) C(s(t)1/p0 w0 (s(t))1/p0 + ts(t)1/p1 w1 (s(t))1/p1 ) = Cs(t)1/p0 w0 (s(t))1/p0 (1 + ts(t)1/r v(s(t))1/r ) C s(t)1/p0 w0 (s(t))1/p0 .

22

S. V. ASTASHKIN

Thus, under condition () we have the equivalence k1 (t) s(t)1/p0 w0 (s(t))1/p0 . If p0 = 1, a slightly less restrictive condition can be employed: () w0 (x) is monotone increasing and w0 (2x) C1 w0 (x) (x > 0); next, either w1 (x) w0 (x) is monotone decreasing and w1 (x) C2 w1 (2x) (x > 0), or both w1 (x) and w(x) = w1 (x) are monotone increasing and
x 0

(x > 0).

## Much as in the case where p0 > 1, it can be shown that () implies

k1 (t) w0 (s(t))1 .

As a result, applying Theorem 4, we arrive at the following statement. Corollary 5. Suppose two numbers p0 , p1 (1 p0 < p1 < ) and two weight functions w0 (x), w1 (x) satisfy () if p0 > 1 and satisfy () if p0 = 1. Let , , 0 , and be the dilation indices of the function k2 (t) = s(t) p0 w0 (s(t)) p0 , where s(t) is the solution of equation (4.6). If 0 , 0 < < 1, and 1 q < , then (4.1) is equivalent to (2.1). b) 1 < p0 = p1 = p < . It is well known (see ) that in this case k(t) = K(t, 1; Lp (w0
1/(p1) 1/(p1)
p0 1

), Lp (w1

))
1/p 1/(p1)

min(w0 (x) t
p Ft

1/(p1)

, t w1 (x)

) dx
1/p

= where (4.8)

w1 (x)

1/(p1)

dx +
c Ft

w0 (x)

1/(p1)

dx

Ft = x > 0 :

## w0 (x) < tp , w1 (x)

Ftc = (0, ) \ Ft .

The following statement is proved much as Theorem 4. Theorem 5. Let p (1, ). Suppose w0 (x) and w1 (x) are such that the function
1/p

k3 (t) =

tp

w1 (x)1/(p1) dx +
Ft
c Ft

w0 (x)1/(p1) dx

where Ft and Ftc are dened by (4.8), is nite for some (all) t > 0. If , , 0 , and are the dilation indices of the function k3 (t) and 0 , then the relation (4.9) (Lp (w0 ) Ker , Lp (w1 ) Ker ),q = (Lp (w0 ), Lp (w1 )),q Ker is equivalent to (2.1). Suppose () is fullled for p0 = p1 = p, w0 (x), and w1 (x). Then Ft = (0, w 1 (tp )), where w 1 (x) is the function inverse to w(x) = w0 (x)/w1 (x). Therefore, arguing as we did before Corollary 5, we obtain yet another statement. Corollary 6. Suppose () is fullled for p0 = p1 = p (1, ), w0 (x), and w1 (x). Let , , 0 , and be the dilation indices of the function k4 (t) = (w 1 (tp ))(p1)/p (w0 (w 1 (tp )))1/p , and let 0 . Then (4.9) is equivalent to (2.1).

23

x>0

## w0 (x) 1 . min 1, t w0 (x) w1 (x)

If the weight functions obey the condition w0 (x) is monotone increasing, w1 (x) is monotone decreasing, and (4.10) 1 lim w(x) = lim = 0, x w(x) x0 then 1 . k(t) w0 (w 1 (1/t))
w0 (x) As before, here w(x) := w1 (x) , and w 1 (x) is the function inverse to w(x). The following statement is proved much as Theorem 4.

Theorem 6. Suppose w0 (x) and w1 (x) satisfy (4.10). Let , , 0 , and be the 1 dilation indices of the function k5 (t) = w0 (w1 (1/t)) , and let 0 . Then the relation (4.11) (L1 (w0 ) Ker , L1 (w1 ) Ker ),q = (L1 (w0 ), L1 (w1 )),q Ker is equivalent to (2.1). From the preceding theorem we deduce an interesting consequence. Let a, b, c, d be four numbers satisfying 0 a min(b, c) max(b, c) d 1. Then there exists a concave function (x) on (0, ) whose dilation indices , , 0 , and coincide with a, b, c, and d. In order to exhibit such a function, we take a two-sided monotone increasing sequence xk+1 {xk } k= of positive numbers such that x0 = 1 and lim|k| xk = . If b > 0, we dene a function in the following way: x a (x) = (x2k ), x2k x x2k+1 , x2k b x (x) = (x2k+1 ), x2k+1 x x2k+2 , x2k+1 for k = 0, 1, 2, . . . , and x c (x2k ), x2k1 x x2k , (x) = x2k d x (x) = (x2k1), x2k2 x x2k1, x2k1 for k = 0, 1, 2, . . .. If b = 0 and d > 1, we dene (x) as before if x (0, 1], and for x [1, ) we put (x) = ln ex. 1 Finally, if d = 0, we put (x) = ln e/x for x (0, 1] and (x) = ln ex for x [1, ]. It can easily be shown that (x) is monotone increasing, (x)/x is monotone decreasing, and the range of (x) is (0, ). There exists a monotone increasing concave function (x) such that (x) (x) 2 (x) (x > 0); see [17, Theorem 2.1.1]. Clearly, the range of (x) also coincides with (0, ). The denition of readily implies that its dilation indices , , 0 , and (therefore, also those of ) coincide with a, b, c, and d, respectively. We denote w0 (x) = x and w1 (x) = x 1 (1/x) ( 1 is the inverse function to ). Since these functions satisfy (4.10) and 1 , (x) = 1 (1/t)) w0 (w

24

S. V. ASTASHKIN

application of Theorem 6 leads to the following result. Corollary 7. For arbitrary numbers 0 a b c d 1, there exist weight functions w0 (x) and w1 (x) such that (4.11) is fullled if and only if (0, a) (b, c) (d, 1). Remark. The last statement shows that all situations indicated in Theorem 1 realize indeed, already in the framework of weighted L1 -spaces. Partial results of the same nature were known earlier; see [1, Corollary 2]. The case of power-type weight functions leads to the most transparent results. If w0 (x) = xl and w1 (x) = xm , it can easily be seen that () is fullled if a) l > p0 1 and m 0 or (b) l > p0 1, l > m, and 0 m < p1 1. By (4.2) and (4.7), we have v(x) = x
p1 lp0 m p1 p0

## s(t) t p1 lp0 m+p1 p0 ,

r(p1 p0 )

k2 (t) t0 ,

p1 (lp where 0 = p1 (l+1)p00+1) . Consequently, = = 0 = = 0 , and the preceding (m+1) results yield the following.

Corollary 8. Suppose p0 , p1 (1 p0 p1 < ), l, and m satisfy (a) or (b). Then (Lp0 (xl ) Ker , Lp1 (xm ) Ker ),q = (Lp0 (xl ), Lp1 (xm )),q Ker if and only if =
p1 (lp0 +1) p1 (l+1)p0 (m+1) .

Remark. For p0 = p1 = q, the last statement was proved in [1, Corollary 1] by a dierent method. Now, we apply the results of 3 to the evaluation of the K-functional on the couple of intersections (Lp (w0 ) Ker g , Lp (w1 ) Ker g ) for weighted Lp -spaces, where g (f) = f(x)g(x) dx. Consider two cases. 0 a) p0 = p1 = p > 1. As before, the condition g (Lp (w0 ) Lp (w1 )) is equivalent to the condition g Lp (w0
1/(p1)

) + Lp (w1

1/(p1)

) = Lp (max(w0 , w1 )1/(p1)).

Then, as was mentioned already in , K(t1 , g ; Lp(w0 ) , Lp (w1 ) ) = K(t1, g; Lp (w0
1/(p1)

), Lp (w1

1/(p1)

))
1/p

|g(x)|

## 1/(p1) 1/(p1) min(w0 (x), tp w1 (x)) dx

and the latter function is nite for all t > 0. In a similar way, we obtain
1/p

0

## |f(x)|p min(w0 (x), tpw1 (x)) dx

Therefore, under the assumption (4.12) the function w(x) := 1 w0 (x) is monotonic and lim w(x) = lim = 0, t w(x) t0 w1 (x)

25

## we have K(t, f; Lp(w0 ), Lp (w1 ))

w 1 (tp ) w 1 (tp ) t f0 p Lp (w0 ) t + tp f1 p Lp (w1 ) 1/p 1/p

|f(x)|p w0 (x) dx + tp

|f(x)|p w1 (x) dx

=
t f0

Lp (w0 )

t + t f1

Lp (w1 ) ,

t t where f0 (x) = f(x)(0,w1 (tp )) (x) and f1 (x) = f(x)(w1 (tp ),) (x). The last display t t shows that the decomposition f = f0 + f1 is optimal (see (3.2)). Moreover, if f t Lp (w0 ) Ker g + Lp (w1 ) Ker g , then f0 belongs to the domain Dg of g for every t > 0. Thus, Theorem 3 implies the following result.

w0 (x) w1 (x)

1/p

1/p

+ where

w 1 (tp ) 0

Gp(t) =
0

|g(x)|

## 1/(p1) 1/(p1) min(w0 (x), tp w1 (x)) dx

If g(x) 1, the formula for the K-functional in Theorem 7 simplies under certain conditions on p (1, ) and the weight functions w0 (x) and w1 (x). Specically, suppose that ( ) w0 (x) is monotone increasing and
x

## w0 (s) 1p ds C1 xw0 (x) 1p

(x > 0);

next, either w1 (x) is monotone decreasing and w1 (x) C2 w1 (2x) (x > 0), or both w1 (x) and w(x) = w0 (x) are monotone increasing, and w1 (x)
x 0

## w1 (s) 1p ds C3 xw1 (x) 1p

(x > 0).

Arguing as we did before Corollary 6, we easily obtain the following result, which was established in [1, Theorem 3] by a dierent method, namely, on the basis of direct estimates. Corollary 9. Suppose p (1, ), w0 (x), and w1 (x) satisfy ( ). Then K(t, f; Lp (w0 ) Ker , Lp (w1 ) Ker )
1/p

1/p w 1 (tp )

## + (w 1 (tp ))1/p1 w0 (w 1 (tp ))

f(x) dx .
0

26

S. V. ASTASHKIN

b) p0 = p1 = 1. In this case the condition g (L1 (w0 ) L1 (w1 )) emerges, which is equivalent to g L (1/w0 ) + L (1/w1 ) = L (1/ max(w0 , w1 )). Now, for all t > 0 the following function is nite: K(t, g ; L1 (w0 ) , L1 (w1 ) ) = K(t, g; L(1/w0 ), L (1/w1 )) t 1 , = sup |g(x)| min w0 (x) w1 (x) x>0 As in the case of p > 1, if (4.12) is fullled, then
t K(t, f; L1 (w0 ), L1 (w1 )) = f0 L1 (w0 ) t + t f1 L1 (w1 ) , t t where f0 (x) = f(x)(0,w1 (t))(x) and f1 (x) = f(x)(w1 (t),) (x). Thus, the decomposit t tion f = f0 + f1 is optimal. Moreover, if f L1 (w0 ) Ker g + L1 (w1 ) Ker g , then t f0 Dg for every t > 0. Therefore, Theorem 3 yields yet another theorem.

Theorem 8. If (4.12) is fullled and g L (1/ max(w0 , w1 )), then K(t, f; L1 (w0 ) Ker g , L1 (w1 ) Ker g )

w 1 (t) 0

## where G1 (t) = sup |g(x)| min

x>0

If g(x) 1 and the weight functions are suciently regular, the formula for the K-functional on the couple of intersections simplies somewhat. Corollary 10. If w0 (x) and w1 (x) satisfy (4.10), then K(t, f; L1 (w0 ) Ker , L1 (w1 ) Ker )

## |f(x)| min(w0 (x), tw1 (x)) dx + w0 (w 1 (t))

0 w 1 (t)

f(x) dx .

Remark. Under the additional assumption w1 (x/2) Aw1 (x) (x > 0), Corollary 10 was proved by a dierent method in  (see Theorem 3). The author is grateful to Prof. L. Maligranda for a useful discussion of certain issues related to the proof of Theorem 2. References
 N. Krugljak, L. Maligranda, and L.-E. Persson, The failure of the Hardy inequality and interpolation of intersections, Ark. Mat. 37 (1999), 323344. MR1714765 (2000h:46035)  J. Bergh and J. Lfstrm, Interpolation spaces. An introduction, Grundlehren Math. Wiss., vol. 223, o o Springer-Verlag, BerlinNew York, 1976. MR0482275 (58:2349)  S. Ivanov and N. Kalton, Interpolation of subspaces and applications to exponential bases, Algebra i Analiz 13 (2001), no. 2, 93115; English transl., St. Petersburg Math. J. 13 (2002), no. 2, 221239. MR1834861 (2002f:46147)

## INTERPOLATION OF INTERSECTIONS BY THE REAL METHOD

27

 J.-L. Lions and E. Magenes, Probl`mes aux limites non homog`nes et applications. Vols. 12, Dunod, e e Paris, 1968. MR0247243 (40:512) MR0247244 (40:513)  H. Triebel, Eine Bemerkung zur nicht-kommutativen Interpolation, Math. Nachr. 69 (1975), 5760. MR0390797 (52:11620) , Interpolation theory, function spaces, dierential operators, North-Holland Math. Library,  vol. 18, North-Holland Publ.Co., AmsterdamNew York, 1978. MR0503903 (80i:46032b)  L. Maligranda, On commutativity of interpolation with intersection, Rend. Circ. Mat. Palermo (2) Suppl. No. 10 (1985), 113118 (1986). MR0894276 (88j:46067)  R. Wallsten, Remarks on interpolation of subspaces, Function Spaces and Applications (Lund, 1986), Lecture Notes in Math., vol. 1302, Springer, Berlin, 1988, pp. 410419. MR0942285 (89h:46042)  G. Pisier, Interpolation between H p spaces and noncommutative generalizations. I, Pacic J. Math. 155 (1992), 341368. MR1178030 (93f:46111)  S. Janson, Interpolation of subcouples and quotient couples, Ark. Mat. 31 (1993), 307338. MR1263557 (95c:46124)  S. V. Kislyakov and Q. Xu, Real interpolation and singular integrals, Algebra i Analiz 8 (1996), no. 4, 75109; English transl., St. Petersburg Math. J. 8 (1997), no. 4, 593615. MR1418256 (98c:46161)  J. Lfstrm, Interpolation of subspaces, Techn. Rep. no. 10, Univ. of Gteborg, 1997, 63 pp. o o o  S. V. Astashkin, About interpolation of subspaces of rearrangement invariant spaces generated by Rademacher system, Int. J. Math. Math. Sci. 25 (2001), no. 7, 451465. MR1823608 (2002e:46029)  S. Kaijser and P. Sunehag, Interpolation of subspaces and the unit problem, Function Spaces, Interpolation Theory and Related Topics (Lund, 2000), de Gruyter, Berlin, 2002, pp. 345353. MR1943292 (2003k:46106)  S. V. Astashkin, E. M. Semenov, and F. A. Sukochev, The Banach-Saks p-property (submitted to publ.).  Yu. A. Brudnyi and N. Ya. Krugljak, Interpolation functors and interpolation spaces. Vol. 1, North-Holland Math. Library, vol. 47, NorthHolland Publ. Co., Amsterdam, 1991. MR1107298 (93b:46141)  S. G. Kre Yu. I. Petunin, and E. M. Semenov, Interpolation of linear operators, Nauka, Moscow, n, 1978; English transl., Transl. Math. Monogr., vol. 54, Amer. Math. Soc., Providence, RI, 1982. MR0506343 (81f:46086) MR0649411 (84j:46103) Samara State University, ul. Akademika Pavlova 1, Samara 443011, Russia E-mail address : astashkn@ssu.samara.ru

Received 30/SEP/2003
Translated by S. V. KISLYAKOV