7 Proof of the Forest Operator Proposition
7.1 The pointwise tree estimate
Fix a forest . The main result of this subsection is Lemma 7.1.3, we begin this section with some definitions necessary to state the lemma.
For and , we define
This is a subset of , so has a minimum and a maximum. We set
Lemma
7.1.1
convex scales
Proof
▶
Let with . By definition of , there exists with and , and there exists with and . By property 2.0.7 of the dyadic grid, there exists a cube of scale with . By property 2.0.13, there exists a tile with . By the dyadic property 2.0.8 we have , and by 2.0.14, we have . Thus , which gives with the convexity property 2.0.33 of that , so .
For a nonempty collection of tiles we define
to be the collection of all dyadic cubes such that or
for all . We define to be the collection of inclusion maximal cubes in .
We further define
to be the collection of dyadic cubes such that , or there exists with and there exists no with . We define to be the collection of inclusion maximal cubes in .
Lemma
7.1.2
dyadic partitions
Proof
▶
Since is the set of inclusion maximal cubes in , cubes in are pairwise disjoint by 2.0.8. The same applies to .
If , then there exists by 2.0.7 a cube with and . Then . There exists an inclusion maximal cube in containing . This cube contains and is contained in . This shows one inclusion in 7.1.1, the other one follows from .
The proof of the two inclusions in 7.1.2 is similar.
For a finite collection of pairwise disjoint cubes , define the projection operator
Given a scale and a point , there exists a unique cube in of scale containing by 2.0.7. We denote it by . Define for the nontangential maximal operator
Define for each the auxiliary operator
Define also the collection of balls
The following pointwise estimate for operators associated to sets is the main result of this subsection.
Lemma
7.1.3
pointwise tree estimate
Let and . Let . Then for all bounded functions with bounded support
Proof
▶
By 2.0.21, if , then . Combining this with , we obtain
Using the triangle inequality, we bound this by the sum of three terms:
The proof is completed using the bounds for these three terms proven in Lemma 7.1.4, Lemma 7.1.5 and Lemma 7.1.6.
Lemma
7.1.4
first tree pointwise
For all , all , all and all bounded with bounded support, we have
Proof
▶
Let . If are such that , then, by 2.1.2, we have . By -Lipschitz continuity of the function and the property 1.0.7 of the metrics , it follows that
Let be a tile with and , and let be a tile with and . Using the monotonicity property 1.0.9, the doubling property 1.0.8 repeatedly, the definition of and Lemma 2.1.2, we can bound the previous display by
Since by 2.0.32 and by 2.0.15, this is estimated by
Using 2.1.3, it follows that
By 7.1.1, the collection is a partition of , so this is estimated by
This expression does not change if we replace by .
Let with . By the triangle inequality and since , it follows that . If and , then it follows from the triangle inequality, 2.0.10 and 2.0.1 that , contradicting . Thus or . If and , then . Thus we always have . It then follows from the triangle inequality and 2.0.10 that .
Thus we can continue our chain of estimates with
We have , by 2.0.10 and the triangle inequality, since . Combining this with the doubling property 1.0.5, we obtain
Since , it follows that 7.1.6 is bounded by
Since and , we have . It follows by 2.0.8 that , in particular . Thus
This completes the estimate for term 7.1.6.
Lemma
7.1.5
second tree pointwise
For all , all , all and all bounded with bounded support, we have
Proof
▶
Let . By definition, there exists a tile with and . Then . By 2.0.8 and the definition of , it follows that , in particular , so . Next, let and let with and . Since , we have . Since , it follows that
Applying the doubling property 1.0.8 five times, we obtain
By the triangle inequality, we have , so by 1.0.9
Finally, by applying 1.0.10 times, we obtain
Consequently, . The lemma now follows from the definition of .
Lemma
7.1.6
third tree pointwise
For all , all , all and all bounded with bounded support, we have
Proof
▶
We have for :
By 2.1.4 and 2.0.10, we have for
Suppose that . If for some then, by 2.1.2, . Let with and . Then by the triangle inequality. If and , then it follows from the triangle inequality, 2.0.10 and 2.0.1 that , contradicting . Thus or . If and , then . So in both cases, . It then follows from the triangle inequality and 2.0.10 that .
Thus, we can estimate 7.1.9 by
By 2.0.13 and 2.0.20, the sets for tiles with are pairwise disjoint. It follows from the definition of that if and only if , thus we can estimate the sum over by . If then in particular , so by 2.0.10 . By the doubling property 1.0.5
Since we can continue our estimate with
This completes the proof.
7.2 An auxiliary tree estimate
In this subsection we prove the following estimate on for operators associated to trees.
Lemma
7.2.1
tree projection estimate
Let . Then we have for all bounded with bounded support
Below, we deduce Lemma 7.2.1 from Lemma 7.1.3 and the following estimates for the operators in Lemma 7.1.3.
Lemma
7.2.2
nontangential operator bound
For all bounded with bounded support and all
Lemma
7.2.3
boundary operator bound
For all and all bounded functions with bounded support
Let . Let denote the right-hand side of Lemma 7.1.3. Apply this lemma to , to obtain for all
Hence, by taking an infimum, we have for
Integrating this estimate yields
By 2.0.21, we have for all , so
Since partitions by Lemma 7.1.2, we get from the triangle inequality
which by the above computation is bounded by
Applying Cauchy-Schwarz, this is bounded by . By Minkowski’s inequality, Proposition 2.0.6, Lemma 7.2.2 and Lemma 7.2.3, is at most
By the triangle inequality we have for all that , thus we can further estimate the above by
This completes the proof since .
Now we prove the two auxiliary lemmas. We begin with the nontangential maximal operator .
Fix . By 2.0.4 we have for all
Since is supported in , the two sums on the right hand side are zero for all , hence
Since is supported in , we further have
Finally, since and , we have for all
Let and suppose that . By the triangle inequality and 2.0.10, it holds that . We have
The first term 7.2.3 is at most . The other two terms will be estimated by the finitary maximal function from Proposition 2.0.6. For the second term 7.2.4 we use 1.0.14 which implies that for all with , we have
Using and the doubling property 1.0.5 times estimates the last display by
By the triangle inequality and 2.0.10, we have
Combining this with 7.2.6, we conclude that 7.2.4 is at most
For 7.2.5 we argue similarly. We have for all with
Using the doubling property 1.0.5 times estimates the last display by
Note that by 2.0.8 we have , in particular . By the triangle inequality and 2.0.10, we have
Combining this, 7.2.5 is at most
Using , taking a supremum over all and then a supremum over all , we obtain
The lemma now follows from assumption 1.0.18, Proposition 2.0.6 and .
We need the following lemma to prepare the -estimate for the auxiliary operators .
Lemma
7.2.4
boundary overlap
For every cube , there exist at most cubes with and .
Proof
▶
Suppose that and . Then . Hence by the doubling property 1.0.5
and by the triangle inequality, the ball is contained in .
If is any finite collection of cubes satisfying and
then it follows from 2.0.10 and pairwise disjointedness of cubes of the same scale 2.0.8 that the balls are pairwise disjoint. Hence
Since is doubling and , we have . The lemma follows after dividing by .
Now we can bound the operators .
Note that by definition, is a finite sum of indicator functions of cubes for each locally integrable , and hence is bounded, has bounded support and is integrable. Let be another function with the same three properties. Then is integrable, and we have
Changing the order of summation and using to bound the first average integral by for any , we obtain
By Lemma 7.2.4, there are at most cubes at each scale with . Since , . Using this estimate for the sum of the geometric series, we conclude that 7.2.8 is at most
The collection is a partition of , so this equals
Using Cauchy-Schwarz and Proposition 2.0.6, we conclude
The lemma now follows by choosing and dividing on both sides by the finite .
7.3 The quantitative tree estimate
The main result of this subsection is the following quantitative bound for operators associated to trees, with decay in the densities and .
Lemma
7.3.1
densities tree bound
Let . Then for all bounded with bounded support and with we have
If additionally , then we have
Below, we deduce this lemma from Lemma 7.2.1 and the following two estimates controlling the size of support of the operator and its adjoint.
Lemma
7.3.2
local dens1 tree bound
Lemma
7.3.3
local dens2 tree bound
Denote
Then we have
By Lemma 7.2.1, this is bounded by
We bound the two factors separately. We have
By Cauchy-Schwarz and Lemma 7.3.2 this is at most
Since cubes are pairwise disjoint by Lemma 7.1.2, this is
Similarly, we have
By Cauchy-Schwarz, this is
Since cubes in are pairwise disjoint by Lemma 7.1.2, this is at most
Combining 7.3.4, 7.3.5 and 7.3.7 gives 7.3.1.
If then , so
We estimate as before, using now Lemma 7.3.3 and Cauchy-Schwarz, and obtain that this is
Combining this with 7.3.4 and 7.3.5 gives 7.3.2.
Now we prove the two auxiliary estimates.
If the set on the right hand side is empty, then 7.3.3 holds. If not, then there exists with .
Suppose first that there exists such with . Then by 2.0.8 , which gives by the definition of that and hence . Let with . Since it follows from 2.0.8 that . We have then by Lemma 2.1.2
Using that and 2.0.32, this is at most . Using again the triangle inequality and Lemma 2.1.2, we obtain that for each
Thus . We obtain
By the definition of , this is bounded by
Since , 7.3.3 follows in this case.
Now suppose that for each with , we have . Since there exists at least one such , there exists in particular at least one cube with and . By 2.0.7, there exists with and . By the definition of there exists a tile with .
It suffices to show that there exists a tile with , and . For then, let with . As shown above, this implies , so by 2.0.8 . If , then by a similar calculation as above, using the triangle inequality, Lemma 2.1.2 and 2.0.32, we obtain
Thus . We deduce using the definition 2.0.28 of
Using the doubling property 1.0.5, 2.0.10, and this is estimated by
To show existence of with the given properties, if we can take , which satisfies the distance property by 2.0.32 and the other properties trivially. Otherwise, let be the unique tile such that and such that . Since and , we have . Since by 2.0.32 , we have by 2.0.8 and 2.0.14 that , and hence the distance property. follows by the triangle inequality, 2.0.32, Lemma 2.1.2 and 2.0.15. This completes the proof.
We prove the inequality with the constant replaced by ; this is stronger because . It suffices to show the existence of a tile and an such that and , because then it follows from the definition 2.0.29 of that
In particular, these criteria are satisfied, with , by any such that and , because then by the doubling property 1.0.5,
Suppose first that . Then , so 2.0.9 and the fact that imply that . Thus . It follows that is the only dyadic cube, so any has , and therefore satisfies and .
It remains to consider the case . Then, by 2.0.7 and 2.0.8, there exists some cube with and . By definition of there exists some such that .
Since , the triangle inequality, and imply
From the doubling property 1.0.5, and 2.0.10, we obtain
If , then we need only check that . This follows immediately from and 7.3.8.
From now on we assume . Since
we have by 2.0.10 and the triangle inequality
In particular this implies . By the triangle inequality we also have
so from 7.3.8,
which proves satisfies the needed criteria with .
7.4 Almost orthogonality of separated trees
The main result of this subsection is the almost orthogonality estimate for operators associated to distinct trees in a forest in Lemma 7.4.4 below. We will deduce it from Lemmas 7.4.5 and 7.4.6, which are proven in Subsections 7.5 and 7.6, respectively. Before stating it, we introduce some relevant notation.
The adjoint of the operator defined in 2.0.21 is given by
Lemma
7.4.1
adjoint tile support
For each , we have
For each and each , we have
Proof
▶
By 2.0.32, . Thus by 7.4.1
If this integral is not , then there exists such that . By 2.1.2, 2.0.10 and the triangle inequality, it follows that
Thus
The second claimed equation follows now since and by 2.0.37 .
Lemma
7.4.2
adjoint tree estimate
For all with , we have that
Proof
▶
By Lemma 7.3.1, we have for all bounded and with that
Let . Since , is bounded and has bounded support. In particular . Dividing 7.4.2 by completes the proof.
We define
Lemma
7.4.3
adjoint tree control
Now we are ready to state the main result of this subsection.
Lemma
7.4.4
correlation separated trees
For any and all bounded with bounded support, we have
By Lemma 7.4.1 and 2.0.8, the left hand side 7.4.3 is unless or . Without loss of generality we assume that .
Define
Lemma 7.4.4 follows by combining the definition 2.0.3 of with the following two lemmas.
Lemma
7.4.5
correlation distant tree parts
We have for all with and all bounded with bounded support
Lemma
7.4.6
correlation near tree parts
We have for all with and all bounded with bounded support
In the proofs of both lemmas, we will need the following observation.
Lemma
7.4.7
overlap implies distance
Let with . If with , then . In particular, we have .
Proof
▶
Suppose first that . Then , by 2.0.32. Thus we have by the separation condition 2.0.36, 2.0.15, 2.0.32 and the triangle inequality
using that . Hence .
Suppose now that . If , then the same argument as above with and swapped shows . If then, by 2.0.8, . Pick , we have . Hence, by Lemma 2.1.2 and the first paragraph
so .
To simplify the notation, we will write at various places throughout the proof of Lemmas 7.4.5 and 7.4.6 for a subset
7.5 Proof of the Tiles with large separation Lemma
Lemma 7.4.5 follows from the van der Corput estimate in Proposition 2.0.5. We apply this proposition in Section 7.5.3. To prepare this application, we first, in Section 7.5.1, construct a suitable partition of unity, and show then, in Section 7.5.2 the Hölder estimates needed to apply Proposition 2.0.5.
7.5.1 A partition of unity
Define
Lemma
7.5.1
dyadic partition 1
Proof
▶
By Lemma 7.1.2, it remains only to show that each with is in . But if , then by 2.0.8 . Pick . Then . This contradicts the definition of .
For cubes , denote
The main result of this subsubsection is the following.
Lemma
7.5.2
Lipschitz partition unity
There exists a family of functions , such that
and for all and all
In the proof, we will use the following auxiliary lemma.
Lemma
7.5.3
moderate scale change
For each cube let
and set
We define
Then, due to 2.0.37 and 7.5.1, the properties 7.5.2 and 7.5.3 are clearly true. Estimate 7.5.4 follows from 7.5.3 if . Thus we can assume that . We have by the triangle inequality
Since for all and by Lemma 7.5.1, we have that for all . So we can estimate the above further by
If then the second summand vanishes. Else, we can estimate the above, using also that , by
By the triangle inequality, we have for all dyadic cubes
Using this above, we obtain
By Lemma 7.5.3, this is at most
By 2.0.10 and Lemma 7.5.1, the balls are pairwise disjoint. By the triangle inequality and Lemma 7.5.3, each such ball for in the set of the last display is contained in
By the doubling property 1.0.5, we further have
for each such ball. Thus
Recalling that , we obtain
Since , 7.5.4 follows.
Suppose that . Then . Thus, by the definition of there exists no with
Since , there exists a cube with and . By the definition of , there exists a tile with
But by the triangle inequality and 2.0.1, we have
which contradicts 7.5.5 and 7.5.6.
7.5.2 Hölder estimates for adjoint tree operators
Let be bounded with bounded support. Define for
The main result of this subsubsection is the following -Hölder estimate for , where .
Lemma
7.5.4
Holder correlation tree
We will prove this lemma at the end of this section, after establishing several auxiliary results.
We begin with the following Hölder continuity estimate for adjoints of operators associated to tiles.
Lemma
7.5.5
Holder correlation tile
Let and . Then for all and all bounded with bounded support, we have
Proof
▶
By 7.4.1, we have
By the oscillation estimate 1.0.7, we have
Suppose that , so that . Let be such that but . In particular, . Then, using 1.0.10 followed by 1.0.8, we can bound 7.5.13 from above by
Since we have , and since we have , so this is estimated by
By definition of , we have
which gives
For all , we have by 1.0.5 that
Combining the above with 2.1.3, 2.1.4 and 7.5.14, we obtain
Since , we conclude
Next, if , then , by Lemma 7.4.1. Then 7.5.9 holds.
Finally, if and , then
By the same argument used to prove 2.1.6, this is bounded by
It follows from the definition of that
Now for all , it follows by the triangle inequality and 2.0.10 that
Combining the above with the previous estimate on , we get
Further, we obtain from the doubling property 1.0.5 and 2.0.10 that
Plugging this into 7.5.15 and using , we get
which completes the proof of the lemma.
Recall that
We also denote
Lemma
7.5.6
limited scale impact
Let , and suppose that
Then
Proof
▶
For the first estimate, assume that , then in particular . Since , we have by Lemma 7.4.7 that . Since , this implies
On the other hand
by our assumption. Thus , which contradicts 2.0.1 and .
For the second estimate, assume that . Since , we have . Thus there exists with and , by 2.0.7 and 2.0.8. By definition of , there exists some such that . On the other hand, since , by the triangle inequality it holds that
Using the definition of , we have
By 1.0.10, this is
and by 1.0.8 and the definition of
This is a contradiction, the second estimate follows.
Lemma
7.5.7
local tree control
For all and all bounded with bounded support
Proof
▶
By the triangle inequality and since , we have
By Lemma 7.5.6, this is at most
If and , then
by 2.0.10 and the triangle inequality. Using the doubling property 1.0.5, it follows that
Using 7.4.1, 2.1.3 and that , we bound 7.5.16 by
For each , the sets for with are pairwise disjoint by 2.0.20 and 2.0.13. Further, if and , then . Thus the last display is bounded by
The lemma follows since .
Lemma
7.5.8
scales impacting interval
Let or . Then for each and with , we have .
Proof
▶
By Lemma 7.4.7, we have that in both cases, . If with and , then . Since , it follows from the definition of that , which contradicts .
Lemma
7.5.9
global tree control 1
Let and . Then for and each and all bounded with bounded support, we have
and for all
Proof
▶
Note that 7.5.17 follows from 7.5.18, since for , by the triangle inequality,
By the triangle inequality, Lemma 7.4.1 and Lemma 7.5.5, we have for all
By Lemma 7.5.8, we have for all occurring in the sum. Further, for each , the sets for with are pairwise disjoint by 2.0.20 and 2.0.13, and contained in by 2.0.10 and the triangle inequality. Using also the doubling estimate 1.0.5, we obtain that the expression in the last display can be estimated by
Since , we have
Estimate 7.5.18, and therefore the lemma, follow.
Lemma
7.5.10
global tree control 2
We have for all and all bounded with bounded support
Let be the product on the right hand side of 7.5.8, and as defined in 7.5.7.
By 7.5.3 and Lemma 7.4.1, the function is supported in . By 7.5.3 and Lemma 7.5.9, we have for all :
We have by the triangle inequality
As is supported in , we can assume without loss of generality that . If , then 7.5.20 vanishes. If then we have by 7.5.4, Lemma 7.5.9 and Lemma 7.5.10
where denotes the product on the right hand side of 7.5.8.
By 7.5.3, Lemma 7.5.9 and Lemma 7.5.10, we have
By 7.5.3, and twice Lemma 7.5.9, we have
Using that and , the lemma follows.
7.5.3 The van der Corput estimate
Lemma
7.5.11
lower oscillation bound
Proof
▶
Since by Lemma 7.4.7, there exists at least one tile with . Thus , so . Thus there exists a cube with and , by 2.0.7 and 2.0.8. By definition of and the triangle inequality, there exists such that
Thus, by definition of :
By the doubling property 1.0.8, this is
which gives the lemma using .
Now we are ready to prove Lemma 7.4.5.
7.6 Proof of The Remaining Tiles Lemma
We define
note that this is different from the defined in the previous subsection.
Lemma
7.6.1
dyadic partition 2
Proof
▶
By Lemma 7.1.2, it remains only to show that each with is in . But if , then by 2.0.8 . Pick . Then . This contradicts the definition of .
Lemma 7.4.6 follows from the following key estimate.
Lemma
7.6.2
bound for tree projection
We prove this lemma below. First, we deduce Lemma 7.4.6.
By Lemma 7.2.1 and Lemma 7.4.1, we have
It follows from the definition of the projection operator and Jensen’s inequality that
Since cubes in are pairwise disjoint and by Lemma 7.6.1, a cube intersect if and only if . Thus
Combining this with Lemma 7.6.2, the definition 2.0.2 and proves the lemma.
We need two more auxiliary lemmas before we prove Lemma 7.6.2.
Lemma
7.6.3
thin scale impact
Proof
▶
Suppose that . Then, we have so
There exists a tile . By 2.0.32, it satisfies . Thus . It follows that . By 2.0.7 and 2.0.8, there exists a cube with and . By definition of , there exists a tile with
By the triangle inequality, the definition 2.0.1 and , we have
Since and , we have by 2.0.36
Hence, by 2.0.32, the triangle inequality and using that by 2.0.3
It follows that
Using 1.0.8, we obtain
Since this is bounded by
Thus
contradicting the definition of .
Lemma
7.6.4
square function count
For each and all , we have
Proof
▶
Since we have . Thus, if then
Furthermore, for each the balls with have bounded overlap: Consider the collection of all with and . By 2.0.10 and 2.0.8, the balls , are disjoint, and by the triangle inequality, they are contained in . By the doubling property 1.0.5, we have
for each . Thus
Dividing by the positive , we obtain that for each
Combining 7.6.1, 7.6.2 and the small boundary property 2.0.11, noting that , the lemma follows.
Expanding the definition of , we have
We split the innermost sum according to the scale of the tile , and then apply the triangle inequality and Minkowski’s inequality:
By Lemma 7.4.1, the integral in the last display is if . By Lemma 7.6.3, it follows with :
We have by Lemma 7.4.1 and 2.1.3
If , then we have by 2.0.10 that
Using the doubling property 1.0.5, it follows that
Thus, using also
Since for each the sets are disjoint, it follows that
By Lemma 7.4.7, we have for all . Thus we can estimate 7.6.3 by
which is by Cauchy-Schwarz at most
Using Lemma 7.6.4, we bound 7.6.4 by
and, since dyadic cubes in form a partition of by Lemma 7.6.1, by 2.0.2, and
By convexity of and since , we have for all
Using this for and using that and the definitions 2.0.1 and 2.0.2 of and
Using the definition 2.0.2 of and , the lemma follows.
7.7 Forests
In this subsection, we complete the proof of Proposition 2.0.4 from the results of the previous subsections.
Define an -row to be an -forest , i.e. satisfying conditions 2.0.32 - 2.0.37, such that in addition the sets are pairwise disjoint.
Lemma
7.7.1
forest row decomposition
Let be an -forest. Then there exists a decomposition
such that for all the pair is an -row.
Proof
▶
Define recursively to be a maximal disjoint set of tiles in
with inclusion maximal . Properties 2.0.32, -2.0.37 for follow immediately from the corresponding properties for , and the cubes are disjoint by definition. The collections are also disjoint by definition.
Now we show by induction on that each point is contained in at most cubes with . This implies that , which completes the proof of the Lemma. For each point is contained in at most cubes by 2.0.34. For larger , if is contained in any cube with , then it is contained in a maximal such cube. Thus it is contained in a cube in with . Thus the number with is zero, or is less than the number of with by at least one.
We pick a decomposition of the forest into -rows
as in Lemma 7.7.1.
Lemma
7.7.2
row bound
For each and each bounded with bounded support with , we have
and
Proof
▶
By Lemma 7.3.1 and the density assumption 2.0.35, we have for each and all bounded of bounded support that
and
Since for each the top cubes , are disjoint, we further have for all bounded of bounded support and by Lemma 7.4.1
Applying the estimate for the adjoint operator following from equation 7.7.4, we obtain
Again by disjointedness of the cubes , this is estimated by
Thus, 7.7.2 follows, since . The proof of 7.7.1 from 7.7.3 is the same up to replacing by .
Lemma
7.7.3
row correlation
For all and for all with , it holds that
Proof
▶
To save some space we will write for subsets
We have by Lemma 7.4.1 and the triangle inequality that
By Lemma 7.4.4, this is bounded by
We apply the Cauchy-Schwarz inequality in the form
to the outer two sums:
By pairwise disjointedness of the sets for and of the sets for , we have
Arguing similar for , we can estimate 7.7.5 to be
The lemma now follows from Lemma 7.4.3.
Define for
Lemma
7.7.4
disjoint row support
The sets , are pairwise disjoint.
Proof
▶
Suppose that and with and . Suppose without loss of generality that . Then . By 2.0.8 it follows that . By 2.0.36, it follows that
By the triangle inequality. Lemma 2.1.2 and 2.0.32 it follows that
Since by 2.0.3, it follows that , so by 2.0.15. Hence, by 2.0.14, . But if then . This is a contradiction, and the lemma follows.
Now we prove Proposition 2.0.4.
To save some space, we will write
By 7.4.1, we have for each
Hence, by Lemma 7.7.1,
We use Lemma 7.7.2 to estimate each term in the first sum, and Lemma 7.7.3 to bound each term in the second sum:
By Cauchy-Schwarz in the second two sums, this is at most
and by disjointedness of the sets , this is at most
Taking adjoints and square roots, it follows that for all
On the other hand, we have by disjointedness of the sets from Lemma 7.7.4
If then we obtain from Lemma 7.7.2 and taking square roots that
Proposition 2.0.4 follows by taking the product of the -th power of 7.7.6 and the -st power of 7.7.7. □