Free-group averaging and the compact ideal

Written by GPT-6.1 Sol (OpenAI), Ultra, September 2026. Self-checked by the writing AI. Original text: CC0 1.0.

The left and right regular actions of a free group commute. Their joint action on one Hilbert space has an ideal of compact operators, and removing that ideal gives the spatial tensor product of the two reduced group algebras. We will prove each part of this statement. The proof separates three mechanisms: an averaging argument proves simplicity of the factors; a spectral gap isolates a rank-one projection; and an average over word cuts compares the joint action with the spatial action modulo compact operators.

Prerequisites are Tensor norms and independent systems, Tensor independence and ideals, and the functional calculus and quotient results in C*-algebra foundations, Theorem 5.1, Theorem 15.1 and Corollary 15.4. We reuse Theorem 2.1 of the tensor-independence lesson, which proves that a spatial tensor product of simple C*-algebras is simple, and Proposition 4.1 of that lesson, which computes the four-regular tree adjacency norm as 232\sqrt3. Familiarity with reduced words and orthogonal projections on Hilbert space is sufficient for the group arguments below.

Freely readable treatments are de la Harpe’s exposition of Powers averaging and Akemann and Ostrand’s paper on the compact ideal and spatial quotient. The arguments here give a reduced-word partition, an explicit cyclic-coset comparison and a word-cut isometry with a compact intertwining error. The last construction proves the essential-norm bound in Proposition 3.2 directly. The earlier programme lessons supply the norm, tensor and simplicity prerequisites.

Throughout, G=F(s,t)G=F(s,t) is the free group on two generators, ee is its identity, and ∣g∣|g| is the length of the reduced word for gg. Put H=ℓ2(G),λgδh=δgh,ρgδh=δhg−1.(0.1) H=\ell^2(G),\qquad \lambda_g\delta_h=\delta_{gh},\qquad \rho_g\delta_h=\delta_{hg^{-1}}. \tag{0.1} Both λ\lambda and ρ\rho are unitary representations. Their operators commute. We write L=C∗(λg:g∈G),R=C∗(ρg:g∈G),A=C∗(L,R)⊆B(H).(0.2) L=C^*(\lambda_g:g\in G),\qquad R=C^*(\rho_g:g\in G),\qquad \mathcal A=C^*(L,R)\subseteq B(H). \tag{0.2} All three algebras are unital. The linear span of the operators λgρh\lambda_g\rho_h is dense in A\mathcal A, since products and adjoints of these operators remain in that span.

1. Word partitions and norm averaging

Define the canonical state on LL by τ(a)=⟨aδe,δe⟩.(1.1) \tau(a)=\langle a\delta_e,\delta_e\rangle. \tag{1.1} For a group polynomial, this selects its identity coefficient. Multiplication of two such polynomials shows τ(ab)=τ(ba)\tau(ab)=\tau(ba), because gh=egh=e exactly when hg=ehg=e. Norm density therefore makes τ\tau a tracial state on LL.

It is faithful. If τ(a∗a)=0\tau(a^*a)=0, then aδe=0a\delta_e=0. Every element of LL commutes with every ρg\rho_g, so aρgδe=0a\rho_g\delta_e=0 for all gg. These vectors are the entire standard basis of HH, and hence a=0a=0. In particular, a nonzero positive element of LL has strictly positive trace, by applying this argument to its square root.

Lemma 1.1 (a word partition). For every finite set F⊆G∖{e}F\subseteq G\setminus\{e\} and every positive integer nn, there are a partition G=C⊔DG=C\sqcup D and elements u1,…,un∈Gu_1,\ldots,u_n\in G such that fC∩C=∅(f∈F),uiD∩ujD=∅(i≠j).(1.2) fC\cap C=\varnothing\quad(f\in F), \qquad u_iD\cap u_jD=\varnothing\quad(i\ne j). \tag{1.2}

