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.

46 <strong>Convex</strong> Bodies<br />

C ∩ L ⊥ clearly is a closed convex cone with apex o. We show that it is pointed:<br />

(C ∩ L ⊥ ) ∩ � − (C ∩ L ⊥ ) � = (C ∩ L ⊥ ) ∩ (−C) ∩ (−L ⊥ )<br />

= � C ∩ (−C) � ∩ (L ⊥ ∩ L ⊥ ) = L ∩ L ⊥ ={o}. ⊓⊔<br />

<strong>Convex</strong> Cone Generated by a Set, Positive Hull<br />

If {y1,...,yn} is a finite set in E d , then by the cone generated by it, cone{y1,...,yn},<br />

or by its positive hull pos{y1,...,yn}, we mean the set<br />

� λ1y1 +···+λn yn : λi ≥ 0 � .<br />

It is easy to see that this is a closed convex cone with apex o, in fact, the smallest<br />

such cone containing the set {y1,...,yn}. An open subset C of E d is an open convex<br />

cone with apex o if<br />

λx + µy ∈ C for all x, y ∈ C, λ,µ>0.<br />

Then C is convex. Note that o �∈ C, unless C = E d .<br />

3.2 An Excursion into Combinatorial <strong>Geometry</strong>: The Theorems<br />

of Carathéodory, Helly <strong>and</strong> Radon<br />

The following result of Kirchberger [585] of 1903 seems to be the first result of<br />

what is now called combinatorial geometry. It still conveys well the spirit of the<br />

latter. Consider a flock of black <strong>and</strong> white sheep. If among any four sheep the black<br />

ones can be separated from the white ones by a straight fence, then the black <strong>and</strong><br />

the white sheep of the whole flock can thus be separated. The later theorems of<br />

Carathéodory [190], Radon [821] <strong>and</strong>, in particular, of Helly [490] attracted much<br />

more attention <strong>and</strong> led to a multitude of pertinent results, especially in the 1960s <strong>and</strong><br />

1970s. Some of these results were proved for spaces more general than E d .<br />

We prove below the theorems of Radon, Carathéodory, <strong>and</strong> Helly. While we have<br />

proved Carathéodory’s theorem in a similar way in Sect. 3.1, the present proof makes<br />

the relation between the theorems of Radon <strong>and</strong> Carathéodory more clear. These<br />

results, as well as certain other properties of convex sets, led to various attempts<br />

to extend convexity or, rather, combinatorial geometry to a more general context.<br />

The background of Helly’s theorem is singular homology theory, see the interesting<br />

article of Debrunner [249].<br />

For more information we refer to the surveys of Danzer, Grünbaum <strong>and</strong> Klee<br />

[241] <strong>and</strong> Eckhoff [283, 284] <strong>and</strong> to the monograph of Boltyanskiĭ, Martini <strong>and</strong><br />

Soltan [145]. From the voluminous literature we cite the article of Tverberg [1003]<br />

on Radon’s theorem. Other aspects of combinatorial geometry were treated by<br />

Goodman, Pollack <strong>and</strong> Wenger [386] <strong>and</strong> Matouˇsek [695]. Axiomatic <strong>and</strong> generalized<br />

convexity is dealt with by Van de Vel [1005] <strong>and</strong> Coppel [222].

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

Saved successfully!

Ooh no, something went wrong!