Continuity of convex functions in normed spaces In this chapter, we consider continuity properties of real-valued convex functions dened on open

convex sets in normed spaces. Recall that every innitedimensional normed space contains a discontinuous linear functional. Thus, in innite-dimensional spaces, there exist discontinuous convex functions. One of the corollaries of the results of this chapter is that, in nite-dimensional spaces, this cannot happen. Recall that B (x, r) and B 0 (x, r) denote the open and closed ball of radius r, centered at x. A function f : E R is L-Lipschitz if |f (x) f (y )| L x y whenever x, y E . Proposition 0.1. Let X be a normed space, x0 X , r > 0, (0, r), m, M R. Let f : B 0 (x0 , r) R be a convex function. (a) If f (x) m on B 0 (x0 , r), then |f (x)| |m| + 2|f (x0 )| on B 0 (x0 , r). 0 (b) If |f (x)| M on B 0 (x0 , r), then f is 2M -Lipschitz on B (x0 , r ). Proof. By translation, we can suppose that x0 = 0. Denote B = B 0 (0, r) and C = B 0 (0, r ). 1 1 1 (a) Since 0 = 2 x+ 1 2 (x) (x B ), we have f (0) 2 f (x) + 2 f (x). Consequently, f (x) 2f (0) f (x) 2f (0) m, and hence |f (x)| max{m, m 2f (0)} |m| + 2|f (0)| (b) Consider two distinct points x, y C . The point z=y+
y x + y x y x

(x B ) .

(y x)

belongs to B and y (x, z ). An easy calculation shows that y=

+ y x

x+

(convex combination!).

