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.

4 Support <strong>and</strong> Separation 55<br />

Remark. The proofs of Theorem 2.3 on affine support of convex functions <strong>and</strong> of<br />

the corresponding Theorem 4.1 on support hyperplanes of closed convex sets are<br />

essentially different. The former proof is based on the linearity structure of E d <strong>and</strong><br />

can be extended easily to infinite dimensions by transfinite induction. The latter proof<br />

rests on the Euclidean structure of E d <strong>and</strong> on compactness <strong>and</strong> its extension to infinite<br />

dimensions is not of much interest.<br />

Results on convex functions correspond, in many cases, to results on convex sets<br />

or convex bodies <strong>and</strong> vice versa. Quite often it is possible to transform a result on<br />

convex functions into a result on convex sets or convex bodies. Examples deal with<br />

support, separation, <strong>and</strong> differentiability properties.<br />

Characterization of <strong>Convex</strong> Sets by Support Properties<br />

The definition of a support hyperplane of C at a point x ∈ bd C still makes sense<br />

if the assumption that C is convex is omitted. Thus we may speak of a support<br />

hyperplane ofaclosedsetinE d at a boundary point. The characterizations of convex<br />

functions by support properties in Theorems 1.3 <strong>and</strong> 2.4 correspond to the following<br />

result.<br />

Theorem 4.2. Let C ⊆ E d be closed <strong>and</strong> let int C �= ∅. Then the following are<br />

equivalent:<br />

(i) C is convex.<br />

(ii) C has a support hyperplane HC(x) at each point x ∈ bd C.<br />

Proof. (i)⇒(ii) This follows from Theorem 4.1.<br />

(ii)⇒(i) The intersection of any family of convex sets is also convex. Thus it<br />

suffices to prove that<br />

(3) C = �<br />

H − C (x).<br />

x∈bd C<br />

Since C is contained in the set on the right-h<strong>and</strong> side, it remains to show the<br />

following: Let z ∈ Ed \C. Then z �∈ H − C (x) for a suitable x ∈ bd C. To see this,<br />

let y ∈ int C <strong>and</strong> choose x ∈ [y, z] ∩bd C. By (ii) there is a support halfspace<br />

H − C (x) of C at x. Then y ∈ int C ⊆ C ⊆ H − C (x) <strong>and</strong> therefore z �∈ H − C (x). ⊓⊔<br />

Corollary 4.1. Let C ⊆ Ed be closed <strong>and</strong> convex. Then<br />

C = �<br />

How to Specify a <strong>Convex</strong> Body<br />

x∈bd C<br />

H − C (x).<br />

While the definitions of convex sets <strong>and</strong> convex bodies are extremely simple, it is a<br />

highly non-trivial task to specify an arbitrary convex body so that one may obtain,<br />

from this specification, important information about the body, for example analytic

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

Saved successfully!

Ooh no, something went wrong!