Proof. First we make a common conjugation of FF. Choose N>max⁡f∈F∣f∣N>\max_{f\in F}|f|, and put h=tNsNh=t^Ns^N. Every reduced word for hfh−1hfh^{-1} begins with tt and ends with t−1t^{-1}. To verify this, if f=sk≠ef=s^k\ne e, the conjugate is tNskt−Nt^Ns^kt^{-N}. Otherwise ff contains a letter tt or t−1t^{-1}. Reducing sNfs−Ns^Nfs^{-N} can cancel fewer than NN letters at each end, leaving a nonempty initial block of ss's and a nonempty final block of s−1s^{-1}'s. The outer tNt^N and t−Nt^{-N} then survive.

For the conjugated set, let C0C_0 consist of all reduced words beginning with ss or s−1s^{-1}, and let D0=G∖C0D_0=G\setminus C_0. Thus D0D_0 contains ee and precisely the nonempty words beginning with tt or t−1t^{-1}. Multiplying a word of C0C_0 on the left by hfh−1hfh^{-1} causes no cancellation at the join: that join is t−1t^{-1} followed by s±1s^{\pm1}. The product begins with tt, so misses C0C_0.

The sets siD0s^iD_0, 1≤i≤n1\le i\le n, are disjoint. Their words are sis^i itself or words whose first block is exactly ii positive ss's followed by t±1t^{\pm1}. Different values of ii cannot give the same reduced word. Finally take C=h−1C0C=h^{-1}C_0, D=h−1D0D=h^{-1}D_0, and ui=sihu_i=s^ih. Left multiplication by hh carries fC∩CfC\cap C to (hfh−1)C0∩C0(hfh^{-1})C_0\cap C_0, while uiD=siD0u_iD=s^iD_0. This proves (1.2). □\square

Lemma 1.2 (Powers averaging estimate). If x=∑f∈Fcfλf,e∉F, x=\sum_{f\in F}c_f\lambda_f, \qquad e\notin F, then, for every n≥1n\ge1, some u1,…,un∈Gu_1,\ldots,u_n\in G satisfy ∥1n∑i=1nλuixλui∗∥≤2∥x∥n.(1.3) \left\|\frac1n\sum_{i=1}^n\lambda_{u_i}x\lambda_{u_i}^*\right\| \le\frac{2\|x\|}{\sqrt n}. \tag{1.3}

Proof. Apply Lemma 1.1 to the support of xx. Let PP be the projection onto ℓ2(C)\ell^2(C), and let Q=1−PQ=1-P. Since each λf\lambda_f carries ℓ2(C)\ell^2(C) into ℓ2(D)\ell^2(D), we have PxP=0PxP=0. Put xi=λuixλui∗,Qi=λuiQλui∗. x_i=\lambda_{u_i}x\lambda_{u_i}^*, \qquad Q_i=\lambda_{u_i}Q\lambda_{u_i}^*. The QiQ_i's are mutually orthogonal, and (1−Qi)xi(1−Qi)=0(1-Q_i)x_i(1-Q_i)=0. Thus xi=Qixi+(1−Qi)xiQi.(1.4) x_i=Q_ix_i+(1-Q_i)x_iQ_i. \tag{1.4} For any ξ∈H\xi\in H, orthogonality of the output ranges gives ∥∑iQixiξ∥2=∑i∥Qixiξ∥2≤n∥x∥2∥ξ∥2. \left\|\sum_iQ_ix_i\xi\right\|^2 =\sum_i\|Q_ix_i\xi\|^2 \le n\|x\|^2\|\xi\|^2. For the other sum, the triangle inequality and Cauchy–Schwarz give ∥∑i(1−Qi)xiQiξ∥≤∥x∥∑i∥Qiξ∥≤n ∥x∥ ∥ξ∥. \left\|\sum_i(1-Q_i)x_iQ_i\xi\right\| \le\|x\|\sum_i\|Q_i\xi\| \le\sqrt n\,\|x\|\,\|\xi\|. Adding the two bounds in (1.4) and dividing by nn proves (1.3). No self-adjointness assumption on xx is needed. □\square

Proposition 1.3. For every a∈La\in L, the scalar τ(a)1\tau(a)1 belongs to the norm-closed convex hull of {λgaλg∗:g∈G}.(1.5) \{\lambda_g a\lambda_g^*:g\in G\}. \tag{1.5}

