Lemma 8.8.
For every , there exists
with the following properties. Let satisfy and .
Let and assume satisfies
with the corresponding group. Then if is such that
, there exists a subset
and a diffeomorphism , where , such that
if is the pullback metric, we have
|
|
|
(8.30) |
Proof.
We will fix later. For the moment let any be arbitrary with the
corresponding number from Theorem 8.3. If then there exists a diffeomorphism
|
|
|
(8.31) |
where and , such that
|
|
|
(8.32) |
In particular, if is fixed and is the corresponding number from
Theorem 8.3, then we can choose sufficiently small so that
|
|
|
(8.33) |
Thus, if is such that
|
|
|
(8.34) |
then for all we have .
By Theorem 8.3, there exists for each ,
a diffeomorphism
|
|
|
(8.35) |
where and , such that
|
|
|
(8.36) |
In particular this implies that is independent of
.
Next we focus on the inverse maps
|
|
|
(8.37) |
Observe that by (8.36), after possibly composing with a rotation of
we can assume for that
|
|
|
(8.38) |
Now let be sufficiently small, so that if , then
is isometric to the standard Euclidean ball .
Note in particular that if is a collection of points, then any convex combination is well defined.
For each let be a smooth cutoff function such that
|
|
|
and such that . If we set
then . In particular,
|
|
|
(8.39) |
sarisfies , and so, is a partition of unity, with .
Define the map
|
|
|
(8.40) |
given by
|
|
|
(8.41) |
(As previously noted, the convex combination is well defined since the all live in a
ball which is isometric to a Euclidean ball.) On each domain, , we have by (8.32) and
(8.38) that and are -close. Hence, is a diffeomorphism,
and a quick computation using (8.32) and (8.38) verifies the desired estimates:
|
|
|
(8.42) |
By choosing appropriately small, we complete the proof.
∎
Proof.
First note by Theorem 8.3 that if is fixed, then there exists such that if
and if , then
|
|
|
(8.43) |
By rescaling this inequality, we see that in the context of this lemma, the following holds. If
, and
|
|
|
(8.44) |
then we have
|
|
|
(8.45) |
In particular, for , we can apply Lemma 8.5 to see that there exists a scale
such that
|
|
|
(8.46) |
and hence
|
|
|
(8.47) |
However, if
|
|
|
(8.48) |
this implies , which completes the proof.
∎
Proof.
Let be chosen with to be chosen later. Note that by Lemma 8.5,
for each there exists such that .
Consider the covering of , and choose an efficient
subcovering ,
where and the balls in are disjoint. The usual doubling arguments imply
that .
By Theorem 8.3, if we are given , then we can choose such that
for each we have , while for each
we have .
Let be the group associated to , and for each let be
the largest integer such that . Let with
the corresponding point. Note that for sufficiently small, we have
, and in particular, for every
|
|
|
(8.50) |
Consider the collection of balls . Clearly, by construction, conditions (1) and (3) are satisfied.
If then since cover we have that for some that
, which implies , as claimed.
∎
Proof.
Let us remark first, that if , then by volume ratio monotonicity, we have for every that
|
|
|
(8.52) |
Let from Lemma 8.8 with sufficiently small to satisfy
Theorem 8.3 and Lemmas 8.8, 8.9, 8.10.
After rescaling, it is sufficient to consider a Riemannian manifold with ,
and for every .
Let us begin by efficiently covering by balls such that
the balls in are disjoint.
By the usual doubling argument, there are at most such balls. For each such ball, we
apply Lemma 8.10 in order to produce a collection of balls
such that , , , and
such that if then . Furthermore, if we denote
by ,
the group associated to , then if is the largest integer such that
, then for all
we have
|
|
|
(8.53) |
Define
|
|
|
(8.54) |
as the first body region. Then we can write
|
|
|
(8.55) |
where by using Theorem 8.3, we have that is
diffeomorphic to .
Now to prove the theorem, let us inductively build a decomposition of
|
|
|
(8.56) |
with the following properties:
- (1)
If then .
- (2)
Each neck is diffeomorphic to
for some .
- (3)
are diffeomorphic to . are either empty or diffeomorphic to .
- (4)
.
- (5)
If , then .
- (6)
We have with ,
and .
- (7)
If is the largest integer such that ,
then for every we have .
Before building the inductive decomposition, let us note that once we have it,
we will have finished the proof.
In fact, all we really need to see is that for some , there are no balls
in the decomposition.
To see this, observe that by the lower volume bound we have the upper order bound
.
By condition (5) above we have by iteration that for each that there is some
such that
|
|
|
(8.57) |
and in particular this immediately implies the upper bound
|
|
|
(8.58) |
To prove the inductive decomposition, we begin by noting
that (8.55) provides the basic
case. So let us assume that the
decomposition has been constructed for some ,
and let us build the decomposition for .
First, we use condition (7) and Lemma 8.8 to see that there
exists an open set
|
|
|
(8.59) |
and a diffeomorphism with .
By Lemma 8.9, there exists a radius
such that
|
|
|
(8.60) |
for every .
Pick some
efficient covering
of such that the balls in
disjoint. Now apply Lemma 8.10 to each
ball in order to construct
a collection of balls with .
Observe that since there are at most balls in the collection ,
and the application of Lemma 8.10
produces at most balls for each of these, we have at most such balls in total.
If we put
|
|
|
(8.61) |
we see that and the collection satisfy
the inductive conditions. Specifically,
what is left to check is condition (5). However, by construction, we have
|
|
|
(8.62) |
which for sufficiently small implies . In particular,
the decomposition
|
|
|
(8.63) |
satisfies the inductive hypothesis as well, which completes the proof.
Proof of Theorem 1.4.
Let satisfy , and .
Then using Theorem 8.11, we can write
|
|
|
(8.64) |
First we will analyze each body region . Indeed, by (1) and theorem 8.2,
it follows that there are at most -diffeomorphism types for each .
By (4), there
are at most such body regions, and by (2) and (3), there are
at most diffeomorphism
types that can arise by gluing them together, which proves the theorem.
∎