Bourbaki

Proposition 1

Tag 0257, permanent. Cite it as [Bourbaki, Tag 0257].

Théories spectrales, chapter I, § 1. Spectres et caractères

Let A be an algebra and x,y∈Ax, y\in A. One has Sp′(xy)='(xy) = Sp′(yx)'(yx).

By passing to A~\widetilde{A}, we reduce to the case where A possesses a unit element ee. It is then enough to prove that, if λ≠0\lambda \not= 0 is such that xy−λexy-\lambda e admits an inverse uu, then yx−λeyx-\lambda e is invertible. Put z=yux−ez=yux-e. Since xyu=λu+exyu=\lambda u+e, one has

(yx−λe)z=y(xyu)x−yx−λyux+λe (yx-\lambda e)z=y(xyu)x-yx-\lambda yux+\lambda e
=y(λu+e)x−yx−λyux+λe=λe =y(\lambda u+e)x-yx-\lambda yux+\lambda e=\lambda e

and analogously z(yx−λe)=λez(yx-\lambda e) =\lambda e. Since λ≠0\lambda \not= 0, one sees that yx−λeyx-\lambda e is invertible.

If A is a unital algebra and if x,y∈Ax, y\in A, the preceding proposition implies that Sp(xyxy)∪{0}=\cup \{0\}= Sp(yxyx)∪{0}\cup \{0\}, but one can have Sp(xyxy)≠\not= Sp(yxyx) (cf. I, p. 153, exer. 3).

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.4, gpt-5-6-mini, 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.