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.

324 <strong>Convex</strong> Polytopes<br />

L � P + (n + 1)Q � = �<br />

i<br />

L(F ′<br />

i<br />

) − �<br />

= L(P + nQ) +<br />

= L(P + nQ) +<br />

i< j<br />

L(F ′<br />

i ∩ F′ j ) +···<br />

m�<br />

i=2<br />

L(F ′<br />

i<br />

�<br />

) − L � (Fi ∩ Fj) ′� +···<br />

i< j<br />

m�<br />

L � P(ui) + nQ(ui) + R(ui) ′�<br />

i=2<br />

− �<br />

L � P � {ui, u j } � + nQ � {ui, u j } � + R � {ui, u j } � ′�<br />

+··· .<br />

i< j<br />

This, combined with (9), (10) <strong>and</strong> the induction assumption, shows that L(P +<br />

(n + 1)Q) − L(P + nQ) is a polynomial in n ∈ N, concluding the proof of (6).<br />

Having proved (6), Lemma 19.2 shows that L(P +nQ) is a polynomial in n ∈ N.<br />

If K is a lattice cube such that P, Q ⊆ K , then P + nQ ⊆ (n + 1)K <strong>and</strong> thus<br />

L(P + nQ) ≤ L((n + 1)K ) = O(n d ). Hence the polynomial L(P + nQ) has degree<br />

≤ d. Thus (5) holds for Q ∈ P Z d with dim Q = l. The induction is thus complete<br />

<strong>and</strong> (5) holds generally.<br />

The theorem finally follows from (5) <strong>and</strong> Lemma 19.1. ⊓⊔<br />

19.4 The Betke–Kneser Theorem on Valuations<br />

Many of the functions φ on the space P Z d of convex lattice polytopes which have<br />

been studied are valuations with values in R or in some Abelian group A. This means<br />

that<br />

φ(P ∪ Q) + φ(P ∩ Q) = φ(P) + φ(Q)<br />

whenever P, Q, P ∪ Q, P ∩ Q ∈ P Z d , <strong>and</strong> φ(∅) = 0.<br />

Examples are the volume <strong>and</strong> the lattice point enumerators. Among such valuations<br />

many are integer unimodular invariant. By this we mean that<br />

φ(P) = φ(UP+ u) for P ∈ P Z d , U ∈ U, u ∈ Z d ,<br />

where U is the family of all integer unimodular d × d matrices. A central result in<br />

this context due to Betke [105] <strong>and</strong> Betke <strong>and</strong> Kneser [108] shows that the structure<br />

of the linear space of the real, integer unimodular invariant valuations on P Z d is surprisingly<br />

simple. It parallels Hadwiger’s functional theorem 7.9 for real, continuous<br />

<strong>and</strong> motion invariant valuations on the space C of convex bodies. The theorem of<br />

Betke <strong>and</strong> Kneser yields simple proofs of the results of Ehrhart [292, 293] on lattice<br />

point enumerators.<br />

In the following we state without proof an unpublished result of Stein <strong>and</strong> Betke<br />

on the inclusion–exclusion principle, give a proof of the Betke–Kneser theorem <strong>and</strong><br />

show how it implies the results of Ehrhart. We will make use of some algebraic tools.<br />

For more information, see the survey of McMullen [714] <strong>and</strong> the references in<br />

the introduction of Sect. 19, to which we add Kantor [564].

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

Saved successfully!

Ooh no, something went wrong!