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

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

hold for all sufficiently large n. Hence<br />

Cn ⊆ C + ε<br />

�<br />

C = 1 +<br />

ϱ ε<br />

�<br />

C,<br />

�<br />

ϱ<br />

1 − ε<br />

�<br />

C +<br />

ϱ<br />

ε<br />

ϱ C = C ⊆ Cn + ε<br />

ϱ C.<br />

7 Valuations 123<br />

Using support functions <strong>and</strong> arguing as in the proof of the cancellation law for convex<br />

bodies (Theorem 6.1), we obtain the inclusions<br />

�<br />

1 − ε<br />

� �<br />

C ⊆ Cn ⊆ 1 +<br />

ϱ<br />

ε<br />

�<br />

C<br />

ϱ<br />

for all sufficiently large n. This, together with (8), yields the following:<br />

�<br />

1 − ε<br />

�d �<br />

V (C) ≤ V (Cn) ≤ 1 +<br />

ϱ<br />

ε<br />

�d V (C).<br />

ϱ<br />

For given ε>0 <strong>and</strong> all sufficiently large n,<br />

which, in turn, implies (10) for V (C) >0. Assume second, that V (C) = 0. Since<br />

C1, C2, ···→C, for any ε>0<br />

Cn ⊆ C + εB d<br />

for all sufficiently large n. Thus, by Steiner’s theorem on the volume of parallel<br />

bodies 6.6,<br />

V (Cn) ≤ V (C + εB d ) = V (C) + O(ε) = O(ε)<br />

for given ε>0 <strong>and</strong> all sufficiently large n.<br />

This proves (10) for V (C) = 0. The proof of (10), <strong>and</strong> thus of (9), is complete.<br />

It remains to show that<br />

(11) V is rigid motion invariant.<br />

Taking into account the definition of V , it is sufficient to show that any two congruent<br />

boxes have the same volume. To see this, note that, by Lemma 7.1, it is sufficient to<br />

prove the following, where, by a dissection of a proper convex polytope, we mean a<br />

representation of it as a union of finitely many proper convex polytopes with pairwise<br />

disjoint interiors:<br />

(12) Let P, T be two congruent rectangles in E 2 . Then P can be dissected into<br />

finitely many convex polygons such that suitable translations of these polygons<br />

form a dissection of T .<br />

In other words, P <strong>and</strong> T are equidissectable with respect to (the group of) translations<br />

(Fig. 7.1). Since equidissectability is transitive, as can be shown easily, the following<br />

argument leads to (12): first, P is equidissectable to a parallelogram Q, one pair of<br />

edges of which is parallel to a pair of edges of T . Q is equidissectable to a rectangle,<br />

the edges of which are parallel to those of T . R is equidissectable to a rectangle S,<br />

one side of which has length at least the length l of the corresponding parallel edges<br />

of T <strong>and</strong> at most twice this length. S <strong>and</strong> T are equidissectable. We omit the details.<br />

⊓⊔

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

Saved successfully!

Ooh no, something went wrong!