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.

18 Theorems of Alex<strong>and</strong>rov, Minkowski <strong>and</strong> Lindelöf 309<br />

(1) Let P, Q ∈ Pp have the same set of exterior normal vectors of their facets<br />

<strong>and</strong> such that Q is circumscribed to B d . Then<br />

S(P) d S(Q)d<br />

≥<br />

V (P) d−1 V (Q)<br />

d−1 ,<br />

where equality holds if <strong>and</strong> only if P is homothetic to Q (<strong>and</strong> thus also<br />

circumscribed to a ball).<br />

Since Q is circumscribed to the unit ball B d , dissecting Q into pyramids, all with<br />

apex o, the formula for the volume of a pyramid then shows that<br />

(2) S(Q) = dV(Q).<br />

Minkowski’s theorem on mixed volumes 6.5 yields<br />

(3) V � (1 − λ)P + λQ � is a polynomial in λ for 0 ≤ λ ≤ 1.<br />

Q is circumscribed to B d . Choose ϱ>0 such that Q ⊆ ϱB d .For0≤ λ ≤ 1the<br />

polytope (1−λ)P +λQ can thus be dissected into (1−λ)P, right prisms of height λ<br />

with the facets of (1 − λ)P as bases, <strong>and</strong> a set in the λϱ-neighbourhood of the union<br />

of the (d − 2)-faces of (1 − λ)P. Thus<br />

(4) V � (1 − λ)P + λQ � = (1 − λ) d V (P) + (1 − λ) d−1 λS(P) + O(λ 2 )<br />

as λ →+0.<br />

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

(5) the function f (λ) = V � (1 − λ)P + λQ � 1 d − (1 − λ)V (P) 1 d − λV (Q) 1 d<br />

for 0 ≤ λ ≤ 1 with f (0) = f (1) = 0 is strictly concave, unless P is<br />

homothetic to Q, in which case it is identically 0.<br />

By (3) f is differentiable. Thus (5) shows that<br />

(6) f ′ (0) ≥ 0 where equality holds if <strong>and</strong> only if P is homothetic to Q.<br />

Using the definition of f in (5), (4), <strong>and</strong> (2), a calculation which is almost identical<br />

to that in the proof of the isoperimetric theorem 8.7, yields (1). ⊓⊔<br />

Corollary 18.2. Among all proper convex polytopes in E d with a given number of<br />

facets, there are polytopes with minimum isoperimetric quotient <strong>and</strong> these polytopes<br />

are circumscribed to a ball.<br />

In the proof, the first step is to show that there is a polytope with minimum isoperimetric<br />

quotient. By Lindelöf’s theorem this polytope then is circumscribed to a ball.<br />

Remark. Diskant [274] extended Lindelöf’s theorem to the case where ordinary surface<br />

area is replaced by generalized surface area, see Sect. 8.3. The above corollary<br />

<strong>and</strong> its generalization by Diskant are used by <strong>Gruber</strong> [439,443] to obtain information<br />

about the geometric form of convex polytopes with minimum isoperimetric quotient.

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

Saved successfully!

Ooh no, something went wrong!