Proof. Subtract τ(a)1\tau(a)1, so that we may assume τ(a)=0\tau(a)=0. Given ε>0\varepsilon>0, choose a group polynomial bb with ∥a−b∥<ε/4\|a-b\|<\varepsilon/4. Put x=b−τ(b)1x=b-\tau(b)1. This polynomial has no identity coefficient, and ∥a−x∥≤∥a−b∥+∣τ(b−a)∣<ε/2. \|a-x\|\le\|a-b\|+|\tau(b-a)|<\varepsilon/2. Choose nn so large that 2∥x∥/n<ε/22\|x\|/\sqrt n<\varepsilon/2, and use the same conjugations for aa as for xx in Lemma 1.2. Their average applied to aa has norm less than ε\varepsilon. Restoring the scalar gives (1.5). □\square

Theorem 1.4. The algebras LL and RR are simple and have unique tracial states.

Proof. Let I⊆LI\subseteq L be a nonzero closed two-sided ideal. Choose 0≠a∈I+0\ne a\in I_+. Faithfulness of τ\tau gives τ(a)>0\tau(a)>0. Every conjugate in (1.5) lies in II, so norm closure gives τ(a)1∈I\tau(a)1\in I. Hence 1∈I1\in I, and I=LI=L.

If σ\sigma is another tracial state, it takes the same value on every conjugate of aa, and therefore on every average of those conjugates. Taking the norm limit in Proposition 1.3 gives σ(a)=τ(a)\sigma(a)=\tau(a) for every a∈La\in L.

The linear unitary Jδg=δg−1J\delta_g=\delta_{g^{-1}} satisfies JλgJ=ρgJ\lambda_gJ=\rho_g. It carries LL onto RR, transferring both assertions. □\square

2. A spectral gap produces the compact operators

Write S={s,s−1,t,t−1}S=\{s,s^{-1},t,t^{-1}\}. The known tree norm is ∥∑a∈Sλa∥=23.(2.1) \left\|\sum_{a\in S}\lambda_a\right\|=2\sqrt3. \tag{2.1} We need to apply this bound to the action by conjugation on every nonidentity conjugacy class. The stabilizers of that action are cyclic; we include the group-theoretic and Hilbert-space details.

Lemma 2.1. The centralizer ZG(g)={a∈G:ag=ga}Z_G(g)=\{a\in G:ag=ga\} of every g≠eg\ne e is infinite cyclic.

Proof. Use the Cayley tree whose edges join xx to xs±1xs^{\pm1} and xt±1xt^{\pm1}. Its distance is d(x,y)=∣x−1y∣d(x,y)=|x^{-1}y|, so left multiplication acts by isometries, and no nonidentity left translation fixes a vertex.

Cancel matching inverse letters at the two ends of the reduced word for gg. This writes g=ava−1g=ava^{-1}, where v≠ev\ne e is cyclically reduced: its final letter is not the inverse of its first letter. The word segments from avkav^k to avk+1av^{k+1}, for k∈Zk\in\mathbb Z, concatenate without backtracking and form a bi-infinite geodesic ℓ\ell. Left multiplication by gg translates this line by ∣v∣|v| edges.

For a vertex xx, let pp be its closest vertex on ℓ\ell. The closest vertex is unique, since two different closest vertices would give two different paths between vertices in a tree. The closest vertex to gxgx is gpgp. The path from xx to gxgx runs from xx to pp, along ℓ\ell from pp to gpgp, and then to gxgx. The off-line branches at the distinct vertices pp and gpgp cannot meet without creating a cycle. Hence d(x,gx)=∣v∣+2d(x,ℓ).(2.2) d(x,gx)=|v|+2d(x,\ell). \tag{2.2} In particular, ℓ\ell is characterized intrinsically as the vertices having the smallest displacement under gg.

Every element of ZG(g)Z_G(g) preserves this line, because it preserves the displacement function. An isometry of a discrete line is a translation or a reflection. A reflection conjugates a nonzero translation to its inverse and therefore cannot commute with gg. Thus restriction to ℓ\ell gives a homomorphism from ZG(g)Z_G(g) into the additive group Z\mathbb Z of signed translations. It is injective: an element in its kernel fixes a vertex of ℓ\ell, and the left action on vertices is free. Its image is a nonzero subgroup of Z\mathbb Z, since it contains the translation induced by gg. Every such subgroup is generated by its smallest positive integer. The centralizer is consequently infinite cyclic. □\square

