Bourbaki

Proposition 18

Tag 02ER, permanent. Cite it as [Bourbaki, Tag 02ER].

Théories spectrales, chapter I, § 6. Algèbres stellaires

Let A be an involutive algebra. The ordered set A+<1A^{<1}_+ is directed to the right (E, III, p. 12, def. 7), and the filter of its sections (TG, I, p. 38, example 2) is an increasing approximate unit of A.

Let A~\widetilde{A} be the involutive algebra deduced from A by adjunction of a unit element denoted by 1 (def. 4 of I, p. 106).

Let gg be the function from [0,1[[0,1[ into R+\mathbf{R}_+ defined by g(t)=t(1−t)−1g(t) =t(1-t)^{-1}. It is a continuous increasing bijection, its inverse bijection being given by t↦1−(1+t)−1t\mapsto 1-(1 +t)^{-1}.

Let us prove that the ordered set A+<1A^{<1}_+ is directed to the right. Let xx and yy be elements of A+<1A^{<1}_+. Since g(0)=0g(0) = 0 and since SpA′(x)'_A(x) and SpA′(y)'_A(y) are contained in [0,1[[0,1[, the elements g(x)g(x) and g(y)g(y) are defined; they are positive, so that g(x)+g(y)⩾0g(x) +g(y)\geqslant 0. We can therefore form the element z=g−1(g(x)+g(y))z=g^{-1}(g(x) +g(y)) of A. We have SpA′(z)⊂[0,1['_A(z)\subset [0,1[, and hence z∈A+<1z\in A^{<1}_+.

We have 0⩽g(x)⩽g(z)0\leqslant g(x)\leqslant g(z), whence 1⩽1+g(x)⩽1+g(z)1\leqslant 1+g(x)\leqslant 1+g(z). Assertion b) of lemma 14 of I, p. 119 implies that 1+g(x)1 +g(x) and 1+g(z)1 +g(z) are invertible and that (1+g(z))−1⩽(1+g(x))−1(1 +g(z))^{-1}\leqslant (1 +g(x))^{-1}. Consequently, z=1−(1+g(z))−1⩾z= 1-(1 +g(z))^{-1}\geqslant 1−(1+g(x))−1=x1-(1 +g(x))^{-1}=x. Analogously, we have z⩾yz\geqslant y. In consequence, zz majorizes xx and yy in A+<1A^{<1}_+. The ordered set A+<1A^{<1}_+ is therefore directed to the right. Let us denote by F\mathfrak{F} the filter of its sections

Let xx be a positive element of A. For every integer n⩾1n\geqslant 1, let en=e_n= g−1(nx)g^{-1}(nx); we have en∈A+<1e_n\in A^{<1}_+. Let hnh_n be the continuous function on R+\mathbf{R}_+ defined for every t∈R+t\in \mathbf{R}_+ by hn(t)=t2(1−g−1(nt))=t2/(1+nt)h_n(t) =t^2(1-g^{-1}(nt)) =t^2/(1 +nt). We have ∣hn(t)∣⩽t/n|h_n(t)|\leqslant t/n for every t⩾0t\geqslant 0, and hence ∥x(1−en)x∥=∥hn(x)∥⩽\|x(1-e_n)x\|=\|h_n(x)\|\leqslant ∥x∥/n\|x\|/n. In particular, x(1−en)xx(1-e_n)x tends to 0 when nn tends to infinity.

Let ε>0\varepsilon >0 be a real number. Let nn be an integer such that ∥x(1−en)x∥<ε\|x(1-e_n)x\|< \varepsilon. For every f∈A+<1f\in A^{<1}_+ such that f⩾enf\geqslant e_n, one has then

∥x−fx∥2=∥(1−f)x∥2=∥((1−f)x)∗(1−f)x∥=∥x∗(1−f)2x∥ \|x-f x\|^2=\|(1-f)x\|^2=\|((1-f)x)^*(1-f)x\|=\|x^*(1-f)^2x\|
=∥x(1−f)2x∥ =\|x(1-f)^2x\|

Moreover, since 0⩽f⩽10\leqslant f\leqslant 1, one has (1−f)−(1−f)2=(1−f)f⩾0(1-f)-(1-f)^2= (1-f)f\geqslant 0 (Lemma 12, d) of I, p. 116), hence (1−f)2⩽1−f(1-f)^2\leqslant 1-f. Since 1−f⩽1−en1-f\leqslant 1-e_n, it follows that 0⩽(1−f)2⩽1−en0\leqslant (1-f)^2\leqslant 1-e_n. By Lemma 14, a) and c) of I, p. 119, it follows that

∥x−fx∥2=∥x(1−f)2x∥⩽∥x(1−en)x∥<ε \|x-f x\|^2=\|x(1-f)^2x\|\leqslant \|x(1-e_n)x\|< \varepsilon

Thus limf,Ffx=x_{f,\mathfrak{F}}f x=x for every x∈A+x\in A_+. The filter F\mathfrak{F} is therefore an approximate unit of A by Proposition 17.

Bourbaki sets the proof directly after the statement, and the corpus does not separate them, so what is above is the statement and its proof together.

Cited by

Nothing.

Cites

Nothing.

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