Manuscript En06-A@1 · En06-A.tex · lemma · e04c9892
Lemma: Stencil existence
Increasing stencils: the geometric escape · lines 995–1016 · proof included or linked
En06-A@1#lem:stencil
Such stencils exist, with at most generators.
Proof. Choose a symmetric -net of the sphere. For , a maximal separated set gives the stated count by packing disjoint spherical caps; for , the sphere has two points.
Round to an integer vector . The error is at most , so
These vectors are long and nonzero. For , normalization changes direction by at most . Together with the net error this gives a -net. Adjoin negatives and the unit generators.
Displayed formulas in this passage
unlabeled · line 1008
Nearby in this section
- section: Increasing stencils: the geometric escape
- definition: Definition: Admissible stencil
- section: Increasing stencils: the geometric escape
- remark: Remark: Notation and normalization
- lemma: Lemma: Polytope approximation
- theorem: Theorem: Uniform two-parameter shape theorem
- section: Increasing stencils: the geometric escape