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.

28 <strong>Convex</strong> Functions<br />

even more is true: a convex function is twice differentiable, except on a set of<br />

measure zero. In contrast, results of Zamfirescu [1037, 1038] imply that, from the<br />

Baire category viewpoint, a typical convex function is twice differentiable only on a<br />

small set.<br />

This section contains a proof of the theorem of Alex<strong>and</strong>rov [14] on second order<br />

differentiability of convex functions. It generalizes, in a non-trivial way, a result of<br />

Busemann <strong>and</strong> Feller [183] for d = 2 <strong>and</strong>, of course, Theorem 1.7 for d = 1.<br />

Besides the original proof of Alex<strong>and</strong>rov, we mention a proof of Zajíček [1036]<br />

<strong>and</strong> one in the book of Evans <strong>and</strong> Gariepy [314].<br />

For more information on differentiability properties of convex functions, respectively,<br />

smooth boundary points of convex bodies, see Schneider [904, 907, 908] <strong>and</strong><br />

<strong>Gruber</strong> [431].<br />

Second-Order Differentiability<br />

A function f : C → R is twice (or second-order) differentiable at a point x ∈ int C,<br />

if there are a vector u ∈ E d ,thegradient of f at x, <strong>and</strong> a real d × d matrix H, the<br />

Hessian matrix of f at x, such that<br />

f (y) = f (x) + u · (y − x) + 1<br />

2 (y − x)T H(y − x) + o(�y − x� 2 ) as y → x.<br />

Alex<strong>and</strong>rov’s Theorem<br />

Following Zajíček [1036], we prove Alex<strong>and</strong>rov’s differentiability theorem [14]:<br />

Theorem 2.9. Let C be open <strong>and</strong> f : C → R convex. Then f is twice differentiable<br />

almost everywhere on C.<br />

Because the required tools are cited explicitly <strong>and</strong> the necessary definitions <strong>and</strong><br />

explanations are incorporated into the proof, the latter looks longer than it actually<br />

is. A source for the tools is Mattila [696].<br />

Proof. First, several tools are collected. The extension theorem of McShane shows<br />

that<br />

(1) A Lipschitz mapping which maps a set D ⊆ E d into E d can be extended to<br />

a Lipschitz mapping of E d into E d with the same Lipschitz constant.<br />

By Rademacher’s differentiability theorem,<br />

(2) A Lipschitz mapping which maps C into E d is almost everywhere differentiable<br />

on C.<br />

Call a mapping K : C → E d differentiable (in the sense of Stolz or Fréchet) at a<br />

point x ∈ C if there is a real d × d matrix A, thederivative of K at x, such that<br />

K (y) = K (x) + A(y − x) + o(�y − x�) as y → x, y ∈ C.<br />

The next result is a version of Sard’s theorem.

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

Saved successfully!

Ooh no, something went wrong!