2 Proof of Metric Space Carleson, overview
This section organizes the proof of Theorem 1.0.2 into sections 3, 4, 5, 6, 7, 8, and 9. These sections are mutually independent except for referring to the statements formulated in the present section. Chapter 3 proves the main Theorem 1.0.2, while sections 4, 5, 6, 7, 8, and 9 each prove one proposition that is stated in the present section. The present section also introduces all definitions used across these sections.
Section 2.1 proves some auxiliary lemmas that are used in more than one of the sections 3-9.
Let be given as in Theorem 1.0.2.
Define
and
Let be the unique compactly supported, piece-wise linear, continuous function with corners precisely at , , and which satisfies
for all . This function vanishes outside , is constant one on , and is Lipschitz with constant .
Let a doubling metric measure space be given. Let a cancellative compatible collection of functions on be given. Let be a point such that for all .
Let a Borel measurable function with finite range be given. Let a one-sided Calderón–Zygmund kernel on be given so that for every the operator defined in 1.0.21 satisfies 1.0.23.
For , we define
so that for each with we have
In Chapter 3, we prove Theorem 1.0.2 and Theorem 1.0.3 from the finitary version, Proposition 2.0.1 below. Recall that a function from a measure space to a finite set is measurable if the pre-image of each of the elements in the range is measurable.
Proposition
2.0.1
finitary Carleson
Let be measurable functions with finite range and . Let be bounded Borel sets in . Then there is a Borel set in with such that for all Borel functions with .
Let measurable functions with finite range be given. Let bounded Borel sets in be given. Let be the smallest integer such that the ranges of and are contained in and and are contained in the ball .
In Chapter 4, we prove Proposition 2.0.1 using a bound for a dyadic model formulated in Proposition 2.0.2 below.
A grid structure on consists of a finite collection of pairs of Borel sets in and integers , the projection to the second component which is assumed to be surjective and called scale function, and a function called center function such that the five properties 2.0.7, 2.0.8, 2.0.9, 2.0.10, and 2.0.11 hold. We call the elements of dyadic cubes. By abuse of notation, we will usually write just for the cube , and we will write to mean that for two cubes we have and .
For each dyadic cube and each we have
Any two non-disjoint dyadic cubes with satisfy
There exists a with and and for all cubes , we have
For any dyadic cube ,
For any dyadic cube and any with ,
A tile structure for a given grid structure is a finite set of elements called tiles with five maps
with surjective and denoting the power set of such that the five properties 2.0.13, 2.0.14, 2.0.15, 2.0.18, and 2.0.19 hold. For each dyadic cube , the restriction of the map to the set
is injective and we have the disjoint covering property (we use the union symbol with dot on top to denote a disjoint union)
For any tiles with and we have
For each tile ,
where
and
We have for each tile
Proposition
2.0.2
discrete Carleson
Let be a grid structure and
a tile structure for this grid structure. Define for
and
Then there exists a Borel set with such that for all Borel functions with we have
The proof of Proposition 2.0.2 is done in Chapter 5 by a reduction to two further propositions that we state below.
Fix a grid structure and a tile structure for this grid structure.
We define the relation
on meaning and . We further define for the relation
on meaning and
Define for a tile and
Given a subset of , we define to be the set of all such that there exist with . Define the densities
An antichain is a subset of such that for any distinct we do not have .
The following proposition is proved in Chapter 6.
Proposition
2.0.3
antichain operator
For any antichain and for all with and all with
Let . An -forest is a pair where is a subset of and is a map assigning to each a nonempty set called tree such that the following properties 2.0.32, 2.0.33, 2.0.34, 2.0.35, 2.0.36, and 2.0.37 hold.
For each and each we have and
For each and each and we have
We have
We have for every
We have for with and with that
We have for every and that
The following proposition is proved in Chapter 7.
Proposition
2.0.4
forest operator
For any and any -forest we have for all with and all bounded with bounded support
Theorem 1.0.2 is formulated at the level of generality for general kernels satisfying the mere Hölder regularity condition 1.0.15. On the other hand, the cancellative condition 1.0.12 is a testing condition against more regular, namely Lipschitz functions. To bridge the gap, we follow
[
to observe a variant of 1.0.12 that we formulate in the following proposition proved in Chapter 8.
Define
Define for any open ball of radius in the -normalized -Hölder norm by
Proposition
2.0.5
Holder van der Corput
Let and and set . Let by supported on and satisfy . Let . Then
We further formulate a classical Vitali covering result and maximal function estimate that we need throughout several sections. This following proposition will typically be applied to the absolute value of a complex valued function and be proved in Chapter 9. By a ball we mean a set with and as defined in 1.0.6. For a finite collection of balls in and define the measurable function on by
Define further .
Proposition
2.0.6
Hardy–Littlewood
Let be a finite collection of balls in . If for some and some measurable function we have
for each , then
For every measurable function and we have
Moreover, given any measurable bounded function there exists a measurable function such that the following 2.0.45 and 2.0.46 hold. For each ball and each
and for all
This completes the overview of the proof of Theorem 1.0.2.
2.1 Auxiliary lemmas
We close this section by recording some auxiliary lemmas about the objects defined in Chapter 2, which will be used in multiple sections to follow.
First, we record an estimate for the metrical entropy numbers of balls in the space equipped with any of the metrics , following from the doubling property 1.0.11.
Lemma
2.1.1
ball metric entropy
Let be a ball. Let , and . Suppose that satisfies that is a collection of pairwise disjoint sets. Then
Proof
▶
By applying property 1.0.11 times, we obtain a collection with and
Then each is contained in one of the balls , but by the separation assumption no such ball contains more than one element of . Thus .
The next lemma concerns monotonicity of the metrics with respect to inclusion of cubes in a grid.
Lemma
2.1.2
monotone cube metrics
Let be a grid structure. Denote for cubes
Let with . Then for all we have
and if then we have
Proof
▶
If then 2.0.8 and the assumption imply . Then the lemma holds by reflexivity.
If , then using the monotonicity property 1.0.9, 2.0.1 and 1.0.10, we get
Using 2.0.10, together with the inclusion , we obtain
and consequently by the triangle inequality
Using this together with the monotonicity property 1.0.9 and 1.0.8 in 2.1.1, we obtain
This proves the second inequality claimed in the Lemma, from which the first follows since and hence .
We also record the following basic estimates for the kernels .
Lemma
2.1.3
kernel summand
Let and . If , then we have
We have
and
Proof
▶
By Definition 2.0.5, the function is the product of with a function which is supported in the set of all satisfying 2.1.2. This proves 2.1.2.
Using 1.0.14 and the lower bound in 2.1.2 we obtain
Using and the doubling property 1.0.5 times estimates the last display by
Using proves 2.1.3.
To prove 2.1.4 when , use the lower bound in 2.1.2, . Then 2.1.4 follows from the triangle inequality, 2.1.3 and .
If , we rewrite as
An upper bound for is obtained similarly to the proof of 2.1.3, using 1.0.15 and the lower bound in 2.1.2
As above, this is estimated by
We have the trivial bound , and 2.1.6 provides a bound for . Finally, we show that
by considering separately the cases and . In the former case, the inequality is trivial; in the latter case, it follows from the fact that is Lipschitz with constant .
Combining the above bounds and using proves 2.1.4 in the case . □