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.

10 <strong>Convex</strong> Functions<br />

z = f (x) + f ′ − (x)(y − x)<br />

x<br />

z = f (y)<br />

Fig. 1.5. Support <strong>and</strong> left <strong>and</strong> right side differentiability<br />

z = f (x) + f ′ + (x)(x − y)<br />

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

It follows from (7) <strong>and</strong> (8) that a function of the form z = f (x) + u(y − x) for<br />

y ∈ R is an affine support of f at x if <strong>and</strong> only if f ′ − (x) ≤ u ≤ f ′ + (x). ⊓⊔<br />

As an immediate consequence of this proposition we obtain the following result.<br />

The corresponding d-dimensional result is Theorem 2.7.<br />

Theorem 1.6. Let f : I → R be convex <strong>and</strong> x ∈ int I . Then the following statements<br />

are equivalent:<br />

(i) f is differentiable at x.<br />

(ii) f has unique affine support at x, say a : R → R, where a(y) = f (x) + u(y − x)<br />

for y ∈ R <strong>and</strong> u = f ′ (x).<br />

Second-Order Differentiability<br />

We need the following weak notion of twice differentiability: a function f : I → R<br />

is twice (or is second-order) differentiable almost everywhere on I if there are sets<br />

M, N ⊆ I of (Lebesgue) measure 0 such that<br />

f ′ (x) = lim<br />

y→x<br />

<strong>and</strong> lim<br />

y→x<br />

y∈I \M<br />

f (y) − f (x)<br />

exists for x ∈ I \M,<br />

y − x<br />

f ′ (y) − f ′ (x)<br />

exists for x ∈ I \(M ∪ N).<br />

y − x<br />

The latter limit is denoted by f ′′ (x). (In Sect. 2.2, we will consider a slightly different<br />

notion of twice differentiability almost everywhere for functions of several<br />

variables.)<br />

For the convenience of the reader, we define the Bachmann–L<strong>and</strong>au symbols o(·)<br />

<strong>and</strong> O(·):letg, h : I → R <strong>and</strong> x ∈ I . Then we say that<br />

g(y) = o � h(y) � as y → x, y ∈ I, if |g(y)|<br />

→ 0<br />

|h(y)|<br />

as y → x, y ∈ I, y �= x,<br />

g(y) = O � h(y) � as y → x, y ∈ I if |g(y)| ≤const |h(y)|<br />

for y ∈ I, close to x,<br />

where const is a suitable positive constant.

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

Saved successfully!

Ooh no, something went wrong!