Exercise 1.3

Let be X as topological vector space. All sets mentioned below are understood to be the subsets of X. Prove the following statements:

1.
The convex hull of every open set is open.
2.
If X is locally convex then the convex hull of every bounded set is bounded.
3.
If A and B are bounded, so is A+B.
4.
If A and B are compact, so is A+B.
5.
If A is compact and B is closed, then A+B is closed.
6.
The sum of two closed sets may fail to be closed.

Answers

Proof.

(a)
Pick an open set A then let the variables V i ( i = 1 , 2 , ) run through all open subsets of A , so that A t i ( t 1 V 1 + + t i V i + ) A (1)

given all convex combinations t 1 V 1 + + t i V i + . We know from Section 1.7 of Functional Analysis that those sums are open; which achieves the proof.

(b)
Provided a bounded set E , pick V a neighbourhood of 0 : By (b) of [1.14] in Functional Analysis, V contains a convex neighbourhood of 0 , say W . There so exists a positive scalar s such that E tW tV ( t > s ) ; (2)

which yields

E tW = tW = tW tV . (3)

So ends the proof.

(c)
At fixed V , neighbourhood of the origin, we combine the continuousness of + with [1.14] of Functional Analysis to conclude that there exists U a balanced neighborhood of the origin such that U + U V . (4)

Moreover, by the very definition of boundedness, A rU for some positive scalar r . Similarly, B sU for some positive s . Finally,

A + B rU + sU tU + tU tV ( t > r , s ) , (5)

since U is balanced. So ends the proof.

(d)
First, A and B are compact: So is A × B . Next, + maps continuously A × B onto A + B . In conclusion, A + B is compact.
(e)
From now on, we assume that neither A nor B is empty, since otherwise the result is trivial. Now pick c X outside A + B : The result will be established by showing that c is not in the closure of A + B .

To do so, we let the variable a range over A : Every set a + B is closed as well; see [1.7] of Functional Analysis. Trivially, a + B c : By [1.10] of Functional Analysis, there so exists V = V ( a ) a neighborhood of the origin such that ( a + B + V ) ( c + V ) = . (6)

Moreover, there are finitely many a + V , say a 1 + V 1 , a 2 + V 2 , , whose union U contains the compact set A . Therefore,

A + B U + B . (7)

Now define

W V 1 V 2 , (8)

so that

( a i + B + V i ) ( c + W ) = ( 6 ) ( i = 1 , 2 , ) . (9)

As a conclusion, c is not in the closure of U + B . Finally, (7 ) asserts that c is not in A + B ¯ either; which achieves the proof.

Corollary: If B is the closure of a set S , then

A + B A + S ¯ A + B ¯ = A + B (10)

by (b) of [1.13] of Functional Analysis (since A is closed; see [1.12] from the same source). The special case A = { x } , B = X will occur in the proof of Exercise 15 in chapter 2.

(f)
The last proof will consist in exibhiting a counterexample. To do so, let f be any continuous mapping of the real line such that
(i)
f ( x ) + f ( x ) 0 ( x R );
(ii)
f vanishes at infinity.

For instance, we may combine (ii) with f even and f > 0 by setting f ( x ) = 2 | x | , f ( x ) = e x 2 , f ( x ) = 1 ( 1 + | x | ) , …, and so on.

As a continous function, f has closed graph G ; see [2.14] of Functional Analysis. Moreover, (i) implies that the origin ( 0 , 0 ) ( x x , f ( x ) + f ( x ) ) is not in G + G . On the other hand,

{ ( 0 , f ( n ) + f ( n ) ) : n = 1 , 2 , } G + G . (11)

Now the key ingredient is that

( 0 , f ( n ) + f ( n ) ) n ( ii ) ( 0 , 0 ) . (12)

We have so constructed a sequence in G + G that converges outside G + G . So ends the proof.

User profile picture
2023-08-21 16:24
Comments