Use convexity of f and multiply by the common denominator to get ( + y x )f (y ) f (x) + y x f (z ) . Then f (y ) f (x) [f (z ) f (y ) y x 2M y x . Thus f (y ) f (x)
2M

yx .

Interchanging the role of x and y , we obtain that f is ( 2M )-Lipschitz on C . Observation 0.2. Let C be a convex set in a normed space X , f : C R a convex function, B := B 0 (x0 , r) C . Let x, y C be such that x = (1 )x0 + y with 0 < < 1. If f m on B , then f max{m, f (y )} (in particular, on B 0 (x, (1 )r)). Proof. Exercise. Theorem 0.3. Let C be an open convex set in a normed space X , and f : C R a convex function. The following assertions are equivalent:
1

on conv B {y }

(i) (ii) (iii) (iv) (v)

f f f f f

is is is is is

locally Lipschitz on C ; continuous on C ; continuous at some point of C ; locally bounded on C ; upper bounded on a nonempty open subset of C .

Proof. The implications (i) (ii) (iii) (v ) and (ii) (iv ) (v ) are obvious. It remains to show that (v ) implies (i). By (v), there exists an open ball B 0 (x0 , r) C on which f is upper bounded. Let x C . There exists y C such that x (x0 , y ). By Observation 0.2, f is uper bounded on some ball B 0 (x, ). By Proposition 0.1, f is Lipschitz on B 0 (x, 2 ). As an easy corollary, we obtain the following result on automatic continuity of convex functions in nite-dimensional spaces. Corollary 0.4. Each convex function on an open convex subset of Rd is locally Lipschitz (hence continuous). Proof. Let C Rd be open and convex, and f : C R a convex function. Fix x0 C . There exist nitely many points c1 , . . . , cn C0 such that x0 U := int[conv{c1 , . . . , cn }] (take, e.g., the vertices of a small d-dimensional cube centered at x0 ). By convexity, f max{f (c1 ), . . . , f (cn )} on U . By Theorem 0.3, f is locally Lipschitz on U . Corollary 0.5. Let C be a nite-dimensional convex set in a normed space X . Then every convex function f : C R is continuous on ri(C ) (the relative interior of C ). Proof. Ecercise. (Hint: use Corollary 0.4.) Continuity of semicontinuous convex functions.
Let M be a topological space, x0 M . Recall that a function f : M R is: lower semicontinuous (l.s.c.) at x0 if t (, f (x0 )) > 0: f (x) > t whenever d(x, x0 ) < . upper semicontinuous (u.s.c.) at x0 if t (f (x0 ), +) > 0: f (x) < t whenever d(x, x0 ) < . Clearly, f is u.s.c. at x0 if and only if f is l.s.c. at x0 . Observation 0.6. Let M, f be as above. Then the following assertions are equivalent: (i) f is l.s.c.; (ii) for each t R, the set {f > t} is open; (iii) for each t R, the set {f t} is closed; (iv) the epigraph epi(f ) := {(x, t) M R : f (x) t} is closed (in M R). Proof. Exercise.

Proposition 0.7. Let C be an open convex set in a normed space X , f : C R a convex function. (a) If f is u.s.c., then f is continuous on C .

(b) If X is a Banach space and f is l.s.c., then f is continuous on C . Proof. (a) Fix x0 C and t > f (x0 ). Then the set {x C : f (x) < t} is a nonempty open subset of C , on which f is bounded above. Apply Theorem 0.3. (b) If C = X , put Fn = {x C : f (x) n}; otherwise dene
1 Fn = {x C : f (x) n, dist(x, X \ C ) n }.

The sets Fn (n N) are closed in C ; but they are also closed in X since Fn C . By the Baire Category Theorem, there exists k N such that Fk has a nonempty interior. This implies that f is upper bounded on a nonempty open set. Apply Theorem 0.3. Families of convex functions. Let F be a family of fuctions on a set E . We say that F is pointwise bounded if, for each x E , the set F (x) = {f (x) : f F} is bounded (in R). Theorem 0.8. Let C be an open convex set in a Banach space X . Let F be a family of continuous convex functions on C . If F is pointwise bounded, then F is locally equi-Lipschitz and locally equi-bounded. Proof. The (real-valued!) function g (x) = sup F (x) = sup f (x)
f F

is easily seen to be l.s.c. (e.g., by Observation 0.6). By Proposition 0.7, g is continuous on C ; in particular, g is locally bounded. Hence F is locally equi-bounded above on C . The rest follows from Proposition 0.1. Theorem 0.9. Let C be an open convex set in a Banach space X . Let {fn } be a sequence of continuous convex functions on C that converges pointwise on C to a (convex) function f : C R. Then f is continuous and the convergence is uniform on compact sets. Proof. The sequence {fn } is pointwise bounded, hence, by the previous theorem, locally equi-bounded and equi-Lipschitz. Consequently, f is locally bounded and hence continuous (Theorem 0.3). Moreover, on each compact set K C , the restrictions fn |K (n N) are equi-bounded and equi-Lipschitz. An easy application of the Ascoli-Arzel` a theorem (exercise!) gives that they converge uniformly on K.
Let us recall the so-called diagonal method, a standard argument used in many areas of Mathematical Analysis. Given a sequence = ( (1), (2), . . .) of elements of a set S , and m N, we denote by |[m,) the sequence ( (m), (m + 1), . . .). Lemma 0.10 (Diagonal method). Let S be a set, and n (n N) countably many sequences of elements of S such that n+1 is a subsequence of n for each n N. Then there exists a sequence of elements of S , such that, for each n N, |[n,) is a subsequence of n . Proof. The diagonal sequence = (1 (1), 2 (2), . . .) has the desired property.

Theorem 0.11. Let C be an open convex set in a separable Banach space X . Let {fn } be a pointwise bounded sequence of continuous convex functions on C . Then there exists a subsequence {fnk } of {fn } that converges pointwise and uniformly on compact sets to a continuous convex function on C . Proof. Fix a countable dense set D C . Since {fn } is pointwise bounded, an easy application of diagonal method produces a subsequence {fnk } that converges at each point of D. Let us show that this subsequence converges pointwise on C . Given x C , there exists an open ball U C , centered in x, on which {fn } is equi-Lipschitz with a certain Lipschitz constant L > 0. Choose d U such that 1 dx < L . Given > 0, there exists k0 N such that |fnk (d) fnj (d)| < whenever k, j k0 . Then, for such indices, we have |fnk (x) fnj (x)| |fnk (x) fnk (d)| + |fnk (d) fnj (d)| + |fnj (d) fnj (x)| < L x d + + L x d < 3. It follows that {fnk (x)} is Cauchy and hence convergent. The rest follows from Theorem 0.9.

Direct applications to linear mappings and functionals. Let us show that some signicant results of Functional Analysis are easy consequences of the above theorems for families of convex functions. While usual proofs of the Banach-Steinhaus theorem (Corollary 0.12) go in a similar way as Theorem 0.8, the subsequence theorem Corollary 0.14 is usually proved using compactness of BX (the dual unit ball) in the w -topology (Alaoglus theorem) and its metrizability. Let X be a normed space, and x X . Recall the following well-known consequence of the Hahn-Banach theorem x = sup{x (x) : x X , x = 1} . Corollary 0.12 (Banach-Steinhaus Uniform Boundedness Principle). Let X be a Banach space, Y a normed space. Let T be a family of coninuous linear mappings from X into Y . Suppose that T is pointwise bounded, that is, for each x X , the set {T x : T T } is bounded in Y . Then the family T is bounded in the normed space L(X, Y ) of all continuous linear mappings from X into Y . Proof. The family {y T : T T , y Y , y = 1} is a pointwise bounded family of continuous linear functionals on X ; indeed, |(y T )(x)| y T x = T x (x X ). By Theorem 0.8, there exist r > 0 and M R such that y (T x) = (y T )(x) M Passing to supremum w.r.t. y , we obtain Tx M which easily implies that T
M r

( x B (0, r), y = 1, T T ).

( x B (0, r), T T ) ,

for each T T .

Corollary 0.13. Let X be a Banach space, and {x n } X a sequence that converge pointwise on X to a (linear) functional : X R. Then {xn } is bounded, X , and the convergence is uniform on compact sets.

Proof. By Corollary 0.12, { x n } is bounded, say, by a constant M . This easily implies that M . The last part follows by Theorem 0.9.

5
Let us recall that a sequence {x n } X is w -convergent if there exists x X such that xn x pointwise on X .

Corollary 0.14. Let X be a separable Banach space. Then every pointwise bounded se quence {x n } X is bounded and admits a w -convergent subsequence. Proof. Apply Theorem 0.8 and Theorem 0.11. Remarks on boundary points. Let X be a normed space, C a convex set with int(C ) = , and f : C R a convex function which is continuous on int(C ). The following example shows that, even for nite-dimensional X , the behaviour of f at boundary points of C can be very bad. Example 0.15. Let | |e denote the Euclidean norm on X = Rd . Then each function f : C [0, +) such that f |int(C ) = 0 is convex on C .