Bourbaki

Lemma 2

Tag 07T2, permanent. Cite it as [Bourbaki, Tag 07T2].

Topological Vector Spaces, IV, p. 20, § 2. Bidual. Reflexive spaces

There exists a sequence (xm)m≥0(x_m)_{m \geq 0} consisting of distinct elements of A, which is bounded in E.

We shall construct a sequence (xm)m≥0(x_m)_{m \geq 0} of points of A by induction; and a decreasing sequence (Cm)m≥0(C_m)_{m \geq 0} of subsets of A satisfying the following conditions : a) None of the sets CmC_m is countable. b) For every n≥0n \geq 0, the set prk(Cm)\mathrm{pr}_k(C_m) is bounded in FkF_k for 0≤k≤m0 \leq k \leq m. c) For every m≥0m \geq 0, we have xm∈Cm−Cm+1x_m \in C_m - C_{m+1}.

We put C0=AC_0 = A. Suppose the sets CmC_m for 0≤m≤n0 \leq m \leq n have been defined, so as to satisfy a) and b) for 0≤m≤n0 \leq m \leq n, and also the points xmx_m in Cm−Cm+1C_m - C_{m+1} for 0≤m<n0 \leq m < n. For every integer r≥1r \geq 1, let Cn,rC_{n,r} be the set of all x∈Cnx \in C_n such that

r−1≤∥prn+1(x)∥<r. r - 1 \leq \| \mathrm{pr}_{n+1}(x) \| < r .

Since CnC_n is not countable, there exists an integer r≥1r \geq 1 such that Cn,rC_{n,r} is not countable. We choose a point xnx_n in Cn,rC_{n,r} and put Cn+1=Cn,r−{xn}C_{n+1} = C_{n,r} - \{ x_n \}. Evidently Cn+1⊂CnC_{n+1} \subset C_n and xn∈Cn−Cn+1x_n \in C_n - C_{n+1}, the set Cn+1C_{n+1} is not countable and prk(Cn+1)\mathrm{pr}_k(C_{n+1}) is bounded in FnF_n for 0≤k≤n+10 \leq k \leq n + 1.

We have xm∈Cmx_m \in C_m, and so xm∈Cnx_m \in C_n where m≥nm \geq n. The projection of the sequence (xm)m≥0(x_m)_{m \geq 0} on FnF_n is therefore bounded for all n≥0n \geq 0; in other words, the sequence (xm)m≥0(x_m)_{m \geq 0} is bounded in E, and this establishes lemma 2.

Q.E.D.

With the notations of lemma 2, the bounded sequence (xm)m≥0(x_m)_{m \geq 0} has a limit point yy in E. Therefore the sequence (pr0(xm))m≥0(\mathrm{pr}_0(x_m))_{m \geq 0} has a limit point pr0(y)\mathrm{pr}_0(y) in F0F_0, but this contradicts the construction of A0A_0.

Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.

Cited by

Nothing.

Cites

Nothing.

Transcribed from the printed volume. Not translated.