Interpolation on Convex-set Valued Lebesgue Spaces and its Applications
Yuxun Zhang, Jiang Zhou*
Abstract: In this paper, we obtain two interpolation theorems on convex-set valued Lebesgue spaces, which generalize the Marcinkiewicz interpolation theorem and Riesz-Thorin interpolation theorem on classical Lebesgue spaces, respectively. As applications, we obtain the boundedness of convex-set valued fractional averaging operators and fractional maximal operators, and prove the reverse factorization property of matrix weights.
Key Words: Interpolation; convex-set valued Lebesgue spaces; fractional maximal operators; matrix weights
Mathematics Subject Classification (2020): 26E25; 42B25; 42B35
1 Introduction
In 1972, the classical weights were first introduced by Muckenhoupt[1] during the study of weighted norm inequalities for Hardy-Littlewood maximal operator. A weight (a non-negative, measurable function that satisfies , a.e.) is said to satisfy () if
where the supremum is taken over all cubes with sides parallel to the coordinate axes, denotes the n-dimensional Lebesgue measure of . A weight is said to satisfy if for all ,
For , given a Calderón-Zygmund singular integral operator , it can be extended to an operator on vector-valued functions by applying it to each coordinate: .
Denote to be the set of all real matrices, a matrix function is a mapping . In a series of papers in the 1990s, Nazarov, Treil and Volberg[2, 3, 4] considered that for , what type of positive semidefinite, self-adjoint matrix functions make the weighted inequality
(1) |
hold, and defined the matrix weight class to be the set of such matrix functions , where denotes the product of and , denotes the Euclidean norm of .
In 2003, Roudenko[5] gave a characterization of matrix weights: if and only if
(2) |
where the supremum is taken over all cubes with sides parallel to the coordinate axes, denotes the operator norm of the matrix , that is,
Remark 1.1.
The following discussion indicates that matrix weights are the generalization of classical weights: while , the matrix function will be a non-negative real valued function , then the inequality (1) will turn into
and the condition (2) will turn into
which are the weighted norm inequality and the classical condition, respectively.
Jones factorization theorem[6] and Rubio de Francia extrapolation[7] are two important theorems in classical weight theory. In 1996, Nazarov and Treil[2] conjectured that these results can be generalized to matrix weights, which generated two longstanding open problems. In 2022, Bownik and Cruz-uribe[8] solved these problems by creatively utilizing convex analysis theory (see, for instance, [9, 10, 11]). They defined some new spaces consisted of convex-set valued functions, including and their special form , and furthermore obtained that for , a norm function satisfying condition (see[8, Definition 6.2]) ensures the boundedness of convex-set valued maximal operator on , which enables the Rubio de Francia iteration algorithm to be used and this conjecture to be ultimately proved.
Interpolation is a useful method to obtain the boundedness of several sublinear operators. In 1939, Marcinkiewicz[12] first put forward the so-called Marcinkiewicz interpolation theorem, and Zygmund[13] reintroduced it in 1956. In 1982, in order to study the commutators generated by fractional integrals and BMO functions, Chanillo [14] obtained the boundedness of fractional maximal operators first introduced in[15] by using a generalization of Marcinkiewicz interpolation theorem in[16].
Riesz[17] first proved the Riesz convexity theorem in 1927, which is the original version of Riesz-Thorin interpolation theorem. After that, Thorin [18, 19] generalized this result, and published his theses with a variety of applications. Riesz-Thorin interpolation theorem requires strong boundedness of operators at endpoints, but has the better constant and lower requirment of exponents, and is easier to be generalized. For example, in 1958, Stein and Weiss obtained the Stein-Weiss variable measure interpolation theorem[20], which can be used to obtain the reverse factorization property of weights.
To be specific, given , suppose that and , the classical weight theory[1] indicates that
where is the Hardy-Littlewood operator, and for ,
Then by Stein-Weiss variable measure interpolation theorem[20], for
there holds , which implies that .
In this paper, we will further investigate the properties of convex-set valued Lebesgue spaces, especially establish the interpolation theory above them, including Marcinkiewicz interpolation theorem and Riesz-Thorin interpolation theorem. These results not only enrich and develop set-valued analysis theory, but also have some applications in harmonic analysis.
The remainder of this paper is organized as follows. In Section 2, we give some necessary definitions and lemmas. In Section 3, we prove the Marcinkiewicz interpolation theorem, define the fractional averaging operator and fractional maximal operator on convex-set valued Lebesgue spaces, and obtain their boundedness. In Section 4, we prove the Riesz-Thorin interpolation theorem, and use it with some known results of norm functions to obtain the reverse factorization property of matrix weights, which is a part of Jones factorization theorem first proved in[8].
Throughout this paper we will use the following notations. We will use to denote Euclidean space of dimension , which will be the domain of functions, and use to denote the dimension of vector and set-valued functions. We will use to denote a positive, -infinite, and complete measurable spaces, where . The open unit ball will be denoted by and its closure by . The set of all , real symmetric, positive semidefinite matrices will be denoted by . For , will denote the conjugate index of such that , will denote the Lebesgue space of real-valued functions on , and will denote the Lebesgue space of vector-valued functions on . Given two quantities and , we will write if there exists a constant such that , and write if and .
2 Preliminary
We begin with some basic definitions.
Definition 2.1.
[11] For , define to be the closure of , . For , define .
Definition 2.2.
[11] A set is bounded if for some ball ; is convex if for all and , ; is symmetric if .
Let be the collection of all closed, nonempty subsets of , and the subscripts appended to will denote bounded, convex and symmetric sets, respectively. For example, denotes bounded, convex, symmetric and closed subsets of .
Definition 2.3.
[11] Given a set , let denote the convex hull of :
and denote the closure of the convex hull of by .
Definition 2.4.
[11] A seminorm is a function that satisfies the following properties: for all and ,
For a seminorm and , define
A seminorm is a norm if equals .
Definition 2.5.
[8] A seminorm function on is a mapping such that:
(i) for all , is a seminorm on ;
(ii) is a measurable function for any .
In what follows, to simplify writing, we abbreviate as . Next, definitions of measurable set-valued functions and their integrals will be introduced.
Definition 2.6.
[9] Given a function , is measurable if for every open set , .
Definition 2.7.
[9] Given a function , denote to be the set of all measurable selection functions of , that is, all measurable functions such that
By[9, Theorem 8.1.4], for a measurable function , is not empty.
Definition 2.8.
[9] Given a measurable function , define the set of all integrable selection functions of by
The Aumann integral of is the set of integrals of integrable selection functions of , i.e.
There may not exist integrable selection function of , but the integrably bounded property ensures the existence.
Definition 2.9.
[9] A measurable function is integrably bounded if there exists a non-negative function such that
If is a metric space, say is locally integrably bounded if this holds for .
Remark 2.1.
If and for , then is integrably bounded.
Similar to Lebesgue integral of real-valued functions, Aumann integral is linear and monotone.
Lemma 2.1.
The following lemma can be seen in the proof of[8, Proposition 5.2].
Lemma 2.2.
Suppose that is measurable and integrably bounded, , then
This chapter ends with definitions of convex-set valued Lebesgue spaces , convex-set valued weak Lebesgue spaces and distribution functions.
Definition 2.10.
[8] Suppose that is a seminorm function on . For any , define to be the set of all measurable functions such that
and to be the set of all such that satisfy
When , define to be the set of all such that satisfy
Remark 2.2.
If for any , the space will be , which is the generalization of . In fact, given and , set for , then and .
Definition 2.11.
Suppose that is measurable, is a seminorm function on . For any , define the distribution function of as
Since is a real-valued function in , it’s obvious that the following integral formula holds, we omit the proof.
Lemma 2.3.
For any and ,
3 Marcinkiewicz interpolation theorem and its application
We first prove Marcinkiewicz interpolation theorem.
Theorem 3.1.
Let , , , be a seminorm function on , be a sublinear operator defined on the space : for all , and ,
Suppose that there exist two positive constants and such that
then for all and , we have
(3) |
where
Proof.
Without the loss of generality, assume that , and consider the following cases separately:
Case For a fixed and any , split , where
By the definition of and , we have
thus and .
By the sublinearity property of and , there holds
which implies that, for any ,
therefore
The weak boundedness of gives
where , are not less than . Then, by Lemma 2.3, we obtain that
By the dual property of weighted Lebesgue spaces, we have
where and are real-valued functions satisfying
Set , where and will be determined later. By Fubini’s theorem, the integral under the first ’sup’ equals
and the integral under the second ’sup’ equals
Note that
we select
which makes
therefore,
Next, select
therefore,
thus we obtain (3).
Case The proof of this case is similar to that in case . We change the integration regions , to , respectively in the corresponding integers, and change the denominator , to , . Then,
which also implies (3).
Case Note that , by the weak boundedness of , there hold
Therefore, for a certain which will be determined later, we have
Select
therefore,
which implies (3) with a better constant.
Case If , take in the split of in case , then
which follows that . Note that , according to the similar calculation as which in case , we have
If , we still select makes , after which the proof proceeds as before. Suppose that
and is a positive number which will be determined later. It is enough to show that for a suitable , we have . By the weak boundedness of ,
It follows that we certainly have if
which can be implied by
Since the integral on the left is , the inequality is satisfied if , which completes the proof of this case.
Case In this case, we need only change the symbol of some exponents in case as which in case . We omit the details here.
Case By the weak boundedness of , there hold
Therefore, for , we have
which implies (3) with a better constant. ∎
The following discussion shows that Theorem 3.1 can deduce Marcinkiewicz interpolation theorem on Lebesgue spaces with an additional condition of operator. Through the same method, we can obtain Marcinkiewicz interpolation theorem on vector-valued Lebesgue spaces by Theorem 3.1.
Remark 3.1.
Under the assumptions of in Theorem 3.1, suppose that is a sublinear operator bounded from to , bounded from to , and satisfying . Set , , and define an associated operator on as
It’s easy to obtain that is a sublinear operator bounded from to , and bounded from to . Therefore, by Theorem 3.1, is bounded from to .
For , define for , we have
which implies that is bounded from to .
Next, we define the fractional averaging operator and fractional maximal operator of locally integrably bounded functions, and use Theorem 3.1 to obtain their boundedness.
Definition 3.1.
Let that is locally integrably bounded, for a fixed cube and , define the fractional averaging operator by
Lemma 3.1.
Given any cube , the fractional averaging operator is linear: if are locally integrably bounded mappings, , then for all ,
Proof.
By Lemma 2.1, we have
and
which show the linearity. ∎
Theorem 3.2.
Given a cube , for , such that , the fractional averaging operator is bounded.
Proof.
We begin with . By Lemma 2.2,
Then, consider the case , . By Lemma 2.2 and Hölder’s inequality, for all , we have
which implies that
Finally, by Theorem 3.1 with , , , , , and , we finish the proof. ∎
Definition 3.2.
Given a locally integrably bounded function and , define the fractional maximal operator by
where the union is taken over all cubes whose sides are parallel to the coordinate axes.
Lemma 3.2.
The fractional maximal operator is sublinear: if are locally integrably bounded mappings, , then for all ,
Proof.
By Lemma 3.1 and the linearity of the closure of convex hull,
and
which show the sublinearity. ∎
To prove the boundedness of fractional maximal operators, we need the following results.
Definition 3.3.
[21] For , define the translated dyadic grid
and define the generalized dyadic fractional maximal operator
which generalizes the standard dyadic grid , and dyadic fractional maximal operator
Definition 3.4.
[8] Given a locally integrably bounded function and , define
Similar to [8, Lemma 5.9], the following lemma can be proved, we omit the details here.
Lemma 3.3.
Given a locally integrably bounded, convex-set valued function , we have
where the constant depends only on dimension and .
Theorem 3.3.
For , such that , the fractional maximal operator is bounded. For , , , is bounded.
Proof.
First, by Lemma 3.3,
and so it will suffice to prove the strong and weak type inequalities for . In fact, given that all of the dyadic grids have the same properties as , it will suffice to prove them for the dyadic fractional maximal operator . Moreover, arguing as the authors did in the proof of[8, Lemma 5.6], it will suffice to prove our estimates for the operator .
We begin with , by adapting the Calderón-Zygmund decomposition to convex-set valued functions. Fix and define
If is empty, there is nothing to prove. Otherwise, given , there must exist a cube such that , and
We claim that among all the dyadic cubes containing , there must be a largest one with this property. By Lemma 2.2,
Since the right-hand side goes to as , we see that such a maximal cube must exist, denote this cube by . Since the set of dyadic cubes is countable, we can enumerate the set by . The cubes must be disjoint, since if one were contained in the other, it would contradict the maximality. By the choice of these cubes, , hence
Then we consider the case , . Since , by the boundedness of , for a.e. , we have
which implies that
Finally, by Theorem 3.1 with , , , , , and , we finish the proof. ∎
4 Riesz-Thorin interpolation theorem and its application
Complex method is often important in operator theory, see [22, 23]. In this section, we first prove Riesz-Thorin interpolation theorem, which needs some results of density, analytic functions and dual norms.
Definition 4.1.
Definition 4.2.
[8] A measurable function is called a simple function if takes only finitely many values , hence, it can be written in the form
where are disjoint measurable sets such that
Lemma 4.1.
[8] Every measurable function is the pointwise limit of simple measurable functions with respect to the Hausdorff distance on
Lemma 4.2.
For any , and , there exists a simple measurable function such as .
Proof.
By the proof of[8, Lemma 4.4], there exist simple measurable functions such that
for any . Therefore,
and
By Lebesgue dominated covergence theorem,
Setting for sufficiently large finishes the proof. ∎
Lemma 4.3.
[24] Suppose is a complex measure on a measure space , is an open set in the plane, is a bounded function on such that is a measurable function of for each , and is analytic in for each . For , define
then is analytic in .
Lemma 4.4.
[25] Let be analytic on the open strip and continuous on its closure such that
for some fixed and . Then
whenever .
Definition 4.3.
[8] Given a seminorm , define by
(4) |
Definition 4.4.
[8] If is a norm function, then , defined by , is a measurable norm function.
Definition 4.5.
The function may not be a norm. However, if we still use (4) to define , it will be a norm.
Lemma 4.5.
[8] Let , be two norms, then for , is a norm. Moreover, is a norm, and for all , .
Theorem 4.1.
Let , , be norm functions on , be the set of all locally integrably bounded functions , be a linear, monotone operator. Suppose that
for all , and , are bounded for all sets , that make , bounded. Then for any and simple function , we have
where is a constant independent of , and
(5) |
By density, is bounded from to for all , and as in (5).
Proof.
First, assume that . Let
be a simple function in , where and are pairwise disjoint subsets of with finite measure. We need to control
where the supremum is taken over all simple functions with norm not bigger than 1. Write
where , are real, and are pairwise disjoint subsets of with finite measure.
Denote the open strip , and its closure . For , define
and
where
We claim that is analytic on . By the linearity of ,
Consider the open set for given , for , by the sublinearity of and ,
For all and , , are bounded by assumption, and , , are all bounded by a constant independent of , thus is bounded on . By Lemma 4.3, is analytic in , and then is analytic in by the arbitrary of .
Besides, for all ,
thus we have
therefore, by Lemma 4.4, for all ,
Note that
we have . Set , we obtain
Note that , , by Lemma 4.5, we have
Therefore, for all simple functions satisfying . For an arbitrary simple function , by the linearity of and (with number multiplication), we obtain the same conclusion.
Finally, for any and , by Lemma 4.2, there exists simple measurable function satisfying for all , and
Set , then and . By the definition of Hausdorff distance, for all ,
Then, by the linearity and monotonicity of ,
By the arbitrary of , we have , which completes the proof. ∎
By the similar argument as Remark 3.1, Theorem 4.1 can also deduce Riesz-Theoin interpolation theorem on Lebesgue spaces with some additional conditions of operator .
To prove the reverse factorization property, we need the condition of norm functions.
Definition 4.6.
[8] Fix and suppose for all , define
Definition 4.7.
[8] Given a norm function , then for , if for every cube and ,
Definition 4.8.
[8] A matrix mapping is called measurable if each of its components is a measurable function. Let be a measurable matrix mapping, define an seminorm function by
For each , is a seminorm, and since is measurable, the map is measurable for all . Reversely, for a given norm function, the similar result exists.
Lemma 4.6.
[8] Let be a norm function, then there exists an associated measurable matrix mapping such that for a.e. and every , is positive definite, and
The following lemma shows the connection between norm functions and their associated matrix weights.
Lemma 4.7.
[8] Given a norm function with associated matrix mapping and , if and only if , that is,
When , if and only if , that is,
We need the following characterization of norm weights.
Definition 4.9.
[8] Let that is locally integrably bounded, for a fixed cube , we define the averaging operator by
Lemma 4.8.
[8] Given and a norm function , the following propositions are equivalent:
(i) ;
(ii) Given any cube , is bounded.
We also need the following results about the weighted geometric mean.
Lemma 4.9.
[8] Suppose that , and the norms and are given by
then the double dual of the weighted geometric mean satisfies
Now, we prove the reverse factorization property.
Theorem 4.2.
Given , suppose that matrix mappings , , and , are bounded for . Then for any , , where
Proof.
Define the following norm functions:
By the assumption of and , Lemma 4.7 and Lemma 4.8, for any cube ,
Therefore, by Theorem 4.1,
Using Lemma 4.8 again, we have . By Lemma 4.9, , which implies that . Finally by Lemma 4.7, we complete the proof. ∎
Acknowledgments
The authors thank the referees for their careful reading and helpful comments which indeed improved the presentation of this article.
Funding information
The research was supported by Natural Science Foundation of China (Grant No. 12061069).
Authors contributions
All authors have accepted responsibility for the entire content of this manuscript and approved its submission.
Conflict of interest
Authors state no conflict of interest.
Yuxun Zhang and Jiang Zhou
College of Mathematics and System Sciences, Xinjiang University, Urumqi 830046
E-mail :
[email protected] (Yuxun Zhang);
[email protected] (Jiang Zhou)
References
- [1] B. Muckenhoupt. Weighted norm inequalities for the Hardy maximal function. Transactions of the American Mathematical Society, 165:207–226, 1972.
- [2] S. Treil F. L. Nazarov. The hunt for a Bellman function: applications to estimates for singular integral operators and to other classical problems of harmonic analysis. Algebra i analiz, 8(5):32–162, 1996.
- [3] A. Volberg S. Treil. Wavelets and the angle between past and future. Journal of functional analysis, 143(2):269–308, 1997.
- [4] A. Volberg. Matrix weights via S-functions. Journal of the American Mathematical Society, 10(2):445–466, 1997.
- [5] S. Roudenko. Matrix-weighted Besov spaces. Transactions of the American Mathematical Society, 355(1):273–314, 2003.
- [6] P. W. Jones. Factorization of weights. Annals of Mathematics, 511–530, 1980.
- [7] J. L. Rubio de Francia. Factorization theory and weights. American Journal of Mathematics, 533–547, 1984.
- [8] D. Cruz-Uribe M. Bownik. Extrapolation and factorization of matrix weights. arXiv preprint arXiv:2210.09443, 2022.
- [9] H. Frankowska J. Aubin. Set-valued analysis. Springer Science & Business Media, 2009.
- [10] M. Valadier C. Castaing. Measurable multifunctions. Springer, 1977.
- [11] R. T. Rockafellar. Convex analysis, volume 11. Princeton university press, 1997.
- [12] J. Marcinkiewicz. Sur l’interpolation d’operations. C. R. Acad. Sci., 1272–1273, 1939.
- [13] A. Zygmund. On a theorem of Marcinkiewicz concerning interpolation of operators. J. de Math., 35:223–248, 1956.
- [14] S. Chanillo. A note on commutators. Indiana University Mathematics Journal, 31(1):7–16, 1982.
- [15] R. Wheeden B. Muckenhoupt. Weighted norm inequalities for fractional integrals. Transactions of the American Mathematical Society, 192:261–274, 1974.
- [16] A. Zygmund. Trigonometric series, volume 1. Cambridge university press, 1959.
- [17] M. Riesz. Sur les maxima des formes bilinéaires et sur les fonctionnelles linéaires. Acta mathematica, 49(3-4):465–497, 1927.
- [18] G. Thorin. An extension of a convexity theorem due to M. Riesz. Fysiogr. Sällsk. Lund Förh, 8:166–170, 1939.
- [19] G. Thorin. Convesity theorems generalizing those of M. Riesz and Hadamard with some applications. Comm. Sem. Math. Univ. Lund [Medd. Lunds Univ. Mat. Sem.], 1–58, 1948.
- [20] D. Yong. Foundations of modern analysis (in Chinese). Beijing Normal University Press, 2008.
- [21] J. Isralowitz D. Cruz-Uribe and K. Moen. Two weight bump conditions for matrix weights. Integral Equations and Operator Theory, 90:1–31, 2018.
- [22] B. Guanlong Y. Fangqin. A Carleson type measure and a family of Möbius invariant function spaces. Indagationes Mathematicae, 34(6):1338–1354, 2023.
- [23] C. K. Chui Z. Lefan. Order of uniform approximation by polynomial interpolation in the complex plane and beyond. Indagationes Mathematicae, 34(2):418–456, 2023.
- [24] W. Rudin. Real and complex analysis. McGraw-Hill Book Company, 1970.
- [25] L. Grafakos. Classical Fourier analysis. Springer, 2008.
- [26] R. Bhatia. Positive definite matrices. Princeton University Press, 2007.