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.

84 <strong>Convex</strong> Bodies<br />

similarly, D j is a subset of a translate of Ci, say. This is possible only if C1 = Ci.<br />

Hence C1 = D j − s j. Continuing in this way, we obtain m = n <strong>and</strong> {C1,...,Cm} =<br />

{D1 − s1,...,Dm − sm}. Hence<br />

D1 ⊕···⊕ Dm − (s1 +···+sm) = C1 ⊕···⊕Cm = D1 ⊕···⊕ Dm.<br />

This can hold only if s j = 0 for all j. Hence {C1,...,Cm} = {D1,...,Dm},<br />

concluding the proof of the uniqueness. ⊓⊔<br />

Hausdorff Metric <strong>and</strong> the Natural Topology on C<br />

The space C of convex bodies in E d is endowed with a natural topology. It can be introduced<br />

as the topology induced by the Hausdorff metric δ H on C, which is defined<br />

as follows:<br />

δ H (C, D) = max � max<br />

x∈C min �x − y�, max<br />

y∈D y∈D min<br />

x∈C �x − y�� for C, D ∈ C.<br />

The metric δ H was first defined by Hausdorff [481] in a more general context. A nonsymmetric<br />

version of it was considered earlier by Pompeiu [812] <strong>and</strong> Blaschke [124]<br />

was the first to put it to use in convex geometry in his selection theorem, see below.<br />

The Hausdorff metric can be defined in different ways.<br />

Proposition 6.3. Let C, D ∈ C. Then:<br />

(i) δ H (C, D) = inf � δ ≥ 0 : C ⊆ D + δB d , D ⊆ C + δB d�<br />

(ii) δ H (C, D) = max � |hC(u) − h D(u)| :u ∈ S d−1�<br />

(iii) δ H (C, D) = maximum distance which a point of one of the bodies C, D<br />

can have from the other body<br />

Proof. Left to the reader. ⊓⊔<br />

If we consider a topology on C or on a subspace of it, such as Cp, it is always assumed<br />

that it is the topology induced by δ H .<br />

The Blaschke Selection Theorem<br />

In many areas of mathematics there is need for results which guarantee that certain<br />

problems, in particular extremum problems, have solutions. Examples of such results<br />

are the Bolzano–Weierstrass theorem for sequences in R, the Arzelà–Ascoli theorem<br />

for uniformly bounded equicontinuous families of functions <strong>and</strong> the selection Theorem<br />

25.1 of Mahler for (point) lattices.<br />

In convex geometry, the basic pertinent result is Blaschke’s selection theorem<br />

[124] for convex bodies. It can be used to show that, for example, the isoperimetric<br />

problem for convex bodies has a solution. Here we give the following version of it,

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

Saved successfully!

Ooh no, something went wrong!