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.

76 <strong>Convex</strong> Bodies<br />

Hence x ∈ conv ext D. Ifx ∈ int D, choose y, z ∈ bd D such that x ∈[y, z]. Bythe<br />

case just considered, y, z ∈ conv ext D <strong>and</strong> thus x ∈ conv ext D. This concludes the<br />

proof of (1).<br />

The second step is to show the following:<br />

(2) Let x ∈ ext C. Then C\{x} is convex.<br />

If (2) did not hold, there are points y, z ∈ C\{x} such that [y, z] �⊆ C\{x}. Since<br />

[y, z] ⊆C by the convexity of C, this can hold only if x ∈[y, z]. Since x �= y, z,<br />

the point x is not extreme, a contradiction. The proof of (2) is complete.<br />

Finally, (1) <strong>and</strong> (2) yield the theorem. ⊓⊔<br />

Remark. The following refinement of Theorem 5.5 is due to Straszewicz [973]:<br />

C = cl conv exp C, where exp C is the set of all exposed points of C. These are the<br />

points x ∈ C such that {x} =C ∩ H for a suitable support hyperplane of C at x.<br />

Clearly, each exposed point is extreme, but the converse does not hold generally. It<br />

is not difficult to see that the apex of a pointed closed convex cone C is an exposed<br />

<strong>and</strong> thus an extreme point of C.<br />

Maxima of <strong>Convex</strong> Functions<br />

A simple yet useful application of the above result is as follows:<br />

Theorem 5.6. Let C ∈ C <strong>and</strong> let f : C → R be a continuous convex function. Then<br />

f attains its maximum m at an extreme point of C.<br />

Proof. Let x ∈ C be such that f (x) = m. Theorem 5.5 <strong>and</strong> Lemma 3.1 show that<br />

x = λ1x1 +···+λnxn with suitable x1,...,xn ∈ ext C <strong>and</strong> λ1,...,λn > 0, where<br />

λ1 +···+λn = 1. Jensen’s inequality then yields the following:<br />

m = f (x) ≤ λ1 f (x1) +···+λn f (xn) ≤ (λ1 +···+λn)m = m.<br />

Thus equality holds throughout. Noting that λ1,...,λn > 0, it then follows that<br />

f (x1) =···= f (xn) = m. ⊓⊔<br />

5.3 Birkhoff’s Theorem on Doubly Stochastic Matrices<br />

Doubly stochastic d × d matrices have attracted a lot of interest, for example as the<br />

matrices of transition probabilities of discrete Markov chains or in the context of van<br />

der Waerden’s conjecture on permanents of doubly stochastic matrices.<br />

Using the notions of convex hull <strong>and</strong> extreme point, we give a precise description<br />

of the set of doubly stochastic d × d matrices due to Birkhoff.<br />

For more information on van der Waerden’s conjecture, see Egorychev [291].<br />

For general information on doubly stochastic matrices compare Minc [729,730] <strong>and</strong><br />

Seneta [926].

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

Saved successfully!

Ooh no, something went wrong!