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.

48 <strong>Convex</strong> Bodies<br />

Suppose not. Then, by Radon’s theorem in aff {x1,...,xn}, there are disjoint<br />

subsets of {x1,...,xn}, the convex hulls of which have non-empty intersection. By<br />

re-numbering, if necessary, we thus may assume that<br />

ν1x1 +···+νmxm = νm+1xm+1 +···+νnxn, or ν1x1 +···−νnxn = o,<br />

where ν1,...,νn ≥ 0,ν1 +···+νm = νm+1 +···+νn = 1,<br />

<strong>and</strong> thus ν1 +···−νn = 0.<br />

Thus, up to notation, we have the same situation as in the proof of the Theorem 3.1<br />

of Carathéodory which easily leads to a contradiction.<br />

(ii)⇒(iii) Since the intersection of a family of compact sets is non-empty, if each<br />

finite subfamily has non-empty intersection, it is sufficient to prove (iii) for finite<br />

families F ={C1,...,Cn}, say, where n ≥ d + 2.<br />

Assume that (iii) does not hold for F. Consider the function δ : E d → R<br />

defined by<br />

δ(x) = max{δ(x, Ci) : i = 1,...,n} for x ∈ E d ,<br />

where δ(x, Ci) = min{�x − y� :y ∈ Ci}.<br />

Let δ assume its minimum at p ∈ E d , say. Since (iii) does not hold for F, δ(p) >0.<br />

By re-numbering, if necessary, we may suppose that<br />

Choose qi ∈ Ci such that<br />

Then<br />

δ(p) = δ(p, Ci) precisely for i = 1,...,m (≤ n).<br />

δ(p) = δ(p, Ci) =�p − qi� for i = 1,...,m.<br />

p ∈ conv{q1,...,qm},<br />

since otherwise we could decrease δ(p, Ci) <strong>and</strong> thus δ(p) by moving p closer to<br />

conv{q1,...,qm}. By Carathéodory’s theorem there is a subset of {q1,...,qm} of<br />

k ≤ d + 1 points, such that p is in the convex hull of this subset. By re-numbering,<br />

if necessary, we may assume that this subset is the set {q1,...,qk}. Then<br />

Clearly,<br />

p = λ1q1 +···+λkqk, where λ1,...,λk ≥ 0, λ1 +···+λk = 1.<br />

Ci ⊆ H −<br />

i = � x : (x − p) · (qi − p) ≥�qi − p� 2 (> 0) � for i = 1,...,k.<br />

Since k ≤ d + 1, we may choose a point y ∈ C1 ∩···∩Ck ⊆ H −<br />

1 ∩···∩H − k . Then<br />

0 = (y − p) · (p − p) = (y − p) · (λ1q1 +···+λkqk − p)<br />

= (y − p) · � λ1(q1 − p) +···+λk(qk − p) �<br />

= λ1(y − p) · (q1 − p) +···+λk(y − p) · (qk − p) >0,<br />

which is the desired contradiction. ⊓⊔

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

Saved successfully!

Ooh no, something went wrong!