Hostname: page-component-76dd75c94c-5fx6p Total loading time: 0 Render date: 2024-04-30T07:26:27.170Z Has data issue: false hasContentIssue false

REAL INTERPOLATION AND TWO VARIANTS OF GEHRING'S LEMMA

Published online by Cambridge University Press:  01 October 1998

MARIO MILMAN
Affiliation:
Department of Mathematics, Florida Atlantic University, Boca Raton, FL 33431, USA. E-mail: milman@acc.fau.edu
BOHUMÍR OPIC
Affiliation:
Mathematical Institute of the Czech Academy of Sciences, Žitná 25, 115 67 Praha 1, Czech Republic. E-mail: opic@math.cas.cz
Get access

Abstract

Let Ω be a fixed open cube in ℝn. For r∈[1, ∞) and α∈[0, ∞) we define

formula here

where Q is a cube in ℝn (with sides parallel to the coordinate axes) and χQ stands for the characteristic function of the cube Q.

A well-known result of Gehring [5] states that if

formula here

for some p∈(1, ∞) and c∈(0, ∞), then there exist q∈(p, ∞) and C=C(p, q, n, c)∈(0, ∞) such that

formula here

for all cubes Q⊂Ω, where [mid ]Q[mid ] denotes the n-dimensional Lebesgue measure of Q. In particular, a function fL1(Ω) satisfying (1.1) belongs to Lq(Ω).

In [9] it was shown that Gehring's result is a particular case of a more general principle from the real method of interpolation. Roughly speaking, this principle states that if a certain reversed inequality between K-functionals holds at one point of an interpolation scale, then it holds at other nearby points of this scale. Using an extension of Holmstedt's reiteration formulae of [4] and results of [8] on weighted inequalities for monotone functions, we prove here two variants of this principle involving extrapolation spaces of an ordered pair of (quasi-) Banach spaces. As an application we prove the following Gehring-type lemmas.

Type
Notes and Papers
Copyright
The London Mathematical Society 1998

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)