Bourbaki

Exercise 31, § 1

Topological Vector Spaces, V, p. 66

It is said that a normed space EE (real or complex) is uniformly convex if, for every ε\varepsilon such that 0<ε<20 < \varepsilon < 2, there exists δ>0\delta > 0 such that the relations ∥x∥⩽1,∥y∥⩽1,∥x−y∥⩾ε\|x\| \leqslant 1, \|y\| \leqslant 1, \|x - y\| \geqslant \varepsilon in EE imply ∥12(x+y)∥⩽1−δ\|\frac{1}{2}(x + y)\| \leqslant 1 - \delta. A uniformly convex space is strictly convex (V, p. 66, exerc. 27). It is said that EE is uniformly smooth if, for every ε>0\varepsilon > 0, there exists η>0\eta > 0 such that the relations ∥x∥⩾1,∥y∥⩾1,∥x−y∥⩽η\|x\| \geqslant 1, \|y\| \geqslant 1, \|x - y\| \leqslant \eta entail the inequality ∥x+y∥⩾∥x∥+∥y∥−ε∥x−y∥\|x + y\| \geqslant \|x\| + \|y\| - \varepsilon \|x - y\|. It is equivalent to saying that, for every ε>0\varepsilon > 0, there exists ρ>0\rho > 0 such that the relations ∥x∥=1,∥y∥⩽ρ\|x\| = 1, \|y\| \leqslant \rho entail the inequality

∥x+y∥+∥x−y∥⩽2+ε∥y∥. \|x + y\| + \|x - y\| \leqslant 2 + \varepsilon \|y\|.
A uniformly smooth space is smooth (V, p. 65, exerc. 26). a) Now prove that if EE is uniformly convex, its strong dual E′E' is uniformly smooth, and that if EE is uniformly smooth, E′E' is uniformly convex; the restriction to the unit sphere SS of E of the unique mapping support (V, p. 66, exerc. 29) is then a mapping from S into the unit sphere S’ of E’, continuous for the topologies of E and E’ deduced from the norm. b) Now prove that if E is uniformly convex, and if a filter F\mathfrak{F} on E converges to x0x_0 for the topology σ(E,E′)\sigma(E, E') and is such that lim⁡F∥x∥=∥x0∥\lim_{\mathfrak{F}} \|x\| = \|x_0\|, F\mathfrak{F} converges to x0x_0 for the initial topology of E. c) Now prove that a Banach space which is uniformly convex or uniformly smooth is reflexive (use b) and c), as well as IV, p. 61, exerc. 12). (Cf. V, p. 71, exerc. 14.) d) Generalize to uniformly convex Banach spaces the first part of Theorem 1 of V, p. 10, as well as Cor. 1 and 2 of V, p. 11.

Solution

No solution has been written yet.

Machine translation of the English, by gpt-5-mini. Not checked by a person. That model is a cut down version of the one the rest of this language was written by.