Positive maps and finite-dimensional approximation Prerequisite proofs · Sources and terms

Projections in the reduced free group algebra

Written by GPT-6.1 Sol (OpenAI), Ultra, September 2026. Self-checked by the writing AI. New original text: public domain (CC0).

The reduced C∗C^*-algebra A=Cr∗(F(a,b))A=C_r^*(\mathbb F(a,b)) has only two projections: 00 and 11. Its von Neumann closure is a factor of type II1\mathrm{II}_1 with many projections, so the assertion concerns the norm-closed algebra. We prove it by comparing two representations that differ by trace-class operators on a dense algebra.

We use the faithful canonical trace from the group factor lesson and the norm-averaging result. Foundational prerequisites are the compact self-adjoint spectral theorem, trace-class completeness and its two-sided ideal bound, absolute diagonal summation for the trace, and the holomorphic functional calculus with surrounding cycles. The exact foundational proof scopes remain prerequisites; selected free trace-class methods are identified below. The representation comparison, trace-class closure, projection perturbation and integer trace calculation are proved below.

Write Γ=F(a,b)\Gamma=\mathbb F(a,b), H=ℓ2(Γ)H=\ell^2(\Gamma), PP for the projection onto Cδe\mathbb C\delta_e, and p=1−Pp=1-P. Inner products are linear in the second variable.

1. Removing the identity from the regular representation

On H′=pHH'=pH, define two permutations of its basis by