Lemma 2.2. If K⊆GK\subseteq G is infinite cyclic and σK\sigma_K is the left action on ℓ2(G/K)\ell^2(G/K), then ∥∑a∈SσK(a)∥≤23.(2.3) \left\|\sum_{a\in S}\sigma_K(a)\right\|\le2\sqrt3. \tag{2.3}

Proof. Write K=⟨k⟩K=\langle k\rangle, and put FN={kj:−N≤j≤N}F_N=\{k^j:-N\le j\le N\}. For every fixed b∈Kb\in K, ∣bFN△FN∣∣FN∣⟶0.(2.4) \frac{|bF_N\mathbin{\triangle}F_N|}{|F_N|}\longrightarrow0. \tag{2.4} Indeed, if b=kmb=k^m, the numerator is at most 2∣m∣2|m|, while ∣FN∣=2N+1|F_N|=2N+1.

Choose a representative r(c)r(c) of each left coset c∈G/Kc\in G/K, and define an isometry WNδc=1∣FN∣∑b∈FNδr(c)b: ℓ2(G/K)⟶H.(2.5) W_N\delta_c=\frac1{\sqrt{|F_N|}} \sum_{b\in F_N}\delta_{r(c)b} \quad:\ \ell^2(G/K)\longrightarrow H. \tag{2.5} Vectors from different cosets have disjoint supports. For fixed a∈Ga\in G and c∈G/Kc\in G/K, write ar(c)=r(ac)b(a,c)ar(c)=r(ac)b(a,c), with b(a,c)∈Kb(a,c)\in K. The squared norm of λaWNδc−WNσK(a)δc \lambda_aW_N\delta_c-W_N\sigma_K(a)\delta_c is the ratio in (2.4) with b=b(a,c)b=b(a,c). It tends to zero. For any finitely supported ξ∈ℓ2(G/K)\xi\in\ell^2(G/K), only finitely many pairs (a,c)(a,c) occur when a∈Sa\in S. Therefore ∥(∑a∈Sλa)WNξ−WN(∑a∈SσK(a))ξ∥⟶0. \left\|\Big(\sum_{a\in S}\lambda_a\Big)W_N\xi -W_N\Big(\sum_{a\in S}\sigma_K(a)\Big)\xi\right\| \longrightarrow0. Since WNW_N is isometric, (2.1) bounds the norm of the second expression by 23∥ξ∥2\sqrt3\|\xi\| in the limit. Finite-support vectors are dense, proving (2.3). The coset representatives need not have any uniform bound: only finitely many of them enter each vector comparison. □\square

Proposition 2.3. The operator C=∑a∈Sλaρa∈A(2.6) C=\sum_{a\in S}\lambda_a\rho_a\in\mathcal A \tag{2.6} has Cδe=4δeC\delta_e=4\delta_e, and its restriction to δe⊥\delta_e^\perp has norm at most 232\sqrt3. The rank-one projection pep_e onto Cδe\mathbb C\delta_e belongs to A\mathcal A.

Proof. The representation a↦λaρaa\mapsto\lambda_a\rho_a is conjugation on the basis: λaρaδg=δaga−1. \lambda_a\rho_a\delta_g=\delta_{aga^{-1}}. The identity gives the one-dimensional fixed summand. Every other conjugacy class has the form G/ZG(g)G/Z_G(g), with exactly the coset action of Lemma 2.2. The complement of δe\delta_e is the orthogonal direct sum of these conjugacy-class spaces. Lemmas 2.1 and 2.2 bound CC on every summand by 232\sqrt3, and the same bound holds on their direct sum.

The operator CC is self-adjoint. Its spectrum consists of 44 and a subset of [−23,23][-2\sqrt3,2\sqrt3]; the two pieces are disjoint. For example, the continuous function f(r)=max⁡{r−23,0}4−23(−4≤r≤4)(2.7) f(r)=\frac{\max\{r-2\sqrt3,0\}}{4-2\sqrt3} \quad(-4\le r\le4) \tag{2.7} vanishes on the second piece and has value one at 44. Continuous functional calculus gives f(C)=pe∈Af(C)=p_e\in\mathcal A. □\square

