Quantitative estimates and extrapolation for multilinear weight classes
In this paper we prove a quantitative multilinear limited range extrapolation theorem which allows us to extrapolate from weighted estimates that include the cases where some of the exponents are infinite. This extends the recent extrapolation result of Li, Martell, and Ombrosi. We also obtain vector-valued estimates including ℓ ∞ spaces and, in particular, we are able to reprove all the vector-valued bounds for the bilinear Hilbert transform obtained through the helicoidal method of Benea and Muscalu. Moreover, our result is quantitative and, in particular, allows us to extend quantitative estimates obtained from sparse domination in the Banach space setting to the quasi-Banach space setting. Our proof does not rely on any off-diagonal extrapolation results and we develop a multilinear version of the Rubio de Francia algorithm adapted to the multisublinear Hardy–Littlewood maximal operator. As a corollary, we obtain multilinear extrapolation results for some upper and lower endpoints estimates in weak-type and BMO spaces.
Keywords: 42B25; 42B20
Introduction
An essential tool in the theory of singular operators is extrapolation. In one of its forms, the classical extrapolation theorem of Rubio de Francia [[14]] says that if an operator T satisfies boundedness for a fixed and for all weights w in the Muckenhoupt class , then T is in fact bounded on for all and all .
Many variations of Rubio de Francia's extrapolation theorem have appeared over the years adapted to various situations. A multilinear version of the extrapolation result was found by Grafakos and Martell [[17]]. Another version provided by Auscher and Martell [[1]] dealt with operators bounded only for a limited range of p rather than for all . Combining these approaches, it was shown by Cruz-Uribe and Martell [[7]] that if there are and , , such that an m-linear operator T satisfies
1.1
Graph
for all weights in the restricted Muckenhoupt and Reverse Hölder class , where , , then T satisfies the same boundedness for all and all , as well as certain vector-valued bounds.
In the linear setting for operators satisfying weighted bounds, it need not be the case that they are bounded on , as is the case, for example, for the Hilbert transform. In particular, it is impossible to extrapolate estimates to this endpoint. This is in contrast to what happens in the multilinear setting, where it may very well occur that singular integral operators satisfy boundedness as in (1.1), but with some of the being equal to . This brings an interest to the question whether it is possible to extrapolate to bounds that include these endpoint cases , starting from an initial weighted estimate where the are also allowed to be infinite. In this work we develop a method that does include these cases based on a multilinear Rubio de Francia algorithm. To facilitate this we give a natural extension in the definition of the weight classes to include these cases, see Definition 2.1 below. We point out that it is also possible to obtain these endpoint cases through off-diagonal extrapolation methods [[32]].
As an application for the theory, one can consider the bilinear Hilbert transform given by
Graph
which plays a central role in the theory of time-frequency analysis. It was shown by Lacey and Thiele [[25]] that is bounded with if and . Through the helicoidal method of Benea and Muscalu [[2], [4]], vector-valued bounds of the form were established in this range of , , p for various choices of , with . However, they left open the problem whether one can obtain vector-valued bounds for all , , q in the same range as Lacey and Thiele's theorem, i.e., for all with . While satisfies weighted bounds as well as more general sparse bounds, see [[3], [8]], the extrapolation result by Cruz-Uribe and Martell [[7]] does not allow one to cover the full range of exponents. In particular, their result cannot retrieve any of the vector-valued bounds involving spaces. Such bounds also fall outside of the extrapolation result of Lorist and the author [[35]] where vector valued extensions of multilinear operators were considered in the setting of Banach spaces, since does not satisfy the property. The problem seems to be that the multilinear nature of the problem is not completely utilized when one imposes individual conditions on the weights rather than involving an interaction between the various weights.
In the recent work [[33]] by Li, Martell, and Ombrosi an extrapolation result was presented where they work with a limited range version of the multilinear weight condition introduced by Lerner, Ombrosi, Pérez, Torres, and Trujillo-González [[30]] which also appears in [[3]] and, in the bilinear case, in [[8]]. Indeed, such weight classes are characterized by boundedness of the multi-sublinear Hardy–Littlewood maximal operator as well as by boundedness of sparse forms, meaning the theory can be applied to important operators such as multilinear Calderón-Zygmund operators as well as the bilinear Hilbert transform. They introduced the weight class where , and and with and if
1.2
Graph
They showed that if (1.1) holds for a with , and all , then T satisfies the same boundedness for all and with and . Furthermore, their result extends and reproves some of the vector-valued bounds found by Benea and Muscalu [[4]] for . This class of weights does seem to be adapted to the situation even when , but one needs to be careful in how the constant is interpreted in this case. Similar to the proof of the extrapolation result of Cruz-Uribe and Martell, their proof of this extrapolation result is based upon an off-diagonal extrapolation result, but in their work they left open exactly what happens in the case that some of the exponents are infinite. They announced a paper in which these cases were treated which had not appeared yet when our paper was first posted, but is available now [[32]]. Here they show that, as a feature of off-diagonal extrapolation, it is also possible to obtain estimates that include the cases of infinite exponents.
In this work we again prove an extrapolation result using the multilinear weight classes, and our result includes these endpoint cases which, in particular, include the possibility of extrapolating from the cases where in the initial assumption the exponents can be infinite. Our proof is new and does not rely on any off-diagonal extrapolation result. Rather, we generalize the Rubio de Francia algorithm to a multilinear setting adapted to the multi-sublinear Hardy–Littlewood maximal operator. As a corollary, we are able to obtain vector-valued extensions of operators to spaces including spaces. Thus, applying this to allows us to recover these endpoint bounds that were obtained earlier through the helicoidal method [[4]].
Our construction is quantitative in the sense that it allows us to track the dependence of the bounds on the weight constants. Such quantitative versions of extrapolation results were first formalized by Dragičević, Grafakos, Pereyra, and Petermichl in the linear setting in [[11]], but are completely new in the multilinear setting. In the linear setting this result is based on Buckley's sharp weighted bound for the Hardy–Littlewood maximal operator. This bound has been generalized to the multi-sublinear Hardy–Littlewood maximal operator by Damián, Lerner, and Pérez [[10]] to a sharp estimate in the setting of a mixed type estimates and a sharp bound is found in [[34]]. We give a different proof of this result for the limited range version of this maximal operator by generalizing a proof of Lerner [[28]].
Finally, we also show how our quantitative extrapolation result recovers and extends a bound obtained for multi-(sub)linear sparsely dominated operators, generalizing the bound of Hytönen's Theorem [[20]]. More precisely, sparse domination yields sharp bounds for an operator for exponents only if so that we may appeal to duality. Our extrapolation result allows us to show that this same control in terms of the weight also holds when .
Symmetry in Muckenhoupt weight classes
To facilitate our results, we heavily rely on the symmetric structure of the Muckenhoupt classes.
For , a standard method of obtaining weighted estimates with a weight w is by using the duality given through the integral pairing
Graph
Moreover, the Muckenhoupt class is defined through these two weights w and through
Graph
where the supremum is taken over all cubes . One way to understand this definition better is by noting that we can relate the weights w and through . One can also make sense of this condition if through
Graph
and one usually defines .
When we replace the weight w by the weight we find, using the averaging notation , that
Graph
for . The symmetry in this condition is much more prevalent and this condition seems to be more naturally adapted to the weighted theory. Indeed, defining
Graph
we note that . If we denote the Hardy–Littlewood maximal operator by M and if we define the bi-sublinear Hardy–Littlewood maximal operator by
Graph
then we have the remarkable equivalences
1.3
Graph
where the implicit constant depends only on the dimension, see Proposition 2.7 and Proposition 2.14 below.
Another way of thinking of these equivalences is by setting , and , so that we have the relations
1.4
Graph
Then one can impose a symmetric weight condition
Graph
and note that
Graph
The equivalences in (1.3) can now be thought of as
Graph
We can even make sense of these expressions when and or and , given that we use the correct interpretation and this is what allows us to extrapolate using such classes. Indeed, one can think of as the condition , which makes sense even when by requiring that the function fw is essentially bounded. Using the interpretation , we see that the condition is equivalent to the usual condition imposed on the weight , while the condition is equivalent to the condition . We emphasize here that our condition is not equivalent to the condition and these notions should not be confused. The condition seems to be a natural upper endpoint condition and one can show that this is equivalent to the boundedness
Graph
see Proposition 2.14 below. It also turns out that this condition allows us to extrapolate away from weighted estimates. We point out that this idea has already been used in the endpoint extrapolation result of Harboure, Macías and Segovia [[19], Theorem 3].
We wish to view our symmetric weight condition in the context of extrapolation. In proving Rubio de Francia's extrapolation theorem, one usually starts with a pair of functions (h, f) and assumes that one has the inequality
1.5
Graph
for some and all weights w satisfying . The idea is then that given a and a weight w satisfying , one can construct a weight W, possibly depending on f, h, and w, so that W satisfies as well as some additional properties to ensure that we can use (1.5) with W to conclude that
1.6
Graph
Applying this with then gives the desired boundedness for an operator T. For the proof one usually splits into two cases, namely the case where and the case where . In the former case one can apply Hölder's inequality to move from to and in the latter case one uses duality and a similar trick to move from to . The point is that both of these cases are essentially the same, but due to the notation we use we have to deal with the cases separately. Here, we wish to come up with a formalization to avoid this redundancy.
The extrapolation theorem is essentially a consequence of to the following proposition:
Proposition
Suppose we are given satisfying and weights satisfying and . Moreover, assume we have two functions and and with . Then there are weights , satisfying ,
Graph
and
Graph
Indeed, the result of the extrapolation theorem follows by applying the proposition with , , , , , , and , so that, by (1.5), we have
Graph
Thus, by duality, we obtain (1.6), as desired.
The proof of the proposition uses the classical construction using the Rubio de Francia algorithm and the novelty here is our symmetric formulation. A proof can be found in this work, as it is a special case of Theorem 3.1. The case in the proposition takes the form and while the case takes the form and . The fact that the proposition is formulated completely symmetrically in terms of the parameters indexed over , where we note that , means that these respective cases can be proven using precisely the same argument, up to a permutation of the indices. Thus, without loss of generality, one only needs to prove one of the two cases.
These symmetries become especially important in the m-linear setting where we are dealing with parameters indexed over and the amount of cases we have to consider increases. Thanks to our formulation, we will be able to reduce these multiple cases back to a single case in our arguments again by permuting the indices.
We wish to point out here that to facilitate our symmetric formulation and to use the duality argument involving the Rubio de Francia algorithm as above, we need to essentially restrict ourselves to the Banach range . However, in the m-linear setting one also has to deal with the quasi-Banach range . This means that to employ our multilinear Rubio de Francia algorithm, we must first reduce to the case where In this case we can set and , which places us in the setting of Theorem 3.1. This is not a problem however, as reducing to this case is facilitated by the rescaling properties of the multilinear weight classes, see also Remark 2.3. In conclusion, even though our multilinear Rubio de Francia algorithm is applied in the Banach range , our result also includes the quasi-Banach range .
This article is organized as follows:
- In Sect. 2 we state our main result and give an overview of the multilinear weight classes, proving some important properties as well as proving new quantitative estimates with respect to the multisublinear maximal operator as well as sparse forms.
- In Sect. 3 we prove the main result.
- In Sect. 4 we apply the extrapolation result for weak type bounds and certain type bounds as well as for vector-valued bounds. Moreover, we give an application of our results to the bilinear Hilbert transform.
Multilinear weight classes
Setting and main result
We work in equipped with the Lebesgue measure . This is mostly for notational convenience and our results also hold in the more general setting of spaces of doubling quasimetric measure spaces, provided one uses the right notion of dyadic cubes in this setting, see [[21]]. For a measurable set E we denote its Lebesgue measure by |E|. A measurable function is called a weight. We can identify w with a measure by . For , a weight w, and a measurable function f on we say that provided that . Moreover, for a measurable set with we write
Graph
when and .
We will use the notation if there is a constant , independent of the important parameters, such that . Moreover, we write if and .
Let and let , . For , writing and similarly for , we write if for all . Moreover, we write if and , where p is defined by
Graph
Similarly, we write if for all and we write if and .
Definition 2.1
Let , , and with . Let be weights and write , . We say that if
Graph
where the supremum is taken over all cubes .
As a point of comparison, we note here that, for finite , our condition is equivalent to the condition , where the latter condition considers the weight class of Li, Martell, and Ombrosi defined in (1.2). Thus, in this range their extrapolation result [[33]] consider the same weights as we do.
Our main theorem is as follows:
Theorem 2.2
(Quantitative multilinear limited range extrapolation) Let be an -tuple of measurable functions and let , . Suppose that for some with there is an increasing function such that
2.1
Graph
for all .
Then for all with there is an increasing function such that
2.2
Graph
for all . More explicitly, we can take
2.3
Graph
where .
We note that if there is equality in one of the components in , i.e., if or for some , then we may also include the respective cases with or to the conclusion of the extrapolation result. In this case one should respectively use the interpretation or . To see this, one need only note that the proof we give of the theorem already accounts for the respective cases when or .
Our result is stronger than that in [[33]] in the sense that we do not have to restrict our exponents to the case where they are finite, i.e., in the initial assumption we include all the cases where and in the conclusion we similarly obtain all the cases where , see also [[32]]. We emphasize here that we use the interpretation in the case where and we need to impose the weight condition from Definition 2.1 with . For example, in the case , and , one has to use the condition in the initial estimate (2.1) which, following our definition, is equivalent to the condition . This stronger result is possible due to our use of a multilinear Rubio de Francia algorithm, fully utilizing the multilinear nature of the problem. Our result also implies vector valued estimates in these ranges and we refer the reader to Sect. 4 where we elaborate on this further.
Next we make some remarks on the quantitative result (2.3).
Usually in applications, the increasing function will be of the form for some . Then we find from (2.3) that
Graph
In the case , , , this means that we have
2.4
Graph
and this coincides with the bound obtained in [[11]]. This result was used in Hytönen's theorem [[20]] to reduce proving the sharp estimate
2.5
Graph
for Calderón-Zygmund operators T to only having to prove the linear bound
Graph
Indeed, noting that , we find that (2.5) follows from (2.4) by taking and .
The fact that we need to extrapolate from to obtain the sharp bounds for Calderón-Zygmund operators speaks to their nature as operators revolving around their properties in . As a contrast, we note that the estimate
Graph
is central, for example, for when T is the Hardy–Littlewood maximal operator M. Indeed, by (2.4) with and and by noting that , this estimate extrapolates to the estimate
Graph
for , which is precisely Buckley's sharp bound obtained for M. We point out here that this argument is actually circular for when , since the proof of the quantitative estimate in the extrapolation result makes use of Buckley's sharp bound. Nonetheless, we think this example is heuristically interesting, since it exhibits how one can extrapolate away from weighted estimates. Multilinear versions of Buckley's sharp bound have been found in [[10], [34]] and can be recovered in a similar way, see also Theorem 4.12.
The remainder of this section will be dedicated to a discussion on the quantitative properties of the multilinear weight classes. We split this into two separate cases. In the first case we adopt the symmetric notation from the introduction and think in terms of -tuples of weights and parameters satisfying a symmetric relation. In the second case we adopt the more classical approach of thinking in terms of m-tuples and we prove some key results for our main theorem.
Quantitative properties of multilinear weight classes: the m+1-tuple case
Let , , and and let be weights, with . In terms of symmetries, the definition of the weight class
Graph
seems to be best suited to the case where . Indeed, if we set , and , then we have
Graph
The condition is equivalent to for all and the constant for the weight class now takes the form
Graph
where the last equality follows from the fact that the term involving the product weight in the -linear weight class is equal to 1. The symmetry of this last expression also emphasizes a certain permutational invariance. Indeed, if is a permutation, then, since
Graph
we have
Graph
and this will be used in the proof of our extrapolation theorem.
Remark 2.3
While we restrict ourselves to the Banach range in this section, we do point out that our main results do also apply in the cases where . This is facilitated by the rescaling property
Graph
which, in our arguments, allows us to reduce back to the case where , see also the proof of Theorem 2.2.
It will sometimes also be useful to redefine for so that
Graph
These weight classes are governed by a certain maximal operator, see also [[30]].
Definition 2.4
Given , we define the m-sublinear Hardy–Littlewood maximal operator
Graph
for , where the supremum is taken over all cubes containing x. Moreover, for a dyadic grid we define
Graph
for .
For the relevant definitions and results regarding dyadic grids we refer the reader to [[29]]. A property we need is the fact that there exist dyadic grids such that for each cube there is an and a cube such that and . This implies the following:
Lemma 2.5
Let . Then there exist dyadic grids such that
Graph
See also [[29]].
Definition 2.6
A collection of cubes in a dyadic grid is called sparse if there is a pairwise disjoint collection of measurable sets such that and .
Given , for a sparse collection of cubes we define the sparse operator
Graph
and the sparse form
Graph
We point out here that the sparsity constant 2 appearing in the estimate is not too important and in most situations it can be replaced by any other constant greater than 1. Note however, that we will be considering the form and here it is important that one only considers sparse collections in this supremum with the same sparsity constant. See [[29]] for further properties and results regarding sparse collections of cubes.
Since this section contains results involving both m-tuples and -tuples with the same parameters, it is convenient to separate these notationally. We will use the following convention: for parameters we shall use the boldface notation for -tuples while we will use the arrow notation for m-tuples.
The main result for this section is the following:
Proposition 2.7
Let , satisfy for all and . Moreover, let be weights satisfying . Then the following are equivalent:
-
;
-
;
-
;
-
.
Moreover, we have
2.6
Graph
2.7
Graph
where the implicit constants depend only on the dimension, and
2.8
Graph
where the implicit constant depends on the dimension and
Graph
Remark 2.8
We again point out that the condition is equivalent to the condition , with equal constants. Moreover, the results containing the sparse forms are formulated with the supremum taken inside of the norm. One can equivalently put the supremum outside of the norm which follows from the fact that there is a single sparse form that dominates all the other sparse forms, see [[27], Section 4].
In the case , , the equivalence (2.6) takes the more familiar form
Graph
which appeared in the introduction.
We note that the estimate (2.8) was already obtained in [[8]] in the case .
For , the estimate (2.8) takes the form
2.9
Graph
and when and we reobtain the sharp bound from the theorem. We wish to compare (2.9) to the bound obtained in [[5]]. For their main result they prove that
2.10
Graph
Our result implies that
Graph
see also [[24]], and this recovers the estimate (2.10).
Finally, we point out here that the estimate (2.8) already appears in [[33], p. 12] for the particular choice , and it seems like this choice of is central for the theory of these sparse forms, see also the proof of Corollary 4.2.
For the proof of the proposition we will require several preparatory lemmata.
Lemma 2.9
Let . Then for each dyadic grid and all there is a sparse collection such that
Graph
pointwise almost everywhere, where . In particular we have
Graph
pointwise almost everywhere.
The proof is essentially the same as the well-known result in the case , .
Proof
For we define
Graph
By taking the maximal cubes Q in we obtain a pairwise disjoint collection such that and
2.11
Graph
for all . We define and claim that is a sparse collection of cubes. Indeed, for it follows from (2.11) that for any we have
Graph
Thus, by maximality of and Hölder's inequality with , we have
Graph
Thus, defining , we have .
To conclude that is sparse, it remains to check that is pairwise disjoint. Let such that . If and , we have and . Since is pairwise disjoint, this means that we must have . Since , it follows from maximality of that , as desired.
Finally, if and , then there is a unique such that . Hence, and thus there is a cube so that and
Graph
This proves the assertion.
The following result is a reformulation of the definition of the weight class.
Lemma 2.10
Let , satisfy for all and . Moreover, let be weights satisfying and define . Then if and only if are locally integrable and there is a constant such that for all cubes Q we have
Graph
In this case, the optimal constant c in this inequality is given by .
The following lemma allows us to deal with weighted estimates involving sparse forms.
Lemma 2.11
Let , satisfy for all and . Moreover, let be weights satisfying with and define . Let Q be a cube and let such that . Then
2.12
Graph
Remark 2.12
Having Lemma 2.10 in mind, it seems that the larger power of the weight constant in (2.12) comes from the fact that we are passing from the weighted measure of the set Q to the measure of the smaller set E. In fact, it seems like we are only using the full weight condition once and we are left with an estimate of the form
Graph
where the implicit constant depends on the weights. This estimate seems to only require the weaker Fujii-Wilson condition satisfied by the weight , but we do not pursue this further here. We refer the reader to [[22]] where quantitative estimates involving this condition first appeared. We also point out that estimates of this type for the limited range sparse operator in the case have been studied in [[13], [31]]. This condition has also been considered in the multilinear case in [[10]].
Proof
We set and
Graph
so that for all . Thus, since by the assumptions on E, we have . Then
2.13
Graph
Next, set and . Then
Graph
and
Graph
so that
Graph
Thus, since , it follows from Hölder's inequality that
Graph
By combining this estimate with (2.13), we obtain (2.12). The assertion follows.
Proof of Proposition 2.7
We set for .
The strategy for the proof will be as follows: We will prove the equivalence of (i) and (ii) by proving (2.6) and we will prove the equivalence of (iii) and (iv) by proving (2.7). Then, noting that the implication (iii) (ii) is clear, we conclude the proof by showing that (i) (iv) through (2.8).
For (2.6), for the first inequality we note that it follows from Lemma 2.5 that it suffices to consider the estimate for for a dyadic grid . First consider a finite collection . Let , and, defining as but with the supremum taken over all , we set
Graph
and similarly for .
Let denote the collection of those cubes such that that have no dyadic ancestors in . Using the rule
Graph
where , it follows from Lemma 2.10 and the fact that gives a decomposition of , that
Graph
where in the fourth step we used Hölder's inequality with and in the last step we used Hölder's inequality on the sum.
By considering an exhaustion of of finite sets it follows from monotonicity of the measure and by taking a supremum over that
Graph
For the converse inequality, fix a cube Q. Assuming for the moment that the are locally integrable, we let . Setting , we obtain
Graph
for all so that . Thus,
Graph
Taking a supremum over such , we conclude that
2.14
Graph
Thus, it follows from Lemma 2.10 that
Graph
proving (2.6). To prove our initial assumption that the are locally integrable, we repeat the above argument with the weights replaced by for . As these weights are bounded, they are locally integrable. An appeal to the Monotone Convergence Theorem as after a rearrangement of (2.14) yields the desired conclusion.
For (2.7), let and let be a dyadic grid. By Lemma 2.9 there exists a sparse collection such that
Graph
Thus, it follows from Lemma 2.5 that
Graph
For the converse inequality, we estimate
Graph
As this estimate is uniform in , this proves (2.7) and thus the equivalence of (iii) and (iv).
To prove (2.8) and thus the implication (i) (iv), we note that it follows from Lemma 2.11 that for a sparse collection in a dyadic grid and for we have
Graph
where in the last step we used the fact that the weighted dyadic maximal operator is bounded on for with constant bounded by , uniformly in the weight u. As this estimate is uniform in the sparse collection , this proves (2.8). The assertion follows.
Quantitative properties of multilinear weight classes: the m-tuple case
It is sometimes convenient to emphasize this separation of the parameter s from the , as it often plays a different role from the other parameters in the proofs. The following lemma provides a way to deal with this parameter.
Lemma 2.13
(Translation lemma) Let , and with and let be weights with . Then if and only if there are satisfying , , and , where
Graph
Moreover, in this case we have
2.15
Graph
Proof
We have
Graph
it remains to note that
Graph
Taking a supremum over all cubes Q yields (2.15), proving the assertion.
We point out that the choice of the in the lemma is not necessarily unique if . One could, for example, take , but a different choice will be made later in the proof of the main result. We also note that this lemma can be used even if . In this case it can occur that some of the are negative, but this does not seem to cause any problems.
Having reduced to the case where , the following proposition is the main result for this subsection.
Proposition 2.14
Let , with and let be weights with . Then the following are equivalent:
-
;
-
.
In this case we have
2.16
Graph
Moreover, if , then (i) and (ii) are equivalent to
-
and we have
2.17
Graph
where the implicit constant depends on the dimension and
Graph
Moreover, the power of the weight constant in (2.17) is the smallest possible one.
Remark 2.15
The equivalence (2.16) is also contained in the full range version in [[30], Theorem 3.3] in the case where the are finite, and the limited range version is proven in [[3], Proposition 21], but here the cases are only treated when .
For our result here we use the interpretation that for and a weight u we have .
Remark 2.16
The estimate (2.17) is a generalization of Buckley's sharp weighted bound for the Hardy–Littlewood maximal operator. It can be proven using the sparse domination we obtained in Lemma 2.9, but we present an altogether different proof which generalizes an approach due to Lerner [[28]]. This construction is important, as it turns out to be key for our multilinear Rubio de Francia algorithm.
In the case , the sharp bound (2.17) recovers the sharp bound obtained by Li, Moen, and Sun in [[34]] where sparse domination techniques were used. To see this, note given weights and setting , the multilinear weight constant they used is defined as
2.18
Graph
Writing , the sharp result they prove is
2.19
Graph
for all and . To compare this to our result, we replace the by and note that , Thus, (2.19) coincides with our bound found in (2.17) when .
Lemma 2.17
Let , with and let be weights with and . Then there exist sublinear operators so that for any we have
2.20
Graph
Moreover, satisfies
Graph
Proof
We first prove this result for the dyadic maximal operator for a dyadic grid to obtain the appropriate operators . Then it follows from Lemma 2.5 that
2.21
Graph
The result then follows by setting
Graph
where c is an appropriate constant determined by the implicit constant in (2.21).
Now, fix a dyadic grid . Let , let , and set . Since , it follows from Hölder's inequality that
Graph
This implies that
Graph
Thus, for and any , we have
2.22
Graph
Setting
Graph
and by taking a supremum over all Q containing x in (2.22) we have proven (2.20) in the dyadic case. We remark here that in the case that , we use the interpretation
Graph
Noting that
Graph
for the case , we compute
Graph
and for the case , we compute
Graph
The assertion follows.
Proof of Proposition 2.14
We will prove the equivalence of (i) and (ii) by proving (2.16).
For , we note that it follows from Lemma 2.5 that it suffices to prove the estimate for for a fixed dyadic grid . Note that by Hölder's inequality we have for a cube Q, so that
Graph
Thus, by Hölder's inequality for weak type Lebesgue spaces, we have
Graph
where we used the fact that the weighted dyadic maximal operator is bounded with constant uniform in q and the weight u. Thus, we have shown that
Graph
For the converse inequality, fix a cube Q and let . Letting , we have
Graph
for all so that . Hence,
Graph
Taking a supremum over such and by replacing with , we conclude that
2.23
Graph
Now set and assume for the moment that is locally integrable. Then the product on the right-hand side of (2.23) is positive and finite so that we may take it to the left-hand side. This yields
2.24
Graph
and taking a supremum over all cubes Q yields (2.16). To prove that is indeed locally integrable, we choose such that for , the latter expression being bounded and thus locally integrable. Again taking the product on the right-hand side of (2.23) to the left, an appeal to the Monotone Convergence Theorem as yields (2.24). The assertion follows.
Since the implication (iii) (ii) is clear, we may finish the proof of the equivalences by showing (i) (iii) through (2.17).
By Lemma 2.17, it follows from Hölder's inequality that
Graph
as desired.
Finally, we prove optimality of (2.17). Let denote the smallest possible constant in the estimate
Graph
We have shown that and it remains to prove the lower bound. We assume that we are in dimension , the general case following mutatis mutandis. Moreover, we assume without loss of generality that the maximum is attained for , the other cases following similarly by permuting the indices. For we define
Graph
Then, by Hölder's inequality and a computation, we have
Graph
Moreover, one computes
Graph
and
Graph
Setting , we find that
Graph
and
Graph
Letting shows that we must have , i.e.,
Graph
Thus, we have and the assertion follows.
Remark 2.18
We point out here that in the unweighted case we actually have an equivalence , which follows from a similar calculation as above, with for all .
Proof of the main result
The proof of the main theorem essentially follows from the theorem below. In this theorem we deal with -tuples as well as m-tuples of the same parameters, which can be notationally confusing. To circumvent this problem, we shall use the earlier established convention that for parameters we shall use the boldface notation for -tuples while we will use the arrow notation for m-tuples, see also Sect. 2.2.
We again point out that even though this result is formulated for the Banach range , it can be used to obtain results in the range including the cases , see also Remark 2.3 and the proof of Theorem 2.2.
Theorem 3.1
Let and suppose we are given satisfying for all and . Assume moreover that we are given weights satisfying and .
Suppose we are given functions and satisfying and . Then there are weights satisfying and such that
3.1
Graph
and
3.2
Graph
The proof of this theorem relies on a multilinear generalization of the Rubio de Francia algorithm.
Lemma 3.2
(Multilinear Rubio de Francia algorithm) Let with . Then for each there exist operators satisfying
-
;
-
;
-
for all cubes Q, where the implicit constant depends on the dimension and
-
Graph
Proof
Letting be as in Lemma 2.17, we define
Graph
where and .
To prove property (i), it suffices to note that the term in the sum is equal to .
For (ii) we have
Graph
To prove (iii), we first note that
Graph
Thus, it follows from Lemma 2.17 that
Graph
as desired. The assertion follows.
Proof of Theorem 3.1
The proof will consist of two steps. In the first step we prove the result for very specific . In the second step we iterate the first step to obtain the desired result.
Step 1. In this step we assume that there is some such that
Graph
Since none of the statements in the formulation of the proposition depend on the order of the indices, we may assume without loss of generality that . More precisely, we can let be the transposition given by for and , . Replacing the index j by everywhere then indeed allows us to reduce to the case .
We define , , , and so that . For an -tuple we will use the notation so that the arrow notation will always refer to an m-tuple. Thus, we have now reduced the problem to proving that there exist m weights such that , , where , with
3.3
Graph
and
3.4
Graph
Indeed, the result then follows by setting and by noting that
Graph
The construction of the m weights relies on the multilinear Rubio de Francia algorithm as well as a clever usage of the translation lemma to deal with the parameter s. Setting
Graph
we have
Graph
with equality if and only if and so that , and
Graph
We set
Graph
and , , and similarly for , , and .
We emphasize here that if and only if and we encourage the reader to verify that the remaining steps in this proof remain valid in this particular case.
We may compute
3.5
Graph
We set so that
Graph
and, using the notation from Lemma 3.2, we set
Graph
Unwinding the definitions, it follows from (3.5) and property (i) of our multilinear Rubio de Francia algorithm that
3.6
Graph
Next, it follows from (3.5), Hölder's inequality, and property (ii) that
Graph
By combining this estimate with (3.6), we have proven (3.3).
Finally, we prove (3.4). Noting that
Graph
it follows from Hölder's inequality and (iii) that for a cube Q we have
3.7
Graph
Moreover, we have
Graph
By combining this with (3.7) we find that
3.8
Graph
By the translation lemma, Lemma 2.13, we have and, moreover, by using (3.5) we compute
Graph
which we interpret as being equal to 1 when , so that
Graph
Hence, (3.4) follows by taking a supremum over all cubes Q in (3.8). This concludes Step 1.
Step 2. Now suppose is arbitrary. For each j we either have or . Assume without loss of generality that there is a such that
3.9
Graph
Indeed, if this is not the case then, just as in Step 1, we may permute the indices to reduce back to this case.
The strategy will be to construct the weights in steps through repeated application of Step 1.
We define
Graph
so that . Thus, defining,
Graph
we have
Graph
Now, we define
Graph
First we will check that the reciprocals of the coordinates of these -tuples sum to 1. Indeed, using , we have
Graph
so that
Graph
as desired.
Now, for we define
Graph
which should be interpreted as being equal to 1 when , and we write for the m-tuple given by the first m coordinates of , with .
We may apply Step 1 with to obtain weights such that
3.10
Graph
and
3.11
Graph
Next we apply Step 1 with to obtain weights with
Graph
and
Graph
Combining these estimates with (3.10) and (3.11) we obtain
Graph
and
Graph
Continuing this process, applying Step 1 with for , we conclude, setting , that
3.12
Graph
and
3.13
Graph
Since , we note that (3.1) now follows from (3.12). Finally, we note that (3.2) follows from (3.13), provided we can show that
3.14
Graph
Note that by our initial assumption (3.9), this maximum is attained at some .
We claim that
Graph
for all . Assuming for the moment that the claim is true, we find that
Graph
proving (3.14).
To prove the claim, we compute
Graph
so that
Graph
where
Graph
We note that proving the claim is equivalent to proving the equality
Graph
The inequality
Graph
is clear. To prove the converse inequality, it suffices to show that is an increasing function for all . Computing
Graph
we have proven the desired result. This concludes Step 2. The assertion follows.
Proof of Theorem 2.2
The result essentially follows from an application of Theorem 3.1. However, in order to use this result we must reduce to a case where so that we may set . To reduce to this case, we employ a general rescaling trick that also appears in the proof of the case given by Auscher and Martell in [[1], Theorem 4.9].
First we will show that we may assume that . Indeed, assuming we have shown the result for , we consider the -tuple . Then, since
Graph
we find that for all we have
Graph
Thus, since , applying the extrapolation result with replaced by , replaced by , and s replaced by , we find that for any with and , or equivalently, for all , we have
Graph
for all , with
Graph
as desired.
Now that we have reduced to the case where , we have . Thus, we may set , , and .
Let and let be the weights obtained from Theorem 3.1. Setting and we find, using the assumption (2.2) and property (3.1) of , that
3.15
Graph
Moreover, it follows from (3.2) that
Graph
By combining this estimate with (3.15) and by noting that
Graph
the assertion follows.
Applications of the extrapolation theorem
In applying extrapolation theorems, one can obtain further results by making appropriate choices in the -tuples. We provide some applications in this section.
Boundedness of operators through extrapolation
Given an operator T defined on m-tuples of functions, one can apply the extrapolation result to the -tuples to obtain the following extension result:
Theorem 4.1
Let T be an m-linear or a positive valued m-sublinear operator and suppose that there exist , and with and an increasing function such that
4.1
Graph
for all .
Then for all with and all weights the operator T extends to a bounded operator . Moreover, T satisfies the bound
Graph
where .
Proof
Let be simple functions. By (4.1) we have
Graph
for all . Thus, by applying Theorem 2.2 to the -tuple we find that for all with and all weights we have
Graph
with given by (2.3). Since this estimate holds for all simple functions , the assumptions on T allow us to conclude the results through density.
The initial estimate (4.1) is often obtained through sparse domination. Once we have an estimate of the form
Graph
it follows from duality and Proposition 2.7 that for with and , we have
4.2
Graph
We are, however, still missing the cases outside of the reflexive range . One can reach these cases through extrapolation, see [[32]]. The novelty in our result is that we also obtain a quantitative weighted bound in this range through Theorem 4.1.
Corollary 4.2
Let T be an m-linear or a positive valued m-sublinear operator and suppose that there exist , such that for all bounded compactly supported we have
Graph
where the supremum runs over all sparse collections with a fixed sparsity constant. Then for all with and all weights the operator T extends to a bounded operator . Moreover, T satisfies the bound
4.3
Graph
Proof
We set . Assuming the set of satisfying is non-empty, we have . Indeed, for such a we have
Graph
Setting , we have
Graph
so that
Graph
Then by (4.2) with this specific choice of we obtain
Graph
for all . Thus, it follows from (4.1) that for all with and all weights we have
4.4
Graph
Noting that
Graph
the estimate (4.3) now follows from (4.4).
Remark 4.3
We note that in particular the quantitative bound (4.3) extends the bound (4.2) obtained from the sparse form, even though the proof only used the sparse bound for the particular values with . It seems that these values are, in some sense, central for the sparse form and the quantitative bound for these values has already appeared in [[33]], but giving a quantitative bound for the whole range of is new. In the case this value becomes which is the value central in the main theorem of [[5]]. In particular when , we have which is central in the theory of Calderón-Zygmund operators.
In the full-range case, i.e., when , , the particular case we consider becomes and in [[10]] a bound in this case for multilinear Calderón-Zygmund operators was found. Using the sparse domination result of [[10]], this result was extended by Li, Moen, and Sun in [[34]] to the range of with . They showed that for a multilinear Calderón-Zygmund operator T, all with and all weights we have
4.5
Graph
where the class is defined through the constant in (2.18), and . They proved that this same bound holds even in the case for multilinear sparse operators, leading them to conjecture that the bound (4.5) should also extend to the case . This conjecture was independently proven to be true by Conde-Alonso and Rey [[6]] and Lerner and Nazarov [[29]] for kernels satisfying –Dini conditions. We also refer the reader to [[23], [26]], where the weaker Dini condition was considered in the linear case. The Dini condition was used in the multilinear setting by Damián, Hormozi and Li [[9]] where, in addition, quantitative mixed multilinear – bounds were considered.
Our results yields another proof of the extension of the bound to the case . To see this, we note that by replacing the by we have and
Graph
Thus, the result (4.5) takes the equivalent form
Graph
which precisely corresponds to the bound (4.2). By applying our extrapolation result we can now extend (4.5), proving the following:
Corollary 4.4
Let T be an m-linear Calderón-Zygmund operator. Then for all we have
Graph
As in Corollary 4.2, our result actually yields weighted bounds for multilinear Calderón-Zygmund operators in the more general case with .
Vector-valued extrapolation
By Fubini's Theorem we are able to extend the extrapolation theorem to a vector-valued setting. In the following result we are considering spaces of the form for , a weight w, and a -finite measure space. Such spaces consist of functions such that the function lies in , with . In the case when , we can use Fubini's Theorem to find that
Graph
valid for any , allowing us to carry over scalar-valued estimates to the vector-valued setting.
Theorem 4.5
(Vector-valued extrapolation) Let , . Let be a -finite measure space, let and , and let be an -tuple of measurable functions on . Assume that there is an increasing function such that the inequality
4.6
Graph
holds pointwise a.e. in for all .
Then for all with there is an increasing function such that
Graph
for all . More explicitly, we can take
Graph
where .
Proof
Set , , which, by Fubini's Theorem, are measurable functions on . Then by Fubini's Theorem, the assumption (4.6), and Hölder's inequality, we have
Graph
Thus, we may apply Theorem 2.2 to the -tuple , proving the result.
By iterated uses of Fubini's Theorem, a similar argument also allows us to extrapolate to vector-valued bounds with iterated -spaces which were considered by Benea and Muscalu through their helicoidal method [[4]], but we do not detail this here.
We emphasize here that our extrapolation result goes through even if we have for some in (4.6). The conclusion of our result then yields vector-valued estimates in the mixed normed spaces .
If we take with the counting measure, we obtain vector-valued bounds for -spaces. Given an m-linear operator T and sequences of measurable functions , we may define
4.7
Graph
By combining the vector-valued extrapolation theorem with Corollary 4.2, we obtain the following:
Corollary 4.6
Let T be an m-linear operator and suppose that there exist , such that for all bounded compactly supported we have
Graph
where the supremum runs over all sparse collections with a fixed sparsity constant.
Then for all with , the operator T has a bounded extension given by (4.7). Moreover, there is an increasing function such that
Graph
for all . More explicitly, we can take
4.8
Graph
Proof
For each , let be a sequence of simple functions with at most finitely many non-zero entries. Setting and , it follows from Corollary 4.2 that (4.6) is satisfied with
Graph
The assertion now follows from Theorem 4.5 and density.
Remark 4.7
If one can use an argument where extrapolation is only required once, then we may be able to replace the exponent in (4.8) by the smaller exponent
Graph
which no longer depends on the exponents of the spaces. One way of doing this is by considering a vector-valued sparse domination rather than a scalar one. Such a sparse domination for the bilinear Hilbert transform is obtained in [[3]]. See also [[18]] where such ideas are used for vector-valued Calderón-Zygmund operators.
The bilinear Hilbert transform
The bilinear Hilbert transform
Graph
is an integral operator falling outside of the theory of bilinear Calderón-Zygmund operators. It was introduced by A. Calderón and he wanted to know if it was bounded as an operator from to . This question was answered by Lacey and Thiele and they showed that is bounded for all with , , see [[25]]. It is an open problem whether one can remove the condition or not. However, in this range several weighted bounds and vector-valued extensions have been obtained, some of which we detail here.
Let . Then, under certain conditions on , , and s, the sparse domination
Graph
was shown in [[8]]. These conditions can be formulated in the following equivalent ways:
Lemma 4.8
Let . Then the following conditions are equivalent:
- We have
- There exist with so that
-
Graph
The sparse domination in terms of characterization (i) was obtained by Culiuc, Di Plinio and Ou in [[8]] and characterization (ii) was used in [[3]] where more general vector-valued sparse domination results were obtained.
Note that if we have satisfying one of the equivalent conditions (i) or (ii) and we have with , then
Graph
so that we are still in the range of Lacey and Thiele.
From the sparse domination result for , it was deduced in [[8]] that we have the weighted bounds for all with in the Banach range and for all . These weighted bounds were used in [[7]] to obtain weighted and vector-valued estimates in the range through extrapolation using products of classes. This result was extended in [[33]] where the full multilinear weight classes were used, but only the cases for finite were treated. However, their methods can be used to also obtain the cases with [[32]]. By applying Corollaries 4.2 and 4.6 we obtain the following result:
Corollary 4.9
Let satisfy one of the equivalent conditions in Lemma 4.8. Then for all with we have
Graph
for all .
Moreover, for all with there is an increasing function such that
4.9
Graph
for all .
While Corollary 4.6 gives us an expression for the increasing function in (4.9), this estimate will not be sharp in general, see also Remark 4.7. Rather, a better quantitative estimate can be obtained if one applies our extrapolation result to weighted bounds that can be obtained from the vector-valued sparse domination result obtained in [[3], Theorem 1], but we do not pursue this further here.
Our result should be compared with [[33], Corollary 2.17] and [[4], Theorem 3]. Qualitatively, we completely recover the results on weighted boundedness in [[33], Corollary 2.17] and extend it in the sense that we also include the cases where either or is equal to and where either or is equal to , but this can also be done through their methods [[32]]. If, for example , then we have and our scalar bound takes the form
Graph
for all and all weights , satisfying
Graph
This is also slightly more general than the weighted bounds in [[3], Corollary 3] in this endpoint case since they only formulate their result in the case when (or more generally, when ), but their methods do allow for this more general case.
The result [[4], Theorem 3] asserts that if satisfy for satisfying one of the equivalent properties of Lemma 4.8, then we have
4.10
Graph
This result is completely recovered in Corollary 4.9 in the unweighted version of (4.9).
By again extrapolating from the weighted vector-valued bounds we can also consider iterated spaces in our results. For example, by applying Theorem 4.5 to the weighted vector valued bounds (4.9), one can obtain
Graph
for all with . Such bounds were already obtained in [[2]] through the helicoidal method, but could not be obtained through earlier extrapolation results. More precisely, to obtain this result through extrapolation one needs to be able to extrapolate away from weighted estimates which is one of our novelties. These type of multiple vector-valued bounds can be applied to prove boundedness results of operators such as the tensor product of and paraproducts and we refer the reader to [[2]] for an overview of such operators.
Endpoint extrapolation results
Finally, we shall discuss some of the endpoint estimates one can extrapolate from.
The following is an extrapolation result involving weak-type estimates. The trick used to obtain this result is well-known and can be found already in [[17]].
Theorem 4.10
(Weak type extrapolation) Let be an -tuple of measurable functions and let , . Suppose that for some with there is an increasing function such that
4.11
Graph
for all .
Then for all with there is an increasing function such that
4.12
Graph
for all . More explicitly, we can take
4.13
Graph
where .
Proof
Let and set . We define
Graph
and note that by (4.11) we have
Graph
Thus, by applying Theorem 2.2 to the -tuple we conclude that for all with there is an increasing function such that
Graph
for all , with given by (4.13). As was arbitrary, noting that proves (4.12). The assertion follows.
As a consequence we can extrapolate from weak lower endpoint estimates in cases where strong bounds are not available. Passing to the full-range case where and , writing for the vector consisting of m components all equal to 1, we obtain the following corollary:
Corollary 4.11
Let be an -tuple of measurable functions and suppose that there is an increasing function such that
Graph
for all .
Then for all with there is an increasing function such that
Graph
for all . More explicitly, we can take
Graph
On the other hand, we can also extrapolate from the upper endpoints. An application of Theorem 2.2 in the case with , writing for the vector consisting of m components all equal to , yields the following:
Theorem 4.12
(Upper endpoint extrapolation) Let be an -tuple of measurable functions and let . Suppose that there is an increasing function such that
Graph
for all .
Then for all with , there is an increasing function such that
Graph
for all . More explicitly, we can take
Graph
where .
An interesting application is related to the space of functions of bounded mean oscillation. We define the sharp maximal operator by
Graph
for locally integrable functions f, where the supremum is taken over all cubes . The classical definition of can be given in terms of by saying a measurable function f is in if , with . The way we have dealt with weighted estimates in so far suggests the following definition of a weighted version of the space:
Definition 4.13
Given a weight w, we define the space as those locally integrable functions f such that
Graph
Weighted spaces also appeared in the work of Muckenhoupt and Wheeden in [[36]], and they showed that the estimate
4.14
Graph
with an explicit constant depending on w, is satisfied when T is the Hilbert transform, if and only if . We recall here that the condition is equivalent to our condition with . Later it was shown by Harboure, Macías and Segovia in [[19]] that one can extrapolate from the estimate (4.14) for an operator T to obtain that T is bounded on for all . As a consequence of Theorem 4.12 we obtain a qualitative multilinear version of this result.
Corollary 4.14
(Extrapolation from estimates) Let T be an m-(sub)linear operator and let . Suppose that there is an increasing function such that
Graph
for all and all with .
Then for all with , there is an increasing function such that
Graph
for all and all , whenever the left-hand side is finite.
Proof
We apply Theorem 4.12 to the -tuples . Then we find that for all with , there is an increasing function such that
4.15
Graph
for all and all . By the classical Fefferman-Stein inequality for the sharp maximal operator, see [[12]], we find that
Graph
for , with implicit constant depending on the constant of , which is bounded by an increasing function of , where , see also [[15], Chapter 7]. Since by Hölder's inequality, the result for follows from (4.15). By extrapolating again, we also obtain the cases , proving the assertion.
Examples of multilinear operators satisfying weak-type and endpoint estimates are multilinear Calderón-Zygmund operators, see also [[16], Section 7.4.1]. Weighted estimates in these situations can be found in [[30]].
Acknowledgements
The author would like to thank Cristina Benea and Dorothee Frey for their feedback on the draft. In particular the author is grateful to Cristina for her thoroughness in helping to provide context regarding what is known for the bilinear Hilbert transform and multilinear extrapolation. Finally, the author would like to thank the anonymous referee for their helpful suggestions.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
[
References
1
Auscher P, Martell JM. Weighted norm inequalities, off-diagonal estimates and elliptic operators. I. General operator theory and weights. Adv. Math.. 2007; 212; 1: 225-2762319768. 10.1016/j.aim.2006.10.0021213.42030
2
Benea C, Muscalu C. Multiple vector-valued inequalities via the helicoidal method. Anal. PDE. 2016; 9; 8: 1931-19883599522. 10.2140/apde.2016.9.19311361.42005
3
Benea, C., Muscalu, C.: Sparse domination via the helicoidal method. arXiv:1707.05484v2 (2017)
4
Benea, C., Muscalu, C.: The Helicoidal method. arXiv:1801.10071 (2018)
5
Bernicot F, Frey D, Petermichl S. Sharp weighted norm estimates beyond Calderón–Zygmund theory. Anal. PDE. 2016; 9; 5: 1079-11133531367. 10.2140/apde.2016.9.10791344.42009
6
Conde-Alonso JM, Rey G. A pointwise estimate for positive dyadic shifts and some applications. Math. Ann.. 2016; 365; 3–4: 1111-11353521084. 10.1007/s00208-015-1320-y1353.42011
7
Cruz-Uribe D, Martell JM. Limited range multilinear extrapolation with applications to the bilinear Hilbert transform. Math. Ann.. 2018; 371; 1–2: 615-6533788859. 10.1007/s00208-018-1640-906871963
8
Culiuc A, Di Plinio F, Ou Y. Domination of multilinear singular integrals by positive sparse forms. J. Lond. Math. Soc. (2). 2018; 98; 2: 369-3923873113. 10.1112/jlms.121391402.42013
9
Damián W, Hormozi M, Li K. New bounds for bilinear Calderón–Zygmund operators and applications. Rev. Mat. Iberoam.. 2018; 34; 3: 1177-12103850284. 10.4171/RMI/10211406.42017
Damián W, Lerner AK, Pérez C. Sharp weighted bounds for multilinear maximal functions and Calderón–Zygmund operators. J. Fourier Anal. Appl.. 2015; 21; 1: 161-1813302105. 10.1007/s00041-014-9364-z1321.42036
Dragičević O, Grafakos L, Pereyra MC, Petermichl S. Extrapolation and sharp norm estimates for classical operators on weighted Lebesgue spaces. Publ. Mat.. 2005; 49; 1: 73-9121402001081.42007
Fefferman C, Stein EM. Hp\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$H^{p}$$\end{document} spaces of several variables. Acta Math.. 1972; 129; 3–4: 137-193447953. 10.1007/BF023922150257.46078
Frey D, Nieraeth B. Weak and strong type A1-A∞\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A_1-A_\infty $$\end{document} estimates for sparsely dominated operators. J. Geom. Anal.. 2019; 29; 1: 247-2823897012. 10.1007/s12220-018-9989-207024065
García-Cuerva J, Rubio de Francia JL. Weighted Norm Inequalities and Related Topics. 1985104: Amsterdam; North-Holland Publishing Co.
Grafakos L. Classical Fourier Analysis. 20143: New York; Springer
Grafakos L. Modern Fourier Analysis. 20143: New York; Springer
Grafakos L, Martell JM. Extrapolation of operators of many variables and applications. J. Geom. Anal.. 2004; 14; 1: 19-462030573. 10.1007/BF029218641049.42007
Hänninen TS, Hytönen TP. The A2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A_2$$\end{document} theorem and the local oscillation decomposition for Banach space valued functions. J. Oper. Theory. 2014; 72; 1: 193-218. 10.7900/jot.2012nov21.19721313.42037
Harboure E, Macías RA, Segovia C. Extrapolation results for classes of weights. Am. J. Math.. 1988; 110; 3: 383-397944321. 10.2307/23746160676.42020
Hytönen TP. The sharp weighted bound for general Calderón–Zygmund operators. Ann. Math.. 2012; 175; 3: 1473-15062912709. 10.4007/annals.2012.175.3.91250.42036
Hytönen TP, Kairema A. Systems of dyadic cubes in a doubling metric space. Colloq. Math.. 2012; 126; 1: 1-332901199. 10.4064/cm126-1-11244.42010
Hytönen TP, Pérez C. Sharp weighted bounds involving A∞\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A_\infty $$\end{document}. Anal. PDE. 2013; 6; 4: 777-8183092729. 10.2140/apde.2013.6.7771283.42032
Hytönen TP, Roncal L, Tapiola O. Quantitative weighted estimates for rough homogeneous singular integrals. Israel J. Math.. 2017; 218; 1: 133-1643625128. 10.1007/s11856-017-1462-61368.42015
Johnson R, Neugebauer CJ. Change of variable results for Ap\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A_p$$\end{document}- and reverse Hölder RHr\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\rm RH}_r$$\end{document}-classes. Trans. Am. Math. Soc.. 1991; 328; 2: 639-666
Lacey M, Thiele C. On Calderón's conjecture. Ann. Math. (2). 1999; 149; 2: 475-4961689336. 10.2307/1209710934.42012
Lacey MT. An elementary proof of the A2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A_2$$\end{document} bound. Israel J. Math.. 2017; 217; 1: 181-1953625108. 10.1007/s11856-017-1442-x1368.42016
Lacey MT, Mena D. The sparse T1 theorem. Houston J. Math.. 2017; 43; 1: 111-12736479351378.42010
Lerner AK. An elementary approach to several results on the Hardy-Littlewood maximal operator. Proc. Am. Math. Soc.. 2008; 136; 8: 2829-28332399047. 10.1090/S0002-9939-08-09318-01273.42019
Lerner, A.K., Nazarov, F.: Intuitive dyadic calculus: the basics. arXiv:1508.05639 (2015)
Lerner AK, Ombrosi S, Pérez C, Torres RH, Trujillo-González R. New maximal functions and multiple weights for the multilinear Calderón–Zygmund theory. Adv. Math.. 2009; 220; 4: 1222-12642483720. 10.1016/j.aim.2008.10.0141160.42009
Li K. Two weight inequalities for bilinear forms. Collect. Math.. 2017; 68; 1: 129-1443591468. 10.1007/s13348-016-0182-21365.42012
Li, K., Martell, J.M., Martikainen, H., Ombrosi, S., Vuorinen, E.: End-point estimates, extrapolation for multilinear Muckenhoupt classes, and applications. arXiv:1902.04951 (2019)
Li, K., Martell, J.M., Ombrosi, S.: Extrapolation for multilinear Muckenhoupt classes and applications to the bilinear Hilbert transform. arXiv:1802.03338 (2018)
Li K, Moen K, Sun W. The sharp weighted bound for multilinear maximal functions and Calderón–Zygmund operators. J. Fourier Anal. Appl.. 2014; 20; 4: 751-7653232584. 10.1007/s00041-014-9326-51318.42022
Lorist, E., Nieraeth, B.: Vector-valued extensions of operators through multilinear limited range extrapolation. J. Fourier Anal. Appl. arXiv:1712.08157 (2017)
Muckenhoupt, B., Wheeden, R.L.: Weighted bounded mean oscillation and the Hilbert transform. Stud. Math. 54(3), 221–237 (1975/1976)
]
By Bas Nieraeth
Reported by Author