Bourbaki

Proposition 12

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

Théories spectrales, chapter IV, § 1. Opérateurs compacts sur un espace hilbertien

Let B=(ei)i∈IB = (e_i)_{i\in I} be an orthonormal basis of E. Let u∈DB(E)u\in \mathscr{D}_B(E) and let us denote by λ=(λi)i∈I\lambda = (\lambda_i)_{i\in I} the family of its eigenvalues. The endomorphism uu is of finite trace if and only if the family λ\lambda is summable in K. One then has Tr(uu) =∑λi=\sum\lambda_i.

Replacing uu by u(C)u_{(\mathbf{C})} if necessary, one may suppose that K=CK =\mathbf{C}.

Suppose first that uu is of finite trace. According to EVT, V, p. 50 and p. 49, formula (25), the family (⟨ei∣u(ei)⟩)i∈I=(λi)i∈I(\langle e_i|u(e_i)\rangle )_{i\in I}= (\lambda_i)_{i\in I} is summable.

Conversely, suppose that the family λ\lambda is summable.

Each of the families (R(λi)+),(R(λi)−),(I(λi)+),(I(λi)−)(\mathscr{R}(\lambda_i)^+), (\mathscr{R}(\lambda_i)^-), (\mathscr{I}(\lambda_i)^+), (\mathscr{I}(\lambda_i)^-) is then summable. The endomorphism uu is a linear combination of the elements of DB(E)\mathscr{D}_B(E) having these families as eigenvalues. These elements of DB(E)\mathscr{D}_B(E) are positive. Since, by definition, the space of endomorphisms of finite trace is generated by the positive endomorphisms of finite trace, one may therefore suppose that λi⩾0\lambda_i\geqslant 0 for every ii. Since ⟨ei∣u(ei)⟩=λi\langle e_i|u(e_i)\rangle =\lambda_i, the family (⟨ei∣u(ei)⟩)i∈I(\langle e_i|u(e_i)\rangle )_{i\in I} is summable, therefore uu is of finite trace (EVT, V, p. 48, lemma 3).

Finally, if uu is of finite trace, then according to EVT, V, p. 50, one has

Tr(uu) =∑i∈I⟨ei∣u(ei)⟩=∑i∈Iλi=\sum_{i\in I}\langle e_i|u(e_i)\rangle =\sum_{i\in I}\lambda_i.

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-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.