14.02.2013 Views

Gruber P. Convex and Discrete Geometry

Gruber P. Convex and Discrete Geometry

Gruber P. Convex and Discrete Geometry

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

488 <strong>Geometry</strong> of Numbers<br />

Arguments similar to those which led to (1) yield the inequalities<br />

(13) const<br />

≤ I (J,α,n) ≤ const<br />

.<br />

n α d<br />

n α d<br />

Choose minimizing configurations Sn ={sn1,...,snn} ⊆J for I (J,α,n) <strong>and</strong> consider<br />

the corresponding Dirichlet–Voronoĭ cells in J,<br />

Dni = � x ∈ J :�x − sni� ≤�x − snj� for j = 1,...,n � , i = 1,...,n.<br />

Since J is a body <strong>and</strong> I (J,α,n) → 0asn →∞by (13), a simple indirect compactness<br />

argument implies that<br />

(14) max{diam<br />

Dni} →0asn →∞.<br />

i<br />

Next, we introduce some necessary notation. If C is a cube, then<br />

n(C) = #{i : C ∩ Dni �= ∅}, Sn(C) ={sni : C ∩ Dni �= ∅}.<br />

Now n(C) will be estimated below <strong>and</strong> above:<br />

(15) Let C ⊆ J be a cube. Then const n ≤ n(C) ≤ n.<br />

Clearly,<br />

I � C,α,n(C) � �<br />

≤<br />

C�<br />

=<br />

C<br />

min<br />

s∈Sn(C) {�x − s�α } dx<br />

min{�x<br />

− s�<br />

s∈Sn<br />

α } dx ≤ I (J,α,n) ≤ const<br />

n α d<br />

by (13). Hence I � C,α,n(C) � → 0 <strong>and</strong> thus n(C) →∞as n →∞. This, in turn,<br />

shows by (11) that<br />

I � C,α,n(C) � ∼ δ<br />

α+d<br />

V (C) d<br />

n(C) α d<br />

as n →∞.<br />

Hence n(C) ≥ const n, concluding the proof of (15).<br />

For the proof of (12) let λ>1. Since J is compact <strong>and</strong> Jordan measurable, the<br />

following holds:<br />

(16) There are pairwise disjoint cubes C1,...,Ck ⊆ J such that:<br />

�<br />

i<br />

V (Ci) ≥ 1<br />

V (J).<br />

λ<br />

Since the cubes C1,...,Ck are pairwise disjoint, it follows from (14) that the<br />

sets Sn(Ci), i = 1,...,k, are also pairwise disjoint <strong>and</strong> thus<br />

(17) �<br />

n(Ci) ≤ n for sufficiently large n.<br />

i

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!