4 Proof of Finitary Carleson
To prove Proposition 2.0.1, we already fixed in Chapter 2 measurable functions and Borel sets . We have also defined to be the smallest integer such that the ranges of and are contained in and and are contained in the ball .
The proof of the next lemma is done in Section 4.1, following the construction of dyadic cubes in
[
.
Lemma
4.0.1
grid existence
There exists a grid structure .
The next lemma, which we prove in Section 4.2, should be compared with the construction in
[
.
Lemma
4.0.2
tile structure
For a given grid structure , there exists a tile structure .
Choose a grid structure with Lemma 4.0.1 and a tile structure for this grid structure with Lemma 4.0.2. Applying Proposition 2.0.2, we obtain a Borel set in with such that for all Borel functions with we have 2.0.22.
Lemma
4.0.3
tile sum operator
Proof
▶
Fix . Sorting the tiles on the left-hand-side of 4.0.1 by the value , it suffices to prove for every that
if and
if . If , then by definition of we have for any with and thus . This proves 4.0.2.
Now assume . By 2.0.7, 2.0.9, 2.0.10, the fact that and , there is at least one with and . By 2.0.8, this is unique. By 2.0.13, there is precisely one such that . Hence there is precisely one with such that . For this , the value by its definition in 2.0.21 equals the right-hand side of 4.0.3. This proves the lemma.
We use this to prove Proposition 2.0.1.
4.1 Proof of Grid Existence Lemma
We begin with the construction of the centers of the dyadic cubes.
Lemma
4.1.1
counting balls
Let . Consider such that for any , we have
furthermore, for any with , we have
Then the cardinality of is bounded by
Proof
▶
Let and be given. By applying the doubling property 1.0.5 inductively, we have for each integer
Since is the union of the balls and is not zero, at least one of the balls has positive measure, thus has positive measure.
Applying 4.1.4 for by 2.0.1, using , , and the triangle inequality, we have
Using the disjointedness of the balls in 4.1.2, 4.1.1, and the triangle inequality for , we obtain
As is not zero, the lemma follows.
For each , let be a set of maximal cardinality in such that satisfies the properties 4.1.1 and 4.1.2 and such that . By the upper bound of Lemma 4.1.1, such a set exists.
For each , choose an enumeration of the points in the finite set and thus a total order on .
Lemma
4.1.2
cover big ball
For each , the ball is contained in the union of the balls with .
Proof
▶
Let be any point of . By maximality of , the ball intersects one of the balls with . By the triangle inequality, .
Define the set
We totally order the set lexicographically by setting if or both and . In what follows, we define recursively in the sense of this order a function
Assume the sets have already been defined for if and if and .
If , define for the set to be . If , define for and the set to be
Define for and
with
Lemma
4.1.3
basic grid structure
For each and the following holds.
If and for some and we have
then .
If , then
We have for each ,
Proof
▶
We prove these statements simultaneously by induction on the ordered set of pairs . Let .
We first consider 4.1.13 for . If , disjointedness of the sets follows by definition of and . If , assume is in for . Then, for , there is with . Using 4.1.13 inductively for , we conclude . This implies that the balls and intersect. By construction of , this implies . This proves 4.1.13 for .
We next consider 4.1.13 for . Assume is in for and . If is in , then by definition 4.1.11, for . As we have already shown 4.1.13 for , we conclude . This completes the proof in case , and we may assume is not in . By definition 4.1.11, is not in for any with or . Hence, neither nor , and by totality of the order of , we have . This completes the proof of 4.1.13 for .
We show 4.1.14 for . In case , this follows from Lemma 4.1.2. Assume . Let be a point of . By induction, there is such that . Using the inductive statement 4.1.15, we obtain . As , by applying the triangle inequality with the points, , , and , we obtain that . By Lemma 4.1.2, is in for some . It follows that . This proves 4.1.14 for .
We show 4.1.14 for . Let . In case , then by definition of we have for some and thus . We may thus assume . As we have already seen 4.1.14 for , there is such that . We may assume this is minimal with respect to the order in . Then . This proves 4.1.14 for .
Next, we show the first inclusion in 4.1.15. Let . As , it suffices to show . If , this follows immediately from the assumption on and the definition of . Assume . By the inductive statement 4.1.14 and , there is a such that . By the inductive statement 4.1.15, we conclude . By the triangle inequality with points , , , and , we have . It follows by definition 4.1.10 that , and thus . This proves the first inclusion in 4.1.15.
We show the second inclusion in 4.1.15. Let . As directly from the definition 4.1.10, it follows by definition 4.1.11 that . By definition 4.1.10, there is with . By induction, . By the triangle inequality applied to the points and , we conclude . This shows the second inclusion in 4.1.15 and completes the proof of the lemma.
Lemma
4.1.4
cover by cubes
Proof
▶
Let and . If , the inclusion 4.1.16 is true from the definition of set union. We may then assume inductively that and the statement of the lemma is true if is replaced by . Let . By definition 4.1.11, for some . By 4.1.10, for some . We conclude 4.1.16 by induction.
Lemma
4.1.5
dyadic property
Proof
▶
Let be as in the lemma. Pick . Assume first . By 4.1.13 of Lemma 4.1.3, we conclude , and thus 4.1.17. Now assume . By induction, we may assume that the statement of the lemma is proven for in place of .
By Lemma 4.1.4, there is a such that . By induction, we have . It remains to prove
We make a case distinction and assume first . By Definition 4.1.11, we have . By Definition 4.1.10, there is a with . By 4.1.13 of Lemma 4.1.3, we have . By Definition 4.1.10, we then have . Then 4.1.18 follows by Definition 4.1.11 in the given case.
Assume now the case . By 4.1.11, we have . Moreover, for any in , we have . Let . By transitivity of the order in , we conclude . By 4.1.10 and the disjointedness property of Lemma 4.1.3, we have . Similarly, . Hence . As was arbitrary, we conclude with 4.1.11 the claim in the given case. This completes the proof of 4.1.18, and thus also 4.1.17.
For and , write if and
Lemma
4.1.6
transitive boundary
Assume and , , . Assume there is such that
If , the also and
Proof
▶
As and , we have by Lemma 4.1.5 that . Similarly, . Pick such that
which exists as . As as well, we conclude . By the triangle inequality, we have
Using the choice of and 4.1.15 as well as 4.1.21, we estimate this by
where we have used and . We conclude .
Lemma
4.1.7
small boundary
Let . For each and we have
Proof
▶
Let be as in the lemma. Let and .
Pick so that . For each with , by Lemma 4.1.4 and Lemma 4.1.5, there is a unique such that
Using Lemma 4.1.6, .
We conclude using the disjointedness property of Lemma 4.1.3 that
Adding over , and using
from the doubling property 1.0.5 and 4.1.15 gives
Each ball occurring in 4.1.28 is contained in by 4.1.15 and in turn contained in by 4.1.25. Assume for the moment all these balls are pairwise disjoint. Then by additivity of the measure,
which by implies 4.1.24.
It thus remains to prove that the balls occurring in 4.1.28 are pairwise disjoint. Let and be two parameter pairs occurring in the sum of 4.1.28 and let and be the corresponding balls. If , then the balls are equal or disjoint by 4.1.15 and 4.1.13 of Lemma 4.1.3. Assume then without loss of generality that . Towards a contradiction, assume that
As , there is a point in with . Using , we conclude from the triangle inequality and 4.1.30 that . However, , and , a contradiction to . This proves the lemma.
Lemma
4.1.8
smaller boundary
Let and let be an integer. Then for each we have
Proof
▶
We prove this by induction on . If , both sides of 4.1.31 are equal to by 4.1.13. If , this follows from Lemma 4.1.7.
Assume and 4.1.31 has been proven for . We write 4.1.31
Applying the induction hypothesis, this is bounded by
Applying 4.1.24 gives 4.1.31, and proves the lemma.
Lemma
4.1.9
boundary measure
For each and and with we have
Proof
▶
Let with . Let as in Lemma 4.1.8. Let be the largest integer such that , so that and
Let , by the assumption , we have . By 4.1.16, there exists with . By the squeezing property 4.1.15 and the assumption on , we have
By the assumption on and the definition of , this is
Together with 4.1.17 thus . We have shown that
Using monotonicity and additivity of the measure and Lemma 4.1.8, we obtain
By 4.1.36 and the definition 2.0.1 of , this is bounded by
which completes the proof by the definition 2.0.2 of .
Let be the set of all with and . Define
We define to be the set of all such that .
We first show that satisfies properties 2.0.7, 2.0.8, 2.0.10 and 2.0.11. Property 2.0.10 follows from 4.1.15, while 2.0.11 follows from Lemma 4.1.9.
Let . We show properties 2.0.7 and 2.0.8 for and .
We first show 2.0.7 for by contradiction. Then there is an violating the conclusion of 2.0.7. Pick such such that is minimal. By assumption, we have ; in particular . By definition, is contained in , which is contained in the union of with . By minimality of , each such is contained in the union of all with . This proves 2.0.7.
We now show 2.0.8 for . Assume to get a contradiction that there are non-disjoint with and . We may assume the existence of such and with minimal . Let . Assume first . Let and with . If , then , a contradiction to . If , then by 4.1.13, a contradiction to the non-disjointedness of . Assume now . Choose . By property 2.0.7, there is with and . By construction of , and pairwise disjointedness of all that we have already seen, we have . By minimality of , we have . This proves and thus 2.0.8.
Now note that properties 2.0.8, 2.0.10 and 2.0.11 immediately carry over to by restriction. 2.0.9 is true for by definition, and 2.0.7 follows from 2.0.7 and 2.0.8 for .
4.2 Proof of Tile Structure Lemma
Choose a grid structure with Lemma 4.0.1 Let . Suppose that
is such that for any with we have
Since is finite, there exists a set satisfying both 4.2.1 and 4.2.2 of maximal cardinality among all such sets. We pick for each such a set .
Lemma
4.2.1
frequency ball cover
Proof
▶
Let . By maximality of , there must be a point such that . Else, would be a set of larger cardinality than satisfying 4.2.1 and 4.2.2. Fix such , and fix a point . By the triangle inequality, we deduce that
and hence .
We define
We further set
Then 2.0.18, 2.0.19 hold by definition.
It remains to construct the map , and verify properties 2.0.13, 2.0.14 and 2.0.15. We first construct an auxiliary map . For each , we pick an enumeration of the finite set
We define as below. Set
and then define iteratively
Lemma
4.2.2
disjoint frequency cubes
For each , and , if
then .
Proof
▶
By the definition of the map , we have
By 4.2.4, the set is disjoint from each with . Thus the sets , are pairwise disjoint.
Lemma
4.2.3
frequency cube cover
For each , it holds that
For every , it holds that
Proof
▶
For 4.2.6 let . The second inclusion in 4.2.6 then follows from 4.2.4 and the equality , which is true by definition. For the first inclusion in 4.2.6 let . Let be such that in the enumeration we chose above. It follows immediately from 4.2.4 and 4.2.2 that for all . Thus, again from 4.2.4, we have .
To show 4.2.5 let . If there exists with , then
by the first inclusion in 4.2.6.
Now suppose that there exists no with . Let be minimal such that . Since for each by 4.2.4, we have that for all . Hence , again by 4.2.4.
Now we are ready to define the function . We define for all
For all other cubes , , there exists, by 2.0.8 and 2.0.9, with and . On such we define by recursion. We can pick an inclusion minimal among the finitely many cubes such that and . This is unique: Suppose that is another inclusion minimal cube with and . Without loss of generality, we have that . By 2.0.8, it follows that . Since is minimal with respect to inclusion, it follows that . Then we define
We now verify that forms a tile structure.
First, we prove 2.0.15. If , then 2.0.15 holds for all by 4.2.7 and 4.2.6. Now suppose that is not maximal in with respect to set inclusion. Then we may assume by induction that for all with and all , 2.0.15 holds. Let be the unique minimal cube in with .
Suppose that . If , then since
we conclude that . If not, by 4.2.8, there exists with . Using the triangle inequality and 4.2.6, we obtain
By Lemma 2.1.2 and the induction hypothesis, this is estimated by
This shows the second inclusion in 2.0.15. The first inclusion is immediate from 4.2.8.
Next, we show 2.0.13. Let .
If , then disjointedness of the sets for follows from the definition 4.2.7 and Lemma 4.2.2. To obtain the inclusion in 2.0.13 one combines the inclusions 4.2.3 and 4.2.5 of Lemma 4.2.3 with 4.2.7.
Now we turn to the case where there exists with and . In this case we use induction: It suffices to show 2.0.13 under the assumption that it holds for all cubes with . As shown before definition 4.2.8, we may choose the unique inclusion minimal such . To show disjointedness of the sets we pick two tiles and . Then we are by 4.2.8 in one of the following four cases.
1. There exist such that , and there exists such that . By the induction hypothesis, that 2.0.13 holds for , we must have . By Lemma 4.2.2, we must then have .
2. There exists such that , and . Using the triangle inequality, Lemma 2.1.2 and 2.0.15, we obtain
Thus by 4.2.6. By Lemma 4.2.2, it follows that .
3. There exists such that , and . This case is the same as case 2., after swapping and .
4. We have . In this case it follows that since the sets are pairwise disjoint by the inclusion 4.2.6 and Lemma 4.2.2.
To show the inclusion in 2.0.13, let . By the induction hypothesis, there exists such that . By definition of the set , we have for some . Thus, by 4.2.3, there exists with . Then by Lemma 4.2.3 there exists with . Consequently, by 4.2.8, . This completes the proof of 2.0.13.
Finally, we show 2.0.14. Let with and . If we have , then it follows from 2.0.8 that , thus . By 2.0.13 we have then either or . By the assumption in 2.0.14 we have , so we must have and in particular .
So it remains to show 2.0.14 under the additional assumption that . In this case, we argue by induction on . By 2.0.7, there exists a cube with and . We pick one such . By 2.0.8, we have .
Thus, by 4.2.3, there exists with . Then by Lemma 4.2.3 there exists with . By 4.2.8, it follows that . Note that then and and . Thus, we have by the induction hypothesis that . This completes the proof. □