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.

34 <strong>Convex</strong> Functions<br />

2.4 A Stone–Weierstrass Type Theorem<br />

The problem, whether interesting special families of functions are dense in the class<br />

of real or complex continuous functions on a given space, has drawn attention ever<br />

since Weierstrass gave his well known approximation theorem.<br />

In this section, we present a Stone-Weierstrass type result which shows that<br />

differences of convex functions are dense in the space of continuous functions.<br />

A Stone–Weierstrass Type Theorem for <strong>Convex</strong> Functions<br />

For the following result, see Alfsen [21].<br />

Theorem 2.11. Let C be compact <strong>and</strong> convex. Then the set D of all differences<br />

of continuous convex functions on C is dense in the space of all real continuous<br />

functions on C, endowed with the maximum norm.<br />

We present two proofs. The first one was proposed by Schneider [910] <strong>and</strong> makes<br />

use of the Weierstrass approximation theorem for several variables <strong>and</strong> the convexity<br />

criterion of Brunn <strong>and</strong> Hadamard. The second proof is based on a theorem of Stone<br />

of Stone–Weierstrass type.<br />

Proof (using the Weierstrass approximation theorem). We need the following version<br />

of the approximation theorem:<br />

The family of all real polynomials in d variables on the cube K ={x :<br />

|xi| ≤1} is dense in the space of all real continuous functions on K .<br />

For the proof of the theorem we may assume that C ⊆ K . Since each continuous real<br />

function on the compact set C can be continuously extended to K ,itfollowsthat<br />

The family of all (restrictions of) real polynomials on C is dense in the<br />

space of all real continuous functions on C.<br />

This yields the theorem if we can show that<br />

Each polynomial p on C can be represented as the difference of two convex<br />

polynomials on C.<br />

To see this, note that for sufficiently large λ>0 the polynomials p(x)+λ(x 2 1 +···+<br />

x2 d ) <strong>and</strong> λ(x2 1 ···+x2 d ) both are convex on C by the convexity criterion of Brunn <strong>and</strong><br />

Hadamard. ⊓⊔<br />

Proof (based on a theorem of Stone). The required result of Stone is as follows:<br />

(1) Let S be a compact space <strong>and</strong> F a family of real continuous functions on S<br />

having the following properties:<br />

(i) F is closed under multiplication by real numbers, addition, <strong>and</strong><br />

multiplication.

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

Saved successfully!

Ooh no, something went wrong!