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.

2 <strong>Convex</strong> Functions of Several Variables 27<br />

Theorem 2.8. Let C be open <strong>and</strong> f : C → R convex <strong>and</strong> differentiable on C. Then<br />

all partial derivatives of f are continuous, i.e. f is of class C 1 .<br />

Proof. It is sufficient to show the following:<br />

(12) Let x, x1, x2, ···∈C be such that x1, x2, ···→ x. Then<br />

un = grad f (xn) → grad f (x).<br />

Theorem 2.7 implies that<br />

(13) f (y) ≥ f (xn) + un · (y − xn) for y ∈ C <strong>and</strong> n = 1, 2,....<br />

By Theorem 2.2, f is Lipschitz in a suitable neighborhood N ⊆ C of x with Lipschitz<br />

constant L, say. By omitting finitely many xn <strong>and</strong> changing notation, if necessary,<br />

we may assume that xn ∈ N for n = 1, 2,....For each n, choose yn ∈ N such<br />

that yn − xn �= o <strong>and</strong> yn − xn has the same direction as un. These remarks, together<br />

with (13), imply that<br />

�un��yn − xn� =un · (yn − xn) ≤ f (yn) − f (xn) ≤ L�yn − xn�<br />

<strong>and</strong> thus �un� ≤L, i.e. the sequence (un) is bounded. For the proof of (12) it is then<br />

sufficient to show the following:<br />

(14) Let (unk ) be a convergent subsequence of (un) with limit v, say. Then v =<br />

grad f (x).<br />

Since unk → v, xnk → x, <strong>and</strong> f is continuous, (13) implies that f (y) ≥ f (x) + v ·<br />

(y − x) for each y ∈ C. Thus f is supported at x by the affine function a defined by<br />

a(y) = f (x) + v · (y − x) for y ∈ Ed . Since f is differentiable at x, Theorem 2.7<br />

implies that a is unique <strong>and</strong> v = grad f (x). ⊓⊔<br />

Heuristic Observation<br />

In Sect. 1.2 <strong>and</strong> in the present section we have encountered the phenomenon that a<br />

convex function which has a particular property such as differentiability, has it in a<br />

particularly pure form. This phenomenon occurs also in the context of the Venkov–<br />

Alex<strong>and</strong>rov–McMullen theorem 32.2, 32.3 which shows that a convex polytope<br />

which tiles by translation, is even a lattice tile. We think of these phenomena as<br />

special cases of the following heuristic proposition.<br />

Heuristic Principle. Consider a basic property which a convex function, a convex<br />

body or a convex polytope can have. Then, in many cases, a convex function, body<br />

or polytope which has this property, has an even stronger such property.<br />

2.2 Alex<strong>and</strong>rov’s Theorem on Second-Order Differentiability<br />

In the last section it was shown that a convex function is differentiable almost<br />

everywhere, <strong>and</strong> we remarked that the same holds with respect to Baire category<br />

<strong>and</strong> metric. A deep result of Alex<strong>and</strong>rov says that, in the sense of measure theory,

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

Saved successfully!

Ooh no, something went wrong!