Academia.eduAcademia.edu

An Interpolation Theorem with Perturbed Continuity

2002, Journal of Functional Analysis

https://doi.org/10.1006/jfan.2001.3852

Abstract

Let (A 0 , A 1) and (B 0 , B 1) be two interpolation couples and let T: (A 0 , A 1) W (B 0 , B 1) be a K-quasilinear operator. The boundedness of the operator from A 0 to B 0 implies K(t, Ta; B 0 , B 1) [ M 0 ||a|| A0 and the boundedness of the operator from A 1 to B 1 implies K(t, Ta; B 1 , B 0) [ M 1 ||a|| A1 , a ¥ A 0 5 A 1. We consider perturbations of these two inequalities in the form K(ct, Ta; B 0 , B 1) [ M 0 ||a|| A0 +e 0 K(t, Ta; B 0 , B 1) and K(ct, Ta; B 1 , B 0) [ M 1 ||a|| A1 +e 1 K(t, Ta; B 1 , B 0). We prove that similar to the classical case for c > 1 and 0 [ e j [ 1 we get for all 0 < h < 1 and for all 0 < q [. ||Ta|| (B0, B1)h, q [ C(M 0 , M 1 , h, q) ||a|| (A0, A1)h, q. If we take B 0 =L 1 (Q), B 1 =L. (Q), c=2, and e j =1, where Q is a cube in R n , we get a theorem of Bennett, DeVore, and Sharpley. We prove that if e j > 1 we continue to get an interpolation theorem, but the interpolation holds for (log + e 0)/(log c) < h < 1 − (log + e 1)/(log c). This is the first instance of an interpolation theorem which holds for a subinterval of 0 < h < 1. Bennett, DeVore and Sharpley identified a ''weak L. '' class as the rearrangement invariant span of BMO(Q). This prompts the natural question of the existence of abstract ''weak type'' classes near the endpoints of interpolation scales. As we note below, there have been previous attempts to develop the theory of such classes. The construction was, however, too rigid, and necessitated the precise identification of the K-functional for the interpolation couple. We define these classes here in a way which allows for the identification K-functionals up to multiplicative equivalence. This opens the door to applications of the theory to most interpolation couples, leading to stronger interpolation theorems even for some well known spaces.