Proof.
Take a large collection of points on , such that for any point on , the number of points in the collection within -distance to is at least one but no more than . Then take cutoff functions on supported in such that on . These allow us to decompose into a large number of localised contributions:
|
|
|
using the fact that the -norm is not sensitive to inside .
For each term we apply Lemma 4.35 to produce an approximate local solution on , with bounds prescribed in Lemma 4.35. Here is uniformly equivalent to . The candidate solution is
|
|
|
By construction is supported in .
We now bound , focusing on the absolute estimate. Summing up the contributions
|
|
|
we estimate at a point :
|
|
|
The higher order version is
so for .
Next we estimate the error . The error has two sources: the cutoff error supported on from Lemma 4.35
|
|
|
and the metric deviation error , which is controlled because by Proposition 4.19 the local diffeomorphism is a -approximate isometry between and , and has weighted control. We focus on the absolute estimate:
|
|
|
so that
|
|
|
Using
|
|
|
we sum up all contributions to deduce for ,
|
|
|
The Hölder version is
as required.
∎