Proof of Estimate (1.9) of Theorem 1.5.
Let satisfy and . We will prove the estimate for the
harmonic radius . The same argument works in the Einstein case to control the regularity scale.
So let be fixed
with chosen to satisfy Theorem 8.3. Consider the set
|
|
|
(8.19) |
In view of the doubling condition implied by the Bishop-Gromov inequality, we have by a standard construction that
there exists a covering with
|
|
|
(8.20) |
but such that are disjoint. Such coverings, which we will term “efficient”,
will be constructed several
times below.
Note that
|
|
|
(8.21) |
and thus
|
|
|
(8.22) |
Hence, our goal is to control the number of balls in the covering. Denote by
this collection of points.
Now note the following: if is one of our ball centers and , then by Theorem 8.3
we have for every that . In particular, if
, this implies that
|
|
|
(8.23) |
Now let us inductively build a sequence of decreasing subsets
and associated radii with
. There are three key inductive properties that will be proved about these sets:
- (1)
There exists such that the cardinality of satisfies
|
|
|
(8.24) |
- (2)
For every we have
|
|
|
(8.25) |
- (3)
If and then .
Before constructing the sequence of sets, let us see that once the construction is complete, we will have
proved our desired estimate on . Indeed, let be the largest index such that .
By the third property we must have either or , at which point we get by a
covering argument that . By Lemma 8.5 and the second property
we have that , and thus by the first property we have
|
|
|
(8.26) |
which proves the result.
Now let with . Clearly, the inductive properties hold for .
Assume we have built with satisfying the inductive properties,
and let us build . First note that if or , then we let
. Our construction will otherwise give us a nonempty , so that
the third inductive property will automatically be satisfied. So let us denote .
Choose an efficient covering , where , so that
the balls in
are disjoint. Note that because , the usual doubling estimates imply that there are
at most balls in this covering. We choose the ball such that
has the largest cardinality of any ball from the covering. Then we define .
By that by our choice of ball, , we have
|
|
|
|
(8.27) |
so that satisfies the first inductive property. To find and prove the second inductive property,
let us define the following. For each if
|
|
|
(8.28) |
then let us set , and otherwise let be the largest integer such that
but . Note that
. Let
with the associated element which attains the maximum, and note by (8.23) that
|
|
|
(8.29) |
In particular, with then , and the second inductive property holds,
which completes the induction step of the construction, and hence, the proof.