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.

206 <strong>Convex</strong> Bodies<br />

with P. Thus, it is the intersection of a closed convex set with P <strong>and</strong> therefore convex.<br />

By (i), det A < 1 for all A ∈ E \{I }. This, together with (2), yields the following:<br />

(4) E is convex, D ∩ E ={I } <strong>and</strong> E is separated from D by the unique support<br />

hyperplane H of D at I .<br />

The support cone K of E at I is the closed convex cone with apex I generated<br />

by E. Since E is the intersection of the closed halfspaces in (3) <strong>and</strong> P, <strong>and</strong> since<br />

these halfspaces vary continuously as u,v range over bd B d , the support cone K is<br />

the intersection of those halfspaces in (3) which contain the apex I of K on their<br />

boundaries, i.e. I · u ⊗ v = u · v = hC(v). Since u · v ≤ 1, hC(v) ≥ 1foru,v ∈<br />

bd B d , the equality I · u ⊗ v = hC(v) holds precisely in case where u = v <strong>and</strong><br />

v ∈ bd B d ∩ bd C. Thus K is the intersection of the halfspaces<br />

� A ∈ E 1 2 d(d+1) : A · u ⊗ u ≤ 1 � : u ∈ bd B d ∩ bd C = B d ∩ bd C.<br />

The normal cone N, ofE at I , is the polar cone of K − I <strong>and</strong> thus is generated by<br />

the exterior normals u ⊗ u, u ∈ B d ∩ bd C, of these halfspaces,<br />

(5) N = pos � u ⊗ u : u ∈ B d ∩ bd C � .<br />

The cone K has apex I <strong>and</strong>, by (4), is separated form D by the hyperplane H.<br />

The normal I of H points away from K <strong>and</strong> thus is contained in the normal cone N.<br />

Noting (5), Carathéodory’s theorem then implies that there are ui ∈ Bd ∩ bd C,<br />

λi > 0, i = 1,...,m, where m ≤ 1 2d(d + 1), such that<br />

I = �<br />

This, in turn, shows that<br />

i<br />

λi ui ⊗ ui.<br />

d = trace I = �<br />

λi trace ui ⊗ ui = �<br />

λi.<br />

i<br />

For the proof that m ≥ d, it is sufficient to show that lin{u1,...,um} =E d .Ifthis<br />

were not the case, we could choose a unit vector u orthogonal to u1,...,um to obtain<br />

the contradiction<br />

1 = u 2 = Iu · u = �<br />

i<br />

λi<br />

� (ui ⊗ ui) u � · u = �<br />

i<br />

λi<br />

i<br />

� �<br />

(ui · u) ui · u = 0.<br />

(ii)⇒(i) Let E be as above. E is convex <strong>and</strong> I is a boundary point of it by (ii).<br />

Thus we may define K, N as before. (ii) yields I ∈ N. The hyperplane H through I<br />

<strong>and</strong> orthogonal to I thus separates K <strong>and</strong> D <strong>and</strong> thus, a fortiori, D <strong>and</strong> E. Since D is<br />

strictly convex by (2), D ∩ E ={I }. This shows that det A < 1 for each A ∈ E \{I },<br />

or, in other words, B d is the unique ellipsoid in C with maximum volume. ⊓⊔<br />

Remark. For the proof of a more general implication (i)⇒(ii), see Giannopoulos,<br />

Perissinaki <strong>and</strong> Tsolomitis [376]. Proofs of John’s theorem (see Fig. 11.1) in the<br />

non-symmetric case <strong>and</strong> of the generalized version of Giannopoulos, Perissinaki <strong>and</strong><br />

Tsolomitis in the spirit of the above proof are outlined in <strong>Gruber</strong> <strong>and</strong> Schuster [452].

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

Saved successfully!

Ooh no, something went wrong!