Weak endpoint bounds for matrix weights
David Cruz-Uribe, Joshua Isralowitz, Kabe Moen, Sandra Pott, Israel P., Rivera-R\'ios

TL;DR
This paper establishes new quantitative endpoint bounds for matrix weights in harmonic analysis, specifically for maximal operators, Calderón-Zygmund operators, and their commutators under $A_1$ matrix weights.
Contribution
It provides the first quantitative matrix weighted endpoint estimates for these operators when the matrix weight belongs to the $A_1$ class.
Findings
Proves endpoint bounds for matrix weighted Hardy-Littlewood maximal operator.
Establishes bounds for Calderón-Zygmund operators with matrix weights.
Analyzes commutators of CZOs with scalar BMO functions under matrix weights.
Abstract
We prove quantitative matrix weighted endpoint estimates for the matrix weighted Hardy-Littlewood maximal operator, Calder\'on-Zygmund operators, and commutators of CZOs with scalar BMO functions, when the matrix weight is in the class introduced by M.~Frazier and S.~Roudenko.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Weak endpoint bounds for matrix weights
David Cruz-Uribe, OFS
Department of Mathematics
University of Alabama, Box 870350, 345 Gordon Palmer Hall.
,
Joshua Isralowitz
Department of Mathematics and Statistics
SUNY Albany, 1400 Washington Ave., Albany, NY, 12222.
,
Kabe Moen
Department of Mathematics
University of Alabama, Box 870350, 345 Gordon Palmer Hall.
,
Sandra Pott
Centre for Mathematical Sciences, University of Lund, PO Box 118, 22100 Lund, Sweden
and
Israel P. Rivera-Ríos
Instituto de Matemática de Bahía Blanca (INMABB), Departamento de Matemática, Universidad Nacional del Sur (UNS) - CONICET, Av. Alem 1253, Bahía Blanca, Argentina
Abstract.
We prove quantitative matrix weighted endpoint estimates for the matrix weighted Hardy-Littlewood maximal operator, Calderón-Zygmund operators, and commutators of CZOs with scalar BMO functions, when the matrix weight is in the class introduced by M. Frazier and S. Roudenko.
Key words and phrases:
Matrix weights, matrix , maximal operators, Calderón-Zygmund operators, commutators, sparse operators
2010 Mathematics Subject Classification:
Primary 42B20, 42B25, 42B35
Cruz-Uribe is supported by research funds from the Dean of the College of Arts & Sciences, the University of Alabama; Isralowitz and Moen are supported by the Simons Foundation; Rivera-Ríos is supported by grant PIP (CONICET) 11220130100329CO
1. Introduction
In this paper we consider weak-type endpoint estimates for operators with matrix weights. In order to put our results into context, we first review briefly the scalar case. It is well-known that the Hardy-Littlewood maximal operator and all Calderón-Zygmund operators (CZOs) are bounded on when and : that is,
[TABLE]
where the supremum is taken over all cubes with sides parallel to the coordinate axes. These operators are not bounded on , but do map into when : that is, for every cube and almost every ,
[TABLE]
here is the infimum of all constants such that this inequality holds.
However, there is another version of the endpoint inequality. Given a weight and an operator , for , define . Then it is immediate that strong-type inequalities for are equivalent to weighted strong-type estimates for : if and only if . Consequently, we have that if is a CZO or the Hardy-Littlewood maximal operator, and if , then . This suggests that when and , we should have weak-type inequalities of the form
[TABLE]
Muckenhoupt and Wheeden [MW] first proved such inequalities when for the Hardy-Littlewood maximal operator and the Hilbert transform; their results were extended to higher dimensions and arbitrary CZOs (as well as the maximal operator) in [CMP]. These estimates are much more delicate and even for the maximal operator are much more difficult to prove than the more standard endpoint result considered above. Moreover, it was shown in [MW] that the condition is not necessary even for the maximal operator; they showed, for instance, that this endpoint inequality holds when .
Remark**.**
There has been a great deal of interest in generalizing these results to the two-weight setting; the original motivation (even in the one-weight setting) is that such inequalities arise naturally in the theory of interpolation with change of measure of Stein and Weiss [stein-weiss58]. See [CR] for a short history.
We now consider matrix weights: our goal is to generalize (1.1) to this setting. To state our results we first give some basic definitions. For more details, see [CRM, G, MR1928089]. A matrix weight is an self-adjoint matrix function with locally integrable entries such that is positive definite for a.e. . Define for any via diagonalization. Define the operator norm of by
[TABLE]
Finally, for all , define to be the collection of measurable, vector-valued functions such that
[TABLE]
Given a linear operator , , and a matrix weight , define the matrix operator by
[TABLE]
as before, if and only if . It was shown by Christ and Goldberg [CG, G] that for , if is a CZO, then this inequality holds if and only if satisfies the matrix condition,
[TABLE]
Note that this formulation of the matrix condition is due to Roudenko [MR1928089]; see this paper or [CG, G] for the earlier, equivalent definition in terms of norms. While the maximal operator is not linear, they showed that a variant of the maximal operator (now referred to as the Christ-Goldberg maximal operator,
[TABLE]
is bounded on if and only if , .
In the setting of matrix weights, it is unclear how to define the weak-type space ; therefore, it is natural to use the strong-type bounds to get unweighted, weak bounds for or . Here, we argue directly to prove weak estimates for when is a CZO, and for the Christ-Goldberg maximal operator . The appropriate weight class is matrix , first defined by Frazier and Roudenko [FR]: a matrix weight belongs to if
[TABLE]
Note that in the scalar case, when , this definition reduces immediately to the definition of scalar . If , then we have that is in scalar ; see [CRM, Lemma 4.4]. Therefore, we can define the scalar constant of by
[TABLE]
This constant was first introduced in the setting in [NPTV] and for in [CIM]. In the theory of scalar weights there are several equivalent definitions of ; we will use the sharp, Fujii-Wilson definition. The precise definition does not directly matter as we will use this condition indirectly; see [HP, HPR] for details.
We can now state our first two results.
Theorem 1.1**.**
Define by (1.3) with . Given , then for all and
[TABLE]
Theorem 1.2**.**
Define by (1.2) with . Given then for all and
[TABLE]
It follows from the definition that , so in both of these results we can estimate the constant by . While we are able to give a quantitative estimate in terms of the constant, we do not believe that either result is sharp. In the scalar case, for the Hardy-Littlewood maximal operator it is well known (though not explicitly in the literature) that the sharp constant is . For CZOs the sharp constant is : see Lerner, Ombrosi and Pérez [LeOP] for the upper bound and [LNO] for the lower bound.
Remark**.**
When , direct estimates for the best constant in the weak inequalities for these operators are not known. From the strong inequalities, we have that an upper bound on the constant for is (see [IM]) and for is (see [CIM]). It is an open question whether our techniques can be used to prove better weak type estimates.
Remark**.**
As we noted above, even in the scalar case the condition is not necessary for to satisfy the weak inequality. However, weights are characterized by a weak inequality for a closely related, “auxiliary” maximal operator , that was introduced by Christ and Goldberg [CG, G] and which plays an important role in studying . See [CIM, Theorem 1.21] where this is proved in a more general context.
Finally, we can also use our techniques to prove a quantitative, weak-type estimate for commutators of CZOs. Let be a CZO and let . Define the commutator , and define the matrix weighted commutator . Even in the scalar case commutators are more singular and do not satisfy weak bounds. Rather, the natural endpoint condition involves an estimate: see Pérez and Pradolini [perez95b, MR1827073]. Let ; then we have the following result.
Theorem 1.3**.**
Given , then for all and ,
[TABLE]
The remainder of this paper is organized as follows. In Section 2 we provide some preliminary results about matrix weights and about domination via sparse operators. In Section 3 we prove Theorems 1.1 and 1.2. Finally, in Section 4 we prove Theorem 1.3.
Throughout, will denote the dimension of the underlying space , and will be dimension of space in which vector-valued functions take their range. All matrices will be matrices. If we write , then there exists a constant such that . By we mean and . The implicit constants might depend on , , or the given CZO, but will not depend on the matrix weight .
2. Preliminaries
In this section we gather a few additional facts about matrix weights and also give the results on sparse domination which are central to our proofs.
First, as we noted above, if , then we have that is a scalar weight [CRM, Lemma 4.4]. Moreover, we in fact have that for any , , and
[TABLE]
Central to estimating matrix weighted operators is the concept of a reducing matrix. These were first introduced in [CG, G] when , and when in [FR]. Given a norm on , it is well known (see [NT, Lemma 11.4] for a self contained and simple proof) that there exists a positive definite matrix such that for any we have . We refer to this matrix as a reducing matrix of . (Note that the matrix is not unique, but this is not important in practice.) In particular, given a matrix weight and any measurable with , we have that e\mapsto\mathchoice{{\vbox{\hbox{\textstyle-}}\kern-4.86108pt}}{{\vbox{\hbox{\scriptstyle-}}\kern-3.25pt}}{{\vbox{\hbox{\scriptscriptstyle-}}\kern-2.29166pt}}{{\vbox{\hbox{\scriptscriptstyle-}}\kern-1.875pt}}\!\int_{Q}|W(y)e|\,dy is a norm on . Hereafter we will denote by any reducing matrix for this norm, so that
[TABLE]
We can also define the matrix condition in terms of reducing matrices. Given a cube and , we have that if is the standard basis for , then
[TABLE]
Hence,
[TABLE]
To prove our results, we will show that we can reduce each weak-type estimate to proving an analogous result for a so-called sparse operator. To define these operators first we recall the machinery of general dyadic grids as defined in [LN]; we refer the reader there for complete details. We will need the fact that every cube in can be approximated by a dyadic cube from one of finitely many dyadic grids (see the corollary of [LN, Theorem 3.1]).
Lemma 2.1**.**
There exist dyadic grids such that given any cube there exists and such that and .
Given we say that is a -sparse family if for every there exists a measurable subset such that
- (1)
2. (2)
The sets are pairwise disjoint.
Further, given we say that is a Carleson family if for every ,
[TABLE]
Clearly every -sparse family is Carleson, since
[TABLE]
Though less obvious, the converse is true:. every Carleson family is sparse [LN, Lemma 6.3]. We will also use without further comment the fact that every Carleson family can be written as a union of Carleson families, each of which is Carleson [LN, Lemma 6.6]. Hereafter we will sometimes refer to a family as sparse or Carleson without reference to or if the specific values of these constants are unimportant.
To estimate CZOs applied to vector-valued functions, we will use the convex body domination that was introduced by F. Nazarov, S. Petermichl and A. Volberg [NPTV]. Given a cube and a function , define
[TABLE]
where . They proved that \mathopen{\hbox{{\langle}}\kern-1.94444pt\leavevmode\hbox{{\langle}}}f\mathclose{\hbox{{\rangle}}\kern-1.94444pt\leavevmode\hbox{{\rangle}}}_{Q} is a symmetric, convex and compact set in .
The following result was first proved in [NPTV]; we give it here in the version found in [HNotes, Corollary 2.3.18]. To state it, recall that given a linear operator , the grand-maximal operator , defined by A. Lerner [Le], is
[TABLE]
Theorem 2.2**.**
Let be a linear operator such that . For and , there exist , -sparse collections of dyadic cubes (drawn from the dyadic grids in Lemma 2.1) such that
[TABLE]
where . In particular, there exist functions such that
[TABLE]
Lerner proved that for Calderón-Zygmund operators,
[TABLE]
See [Le] for the precise definitions of the Dini condition and the Dini “norm” of the kernel of a CZO . It is also known that
[TABLE]
Consequently Theorem 2.2 holds for a Calderón-Zygmund operator with
[TABLE]
The sparse convex body domination can also be extended to commutators. In fact, somewhat surprisingly, we can use a “ block matrix trick” inspired by [GPTV] in conjunction with Theorem 2.2 to obtain the corresponding result for commutators. In particular, the following was very recently proved in [IPR], extending [LORR, Theorem 1.1] (and in fact providing a very short proof of [LORR, Theorem 1.1].) For completeness we include the relatively short proof.
Theorem 2.3**.**
Let be a linear operator such that . For and every where , and there exist there exist , -sparse collections of dyadic cubes (drawn from the dyadic grids in Lemma 2.1) such that
[TABLE]
where each is a constant and . In particular, there exist functions such that
[TABLE]
Proof.
Let . By Theorem 2.2 there exists sparse collections of cubes and with where
[TABLE]
Define the valued function by
[TABLE]
and define the block matrix by
[TABLE]
so that
[TABLE]
Direct computation shows
[TABLE]
and
[TABLE]
Since , plugging into (2.4) gives
[TABLE]
However, adding and subtracting to the first component, we get
[TABLE]
Thus,
[TABLE]
∎
3. Proofs of Theorems 1.1 and 1.2
We will first need to prove a sparse domination of the maximal function which is more useful for us than the linearization in [CG, G]. Note that a similar stopping time argument was used in [IPR] to prove the sharp bound
[TABLE]
when Given a dyadic grid , define
[TABLE]
and for a sparse collection of dyadic cubes, let
[TABLE]
Lemma 3.1**.**
Let be any matrix weight and have compact support. Then there exists sparse collections where
[TABLE]
Proof.
By Lemma 2.1, it is enough to prove Lemma 3.1 for where is a fixed dyadic grid. Furthermore, since has compact support, we can replace by for some , where
[TABLE]
Let denote the maximal cubes (if any exist) where
[TABLE]
By maximality we have
[TABLE]
Now let be the collection of cubes in that are not a subset of any cube . We then have
[TABLE]
We first estimate . Let and assume also . Then by definition of we must have so that
[TABLE]
where the last inequality follows from maximality.
Next, to estimate , let and pick a sequence of nested dyadic cubes where
[TABLE]
But if
[TABLE]
then for some we have
[TABLE]
which means that for some . Thus,
[TABLE]
Iteration now completes the proof ∎
Proof of Theorems 1.1 and 1.2.
By Fatou’s lemma for weak type estimates, we may assume that has compact support. By Theorem 2.2 we have that there exists
[TABLE]
Also note that Lemma 3.1 gives us the same estimate for . Therefore, to prove Theorem 1.1 and Theorem 1.2 it is enough to prove that
[TABLE]
where is the scalar linear operator defined by
[TABLE]
and is a sparse family of cubes contained in a dyadic grid . Let
[TABLE]
where are the maximal dyadic cubes that satisfy:
[TABLE]
We use a Calderón-Zygmund decomposition argument inspired by the arguments in [CMP]. Let where and b_{j}=(|f|-\mathchoice{{\vbox{\hbox{\textstyle-}}\kern-4.86108pt}}{{\vbox{\hbox{\scriptstyle-}}\kern-3.25pt}}{{\vbox{\hbox{\scriptscriptstyle-}}\kern-2.29166pt}}{{\vbox{\hbox{\scriptscriptstyle-}}\kern-1.875pt}}\!\int_{Q_{j}}|f|)\chi_{Q_{j}}. Then is a non-negative function that satisfies
[TABLE]
while each is supported on and satisfies . Then we have
[TABLE]
Notice that the second term satisfies . Meanwhile, the third term is zero, since . Indeed, if and for some then obviously . Thus,
[TABLE]
so . Thus we are reduced to estimating . By (2.1) and the sharp A∞ reverse Hölder inequality (see [HPR]), we can pick independent of where if then
[TABLE]
Let be such that . We will show that and thus
[TABLE]
where in the last line we used that To see that is bounded on let and be non-negative scalar functions with and . Then we use the well-known bound for the dyadic maximal function
[TABLE]
We have
[TABLE]
where we have additionally used that the maximal function is bounded on since and
[TABLE]
∎
Remark**.**
The proof of Theorem 1.1 using Lemma 3.1 has the advantage that it allows us to simultaneously prove Theorem 1.2. However, it is also possible to prove the endpoint estimate for ( most likely with worse A1 and A dependence) more directly by modifying the original proof of the strong estimates due to Goldberg [G]. This proof also relies on the Calderón-Zygmund decomposition into “good” and “bad” functions. The estimate for the bad part is similar to the proof given above, while the estimate for the good part is more complicated and relies on the operator from [G]. We leave the details of this proof to the interested reader.
4. Proof of Theorem 1.3
The Calderón-Zygmund decomposition argument that was used to prove Theorem 1.2 unfortunately does not work to handle the sparse type operators in Theorem 2.3 and instead we need to employ “slicing” arguments that are similar to the ones in [CR].
First, we recall a few facts about the space and needed in the proof. For details, see [MR2797562, Chapter 5]. Let . It is straightforward to show that is submultiplicative: for all , . For a measurable, valued function and a measurable with , define the norm by the Luxemburg norm
[TABLE]
The conjugate Young function of is the function . We again define the norm by the Luxemburg norm
[TABLE]
Then we have the following Hölder inequality for these spaces:
[TABLE]
Finally we will need the exponential integrability of functions; this is a consequence of the classical John-Nirenberg theorem. If , then
[TABLE]
We will prove the desired estimate in Theorem 1.3 by first bounding the term (2.2). This bound is given by the following lemma.
Lemma 4.1**.**
Let be a sparse family and
[TABLE]
If then
[TABLE]
Proof.
Without loss of generality we may assume that and . Furthermore, we may assume that is sparse. If
[TABLE]
then it suffices to prove that
[TABLE]
Let and as before choose with independent of where
[TABLE]
We then have
[TABLE]
while
[TABLE]
Here we have used the following corollary of John-Nirenberg inequality
[TABLE]
see for instance [GCRdF, Corollary 3.10 p.166]. Now we split the sparse family as follows: We say , if
[TABLE]
Then
[TABLE]
Now we observe that
[TABLE]
For the first estimate we argue as follows. Let . Then
[TABLE]
For the second term,
[TABLE]
since is sparse and thus Carleson. Thus,
[TABLE]
which means that
[TABLE]
For the second estimate of , let denote the maximal cubes in . Then
[TABLE]
Since is Carleson. Putting all this together, we obtain
[TABLE]
Pick some to be determined momentarily. To finish the proof we will estimate the double sum
[TABLE]
For the first term
[TABLE]
And it suffices to choose . For the second term
[TABLE]
Combining all the preceding estimates we are done. ∎
We now finish the proof of Theorem 1.3 by estimating (2.3). More precisely, standard bounds on in conjunction with the following lemma will finish the proof of Theorem 1.3. To prove the following Lemma we will need the exponential integrability of functions and
Lemma 4.2**.**
Let be a sparse family and let
[TABLE]
If with and
[TABLE]
then we have that
[TABLE]
Proof.
Since with , by (4.3) there exists a constant such that
[TABLE]
If we again denote and proceed as in the proof of Lemma 4.1 then
[TABLE]
As before we say if
[TABLE]
Then
[TABLE]
Now we are going to prove that
[TABLE]
We start with the first estimate. Again let . First we note that
[TABLE]
Indeed, since is -Carleson and we have that
[TABLE]
Now we observe that
[TABLE]
while the other estimate for follows from (4.4). Combining the preceding estimates we have that
[TABLE]
Now we are left with estimating the double sum. We proceed as follows.
[TABLE]
For the first term
[TABLE]
where for the last equality we choose . For the second term
[TABLE]
∎
References
