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.

314 <strong>Convex</strong> Polytopes<br />

To see this, note that<br />

L(n int S) = L(nS) − �<br />

L(nR) + �<br />

L(nQ) −+··· ,<br />

R<br />

where R ranges over all facets of S, Q over all (d − 2)-dimensional faces, etc. Now<br />

take into account (6) <strong>and</strong> (9) to see that L(n int S) = qS(n) where qS is a polynomial<br />

of degree d with leading coefficient V (S) <strong>and</strong> constant term<br />

� � � �<br />

d + 1 d + 1<br />

1 − + −+···+(−1)<br />

1 2<br />

d<br />

� �<br />

d + 1<br />

= (−1)<br />

d<br />

d ,<br />

concluding the proof of (10).<br />

Analogous to the derivation of (9) from (6), the following proposition is a consequence<br />

of (10).<br />

(11) Let R ∈ P Z d be a simplex with c = dim R < d. Then L(n relint R) =<br />

qR(n) for n ∈ N, where qR is a polynomial of degree < d with constant<br />

term (−1) c .<br />

In the fourth, <strong>and</strong> last, step of the proof of (i), we extend (6) from simplices to<br />

convex polytopes.<br />

(12) Let P ∈ P Z d p . Then L(nP) = pP(n) for n ∈ N, where pP is a polynomial<br />

of degree d with leading coefficient V (P) <strong>and</strong> constant term 1.<br />

By Theorem 14.9, the proper lattice polytope P is the union of all simplices of a<br />

suitable simplicial complex where all simplices are lattice simplices. Hence P is the<br />

disjoint union of the relative interiors of these simplices. See, e.g. Alex<strong>and</strong>roff <strong>and</strong><br />

Hopf [9], p. 128. Propositions (10) <strong>and</strong> (11) thus yield (12), except for the statement<br />

that the constant term is 1. To see this note that the Euler characteristic of a simplicial<br />

complex is the number of its vertices minus the number of its edges plus the number<br />

of its 2-dimensional simplices, etc. This together with (10) <strong>and</strong> (11) shows that the<br />

constant term in pP is just the Euler characteristic of the simplicial complex; but<br />

this equals the Euler characteristic of P <strong>and</strong> is thus 1. The proof of (12) <strong>and</strong> thus of<br />

Proposition (i) is complete.<br />

(ii) Since the proof of (ii) is similar to that of (i), some details are omitted. The<br />

first step is to show the following analogue of (1).<br />

(13) Let S ∈ P Z d p be a simplex. Then<br />

∞�<br />

n=0<br />

L o (nS)t n �<br />

= r(t) 1 +<br />

� d + 1<br />

1<br />

�<br />

t +<br />

Q<br />

� d + 2<br />

2<br />

�<br />

t 2 �<br />

+··· for |t| < 1,<br />

where r is a polynomial with integer coefficients of degree ≤ d + 1.<br />

Instead of the fundamental parallelotope F in the proof of (1), here the fundamental<br />

parallelotope G = � x = α1q1 +···+αd+1qd+1 : 0

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

Saved successfully!

Ooh no, something went wrong!