Tsδg={δs,g=s−1,δsg,g≠s−1,s=a,b,g≠e.(1)T_s\delta_g=\begin{cases} \delta_s,&g=s^{-1},\\ \delta_{sg},&g\ne s^{-1}, \end{cases} \qquad s=a,b,\quad g\ne e. \tag{1}

The ordinary left translation would send δs−1\delta_{s^{-1}} to the missing vector δe\delta_e; formula (1) sends it to δs\delta_s, which had the missing predecessor ee. This is a bijection of the remaining basis. Its inverse has the same formula with ss replaced by s−1s^{-1}. The free generators therefore define a unitary representation λ′\lambda' of Γ\Gamma on H′H'.

We need more than a representation of the abstract group: we must show it extends to the reduced norm.

For c=a,bc=a,b, define a bijection ϕc:Γ→Γc\phi_c:\Gamma\to\Gamma_c, where Γc\Gamma_c is the set of words ending in cc or c−1c^{-1}, by

ϕc(w)={w,w ends in c−1,wc,otherwise.(2)\phi_c(w)=\begin{cases} w,&w\text{ ends in }c^{-1},\\ wc,&\text{otherwise}. \end{cases} \tag{2}

In the second case appending cc causes no cancellation. Words ending in c−1c^{-1} are their own preimage; words ending in cc have preimage obtained by removing their last cc. These two rules prove bijectivity.

Lemma 1.1. The map

U:H⊕H⟶H′,U(δw,0)=δϕa(w),U(0,δw)=δϕb(w)(3)U:H\oplus H\longrightarrow H', \quad U(\delta_w,0)=\delta_{\phi_a(w)}, \quad U(0,\delta_w)=\delta_{\phi_b(w)} \tag{3}

is unitary and intertwines λ⊕λ\lambda\oplus\lambda with λ′\lambda'.

Proof. The disjoint sets Γa,Γb\Gamma_a,\Gamma_b partition the nonidentity words, so (3) sends an orthonormal basis bijectively onto an orthonormal basis. For each letter s=a±1,b±1s=a^{\pm1},b^{\pm1}, direct reduction gives

Tsδϕc(w)=δϕc(sw).(4)T_s\delta_{\phi_c(w)}=\delta_{\phi_c(sw)}. \tag{4}

Here Ts−1=Ts∗T_{s^{-1}}=T_s^*. Away from w=ew=e and w=s−1w=s^{-1}, multiplication on the left preserves the terminal letter, so (4) is ordinary concatenation and reduction. The exceptional modified step can occur only when ϕc(w)=s−1\phi_c(w)=s^{-1}, which means w=e,s=c−1w=e,s=c^{-1}, or w=c−1,s=cw=c^{-1},s=c; these are among the two boundary cases. They give respectively ϕc(c−1)=c−1\phi_c(c^{-1})=c^{-1} and ϕc(e)=c\phi_c(e)=c, exactly as (1) requires. In the other boundary cases, cancelling s−1s^{-1} against ss leaves the appended cc, again ϕc(e)\phi_c(e). Thus (4) holds for every letter, and hence every word. □\square

Consequently λ′\lambda' extends isometrically to a representation of AA. On HH let ρ(x)\rho(x) denote this representation extended by zero on Cδe\mathbb C\delta_e. It is a star homomorphism supported on pp, with

ρ(1)=p,ρ(x)P=Pρ(x)=0.(5)\rho(1)=p,\qquad \rho(x)P=P\rho(x)=0. \tag{5}

The original representation is π(x)=x\pi(x)=x. Define

D(x)=π(x)−ρ(x).(6)D(x)=\pi(x)-\rho(x). \tag{6}

In particular D(1)=PD(1)=P, rather than zero.

2. Finite differences and a dense algebra

For vectors ξ,η\xi,\eta, put θξ,ηζ=ξ⟨η,ζ⟩\theta_{\xi,\eta}\zeta=\xi\langle\eta,\zeta\rangle. Formula (1), also for inverse letters, gives

D(λs)=θδs,δe+θδe−δs,δs−1.(7)D(\lambda_s) =\theta_{\delta_s,\delta_e} +\theta_{\delta_e-\delta_s,\delta_{s^{-1}}}. \tag{7}

It vanishes on every other basis vector and has rank 22. For arbitrary x,y∈Ax,y\in A, multiplicativity gives the exact identity

D(xy)=π(x)D(y)+D(x)ρ(y),D(x∗)=D(x)∗.(8)D(xy)=\pi(x)D(y)+D(x)\rho(y), \qquad D(x^*)=D(x)^*. \tag{8}

Thus D(λg)D(\lambda_g) has finite rank for every group element, by induction on word length; for g≠eg\ne e its rank is at most 2ℓ(g)2\ell(g).

Let S1(H)\mathcal S_1(H) be the trace-class operators and define

A0={x∈A:D(x)∈S1(H)}.(9)A_0=\{x\in A:D(x)\in\mathcal S_1(H)\}. \tag{9}

Recall the prerequisite inequalities and trace formula:

∥BTC∥1≤∥B∥∥T∥1∥C∥,∣Tr⁡T∣≤∥T∥1,Tr⁡T=∑g⟨δg,Tδg⟩,(10)\|BTC\|_1\le\|B\|\|T\|_1\|C\|, \qquad |\operatorname{Tr}T|\le\|T\|_1, \qquad \operatorname{Tr}T=\sum_g\langle\delta_g,T\delta_g\rangle, \tag{10}

where the last sum is absolutely convergent.

Lemma 2.1. The set A0A_0 is a norm-dense unital star subalgebra of AA. It is complete in the graph norm

∥x∥gr=∥x∥+∥D(x)∥1.(11)\|x\|_{\mathrm{gr}}=\|x\|+\|D(x)\|_1. \tag{11}

Proof. The ideal inequality and (8) give closure under products and adjoints; D(1)=PD(1)=P is trace class. Finite group polynomials belong to A0A_0 by (7)–(8), so it is norm dense. Also (8) bounds the graph norm of a product by the product of the graph norms. If xnx_n is graph-norm Cauchy, then xn→xx_n\to x in AA and D(xn)→TD(x_n)\to T in trace norm. Since D:A→B(H)D:A\to B(H) is operator-norm bounded and trace norm dominates operator norm, D(x)=TD(x)=T. Thus x∈A0x\in A_0, proving completeness. □\square

Density alone does not show that every element of AA has trace-class difference. We will use a spectral-gap projection construction inside A0A_0.

3. Holomorphic closure with the missing unit retained

Theorem 3.1. If x∈A0x\in A_0 and ff is holomorphic on a neighborhood of Sp⁡A(x)\operatorname{Sp}_A(x), then f(x)∈A0f(x)\in A_0.

Proof. For z∉Sp⁡A(x)z\notin\operatorname{Sp}_A(x), put

R(z)=π((z1−x)−1),R′(z)=ρ((z1−x)−1).R(z)=\pi((z1-x)^{-1}),\qquad R'(z)=\rho((z1-x)^{-1}).

The latter is the resolvent on pHpH, extended by zero. Its corner identities are

ρ(x)R′(z)=zR′(z)−p.\rho(x)R'(z)=zR'(z)-p.

Together with π(x)R(z)=zR(z)−1\pi(x)R(z)=zR(z)-1, they give

R(z)−R′(z)=R(z)P+R(z)D(x)R′(z).(12)R(z)-R'(z) =R(z)P+R(z)D(x)R'(z). \tag{12}

Indeed the second term is R(z)p−R′(z)R(z)p-R'(z); adding the first gives the claimed difference. The rank-one term is essential because the representations have different units.

The right side is trace class by (10), and is continuous in trace norm along every compact resolvent contour. Let C\mathcal C be a surrounding cycle within the domain of ff. Computing the functional calculus in B(H)B(H) and in the unital corner B(pH)B(pH) gives

D(f(x))=12πi∫Cf(z)(R(z)P+R(z)D(x)R′(z)) dz.(13)D(f(x)) =\frac1{2\pi i}\int_{\mathcal C} f(z)\bigl(R(z)P+R(z)D(x)R'(z)\bigr)\,dz. \tag{13}

This is a trace-norm integral in the Banach space S1(H)\mathcal S_1(H). It lies in that space, proving the theorem. No division by zz is used, so the formula is valid even if a contour passes through 00 outside the spectrum. □\square

4. Recovering the canonical trace

Lemma 4.1. For every x∈A0x\in A_0,

Tr⁡D(x)=τ(x).(14)\operatorname{Tr}D(x)=\tau(x). \tag{14}

Proof. Every basis diagonal of π(x)\pi(x) equals τ(x)\tau(x): this holds for group polynomials and extends by operator-norm continuity. Lemma 1.1 makes ρ\rho the sum of two regular representations on pHpH, with every basis vector corresponding to a regular basis vector. Thus

⟨δg,ρ(x)δg⟩=τ(x)(g≠e),⟨δe,ρ(x)δe⟩=0.\langle\delta_g,\rho(x)\delta_g\rangle=\tau(x)\quad(g\ne e), \qquad \langle\delta_e,\rho(x)\delta_e\rangle=0.

The diagonal of D(x)D(x) is zero except at ee, where it is τ(x)\tau(x). Absolute diagonal summation in (10) proves (14). This avoids an unjustified trace-norm limit of arbitrary polynomial approximants. □\square

Lemma 4.2. If E,FE,F are projections on any Hilbert space and E−FE-F is trace class, then

Tr⁡(E−F)=dim⁡(EH∩ker⁡F)−dim⁡(FH∩ker⁡E)∈Z.(15)\operatorname{Tr}(E-F) =\dim(EH\cap\ker F)-\dim(FH\cap\ker E)\in\mathbb Z. \tag{15}

Proof. Put B=E−FB=E-F, C=E+F−1C=E+F-1. Multiplication gives

BC=−CB,B2+C2=1.(16)BC=-CB,\qquad B^2+C^2=1. \tag{16}

The self-adjoint operator BB is compact, and −1≤B≤1-1\le B\le1. Its nonzero eigenvalues have finite multiplicities. If Bξ=tξB\xi=t\xi, 0<∣t∣<10<|t|<1, then

B(Cξ)=−t Cξ,C2ξ=(1−t2)ξ.B(C\xi)=-t\,C\xi,\qquad C^2\xi=(1-t^2)\xi.

Hence C/1−t2C/\sqrt{1-t^2} identifies the eigenspaces for tt and −t-t isometrically. Their dimensions agree. The trace-class condition permits absolute summation of the eigenvalues, so all these pairs cancel.

The eigenspace for 11 is EH∩ker⁡FEH\cap\ker F: equality in

⟨ξ,Bξ⟩=∥Eξ∥2−∥Fξ∥2≤∥ξ∥2\langle\xi,B\xi\rangle=\|E\xi\|^2-\|F\xi\|^2\le\|\xi\|^2

forces Eξ=ξ,Fξ=0E\xi=\xi,F\xi=0. The eigenspace for −1-1 is obtained by exchanging E,FE,F. Both are finite-dimensional by compactness. Only their dimension difference remains in the trace, giving (15). □\square

Thus every projection q∈A0q\in A_0 satisfies

τ(q)=Tr⁡(π(q)−ρ(q))∈Z.(17)\tau(q)=\operatorname{Tr}(\pi(q)-\rho(q))\in\mathbb Z. \tag{17}

Both π(q)\pi(q) and ρ(q)\rho(q) are genuine orthogonal projections on HH, even though the latter representation is supported on pp.

5. Bringing every projection into the dense algebra

Lemma 5.1. Every projection e∈Ae\in A is unitarily conjugate within AA to a projection q∈A0q\in A_0.

Proof. Choose a self-adjoint group polynomial hh with

δ=∥h−e∥<1/4.\delta=\|h-e\|<1/4.

Such a polynomial is obtained by symmetrizing a polynomial approximant. For real zz at distance greater than δ\delta from {0,1}\{0,1\}, the resolvent identity and Neumann series show z−hz-h invertible. Since hh is self-adjoint,

Sp⁡A(h)⊂[−δ,δ]∪[1−δ,1+δ].(18)\operatorname{Sp}_A(h)\subset[-\delta,\delta]\cup[1-\delta,1+\delta]. \tag{18}

Choose ff equal to 00 on a neighborhood of the first interval and 11 on a disjoint neighborhood of the second. This function is holomorphic on their disconnected union. Theorem 3.1 gives q=f(h)∈A0q=f(h)\in A_0, and the functional calculus makes qq a self-adjoint projection.

The circle ∣z−1∣=1/2|z-1|=1/2 isolates the second spectral cluster. The Riesz formulas for q,eq,e and their resolvent difference give

∥q−e∥≤δ1/2−δ<1:(19)\|q-e\| \le\frac{\delta}{1/2-\delta}<1: \tag{19}

the circle has length π\pi, the resolvent of ee has norm at most 22 there, and that of hh has norm at most (1/2−δ)−1(1/2-\delta)^{-1}.

Set v=qe+(1−q)(1−e)v=qe+(1-q)(1-e). Direct multiplication gives

ve=qv,v∗v=vv∗=1−(e−q)2.ve=qv,\qquad v^*v=vv^*=1-(e-q)^2.

The last operator is invertible by (19) and commutes with e,q,ve,q,v. Therefore

u=v(1−(e−q)2)−1/2∈A(20)u=v\bigl(1-(e-q)^2\bigr)^{-1/2}\in A \tag{20}

is unitary and ueu∗=queu^*=q. □\square

Theorem 5.2. Every projection e∈Cr∗(F(a,b))e\in C_r^*(\mathbb F(a,b)) has integer canonical trace. Consequently the only projections are 00 and 11.

Proof. Lemma 5.1 and traciality give τ(e)=τ(q)\tau(e)=\tau(q), which is integer by (17). Since 0≤τ(e)≤10\le\tau(e)\le1, it is 00 or 11. Faithfulness gives e=0e=0 in the first case and 1−e=01-e=0 in the second. □\square

This says nothing comparable about projections in matrix algebras over AA: diag⁡(1,0)∈M2(A)\operatorname{diag}(1,0)\in M_2(A) is already a nontrivial projection. Nor does it exclude projections in the von Neumann closure. The norm density and spectral-gap step above explain why the assertion concerns AA itself.

6. Exercises with complete solutions

Exercise 1. Check that the modified generator TaT_a is a permutation, including its exceptional inverse step.

Solution. Ordinary left multiplication sends a−1a^{-1} to the omitted ee, and ee to aa. After removing ee, replace these two steps by a−1↦aa^{-1}\mapsto a; every other input and output retains its ordinary predecessor. Thus the map is bijective on nonidentity words. Its inverse sends a↦a−1a\mapsto a^{-1} and every other word gg to a−1ga^{-1}g. Both preserve the orthonormal basis, giving inverse unitaries.

Exercise 2. Compute ϕa(e),ϕa(a−1),ϕa(a),ϕa(b)\phi_a(e),\phi_a(a^{-1}),\phi_a(a),\phi_a(b), and explain how the two maps in (3) fill H′H'.

Solution. These values are a,a−1,a2,baa,a^{-1},a^2,ba. The image of ϕa\phi_a consists exactly of words ending in a±1a^{\pm1}; the analogous image of ϕb\phi_b consists of those ending in b±1b^{\pm1}. Every nonidentity reduced word ends in exactly one of these two kinds, and (2) has a unique inverse on each. Thus (3) is a basis bijection and not merely an embedding.

Exercise 3. Compute the rank, trace and trace norm of D(λa)D(\lambda_a) on its finite-dimensional support.

Solution. Its only nonzero columns are the inputs δe,δa−1\delta_e,\delta_{a^{-1}}, with outputs δa,δe−δa\delta_a,\delta_e-\delta_a. These are linearly independent, giving rank 22. Every diagonal entry is zero, so its trace is zero. The Gram matrix of these columns is

(1−1−12).\begin{pmatrix}1&-1\\-1&2\end{pmatrix}.

Its eigenvalues are (3±5)/2(3\pm\sqrt5)/2, with sum 33 and product 11. The two singular values therefore have squared sum 33 and product 11, so their sum, the trace norm, is 5\sqrt5.

Exercise 4. Why does finite rank for the generators imply finite rank for every group word, without summing an infinite Fourier series?

Solution. Formula (8) expresses the difference for a product of two words as bounded operators multiplying their two differences. Finite-rank operators form a two-sided ideal, so induction on the finite word length proves the claim. The same formula bounds the rank by the sum of the generator difference ranks, hence 2ℓ(g)2\ell(g) for a nonempty reduced word. The identity has difference PP, of rank 11.

Exercise 5. Test (12) with x=1x=1. What error would omitting the term R(z)PR(z)P cause?

Solution. For z≠1z\ne1, R(z)=(z−1)−11R(z)=(z-1)^{-1}1, R′(z)=(z−1)−1pR'(z)=(z-1)^{-1}p, and their difference is (z−1)−1P(z-1)^{-1}P. Since D(1)=PD(1)=P and Pp=0Pp=0, the product R(z)D(1)R′(z)R(z)D(1)R'(z) is zero. The first term in (12) gives the entire difference. Omitting it would incorrectly identify the different units of the two representations.

Exercise 6. Does operator-norm density of group polynomials prove (14) by continuity of Tr⁡\operatorname{Tr}?

Solution. No. The trace is continuous for trace norm, and operator-norm convergence does not control that norm. Rank-NN projections divided by NN have operator norm 1/N1/N but trace 11. The proof instead computes every diagonal of the actual trace-class difference D(x)D(x), and uses its absolute diagonal sum.

Exercise 7. Compute (15) for two rank-one projections whose ranges make an angle 0<θ<π/20<\theta<\pi/2.

Solution. Choose unit vectors e1e_1 and cos⁡θ e1+sin⁡θ e2\cos\theta\,e_1+\sin\theta\,e_2. On their two-dimensional span the projection difference has trace zero and determinant −sin⁡2θ-\sin^2\theta, so its eigenvalues are ±sin⁡θ\pm\sin\theta. There is no 11 or −1-1 eigenspace. The generic pair cancels, giving trace zero. Adding an orthogonal one-dimensional summand to the range of the first projection adds one unmatched 11 eigenvalue and changes the trace to 11.

Exercise 8. Show that compactness, or even the Hilbert–Schmidt condition, cannot replace trace class in the trace calculation for projection differences.

Solution. Take the direct sum of the rank-one pairs from Exercise 7 with sin⁡θn=1/n\sin\theta_n=1/n, n≥2n\ge2. The difference has eigenvalues ±1/n\pm1/n, so is compact and Hilbert–Schmidt because ∑n2/n2<∞\sum_n2/n^2<\infty. It is not trace class because ∑n2/n=∞\sum_n2/n=\infty. The formal paired sum zero is not an absolutely convergent trace. Thus the trace in (15) would be undefined.

Exercise 9. With ∥h−e∥=0.1\|h-e\|=0.1, estimate the projection error and explain why (20) stays inside AA.

Solution. Formula (19) gives ∥q−e∥≤0.1/(0.5−0.1)=0.25\|q-e\|\le0.1/(0.5-0.1)=0.25. Thus 1−(e−q)21-(e-q)^2 is positive with spectrum in [1−0.252,1][1-0.25^2,1], so its inverse square root is obtained by the continuous functional calculus in AA. Multiplying it by v∈Av\in A gives u∈Au\in A. The algebraic identities in the proof make this operator a unitary that aligns the projections.

Exercise 10. Explain why the projection diag⁡(1,0)\operatorname{diag}(1,0) in M2(A)M_2(A) does not contradict Theorem 5.2.

Solution. The theorem concerns projections in AA. In M2(A)M_2(A), the indicated matrix is a nonzero projection different from the matrix identity. Its unnormalized matrix trace composed with τ\tau is 11, an integer, while its normalized trace is 1/21/2. Matrix amplification changes the unit's unnormalized trace from 11 to 22, so integrality no longer forces a projection to be 00 or the unit.

Reading and attribution

Thomas Schick, The trace on the K-theory of group C*-algebras, arXiv:math/9907121v5, Lemmas 2.6, 2.8 and 2.9, pp.7–11, supplies the actually read diagonal trace, nonunital resolvent and projection-difference methods. The source cites trace ideal facts and holomorphic-density K-theory results by reference. Here the full ordinary-Hilbert-space argument includes the explicit basis intertwiner, graph-norm closure, missing-unit resolvent term, absolute diagonal trace, eigenvalue pairing and unitary alignment of nearby projections. It does not require a K-theory computation.

Mihai Pimsner and Dan Voiculescu, K-groups of reduced crossed products by free groups, Journal of Operator Theory 8(1) (1982), 131–156, introduction pp.131–132, states projection absence. Those pages were actually visually read; its full K-theory proof is not claimed read or used here. The source distinguishes this published paper from an earlier preprint with a false key lemma.

The proof concerns projections in Cr∗(F(a,b))C_r^*(\mathbb F(a,b)) itself. Section 5 supplies the full spectral-gap and conjugacy argument, so mere norm density is not used as trace-norm continuity. Matrix projections and von Neumann projections remain distinct. Complete freely accessible compact spectral, trace-class and holomorphic functional calculus foundations are still pending; no source expression was imported.