10 Two-sided Metric Space Carleson
We prove a variant of Theorem 1.0.2 for a two-sided Calderón–Zygmund kernel on the doubling metric measure space , i.e. a one-sided Calderón–Zygmund kernel which additionally satisfies for all with and ,
By the additional regularity, we can weaken the assumption 1.0.18 to a family of operators that is easier to work with in applications. Namely, for , , and a bounded, measurable function supported on a set of finite measure, we define
Theorem
10.0.1
two-sided metric space Carleson
For all integers and real numbers the following holds. Let be a doubling metric measure space. Let be a cancellative compatible collection of functions and let be a two-sided Calderón–Zygmund kernel on . Assume that for every bounded measurable function on supported on a set of finite measure and all we have
Then for all Borel sets and in and all Borel functions with , we have, with defined in 1.0.17,
For the remainder of this chapter, fix an integer , a doubling metric measure space and a two-sided Calderón–Zygmund kernel as in Theorem 10.0.1.
The following lemma is proved in Section 10.1.
Lemma
10.0.2
nontangential-from-simple
Assume 10.0.3 holds. Then, for every bounded measurable function supported on a set of finite measure we have
Let be a real number. Let be a cancellative compatible collection of functions. By the assumption 10.0.3, we can apply Lemma 10.0.2 to obtain for every bounded measurable supported on a set of finite measure,
Define
Then is a two-sided Calderón–Zygmund kernel on . Denote the corresponding maximally truncated non-tangential singular operator by and the corresponding generalized Carleson operator by . With 10.0.6, we obtain for as above,
Applying Theorem 1.0.2 for yields that for all Borel sets and in and all Borel functions with , we have
This finishes the proof since for all ,
The proof of Lemma 10.0.2 relies on the following auxiliary lemma which is proved in Section 10.2.
Lemma
10.0.3
Calderon-Zygmund Weak (1, 1)
Let be a bounded measurable function supported on a set of finite measure and assume for some that for every bounded measurable function supported on a set of finite measure,
Then for all , we have
Throughout Section 10.2 and Section 10.1, for any measurable bounded function , let denote the corresponding Hardy–Littlewood maximal function defined in Proposition 2.0.6. Apart from Proposition 2.0.6, Section 10.2 and Section 10.1 have no dependencies in the previous chapters.
10.1 Proof of Cotlar’s Inequality
Lemma
10.1.1
geometric series estimate
Proof
▶
By convexity, for all
For , we obtain
We conclude
Lemma
10.1.2
estimate x shift
Let and . Let be a bounded measurable function supported on a set of finite measure. Then for all with .
Proof
▶
By definition,
We split the first integral in 10.1.1 into the domains and . The integral over the first domain we estimate by below. For the second domain, we observe with and the triangle inequality that . We therefore combine on this domain with the corresponding part of the second integral in 10.1.1 and estimate that by below. The remaining part of the second integral in 10.1.1 we estimate by . Overall, we have estimated 10.1.1 by
Using the bound on in 1.0.14 and the doubling condition 1.0.5, we estimate 10.1.2 by
Using the definition of , we estimate 10.1.6 by
Similarly, in the domain of 10.1.4 we note by the triangle inequality and assumption on that and thus we estimate 10.1.4 by
We turn to the remaining term. Using 10.0.1, we estimate 10.1.3 by
We decompose and estimate 10.1.3 with the triangle inequality by
Using Lemma 10.1.1, we estimate 10.1.13 by
Summing the estimates for 10.1.2, 10.1.3, and 10.1.4 proves the lemma.
Lemma
10.1.3
Cotlar control
Let and . Let be a bounded measurable function supported on a set of finite measure. Then for all with we have
Proof
▶
Let and be given with . By an application of Lemma 10.1.2, we estimate the left-hand-side of 10.1.15 by
We have
On the domain , we have . Hence we may write for 10.1.17
Combining the estimate 10.1.16 with the identification 10.1.18, we obtain
We have
As together with implies , we can estimate the absolute value of 10.1.20 with 1.0.14 by
By the triangle inequality, 10.1.15 follows now from 10.1.19 and the estimate for 10.1.20.
Lemma
10.1.4
Cotlar sets
Assume that 10.0.3 holds. Let and . Let be a bounded measurable function supported on a set of finite measure. Then the measure of the set of all such that
is less than or equal to . Moreover, the measure of the set of all such that
is less than or equal to .
Proof
▶
Let , , and be given. If , then is zero almost everywhere and the estimate on is trivial. Assume . We have with 10.1.21
Dividing by gives
This gives the desired bound for the measure of . We turn to the set . Similarly as above we may assume . The set is then estimated with Lemma 10.0.3 by
This gives the desired bound for the measure of .
Lemma
10.1.5
Cotlar estimate
Assume that 10.0.3 holds. Let and . Let be a bounded measurable function supported on a set of finite measure. Then
Proof
▶
By Lemma 10.1.4, the set of all such that at least one of the conditions 10.1.21 and 10.1.22 is satisfied has measure less than or equal to and hence is not all of . Pick an such that both conditions are not satisfied. Applying Lemma 10.1.3 for this and using the triangle inequality estimates the left-hand side of 10.1.28 by
This proves the lemma.
Lemma
10.1.6
simple nontangential operator
Assume that 10.0.3 holds. For every and every bounded measurable function supported on a set of finite measure we have
where
In order to pass from the one-sided truncation in and to the two-sided truncation in , we show in the following two lemmas that the integral in 1.0.16 can be exchanged for an integral over the difference of two balls.
Lemma
10.1.7
small annulus
Let be a bounded measurable function supported on a set of finite measure. Let and . Then, for all , there exists some such that
and
Proof
▶
We only prove the second inequality, the first one is analogous. Note that the integrand is bounded in . So for ,
By continuity from above of , the right factor becomes arbitrarily small as . Thus, for small enough , the whole expression is .
Lemma
10.1.8
nontangential operator boundary
Let be a bounded measurable function supported on a set of finite measure. For all ,
Proof
▶
We show two inequalities. Let . Let and . Then for small enough ,
By Lemma 10.1.7, we can choose such that 10.1.41 is bounded by . Without loss of generality, we can assume . Then 10.1.42 is bounded by the right hand side of 10.1.39 and we obtain
The inequality still holds when taking the suprema over and in 10.1.40. Since was arbitrary, this proves the first inequality.
The other direction is similar. Let . Let and . Then for ,
By Lemma 10.1.7, we can choose such that 10.1.44 is bounded by . Without loss of generality, we can assume . Then 10.1.45 is bounded by the left hand side of 10.1.39 and we obtain
The inequality still holds when taking the suprema over and in 10.1.40. Since was arbitrary, this proves the second inequality.
Fix as in the Lemma. Applying Lemma 10.1.6 with a sequence of tending to and using Lebesgue monotone convergence shows
where
We now write using Lemma 10.1.8 and the triangle inequality,
Noting that the first integral does not depend on and estimating the second summand by the larger supremum over all , at which time the integral does not depend on , we estimate further
Applying the triangle inequality on the left-hand side of 10.0.5 and applying 10.1.46 twice proves 10.0.5. This completes the proof of Lemma 10.0.2.
10.2 Calderón-Zygmund Decomposition
Calderón-Zygmund decomposition is a tool to extend bounds to bounds with or to the so-called weak type endpoint bound. It is classical and can be found in
[
.
The following lemma is Theorem 3.1(b) in
[
. The proof uses Proposition 2.0.6.
Lemma
10.2.1
Maximal theorem
Let be bounded, measurable, supported on a set of finite measure, and let . Then
Proof
▶
By definition, for each with , there exists a ball such that and
Since is open and is inner regular on open sets, it suffices to show that
for every compact . For such an , by compactness, we can select a finite subcollection that covers . By 2.0.43 applied to 10.2.2,
and hence
Lemma
10.2.2
Lebesgue differentiation
Let be a bounded measurable function supported on a set of finite measure. Then for almost every , we have
where is a sequence of balls with radii such that for each and
Proof
▶
This follows from the Lebesgue differentiation theorem, which is already formalized in Lean.
Lemma
10.2.3
Disjoint family countable
In a doubling metric measure space , every disjoint family of balls , , is countable.
Proof
▶
Choose an arbitrary as reference point. For , let denote the set of all such that and . It suffices to show that all the are finite. Indeed, for all ,
Since the are disjoint,
and hence .
The following lemma corresponds to Lemma 3.2 in
[
with additional proof of the bounded intersection property taken from the proof of Proposition 7.1 .
Lemma
10.2.4
Ball covering
Given an open set , there exists a countable family of balls such that
and for ,
and for ,
and we have the bounded intersection property that each is contained in at most of the .
Proof
▶
Define for ,
Since is open, and , we have
Using Zorn’s Lemma, we select a maximal disjoint subfamily of . We obtain a (by Lemma 10.2.3 countable) family of balls such that 10.2.5. 10.2.7 and are also immediate. For the other inclusion, first observe that for , if , then
so
Now let . By maximality, there exists some with . By 10.2.10,
and thus .
We now turn to the bounded intersection property. Assume that for some ,
Similarly as above, observe for ,
and
so
By 10.2.12 and 10.2.13, for all , and . Using this and 10.2.5, we obtain
and conclude .
Most of the next lemma and its proof is taken from Theorem 4.2 in
[
.
Lemma
10.2.5
Calderon Zygmund decomposition
Let be a bounded, measurable function supported on a set of finite measure and let . Then there exists a measurable function , a countable family of balls (where we allow in the special case that ) such that each is contained in at most of the , and a countable family of measurable functions such that for all
and such that the following holds. For almost every ,
We have
For every
For every
and
We have
and
Proof
▶
Let . Then is open. Assume first that . We apply Lemma 10.2.4 with to obtain the family . Without loss of generality, we can assume . Define inductively
Then , the are pairwise disjoint and . Define
and, for each ,
Then 10.2.16, 10.2.19 and 10.2.20 are true by construction. For 10.2.17, we first do the case . By definition of ,
for every ball with . It follows by Lemma 10.2.2 that for almost every , . In the case , there exists some with and we have that
because . We get
To prove 10.2.18, we estimate
Using the triangle inequality, we have that
With 10.2.30, we estimate further
to obtain 10.2.21. Further, summing up 10.2.32 in yields 10.2.23. At last, we estimate with Lemma 10.2.1
proving 10.2.22.
Assume now that . It follows from Lemma 10.2.1 that then . Define
and
Then and and 10.2.16, 10.2.18, 10.2.19, 10.2.20 all hold immediately. By assumption, , so 10.2.17 holds. We also have, using the definitions and the same assumption,
which verifies both 10.2.23 and 10.2.21. Finally, by Lemma 10.2.1,
which shows 10.2.22.
We use Lemma 10.2.5 to prove Lemma 10.0.3. For the remainder of this section, let , and as in the lemma. We define the constant
and . If , then we directly have
which proves 10.0.9. So assume from now on that . Using Lemma 10.2.5 for and , we obtain the decomposition
such that the properties 10.2.16-10.2.23 are satisfied (with replacing ). We rename to and let
Define
(In the special case , we define .) Then is a ball with the same center as but with
Let
We deal with and separately in the following lemmas.
Lemma
10.2.6
Estimate good
Proof
▶
We estimate using monotonicity of the integral
Using 10.0.8 followed by 10.2.17 and 10.2.18, we estimate the right hand side above by
Lemma
10.2.7
Estimate bad partial
Proof
▶
We decompose the index set into the following disjoint sets:
Then
For all , , and thus , so .
Next, for , , and we have
Using 10.2.20, the above is equal to
Since , we have for each that
so we can apply 1.0.15 to estimate
and by 10.2.21,
Next, we estimate 10.2.44. For each , set
Then by 10.2.21
For each , we have
Thus, using the triangle inequality, the equation above and 10.2.49, we obtain
By 10.2.46, we can apply 1.0.15 and arguing as in 10.2.48, we get that
with as in 10.2.48. Define
We claim that
Indeed, for each and , using again 10.2.46,
and hence
For the lower bound, we observe
and conclude
Using the bounded intersection property of the , 10.2.52 and 1.0.14, we get
Combining the estimates 10.2.48 for 10.2.43, 10.2.51 for 10.2.44, and 10.2.58, we get
By the definition 10.2.37 of , this equals
Lemma
10.2.8
Estimate F set
For as defined in Lemma 10.2.7, we have
Proof
▶
We estimate
Using
we have for all ,
where we used Lemma 10.1.1 in the last step. Plugging this into 10.2.62 and using 10.2.22, we conclude that
Lemma
10.2.9
Estimate bad