Corollary 2.4. K(H)⊆A\mathcal K(H)\subseteq\mathcal A, and K(H)\mathcal K(H) is a nonzero proper closed ideal of A\mathcal A.

Proof. For g,h∈Gg,h\in G, the operator λgpeλh∗\lambda_gp_e\lambda_h^* sends δh\delta_h to δg\delta_g and annihilates all other basis vectors. These are all the basis matrix units. Their linear span is norm dense in K(H)\mathcal K(H), so all compact operators belong to A\mathcal A. The compact operators form a closed ideal in B(H)B(H), hence in A\mathcal A. They are proper because HH is infinite dimensional and 11 is not compact. □\square

3. Averaging cuts of a reduced word

Let Q(H)=B(H)/K(H)\mathcal Q(H)=B(H)/\mathcal K(H), and let q:B(H)→Q(H)q:B(H)\to\mathcal Q(H) be the quotient map. We will prove that multiplication followed by qq is continuous for the spatial tensor norm.

For a reduced word gg of length ℓ\ell, denote by pj(g)p_j(g) its first jj letters and by rj(g)r_j(g) the remaining ℓ−j\ell-j letters, for 0≤j≤ℓ0\le j\le\ell. The endpoint cuts are (e,g)(e,g) and (g,e)(g,e), and every cut satisfies g=pj(g)rj(g)g=p_j(g)r_j(g) without cancellation. Define Vδg=1∣g∣+1∑j=0∣g∣δpj(g)⊗δrj(g): H⟶H⊗H.(3.1) V\delta_g=\frac1{\sqrt{|g|+1}} \sum_{j=0}^{|g|}\delta_{p_j(g)}\otimes\delta_{r_j(g)} \quad:\ H\longrightarrow H\otimes H. \tag{3.1}

Lemma 3.1. The map VV is an isometry. For every fixed a,b∈Ga,b\in G, the operator Ea,b=Vλaρb−(λa⊗ρb)V: H⟶H⊗H(3.2) E_{a,b}=V\lambda_a\rho_b-(\lambda_a\otimes\rho_b)V \quad:\ H\longrightarrow H\otimes H \tag{3.2} is compact.

Proof. There are ∣g∣+1|g|+1 distinct cuts of gg, so ∥Vδg∥=1\|V\delta_g\|=1. A pair of group elements (u,v)(u,v) determines the product uvuv. Thus pairs occurring for two different words cannot coincide, and the vectors VδgV\delta_g are orthonormal. This proves isometry.

Fix a,ba,b, and put m=∣a∣m=|a|, n=∣b∣n=|b|, d=m+nd=m+n. Consider a word gg of length ℓ>d\ell>d. Left multiplication by aa can cancel at most mm letters of the beginning of gg, and right multiplication by b−1b^{-1} can cancel at most nn letters at its end. These cancellations cannot meet, because ℓ>d\ell>d.

Consequently every cut with m≤j≤ℓ−n(3.3) m\le j\le\ell-n \tag{3.3} gives a reduced cut of agb−1agb^{-1} after reducing apj(g)ap_j(g) and rj(g)b−1r_j(g)b^{-1}. The portion of gg beyond the possible cancellations retains its original neighboring letters at the cut. At an endpoint of (3.3) a reduced factor can be empty, which is also an allowed cut. Different jj's give different cuts: the reduced prefix length increases by one as jj increases through this interval.

