Two-Weight Tb Theorems for Well-Localized Operators
Kelly Bickel, Taneli Korhonen, Brett D. Wick

TL;DR
This paper introduces new two-weight Tb theorems for well-localized operators, expanding the theoretical framework for analyzing such operators with respect to pairs of accretive functions and systems.
Contribution
It establishes both global and local two-weight Tb theorems for well-localized operators, combining recent proof techniques with classical T1 theorem methods.
Findings
Proved a global two-weight Tb theorem for well-localized operators.
Established a local two-weight Tb theorem for operators with respect to accretive systems.
Integrated recent Tb proof techniques with classical T1 theorem arguments.
Abstract
This paper first defines operators that are "well-localized" with respect to a pair of accretive functions and establishes a global two-weight Tb theorem for such operators. Then it defines operators that are "well-localized" with respect to a pair of accretive systems and establishes a local two-weight Tb theorem for them. The proofs combine recent Tb proof techniques with arguments used to prove earlier T1 theorems for well-localized operators.
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.
Two-Weight Theorems for Well-Localized Operators
Kelly Bickel1
Kelly Bickel, Department of Mathematics
Bucknell University
701 Moore Ave Lewisburg, PA 17837
,
Taneli Korhonen2
Taneli Korhonen, Department of Mathematics
University of Eastern Finland, Department of Physics and Mathematics,
P.O. Box 111, 80101 Joensuu, Finland
and
Brett D. Wick3
Brett D. Wick, Department of Mathematics
Washington University in St. Louis
One Brookings Drive
St. Louis, MO 63130-4899
Abstract.
This paper first defines operators that are “well-localized” with respect to a pair of accretive functions and establishes a global two-weight theorem for such operators. Then it defines operators that are “well-localized” with respect to a pair of accretive systems and establishes a local two-weight theorem for them. The proofs combine recent proof techniques with arguments used to prove earlier theorems for well-localized operators.
Research supported in part by National Science Foundation DMS grant #1448846.
Research supported in part by Faculty of Science and Forestry of University of Eastern Finland.
Research supported in part by National Science Foundation DMS grant #1500509 and # 1800057.
22footnotetext: Key words: theorem, well-localized operators
Introduction
Over the past several decades, researchers have proved a number of important theorems showing that the boundedness of Calderón-Zygmund operators can be deduced from testing on certain functions . David, Journé, and Semmes proved the first global theorem in 1985 [7]; they showed that for sufficiently nice (accretive) functions and , a Calderón-Zygmund operator is bounded precisely when is weakly bounded and This result was generalized to nonhomogeneous settings in both [10, 15].
Meanwhile in 1990, Christ established a local theorem in the homogeneous setting by showing that is bounded if and are uniformly bounded for a system of accretive functions [6]. This theorem was generalized to the nonhomogeneous settings in [9, 14]. In the homogeneous setting, alternate –rather than –testing conditions have also been studied extensively, see [1, 2, 3, 8, 12, 13, 17], and some testing conditions have even been extended to the nonhomogeneous setting [9, 11].
This paper connects this rich field of theorems to the setting of well-localized operators, which were studied in [4, 5, 16]. Well-localized operators are closely connected to band, or almost-diagonal, operators. Indeed, in both [5, 16], the authors showed that the boundedness of band operators, such as Haar shifts of a fixed complexity, is equivalent to the boundedness of certain well-localized operators. Motivated by such connections, the authors in [4, 5, 16] established various theorems for well-localized operators.
In this paper, we extend the results from [16] by establishing both global and local theorems for associated “well-localized” operators. In both settings, we let denote Borel measures that are nonnegative and finite on dyadic cubes Then in the global setting, we consider pairs of functions with averages for all dyadic cubes . Such are called -weakly accretive. In Definition 2, we explain what it means for an operator to be well-localized (with radius ) with respect to such , and then we establish the following theorem:
Theorem 1**.**
If is a -well-localized operator with radius satisfying
- (a)
* and for all *
- (b)
* for all satisfying ,*
then is bounded.
This theorem is very much in the flavor of the theorems from [4, 5, 16], and the proof adapts both arguments from [15] and well-localized arguments from [16]. For a complete explanation of the notation and further details, see Sections 2 and 3.
In the local setting, we prove a similar theorem, but with testing on accretive systems , indexed by the dyadic lattice . This situation is more complicated and we adapt local arguments from both [14] and [9]. Our proof techniques require additional assumptions on the accretive systems and their relationships to the measures as well as an additional testing condition that is trivial when the measures are doubling. The definition of a well-localized operator also requires a restrictive extra condition given in (7). With those assumptions, we prove Theorem 5, a local theorem that is similar to Theorem 1 given above. The details can be found in Sections 4 and 5.
Global Theorem
Let be the standard dyadic lattice in . In what follows, for each cube , denotes the side length of and denotes the set of children of , namely the set of cubes satisfying and Similarly, denotes the set of cubes with Furthermore, denotes the parent of and denotes the ancestor of of order , namely is the unique cube satisfying and For a Borel measure and , denote the average of over a cube by
[TABLE]
To avoid dividing by zero, if , set However, in the later proofs and formulas, for simplicity we will make the standard assumption that for all Given Borel measures on , we can define the testing functions.
Definition 1**.**
A function is -weakly accretive if and the weighted averages of satisfy for all , with implied constant independent of . If is -weakly accretive and is -weakly accretive, then the pair is called -weakly accretive.
Given a -weakly accretive , one can define the following expectations and martingale differences for each and :
[TABLE]
In what follows, any function in the range space is called a -Haar function associated to . These functions are orthogonal to constants and are supported on . An arbitrary function in will be written as Furthermore, the operators and are projections and give useful decompositions of functions.
Lemma 2**.**
[15, pp. 192-193]** Let be a -weakly accretive function and let Then for each ,
[TABLE]
with convergence in . Moreover, the following estimates hold
- (i)
,
- (ii)
**
A basic estimate using the properties of shows that each , and thus
[TABLE]
Given this setup, we can define the well-localized operators. Specifically, for a pair of -weakly accretive functions , we say that an operator acts formally from to with respect to if the bilinear form
[TABLE]
is well defined for all .
Definition 2**.**
Let be an operator acting formally from to with respect to . Then is lower triangularly localized with respect to with radius if there exists an such that for all with ,
[TABLE]
whenever or if and We say that is -well-localized with radius if both and are lower triangularly localized with respect to with radius . For , the roles of and and and are switched.
Then, as mentioned in the introduction, the following theorem can be proved in a way similar to the standard situation discussed in [16, Theorem 2.3]:
Theorem 1. Let be Borel measures on and let be -weakly accretive. Let be a -well-localized operator with radius satisfying
- (a)
* and for all *
- (b)
* for all satisfying .*
Then is bounded.
Remark 1**.**
Testing conditions of the form can be used instead of (a). In particular, since , we would immediately obtain testing condition (a) by
[TABLE]
Similarly, a simple argument using testing condition (b) and the definition of our martingale differences shows that
[TABLE]
for all and and all satisfying .
Proof of Theorem 1
The proof uses the following well-known theorem.
Theorem 3** (Dyadic Carleson embedding theorem).**
If is a Borel measure and if is a -Carleson sequence, i.e. if
[TABLE]
*Proof of Theorem 1. * Fix and and without loss of generality, assume that they are compactly supported. Then, there is an integer and cubes with no common ancestors such that and By Lemma 2, we can write
[TABLE]
By duality, it suffices to show that We break the inner product into the following four terms
[TABLE]
and handle them separately. We leave for later. First consider and observe that if and , then and . Then the definition of well-localized implies that
[TABLE]
This means that we can control by
[TABLE]
where we used (1), testing condition (a), and Hölder’s inequality. Clearly can be handled in an analogous manner. Similarly, if we consider , testing condition (b) implies that
[TABLE]
Now decompose as follows:
[TABLE]
First we consider Fix and observe that if with , then the definition of well-localized implies that
[TABLE]
can only be nonzero if It is easy to show that there are only finitely many satisfying both and . Let denote the number of such , and label the cubes . Then can be bounded by a constant that depends only on and , not . Similarly, one can show that each can be an for at most cubes , where is a constant depending on and , but not on . Then using testing condition (b), Remark 1, and Lemma 2, we have
[TABLE]
The sum can be handled in an analogous way.
Lastly, we consider ; by symmetry, the arguments given here, applied to instead of , will also handle . Observe that if , then the definition of well-localized gives
[TABLE]
since for each for , but Thus, we need only consider
[TABLE]
where again we used the definition of well-localized. This sum collapses as follows:
[TABLE]
To control the sum , observe that using earlier arguments and (1), we have
[TABLE]
since there are at most finitely many terms in the last sum. Now we just need to consider . Since is a projection, we have
[TABLE]
where we used the Cauchy-Schwarz inequality. Lemma 2 implies that the second term is bounded by . To control the first term, we need to show that the sequence , defined by
[TABLE]
and otherwise, is a -Carleson sequence for each . Then the result follows by the dyadic Carleson embedding theorem, given in Theorem 3.
To show that is a -Carleson sequence, we need only consider the case when for some . In particular, we need to control
[TABLE]
by . To proceed, fix and with . Then if with and , we immediately have and . Then the definition of well-localized implies that
[TABLE]
Thus we can rewrite our sum as
[TABLE]
where we used Lemma 2 and testing condition (a). This shows that is a -Carleson sequence and completes the proof.
Local Theorem
Before defining the system of test functions, recall a standard notion of sparsity; a set is -sparse if for all ,
[TABLE]
Equivalently, the sequence defined by for and otherwise is a -Carleson sequence.
Definition 3**.**
We say a system of functions is a sparse -accretive system if it satisfies two conditions. First, is an -accretive system, which here means that
- (i)
- (ii)
- (iii)
\big{|}\int_{Q}b_{Q}d\mu\big{|}\gtrsim\mu(Q),
for each , where the implied constants are independent of . Second, the set of cubes where the change between generations is sparse. In particular, if , then is -sparse.
The definition of an -accretive system given above is very similar to the definitions used in both [9, 14], but does not impose conditions on any . The testing conditions we use appear later. Then given a sparse -accretive system , we can partition into two sets: and . will denote the set of that are contained in some . The minimal such will be denoted by . Similarly will denote the set of cubes that are not contained in any Note that if a point is in two cubes then . This means that if we set
[TABLE]
and otherwise, then is well defined on and satisfies for every
Remark 2**.**
If is an -accretive system and if is compactly supported, then it can be used to create a sparse -accretive system. This is basically the stopping-time construction from [9, pp. 4823] and [14, pp. 269]. In what follows, without loss of generality, we assume the implied constant in property (iii) of Definition 3 is some positive and the implied constant in (ii) of Definition 3 is some
First choose cubes with no common ancestors such that Then set and for each , collect all maximal cubes satisfying Denote the resulting collection of cubes by . Then for each cube , collect all the maximal cubes satisfying and denote the resulting collection by Proceeding in this manner gives collections for every . Using arguments appearing in [14], for and , one can show
[TABLE]
where the implied constant does not depend on . Then a simple argument shows that these stopping cubes are -sparse, namely for all ,
[TABLE]
We can define the associated sparse -accretive system as follows. First for with , let For with for some , let Then these trivially satisfy (i)-(iii) in Definition 3. For each , let denote the smallest cube in containing and set . It is easy to check that these also satisfy conditions (i)-(iii). Conditions (i) and (ii) are immediate. Similarly, if , condition (iii) follows. If , then by construction, Moreover, implies that . Thus if we define as in Definition 3, then (3) implies that is -sparse, as needed.
Let be a sparse -accretive system. Then the functions in can be decomposed using these accretive systems. First define the associated expectations and martingale differences
[TABLE]
for all It is worth pointing out that, to make the two setups easier to differentiate, this notation and is different from the notation and in Sections 2 and 3. Now note that each is supported on and satisfies Because of this, we call all functions in the range space -Haar functions associated to and will denote these functions by . Unlike the classical situation, the spaces and need not be orthogonal for One can also compute
[TABLE]
for each . The arguments in [9, pp. 4824-4825] and [14, pp. 271-274] adapt to this setting to give the decomposition below and testing condition (i). Because our setup is somewhat different and the details for (ii) do not appear in [9, 14], we give the proof of the following lemma in the appendix.
Lemma 4**.**
Let be a sparse -accretive system and let . Then for each ,
[TABLE]
with convergence in Moreover, the following estimates hold
- (i)
**
- (ii)
**
A simple estimate gives that each , and thus
[TABLE]
To see how much these differ from projections, one can compute
[TABLE]
Then properties (i)-(iii) of imply that
In what follows, we will examine pairs of sparse accretive systems associated to two Borel measures.
Definition 4**.**
We say a system of functions is a sparse -accretive system if is a sparse -accretive system, is a sparse -accretive system, and this additional sparsity condition holds: is sparse with respect to and is sparse with respect to
Remark 3**.**
The extra sparsity condition in Definition 4 implies that the set of cubes where the change between generations is small with respect to both measures. Trivially, this condition is satisfied if as in Section 2, for , there is one so that for all . Similarly this condition is satisfied if So this setup generalizes both the accretive function case and the one-weight case.
Now let be a sparse -accretive system. We say is an operator acting formally from to with respect to b if its bilinear form is well defined for all . Then we can define the well-localized operators in this setting.
Definition 5**.**
Let b be a sparse -accretive system and let be an operator acting formally from to with respect to We say that is lower triangularly localized with respect to b with radius if there exists an integer such that for all cubes with and all -Haar functions on
[TABLE]
if or if and . We say that the operator is well-localized with respect to b of radius if both and its formal adjoint are lower triangularly localized with respect to b with radius and if (and ) satisfy an additional localization property: for , if with (here is the minimal with ) or if both , then for
[TABLE]
Remark 4**.**
Condition (7) is a new and somewhat restrictive condition that we need for the proof to work. If possible, we would like to relax this condition so that the theorem applies to more operators. However, in the accretive function setting with as in Section 2, this condition follows immediately from the other parts of the well-localized definition. Indeed, in the context of Theorem 5, Condition (7) is trivial whenever each with also satisfies or each satisfies respectively. To see this, note that in those cases, for ,
[TABLE]
because and . Then it is immediate that
[TABLE]
as needed.
Then we can prove the following local theorem.
Theorem 5**.**
Let be a well-localized operator with respect to a sparse -accretive system b with radius . Further assume
- (a)
;
- (b)
For all satisfying ,
[TABLE]
- (c)
For all and ,
[TABLE]
Then is bounded.
Remark 5**.**
A couple remarks about the testing conditions are in order. First, conditions (a) and (b) are similar to, but somewhat different than, the testing conditions in Theorem 1. However, if our operator is further localized in the sense that
[TABLE]
if have no common ancestors, then we can replace this testing condition (a) with the condition from Theorem 1:
[TABLE]
Condition (b) is necessarily different in this setting because the martingale differences are more complicated for accretive systems.
Meanwhile, testing condition (c) did not appear in Theorem 1. Indeed, in the case of accretive functions , condition (c) is trivial because Similarly, if and are doubling measures, then (c) is immediate. To see this, note that because , the doubling condition implies that and have comparable -sizes. Then testing condition (a) immediately implies
[TABLE]
and a similar argument controls
Proof of Theorem 5
Now let us consider the proof of Theorem 5:
*Proof of Theorem 5. * Fix and and without loss of generality, assume that they are compactly supported. Then, there is an integer and cubes with no common ancestors such that and By Lemma 4, we can write
[TABLE]
By duality, it suffices to show that We break the inner product into the following four terms
[TABLE]
to handle separately. The sums , , and are handled in a way analogous to those in the proof of Theorem 1, so we leave the details to the reader.
Now decompose as
[TABLE]
As (and ) can be controlled as in the proof of Theorem 1, we omit the details. The main differences are using testing condition (b) and Lemma 4.
Lastly consider sums and . By symmetry, we need only estimate . First, the definition of well-localized implies that when the interior sums in vanish. Thus, we have
[TABLE]
where the second equality used the definition lower triangularly localized. We can estimate easily by
[TABLE]
where the first sum is controlled using (5) and the second sum is bounded because it only includes a finite number of terms. One can now control by fixing and controlling
[TABLE]
where
[TABLE]
and
[TABLE]
where depends on and is defined in (6). By the Cauchy-Schwarz inequality and Lemma 4, we have
[TABLE]
where
[TABLE]
for and otherwise. Then to apply the Carleson embedding theorem, we need to show is a -Carleson sequence. To do this, fix and without loss of generality, assume . For now, assume . This means there is some with The minimal such is denoted by and for a general , it is denoted . Then we can write
[TABLE]
We can control using the localization condition (7) in the definition of well-localized, the dual square function estimate in Lemma 4, and testing condition (a) as follows:
[TABLE]
as needed. The same arguments allow us to control as follows:
[TABLE]
where we used the fact that is -sparse. Now if was in , instead of , then would be the same, and would become
[TABLE]
so the same bound holds. Thus is a -Carleson sequence, so an application of the Carleson embedding theorem gives the bound for . To control , begin as follows:
[TABLE]
where
[TABLE]
for and otherwise. In the above computation, we also used the Carleson embedding theorem and the fact that is -sparse. To complete the proof, we need to show that is a -Carleson sequence. To do this, fix and without loss of generality, assume . Then by testing condition (c), we have
[TABLE]
where we used the fact that is also -sparse.
Appendix: Proof of Lemma 4
The proof requires the following well-known square function bound:
Theorem 6**.**
If is a Borel measure on and , then
[TABLE]
Let us proceed to the proof of Lemma 4.
*Proof of Lemma 4. * Fix and for each with , define
[TABLE]
We claim that the sequence converges to pointwise -a.e. and in Observe that by the Lebesgue differentiation theorem, for -a.e. , if is a sequence of nested dyadic cubes shrinking to , then
[TABLE]
As is -sparse, for -a.e. , is in at most finitely many Then for -a.e. , define as follows: if is in some cube in let denote the smallest cube in containing . Otherwise, let denote any cube containing . Fix any sufficiently large so that Then
[TABLE]
where is the unique cube containing with . This, paired with our earlier comments, shows that converges -a.e. to . Moreover, (9) implies that -a.e., where is the dyadic maximal function. Then an application of the Dominated convergence theorem gives the -convergence.
An application of the Cauchy-Schwarz inequality immediately implies that each and so to prove the square function estimate, we need only show . To obtain this, we consider
[TABLE]
where one can insert into each integral and estimate the resulting values to get
[TABLE]
The Carleson embedding theorem paired with the fact that is -sparse implies that Similarly, Theorem 6 implies that
[TABLE]
Thus it remains to bound the first term in . To do this, we show that the sequence defined by
[TABLE]
and otherwise, is a -Carleson sequence. To that end, fix a cube and first assume . Then for all with , we have and . Then using Theorem 6, we have
[TABLE]
as needed. Similarly, if then we can write
[TABLE]
where first and third terms are bounded as before and the second term equals
[TABLE]
Thus, is -Carleson, which completes the proof of estimate (i).
To prove the dual square function estimate , recall (4). Then we have
[TABLE]
By inserting , it is easy to see that this sum is bounded by , where
[TABLE]
Clearly, because is -sparse and . Similarly, is bounded because the sequence defined in (10) is -Carleson. Thus, we need only consider Observe that we can decompose as
[TABLE]
Then Theorem 6 paired with the properties of give
[TABLE]
where is defined in (2). To consider , first write
[TABLE]
For each , let denote the set of maximal so that . If satisfies , then for we can write
[TABLE]
This uses the fact that the are disjoint and if , then since and , we must have Substituting that into for and using Theorem 6 gives
[TABLE]
where we use the fact that if , then the sets and are disjoint, and the fact that is -sparse.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] P. Auscher, S. Hofmann, C. Muscalu,T. Tao, and C. Thiele. Carleson measures, trees, extrapolation, and T(b) theorems. Publ. Mat. 46 (2002), no. 2, 257–325.
- 2[2] P. Auscher and E. Routin. Local T b 𝑇 𝑏 Tb theorems and Hardy inequalities. J. Geom. Anal. 23 (2013), no. 1, 303–374.
- 3[3] P. Auscher and Q.X. Yang. BCR algorithm and the T(b) theorem. Publ. Mat. 53 (2009), no. 1, 179–196.
- 4[4] K. Bickel and B.D. Wick, Well-localized operators on matrix weighted L 2 spaces. Houston J. Math. 42 (2016), no. 1, 249–283.
- 5[5] K. Bickel, A Culiuc, S. Treil, and B.D. Wick. Two weight estimates with matrix measures for well localized operators. preprint, ar Xiv:1611.06667.
- 6[6] M. Christ. A T ( b ) 𝑇 𝑏 T(b) theorem with remarks on analytic capacity and the Cauchy integral. Colloq. Math. 60/61 (1990), no. 2, 601–628.
- 7[7] G. David, J.-L. Journé, and S. Semmes. Opérateurs de Calderón-Zygmund, fonctions para-accrétives et interpolation. Rev. Mat. Iberoamericana 1 (1985), no. 4, 1–56.
- 8[8] S. Hofmann, A proof of the local T b 𝑇 𝑏 Tb theorem for standard Calderón-Zygmund operators, unpublished manuscript (2007), ar Xiv:0705.0840.
