Bourbaki

Exercise 25, § 6

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

Spectral Theories, I, p. 183

Let G be a group. Denote by C[G]\mathbf{C}[G] the group algebra of G over C\mathbf{C}. It is a subspace of the Hilbert space ℓ2(G)\ell^2(G). For gg in G, denote by [g][g] the element of C[G]\mathbf{C}[G] corresponding to gg. The elements [g][g], for g∈Gg\in G, form an orthonormal basis of ℓ2(G)\ell^2(G) and C[G]\mathbf{C}[G] is dense in ℓ2(G)\ell^2(G).

a) The mapping

∑gαg[g]↦∑gα‾g[g−1] \sum_g\alpha_g[g]\mapsto \sum_g\overline{\alpha}_g[g^{-1}]

is an involution on C[G]\mathbf{C}[G].

b) For g∈Gg\in G, let π(g)\pi (g) be the mapping x↦gxx\mapsto gx of C[G]\mathbf{C}[G]. The mapping which to gg associates π(g)\pi (g) extends to a continuous and injective morphism of involutive algebras from C[G]\mathbf{C}[G] into L(ℓ2(G))\mathscr{L}(\ell^2(G)).

Denote by Stellr(G)_r(G), and call the reduced stellar algebra of G, the closure in L(ℓ2(G))\mathscr{L}(\ell^2(G)) of the image of the mapping π\pi. It is a stellar algebra. We identify C[G]\mathbf{C}[G] with its image under π\pi in Stellr(G)_r(G).

c) The linear trace mapping Tr:C[G]→C:\mathbf{C}[G]\rightarrow \mathbf{C} such that Tr(1) = 1 and Tr(gg) == 0 for g≠1g\not= 1 extends to a continuous linear mapping Stellr(G)→C_r(G)\rightarrow \mathbf{C}.

d) One has Tr(xyxy) == Tr(yxyx) for all xx and yy in Stellr(G)_r(G).

e) One has Tr(xx∗xx^*)⩾0\geqslant 0 for every xx in Stellr(G)_r(G), and Tr(xx∗xx^*) =0= 0 if, and only if, x=0x= 0.

f) Let ee be an idempotent element of C[G]\mathbf{C}[G] such that e≠0e\not= 0 and e≠1e\not= 1. Now prove that 0<0< Tr(ee)<1<1. (Use exercise 3).

g) Let ee be an idempotent element of Z[G]\mathbf{Z}[G]. Now prove that e=0e= 0 or e=1e= 1. (“Kaplansky’s theorem”).

h) Let xx be an element of C[G]\mathbf{C}[G]. Then xx is invertible if and only if it is left invertible, if and only if it is right invertible.

i) Let nn be a strictly positive integer. A matrix xx of type (n,n)(n, n) with coefficients in C[G]\mathbf{C}[G] is invertible if and only if it is left invertible, if and only if it is right invertible.

Solution

No solution has been written yet.

Cited by

Nothing.

Cites

Nothing.

Machine translation of the English, by gpt-5.4. Not checked by a person.