Let ℓ′=∣agb−1∣\ell'=|agb^{-1}|. The two unweighted sets of pairs appearing in Vδagb−1V\delta_{agb^{-1}} and (λa⊗ρb)Vδg(\lambda_a\otimes\rho_b)V\delta_g therefore have at least ℓ−d+1\ell-d+1 common pairs. Also ∣ℓ′−ℓ∣≤d|\ell'-\ell|\le d. Since all coefficients are positive real numbers and all pairs in each sum are distinct, their inner product is at least ℓ−d+1(ℓ+1)(ℓ′+1)≥ℓ−d+1ℓ+d+1. \frac{\ell-d+1}{\sqrt{(\ell+1)(\ell'+1)}} \ge\frac{\ell-d+1}{\ell+d+1}. Both vectors have norm one. Hence ∥Ea,bδg∥2≤4dℓ+d+1(ℓ>d).(3.4) \|E_{a,b}\delta_g\|^2 \le\frac{4d}{\ell+d+1} \quad(\ell>d). \tag{3.4} For d=0d=0, the two vectors agree and the bound is zero.

A bound on individual columns alone would not prove compactness. Here we have additional orthogonality. Every pair (u,v)(u,v) in the support of Ea,bδgE_{a,b}\delta_g has product uv=agb−1uv=agb^{-1}. Different gg's give different such products. Thus the columns of Ea,bE_{a,b} are mutually orthogonal.

Let PNP_N be the finite-rank projection onto words of length at most NN. Column orthogonality gives ∥Ea,b(1−PN)∥=sup⁡∣g∣>N∥Ea,bδg∥⟶0(3.5) \|E_{a,b}(1-P_N)\| =\sup_{|g|>N}\|E_{a,b}\delta_g\| \longrightarrow0 \tag{3.5} by (3.4). Each Ea,bPNE_{a,b}P_N has finite rank. The operator Ea,bE_{a,b} is therefore a norm limit of finite-rank operators, as required. □\square

Proposition 3.2 (the quotient norm estimate). For any finite family ai,bi∈Ga_i,b_i\in G, ci∈Cc_i\in\mathbb C, ∥q(∑iciλaiρbi)∥≤∥∑iciλai⊗ρbi∥.(3.6) \left\|q\Big(\sum_i c_i\lambda_{a_i}\rho_{b_i}\Big)\right\| \le\left\|\sum_i c_i\lambda_{a_i}\otimes\rho_{b_i}\right\|. \tag{3.6}

Proof. Write the joint operator on the left before quotienting as TT, and the spatial operator on the right as XX. Lemma 3.1 implies that XV−VTXV-VT is compact, being a finite sum of compact operators. Since V∗V=1V^*V=1, V∗XV−T=V∗(XV−VT) V^*XV-T=V^*(XV-VT) is compact on HH. Therefore ∥q(T)∥=∥q(V∗XV)∥≤∥V∗XV∥≤∥X∥. \|q(T)\|=\|q(V^*XV)\|\le\|V^*XV\|\le\|X\|. This is (3.6). □\square

The two concrete inclusions of LL and RR into B(H)B(H) are faithful, so the norm on the right of (3.6) is exactly the spatial tensor norm. Since group polynomials are dense in both factors, (3.6) extends to all finite sums ∑ixi⊗yi\sum_i x_i\otimes y_i, with xi∈Lx_i\in L and yi∈Ry_i\in R. For this extension, approximate each factor in norm by a group polynomial and use ∥xy−x′y′∥≤∥x−x′∥ ∥y∥+∥x′∥ ∥y−y′∥ \|xy-x'y'\|\le\|x-x'\|\,\|y\|+\|x'\|\,\|y-y'\| both in the commuting action and in the spatial action.

4. The quotient and the ideal lattice

Theorem 4.1 (Akemann–Ostrand). Multiplication modulo compact operators gives an isomorphism μ:L⊗min⁡R→ ≅ A/K(H),μ(∑ixi⊗yi)=∑ixiyi+K(H).(4.1) \mu:L\otimes_{\min}R\xrightarrow{\ \cong\ } \mathcal A/\mathcal K(H), \qquad \mu\Big(\sum_i x_i\otimes y_i\Big) =\sum_i x_iy_i+\mathcal K(H). \tag{4.1} The only closed two-sided ideals of A\mathcal A are 0,K(H),A.(4.2) 0,\qquad\mathcal K(H),\qquad\mathcal A. \tag{4.2}

Proof. Commutation of LL and RR makes the algebraic multiplication map multiplicative and *-preserving. Proposition 3.2 and its norm-density extension make its composition with qq contractive for the spatial norm. It therefore extends to a *-homomorphism on L⊗min⁡RL\otimes_{\min}R.

Corollary 2.4 identifies q(A)q(\mathcal A) with A/K(H)\mathcal A/\mathcal K(H). The extended homomorphism has dense range in this algebra, because products of elements of LL and RR have dense span in A\mathcal A. The range of a C*-algebra *-homomorphism is closed, so it is surjective.

Theorem 1.4 makes LL and RR simple. The imported tensor-independence Theorem 2.1 consequently makes L⊗min⁡RL\otimes_{\min}R simple. Our homomorphism is nonzero: it sends 1⊗11\otimes1 to q(1)≠0q(1)\ne0, since HH is infinite dimensional. Its kernel, a proper closed ideal of a simple algebra, is zero. This proves (4.1).

For completeness, any nonzero ideal I⊆AI\subseteq\mathcal A meets K(H)\mathcal K(H) nontrivially. Choose 0≠a∈I0\ne a\in I. Some basis matrix entry ⟨aδh,δg⟩\langle a\delta_h,\delta_g\rangle is nonzero. Sandwiching aa between the basis matrix units that send δg\delta_g to δe\delta_e and δe\delta_e to δh\delta_h gives a nonzero scalar multiple of pep_e in II. Multiplying again by matrix units shows that II contains every basis matrix unit and hence all of K(H)\mathcal K(H).

The image of II in A/K(H)\mathcal A/\mathcal K(H) is a closed ideal: since II already contains the kernel of the quotient map, it is naturally I/K(H)I/\mathcal K(H). By (4.1) this quotient algebra is simple. Thus either I=K(H)I=\mathcal K(H) or its image is the full quotient, in which case I=AI=\mathcal A. This proves (4.2). □\square

In the direction used to describe the quotient, the inverse of (4.1) is ∑ixiyi+K(H)⟼∑ixi⊗yi.(4.3) \sum_i x_iy_i+\mathcal K(H)\longmapsto\sum_i x_i\otimes y_i. \tag{4.3} Theorem 4.1 proves that this correspondence is well defined and isometric; it is not merely a rule on formal expressions.

The tensor from the earlier lesson also locates the obstruction precisely. If z=∑a∈Sλa⊗ρa, z=\sum_{a\in S}\lambda_a\otimes\rho_a, then ∥z∥min⁡=23\|z\|_{\min}=2\sqrt3, while its joint representative CC in (2.6) has norm 44. The extra isolated spectral value belongs to the rank-one summand. The quotient removes it and satisfies ∥C+K(H)∥=23.(4.4) \|C+\mathcal K(H)\|=2\sqrt3. \tag{4.4} The quotient theorem supplies the ideal and isomorphism statements in the classical free-group example as well as its tensor-norm distinction.

5. Exercises with solutions

Exercise 5.1 (first step). Put x=λs+λs−1x=\lambda_s+\lambda_{s^{-1}}. Use the partition consisting of words beginning with s±1s^{\pm1} and its complement to construct an explicit finite average of conjugates of xx with norm strictly less than 1/101/10. Give a sufficient number of terms, without computing the norm of the average directly.

Solution. The two words tst−1tst^{-1} and ts−1t−1ts^{-1}t^{-1} begin with tt and end with t−1t^{-1}. Thus the explicit conjugation h=th=t works here. If C0C_0 is the stated set of words and D0D_0 is its complement, then (ts±1t−1)C0∩C0=∅(t s^{\pm1}t^{-1})C_0\cap C_0=\varnothing, and the sets siD0s^iD_0 are pairwise disjoint. The proof of Lemma 1.2 applied to λtxλt∗\lambda_t x\lambda_t^* gives ∥1n∑i=1nλsitxλsit∗∥≤2∥x∥n≤4n. \left\|\frac1n\sum_{i=1}^n \lambda_{s^it}x\lambda_{s^it}^*\right\| \le\frac{2\|x\|}{\sqrt n}\le\frac4{\sqrt n}. Taking n=1601n=1601 gives 4/1601<1/104/\sqrt{1601}<1/10. This is a sufficient bound; it does not assert that this number of terms is optimal.

Exercise 5.2 (application). Replace the word-cut isometry by the endpoint isometry V0δg=δg⊗δeV_0\delta_g=\delta_g\otimes\delta_e. For b≠eb\ne e, show that V0ρb−(1⊗ρb)V0 V_0\rho_b-(1\otimes\rho_b)V_0 is not compact. Explain which feature of the averaging in (3.1) fixes this failure.

Solution. Its value on δg\delta_g is δgb−1⊗δe−δg⊗δb−1. \delta_{gb^{-1}}\otimes\delta_e- \delta_g\otimes\delta_{b^{-1}}. The two basis vectors are different, so this vector has norm 2\sqrt2 for every gg. For different gg's these differences are orthogonal: within each difference the product of the two coordinates is gb−1gb^{-1}, and that product distinguishes the input word. Thus the squared operator absolute value is 2 1H2\,1_H, which is not compact on infinite-dimensional HH. Equivalently, images of the standard orthonormal basis fail to tend to zero in norm, whereas this is necessary for compactness.

The endpoint map has left equivariance but retains a fixed right endpoint error. In (3.1), multiplication changes only a bounded number of cuts near the ends of a long word. Most cuts remain common after multiplication. Normalizing the average makes the squared error tend to zero as in (3.4), and the product-coordinate orthogonality turns that decay into the operator-norm estimate (3.5).

Exercise 5.3 (further step). Prove that A\mathcal A has a unique tracial state and that this state annihilates K(H)\mathcal K(H). In particular, explain why the unique trace on A\mathcal A is not faithful, although the canonical traces on LL and RR are faithful.

Solution. Let ω\omega be a tracial state on A\mathcal A. The mutually orthogonal rank-one projections pg=λgpeλg∗p_g=\lambda_gp_e\lambda_g^* all have the same value ω(pe)\omega(p_e). For any NN distinct group elements, Nω(pe)=ω(∑i=1Npgi)≤1. N\omega(p_e)=\omega\Big(\sum_{i=1}^Np_{g_i}\Big)\le1. Letting NN increase gives ω(pe)=0\omega(p_e)=0. Cauchy–Schwarz then makes ω\omega zero on every basis matrix unit; for example, a matrix unit eg,he_{g,h} satisfies eg,h∗eg,h=phe_{g,h}^*e_{g,h}=p_h. Norm continuity gives ω(K(H))=0\omega(\mathcal K(H))=0. The state descends to a tracial state on A/K(H)\mathcal A/\mathcal K(H), hence, by (4.1), to a tracial state ω~\widetilde\omega on L⊗min⁡RL\otimes_{\min}R.

Write τL,τR\tau_L,\tau_R for the unique traces of Theorem 1.4. The restriction of ω~\widetilde\omega to 1⊗R1\otimes R is τR\tau_R. For b∈R+b\in R_+, the functional a⟼ω~(a⊗b) a\longmapsto\widetilde\omega(a\otimes b) on LL is positive and tracial, with value τR(b)\tau_R(b) at 11. If this value is zero the functional is zero; otherwise divide by it and use uniqueness of the tracial state on LL. In both cases ω~(a⊗b)=τL(a)τR(b). \widetilde\omega(a\otimes b)=\tau_L(a)\tau_R(b). Every element of RR is a linear combination of positive elements, so this equality holds for arbitrary bb. Algebraic tensor density then gives ω~=τL⊗τR\widetilde\omega=\tau_L\otimes\tau_R.

Conversely the product state τL⊗τR\tau_L\otimes\tau_R exists on the spatial product and is tracial, as is checked first on elementary products and then by norm continuity. Pull it back through the quotient isomorphism to obtain a trace on A\mathcal A. This proves existence and uniqueness. The resulting trace kills the nonzero projection pep_e, so it is not faithful. Its restrictions to LL and RR are precisely their faithful canonical traces.

References

Powers proved simplicity of the reduced free-group C*-algebra; Akemann and Ostrand identified the spatial quotient by the compact ideal. The proofs here give the partition estimate, cyclic-stabilizer comparison, and word-cut compactness argument explicitly, while reusing the earlier spatial simplicity and adjacency results.

Editable source · Sources and component terms