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.

6 Mixed Volumes <strong>and</strong> Quermassintegrals 101<br />

By (12) the sum of the first two of these volumes equals the sum of the last two.<br />

Equating the coefficients of λλ2 ···λd on both sides of this equality then yields the<br />

theorem. ⊓⊔<br />

Proof (using the continuity of mixed volumes <strong>and</strong> Lemma 6.5). Since the mixed<br />

volumes are continuous in their entries by Theorem 6.8, it is sufficient to prove the<br />

theorem in case where D2,...,Dd are polytopes.<br />

We now show that, for the support functions of C ∪ D <strong>and</strong> C ∩ D, wehavethe<br />

equalities,<br />

hC∩D = min{hC, h D} <strong>and</strong> hC∪D = max{hC, h D}.<br />

Let u ∈ E d \{o}. We may assume that hC(u) ≤ h D(u). Choose x ∈ C, y ∈ D such<br />

that x · u = hC(u) <strong>and</strong> y · u = h D(u). The line segment from x to y is contained in<br />

C ∪ D since C ∪ D is convex. Let z be the last point on this line segment contained<br />

in C. Then z ∈ C ∩ D. Since<br />

we have<br />

<strong>and</strong> thus<br />

C ∩ D ⊆ C ⊆{v : v · u ≤ x · u} ⊆{v : v · u ≤ z · u},<br />

hC∩D(u) ≤ hC(u) ≤ z · u ≤ hC∩D(u)<br />

hC∩D(u) = hC(u) = min{hC(u), h D(u)}.<br />

This proves the first equality. The proof of the second equality is even simpler <strong>and</strong><br />

thus omitted.<br />

These equalities yield the identity,<br />

hC∪D + hC∩D = hC + h D.<br />

Now use Lemma 6.5. ⊓⊔<br />

Minkowski’s Inequalities<br />

Mixed volumes satisfy several inequalities, in particular the following first <strong>and</strong> second<br />

inequality of Minkowski [739].<br />

Theorem 6.11. Let C, D ∈ C. Then:<br />

(i) V (C, D,...,D) d ≥ V (C)V (D) d−1 , where for proper convex bodies C, D<br />

equality holds if <strong>and</strong> only if C <strong>and</strong> D are (positive) homothetic.<br />

(ii) V (C, D,...,D) 2 ≥ V (C, C, D,...,D)V (D).<br />

The equality case in the second inequality is more complicated to formulate <strong>and</strong> to<br />

prove. It was settled by Bol [139], thereby confirming a conjecture of Minkowski.<br />

Proof. The Brunn–Minkowski theorem 8.3 shows that<br />

(13) The function V � (1 − λ)C + λD � 1 d , 0 ≤ λ ≤ 1, is concave in λ. IfC<br />

<strong>and</strong> D are proper, then this expression is linear if <strong>and</strong> only if C <strong>and</strong> D are<br />

homothetic.

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

Saved successfully!

Ooh no, something went wrong!