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

Central sequences, fullness and free group factors

Written by GPT-6.1 Sol (OpenAI), Ultra. Course exposition: CC0-1.0 to the extent of rights held. Human comparison sources retain their own terms.

How much can two commutators reveal about an operator? In a free-group factor they bound its entire distance from the scalars. In the dyadic tensor factor RR, a unitary can instead escape into a later tensor position, commute asymptotically with every fixed operator, and stay a definite distance from every scalar.

We compute these examples first, then relate their behavior to the topology of automorphism groups, retaining the whole center for algebras that are not factors.

The problems are interleaved with the arguments they test. Every problem has its complete solution immediately below it. The foundations prove the normal-functional, faithful-state, metric, Borel-image and phase constructions, and the two factor constructions used here.

Two generators control the distance from the scalars

Let Γ=Fn\Gamma=\mathbb F_n, 2≤n≤∞2\leq n\leq\infty, and choose distinct generators a,ba,b. Its reduced words give the group operations; the free-word construction establishes the cancellation and uniqueness rules for every generator set. Put L(Γ)=λ(Γ)′′L(\Gamma)=\lambda(\Gamma)'', where λgδh=δgh\lambda_g\delta_h=\delta_{gh} on ℓ2(Γ)\ell^2(\Gamma).

FG1 constructs the faithful normal trace τ(x)=⟨δe,xδe⟩\tau(x)=\langle\delta_e,x\delta_e\rangle, proves separability of the predual, and proves the coefficient identity

∥x−τ(x)1∥22=∑g≠e∣x^(g)∣2,x^(g)=⟨δg,xδe⟩.(21)\|x-\tau(x)1\|_2^2=\sum_{g\ne e}|\widehat x(g)|^2, \qquad \widehat x(g)=\langle\delta_g,x\delta_e\rangle. \tag{21}

It also proves that an infinite countable ICC group gives a factor of type II1\mathrm{II}_1.

Here is the required ICC check. If g≠eg\ne e is not an aa-power, strip its maximal initial and final aa-runs to write g=arwasg=a^rwa^s, where ww is nonempty and neither endpoint is an aa-letter. For all sufficiently large positive kk, the conjugate akga−k=ak+rwas−ka^kga^{-k}=a^{k+r}wa^{s-k} has initial run of length k+rk+r and final negative run of length k−sk-s. Distinct such kk give distinct reduced words. If gg is a nonzero aa-power, its conjugates by positive bb-powers are distinct instead. Every nonidentity conjugacy class is therefore infinite.

Theorem 5.1. For every x∈L(Γ)x\in L(\Gamma),

∥x−τ(x)1∥2≤14max⁡{∥[x,λa]∥2,∥[x,λb]∥2}.(22)\|x-\tau(x)1\|_2 \le14\max\{\|[x,\lambda_a]\|_2,\|[x,\lambda_b]\|_2\}. \tag{22}

Proof. We prove the stronger bound 10δ10\delta, where δ=max⁡(∥[x,λa]∥2,∥[x,λb]∥2)\delta=\max(\|[x,\lambda_a]\|_2,\|[x,\lambda_b]\|_2). Let η\eta be the coefficient vector of x−τ(x)1x-\tau(x)1 on Γ∖{e}\Gamma\setminus\{e\}, and put r=∥η∥2r=\|\eta\|_2. For a set AA of nonidentity words, let PAP_A be the coordinate projection onto ℓ2(A)\ell^2(A). Conjugation by hh permutes this Hilbert basis; write the resulting unitary as ChC_h. FG1's coefficient identity gives

∥Chη−η∥2=∥[x,λh]∥2.\|C_h\eta-\eta\|_2=\|[x,\lambda_h]\|_2.

The values for h=bh=b and h=b−1h=b^{-1} agree, by applying the unitary CbC_b to their difference.

Let SS consist of words ending in aa or a−1a^{-1}. A word outside SS ends in a different letter; conjugating it by a−1a^{-1} leaves an aa at the right endpoint. Hence

S∪aSa−1=Γ∖{e}.(23)S\cup aSa^{-1}=\Gamma\setminus\{e\}. \tag{23}

In contrast, the sets

S,bSb−1,b−1Sb(24)S,\qquad bSb^{-1},\qquad b^{-1}Sb \tag{24}

are disjoint. The last two have respectively a final b−1b^{-1}-run and a final bb-run of length one. The terminal aa-letter prevents right cancellation, and left cancellation cannot pass that letter. These are the free-word geometric inputs.

Put t=∥PSη∥2t=\|P_S\eta\|_2 and th=∥PhSh−1η∥2t_h=\|P_{hSh^{-1}}\eta\|_2. Since PhSh−1Chη=ChPSηP_{hSh^{-1}}C_h\eta=C_hP_S\eta, the reverse triangle inequality on that coordinate subspace gives ∣th−t∣≤δ |t_h-t|\leq\delta for h=a,b,b−1h=a,b,b^{-1}. The cover in (23) controls the entire vector by two coordinate pieces, even if they overlap:

r2≤t2+ta2≤t2+(t+δ)2.(25)r^2\leq t^2+t_a^2\leq t^2+(t+\delta)^2. \tag{25}

The three projections in (24) have mutually orthogonal ranges. Pythagoras therefore gives the estimate in the other direction,

r2≥t2+tb2+tb−12≥t2+2max⁡{t−δ,0}2.(27)r^2\geq t^2+t_b^2+t_{b^{-1}}^2 \geq t^2+2\max\{t-\delta,0\}^2. \tag{27}

If δ=0\delta=0, these inequalities give 3t2≤r2≤2t23t^2\leq r^2\leq2t^2, so r=0r=0. Suppose δ>0\delta>0. For t<δt<\delta, (25) gives r2<5δ2r^2<5\delta^2. For t≥δt\geq\delta, combine (25) and (27) and expand to obtain

t2−6tδ+δ2≤0.t^2-6t\delta+\delta^2\leq0.

In particular t≤6δt\leq6\delta, and (25) gives r2≤(36+49)δ2=85δ2<100δ2r^2\leq(36+49)\delta^2=85\delta^2<100\delta^2. Thus r≤10δ≤14δr\leq10\delta\leq14\delta in every case. Equation (21) identifies rr with the distance in (22). □\square

Exercise 7. Decide whether the cover (23) needs disjoint sets. State and justify the direction of the measure inequality it supplies; compare it with the three-set estimate.

Solution. For comparison with measures, set μ(A)=∥PAη∥22=∑g∈A∣x^(g)∣2\mu(A)=\|P_A\eta\|_2^2=\sum_{g\in A}|\widehat x(g)|^2 and k=μ(Γ∖{e})=r2k=\mu(\Gamma\setminus\{e\})=r^2. The word aa lies in SS and in aSa−1aSa^{-1}, because conjugating aa by aa leaves it unchanged. This overlap is allowed. The cover gives

k=μ(S∪aSa−1)≤μ(S)+μ(aSa−1),k=\mu(S\cup aSa^{-1})\leq\mu(S)+\mu(aSa^{-1}),

which is exactly the first inequality in (25). The three sets in (24) are pairwise disjoint subsets of the total space. Their measures therefore add without overlap, and their sum is at most kk, as in (27). The cover supplies a lower bound on the sum of two squared coordinate norms; disjointness supplies an upper bound on the sum of three. Neither inequality may be reversed. Their combination, with the coordinate norm error at most δ\delta, yields the scalar-distance bound.

Exercise 8. Suppose the aa-commutator has 22-norm at most 10−310^{-3}, and the bb-commutator has 22-norm at most 2⋅10−32\cdot10^{-3}. Find the certified scalar approximation, including its error, and prove that its scalar minimizes the 22-norm distance.

Solution. The larger commutator bound is 0.0020.002, hence (22) gives ∥x−τ(x)1∥2≤14(0.002)=0.028\|x-\tau(x)1\|_2\leq14(0.002)=0.028. For every c∈Cc\in\mathbb C, expanding the trace and using τ(x−τ(x)1)=0\tau(x-\tau(x)1)=0 gives

∥x−c1∥22=∥x−τ(x)1∥22+∣c−τ(x)∣2.\|x-c1\|_2^2 =\|x-\tau(x)1\|_2^2+|c-\tau(x)|^2.

The second term has its unique minimum at c=τ(x)c=\tau(x). Equivalently, this is orthogonal projection onto C1\mathbb C1 in the trace Hilbert space.

A tensor tail defeats any scalar approximation

FG2 constructs RR from M2nM_{2^n}, their normalized traces and their tracial Hilbert completion. It proves trace faithfulness, factoriality, type II1\mathrm{II}_1, separable predual and the bounded approximation ∥En(x)−x∥2→0\|E_n(x)-x\|_2\to0 by the first nn tensor positions. These properties follow from the local matrix construction itself.

Let zmz_m put diag⁡(1,−1)\operatorname{diag}(1,-1) at position mm. If m>nm>n, it commutes with En(x)E_n(x), so

∥[zm,x]∥2≤2∥x−En(x)∥2.\|[z_m,x]\|_2\leq2\|x-E_n(x)\|_2.

Given xx, first choose nn to make the right side small and then take m>nm>n. Also τ(zm)=0\tau(z_m)=0 and zmz_m is unitary, whence

∥zm−c1∥22=1+∣c∣2.(28)\|z_m-c1\|_2^2=1+|c|^2. \tag{28}

This gives the opposite of the free-group estimate. Below we show why the distinction is exactly a failure of fullness.

Exercise 9. Allow the scalar approximant to vary with mm. Prove that the tensor-tail unitaries still form a nontrivial sequence, including the passage from 22-norm to bounded strong* convergence.

Solution. The trace of each zmz_m is zero, and τ(zm∗zm)=1\tau(z_m^*z_m)=1. Thus any choice cm∈Cc_m\in\mathbb C satisfies ∥zm−cm1∥22=1+∣cm∣2≥1\|z_m-c_m1\|_2^2=1+|c_m|^2\geq1. If the scalar approximants are bounded, the differences are bounded too. NT2 proves that bounded intrinsic strong* convergence forces trace 22-norm convergence, by using the trace as a test; the latter is impossible here. Since FG2 proves Z(R)=C1Z(R)=\mathbb C1, this excludes every allowed bounded central approximating sequence.

Which commutators test a sequence?

For ω∈M∗\omega\in M_*, fix the module convention

(xω)(y)=ω(yx),(ωx)(y)=ω(xy),[x,ω]=xω−ωx.(1)(x\omega)(y)=\omega(yx),\qquad (\omega x)(y)=\omega(xy),\qquad [x,\omega]=x\omega-\omega x. \tag{1}

A norm-bounded sequence is centralizing when ∥[xn,ω]∥→0\|[x_n,\omega]\|\to0 for every ω∈M∗\omega\in M_*. It is central when [xn,a]→0[x_n,a]\to0 intrinsic strong* for every a∈Ma\in M. Here intrinsic strong* on bounded sets tests both ∥x∥ψ=ψ(x∗x)1/2\|x\|_\psi=\psi(x^*x)^{1/2} and ∥x∗∥ψ\|x^*\|_\psi for every positive normal ψ\psi. A sequence is trivial when xn−an→0x_n-a_n\to0 in that topology for a bounded sequence an∈Z(M)a_n\in Z(M).

Lemma 1.1. Every centralizing sequence is central. If MM has a faithful normal state φ\varphi, a central sequence is centralizing whenever ∥[xn,φ]∥→0\|[x_n,\varphi]\|\to0.

Proof. For fixed x,ax,a and positive normal ψ\psi, put c=xa−axc=xa-ax. Expanding (1) gives the exact identity

ψ(c∗c)=[x,aψ](a∗x∗−x∗a∗)+[x,ψ](x∗a∗a−a∗x∗a).\psi(c^*c) =[x,a\psi](a^*x^*-x^*a^*) +[x,\psi](x^*a^*a-a^*x^*a).

The first test variable has norm at most 2∥a∥∥x∥2\|a\|\|x\|, and the second at most 2∥a∥2∥x∥2\|a\|^2\|x\|. Therefore

ψ([x,a]∗[x,a])≤2∥x∥∥a∥∥[x,aψ]∥+2∥x∥∥a∥2∥[x,ψ]∥.(2)\psi([x,a]^*[x,a]) \leq2\|x\|\|a\|\|[x,a\psi]\| +2\|x\|\|a\|^2\|[x,\psi]\|. \tag{2}

NT1 supplies the bounded module functionals appearing here. If the sequence is centralizing and bounded, both terms tend to zero. The functional involution ω∗(y)=ω(y∗)‾\omega^*(y)=\overline{\omega(y^*)} satisfies

[x,ω]∗=−[x∗,ω∗],∥[x∗,ω]∥=∥[x,ω∗]∥.(3)[x,\omega]^*=-[x^*,\omega^*], \qquad \|[x^*,\omega]\|=\|[x,\omega^*]\|. \tag{3}

It follows that xn∗x_n^* is centralizing as well. Apply (2) with xn∗,a∗x_n^*,a^* to obtain the adjoint seminorm of the original commutator. Both tests now vanish.

For the state converse, NT1 proves that MφM\varphi is norm dense in M∗M_* when φ\varphi is faithful. The identity

[xn,aφ]=[xn,a]φ+a[xn,φ](4)[x_n,a\varphi]=[x_n,a]\varphi+a[x_n,\varphi] \tag{4}

reduces the dense family to the assumed two kinds of convergence. Indeed Schwarz gives

∥bφ∥≤φ(1)1/2∥b∥φ.(5)\|b\varphi\|\leq\varphi(1)^{1/2}\|b\|_\varphi. \tag{5}

Centrality makes the first term of (4) tend to zero; the stated state-commutator assumption controls the second. If sup⁡n∥xn∥=C\sup_n\|x_n\|=C, the estimate ∥[xn,ω]∥≤2C∥ω∥\|[x_n,\omega]\|\leq2C\|\omega\| extends convergence from MφM\varphi to its norm closure. □\square

Exercise 1. Prove the product rule for convention (1). Give a matrix example showing why a vanishing commutator with one faithful state, without centrality, does not suffice.

Solution. At a test element tt,

x[y,ω](t)=ω(txy)−ω(ytx),[x,ω]y(t)=ω(ytx)−ω(xyt).\begin{aligned} x[y,\omega](t)&=\omega(txy)-\omega(ytx),\\ [x,\omega]y(t)&=\omega(ytx)-\omega(xyt). \end{aligned}

Adding cancels the middle values and gives

[xy,ω]=x[y,ω]+[x,ω]y.(7)[xy,\omega]=x[y,\omega]+[x,\omega]y. \tag{7}

In M2(C)M_2(\mathbb C), take x=diag⁡(1,−1)x=\operatorname{diag}(1,-1) and the faithful normalized trace. Traciality makes [x,τ]=0[x,\tau]=0, but xe12−e12x=2e12≠0xe_{12}-e_{12}x=2e_{12}\ne0. The constant sequence xn=xx_n=x is not central. Lemma 1.1's first implication then shows it is not centralizing either. The state test alone misses this obstruction.

Exercise 2. Show that MφM\varphi is norm dense for a faithful normal state. For a nonfaithful state, identify an explicit nonzero annihilator and the exact support obstruction.

Solution. The concrete duality M=(M∗)∗M=(M_*)^* is proved in CP. A dual element yy annihilating MφM\varphi obeys φ(ya)=0\varphi(ya)=0 for all a∈Ma\in M. Testing a=y∗a=y^* gives φ(yy∗)=0\varphi(yy^*)=0, so faithfulness gives y=0y=0. If the norm closure were proper, Hahn–Banach would supply a nonzero annihilator; thus the closure is all of M∗M_*. For a nonfaithful φ\varphi, NT4 constructs p=s(φ)≠1p=s(\varphi)\ne1 with φ(1−p)=0\varphi(1-p)=0. Schwarz gives φ((1−p)a)=0\varphi((1-p)a)=0 for every aa. Hence y=1−p≠0y=1-p\ne0 annihilates MφM\varphi, and the norm closure is proper. The support being one is equivalent to faithfulness, so this is precisely the obstruction.

Corollary 1.2. In every finite von Neumann algebra, central and centralizing bounded sequences coincide. No separability or countable decomposition is required.

Proof. In the presence of a faithful normal tracial state, the additional state commutator in Lemma 1.1 is zero, so centrality implies centralizing. For the general finite case, the complete FCT0–7 construction gives the faithful normal center-valued trace TZ:M→Z(M)T_Z:M\to Z(M). Its projection and central-corner inputs PC0–7 are retained in the same component; neither proof requires countable decomposition. Fix 0≠ψ∈M∗+0\ne\psi\in M_*^+ and use NT4 on the center to obtain z=s(ψ∣Z(M))z=s(\psi|_{Z(M)}). The functional

τz(x)=ψ(TZ(x))ψ(z),x∈Mz,(6)\tau_z(x)=\frac{\psi(T_Z(x))}{\psi(z)},\qquad x\in Mz, \tag{6}

is normal and tracial. It is faithful because both the trace map and ψ∣Z(M)z\psi|_{Z(M)z} are faithful. Its value at the corner unit zz is one. The bounded central sequence zxnzx_n is therefore centralizing in MzMz, by the state case. NT4 also gives ψ(y)=ψ(zyz)\psi(y)=\psi(zyz). Since zz is central, evaluating the predual commutator against yy is the same as evaluating the corner commutator against zyzzyz; this compression has norm at most ∥y∥\|y\|. Thus ∥[xn,ψ]∥→0\|[x_n,\psi]\|\to0. NT1's four-positive decomposition extends the assertion to every normal functional. Lemma 1.1 gives the reverse implication on any algebra. □\square

Before using unitary sequences, note that centralizing bounded sequences form a unital C-star algebra in ℓ∞(N,M)\ell^\infty(\mathbb N,M). Equation (3) handles adjoints, (7) handles products, and the 2C2C-commutator estimate handles norm limits. CF's continuous calculus therefore stays inside this algebra. For a centralizing self-adjoint contraction hnh_n,

wn=hn+i(1−hn2)1/2(8)w_n=h_n+i(1-h_n^2)^{1/2} \tag{8}

is a centralizing unitary with real part hnh_n. Taking real and imaginary parts of any bounded sequence, scaling by a common bound and using (8), expresses it as a linear combination of four centralizing unitary sequences, with fixed bounded coefficients.

Automorphisms and their implementing cosets

Assume M∗M_* is separable and M≠0M\ne0. NT2 constructs a faithful normal state φ\varphi and proves that its two bounded seminorms give intrinsic strong*. For an arbitrary separable Banach space XX, choose (ξj)(\xi_j) dense in its unit ball. On its surjective linear isometries use

d(S,T)=∑j≥12−j(∥Sξj−Tξj∥+∥S−1ξj−T−1ξj∥).(9)d(S,T)=\sum_{j\geq1}2^{-j} \bigl(\|S\xi_j-T\xi_j\|+\|S^{-1}\xi_j-T^{-1}\xi_j\|\bigr). \tag{9}

The sum is finite, and its coordinates separate the maps. Coordinate convergence is equivalent to pointwise norm convergence of maps and inverses, by their common isometric bound; tails of the sum are uniformly bounded.

A Cauchy sequence has pointwise isometric limits S,RS,R for the maps and inverses. The equality ∥SnRξ−ξ∥=∥Rξ−Sn−1ξ∥\|S_nR\xi-\xi\|=\|R\xi-S_n^{-1}\xi\| and passage to the limit give SR=1SR=1; exchanging the roles gives RS=1RS=1. Thus (9) is complete. Its coordinate embedding lies in a countable product of separable metric spaces, which TS1 makes second countable; its subspace is separable. The estimate for compositions of two isometries proves joint continuity of multiplication. If Sn→SS_n\to S pointwise and SS is onto, ∥Sn−1ξ−S−1ξ∥=∥ξ−SnS−1ξ∥→0\|S_n^{-1}\xi-S^{-1}\xi\|=\|\xi-S_nS^{-1}\xi\|\to0, which also proves continuity of inversion. The isometry group is Polish.

Give Aut⁡(M)\operatorname{Aut}(M) its uu-topology,

αn→α ⟺ ∥ω∘αn−ω∘α∥→0(ω∈M∗).(10)\alpha_n\to\alpha\ \Longleftrightarrow\ \|\omega\circ\alpha_n-\omega\circ\alpha\|\to0 \quad(\omega\in M_*). \tag{10}

For Tαω=ω∘α−1T_\alpha\omega=\omega\circ\alpha^{-1}, composition shows Tαβ=TαTβT_{\alpha\beta}=T_\alpha T_\beta. The map is injective and takes values in the isometry group of M∗M_*.

Lemma 2.1. This image is closed. Consequently Aut⁡(M)\operatorname{Aut}(M) is a Polish group, with a complete metric obtained from (9).

Proof. Suppose TαnT_{\alpha_n} converges to a surjective isometry TT. Its inverse also converges pointwise. Put β=(T−1)∗\beta=(T^{-1})^*, γ=T∗\gamma=T^*. Concrete predual duality makes these inverse normal linear maps on MM. Their pointwise ultraweak limits are respectively αn,αn−1\alpha_n,\alpha_n^{-1}. Vector tests on every finite matrix level show that these limits remain unital completely positive. NT1 proves Schwarz from a positive 2×22\times2 block. Applying it successively gives

x∗x=γβ(x∗x)≥γ(β(x)∗β(x))≥x∗x.x^*x=\gamma\beta(x^*x) \geq\gamma(\beta(x)^*\beta(x)) \geq x^*x.

The two positive differences vanish. Injectivity of γ\gamma forces β(x∗x)=β(x)∗β(x)\beta(x^*x)=\beta(x)^*\beta(x). Polarize this equality using x+yx+y and x+iyx+iy to get β(x∗y)=β(x)∗β(y)\beta(x^*y)=\beta(x)^*\beta(y). Positivity preserves adjoints, so β\beta is a star homomorphism; γ\gamma is its normal inverse. Thus T=TβT=T_\beta, proving closedness. A closed subspace of the complete metric space is complete. The preceding inverse-coordinate identity shows that the induced topology is exactly (10). □\square

For the unitaries put

D(u,v)=∥u−v∥φ+∥u∗−v∗∥φ.(11)D(u,v)=\|u-v\|_\varphi+\|u^*-v^*\|_\varphi. \tag{11}

Faithfulness makes this a metric, and NT2 identifies its topology with bounded intrinsic strong*. In the faithful GNS representation, a bounded family converging on Ω\Omega converges strongly on the dense orbit M′ΩM'\Omega, by commutation, and hence on the whole Hilbert space. This justifies both seminorm tests. For a unitary limit, strong convergence alone also controls adjoints:

(un∗−u∗)ξ=un∗(u−un)u∗ξ.(12)(u_n^*-u^*)\xi=u_n^*(u-u_n)u^*\xi. \tag{12}

NT2 proves separability of this GNS Hilbert space. Evaluations of operators and adjoints on a countable dense set embed the bounded strong* topology into a countable product of separable Hilbert spaces. The unitary group is consequently separable.

Lemma 2.2. Metric (11) is complete, and

U(M)/U(Z(M))(13)\mathcal U(M)/\mathcal U(Z(M)) \tag{13}

is a Polish group with the complete quotient metric

ρ(u U(Z),v U(Z))=inf⁡z∈U(Z)D(u,vz).(14)\rho(u\,\mathcal U(Z),v\,\mathcal U(Z)) =\inf_{z\in\mathcal U(Z)}D(u,vz). \tag{14}

Proof. A DD-Cauchy sequence gives Cauchy values unΩ,un∗Ωu_n\Omega,u_n^*\Omega. Commuting with M′M' extends these to Cauchy vectors on its dense orbit; the norm-one bound extends the limits to all vectors. Strong closedness puts the bounded limits u,wu,w in MM. Passing to the Hilbert pairing shows w=u∗w=u^*. Strong continuity of multiplication on bounded sets then gives u∗u=uu∗=1u^*u=uu^*=1, so the limit is unitary and the metric complete.

Right multiplication by a central unitary preserves both terms of DD: for a difference xx, it leaves x∗xx^*x and xx∗xx^* unchanged. Consequently (14) does not depend on representatives. Aligning representatives for two consecutive distances proves its triangle inequality; reversing the alignment proves symmetry. If ρ=0\rho=0, choose znz_n with vzn→uvz_n\to u strong*. Then zn→v∗uz_n\to v^*u, and the strong* closed central unitary group contains this limit. Thus the cosets are equal. The image of a DD-ball is exactly the corresponding ρ\rho-ball; the quotient map is open because its full preimage is the union of central translates of that ball. Hence this is the quotient topology. From a ρ\rho-Cauchy sequence choose a subsequence whose consecutive distances are less than 2−j−22^{-j-2}. Successive central adjustments give representatives with DD-increments less than 2−j−12^{-j-1}. Completeness gives a representative limit, then a coset limit. The entire Cauchy sequence converges by the triangle inequality. The quotient is separable, and its group operations are continuous: products and inversion descend through the open quotient map and the subgroup is normal. □\square

The quotient-metric argument applies to a complete metric invariant under right multiplication by any closed subgroup, with left cosets as its orbits. Complete metrizability of a Polish group also implies completeness for its two-sided group uniformity. Exercise 4 proves that implication and distinguishes it from one-sided completeness.

Exercise 3. Construct unitaries converging strongly to a nonunitary on ℓ2(N0)\ell^2(\mathbb N_0). Show that they are strong Cauchy and that their adjoints fail the metric (11) for a faithful diagonal state.

Solution. Let unu_n cycle e0,…,ene_0,\ldots,e_n forward, taking ene_n to e0e_0, and fix eje_j for j>nj>n. On each fixed finite-support vector, eventually this agrees with the unilateral shift Sej=ej+1S e_j=e_{j+1}. The norm-one bound extends the convergence to every vector, so un→Su_n\to S strongly and is strong Cauchy. The range of SS omits e0e_0, so the limit is not unitary. However un∗e0=enu_n^*e_0=e_n. For n≠mn\ne m these vectors have squared distance two. For the faithful normal state φ(x)=∑j≥02−j−1⟨ej,xej⟩\varphi(x)=\sum_{j\geq0}2^{-j-1}\langle e_j,xe_j\rangle, the adjoint term satisfies ∥un∗−um∗∥φ2≥2−1∥en−em∥2=1\|u_n^*-u_m^*\|_\varphi^2\geq2^{-1}\|e_n-e_m\|^2=1. Thus the sequence fails to be DD-Cauchy. Both convergence tests are necessary for completeness.

Exercise 4. Explain the role of centrality in the quotient metric. State what completeness of a compatible metric permits one to infer about the two-sided group uniformity.

Solution. If zz is central unitary and x=u−vx=u-v, then (xz)∗(xz)=x∗x(xz)^*(xz)=x^*x and (xz)(xz)∗=xx∗(xz)(xz)^*=xx^*. For a noncentral right multiplier, the first expression becomes z∗x∗xzz^*x^*xz; a general faithful state changes under this conjugation. For a left multiplier the other square instead changes. Central multipliers therefore give the simultaneous invariance used to align representatives in (14).

A Polish group is complete for its two-sided group uniformity: a sequence (gj)(g_j) is Cauchy for that uniformity when both gj−1gkg_j^{-1}g_k and gjgk−1g_jg_k^{-1} tend to one uniformly over pairs of sufficiently large indices. This is called Raikov completeness. A compatible complete metric need not be invariant, so we prove the implication rather than identify its Cauchy sequences with the group-uniformity Cauchy sequences.

First construct a bounded compatible left-invariant metric. Choose symmetric identity neighborhoods V0=G,V1,V2,…V_0=G,V_1,V_2,\ldots, forming a neighborhood base and satisfying Vn+13⊂VnV_{n+1}^3\subset V_n. Such a sequence is obtained successively from a countable base and continuity of multiplication and inversion. Define

dL(g,h)=inf⁡{∑i=1m2−ni:g−1h=v1⋯vm,vi∈Vni}.d_L(g,h)=\inf\left\{\sum_{i=1}^m2^{-n_i}: g^{-1}h=v_1\cdots v_m,\quad v_i\in V_{n_i}\right\}.

The empty product has cost zero. Every other group element has a factorization of cost at most one, using V0V_0. Reversing a factorization and taking inverses proves symmetry; concatenating factorizations proves the triangle inequality. Left invariance follows from the occurrence of g−1hg^{-1}h.

Here is the bound that prevents this infimum from collapsing. If an ordered product has total cost less than 2−n2^{-n}, its product lies in VnV_n. Prove this by induction on the number of factors, simultaneously for every nn. For one factor the assertion follows from nesting. For more factors, choose a factor at a weighted median: the total costs strictly before and strictly after it are each at most half the total. By induction both surrounding products belong to Vn+1V_{n+1}. The middle factor also belongs to Vn+1V_{n+1}, since its own cost is less than 2−n2^{-n}. The three-factor inclusion gives the assertion. Empty surrounding products cause no exception. Consequently

Vn+1⊂BdL(1,2−n)⊂Vn.V_{n+1}\subset B_{d_L}(1,2^{-n})\subset V_n.

Their intersection is {1}\{1\}, so dLd_L separates points and induces the group topology.

Let XX be the metric completion of (G,dL)(G,d_L). Explicitly, identify two Cauchy sequences when their pointwise distances tend to zero and define distance between classes by the limit of those distances. The triangle inequality makes the limit and equivalence well defined; constant sequences embed GG densely. A Cauchy sequence of classes has a subsequence with successive distances below 2−j2^{-j}. Choose representatives from GG within 2−j2^{-j} of those classes. They are Cauchy and define the required limit class; the original Cauchy sequence then has the same limit. This proves completeness. A countable dense subset of GG remains dense in XX, so XX is separable.

The surjective isometry group of any complete separable metric space (X,dX)(X,d_X) is Polish. To verify this without a completeness assumption about a group uniformity, choose a dense sequence (ξj)(\xi_j) and use

dI(S,T)=∑j≥12−j(min⁡{1,dX(Sξj,Tξj)}+min⁡{1,dX(S−1ξj,T−1ξj)}).d_I(S,T)=\sum_{j\geq1}2^{-j} \left(\min\{1,d_X(S\xi_j,T\xi_j)\} +\min\{1,d_X(S^{-1}\xi_j,T^{-1}\xi_j)\}\right).

The common isometry bound extends coordinate convergence and coordinate Cauchy convergence to every point of XX. For a Cauchy sequence, completeness of XX gives pointwise isometric limits S,RS,R for the maps and inverses. The equality

dX(SnRξ,ξ)=dX(Rξ,Sn−1ξ)d_X(S_nR\xi,\xi)=d_X(R\xi,S_n^{-1}\xi)

gives SR=1SR=1; exchanging maps and inverses gives RS=1RS=1. Thus the limit is a surjective isometry. Uniformly bounded tails of the displayed sum prove convergence in dId_I. Its coordinate embedding in XN×XNX^{\mathbb N}\times X^{\mathbb N} gives second countability and separability by TS1. Inversion swaps the two coordinate families; the triangle inequality and the isometry bound prove continuity of composition. This proves the assertion about the isometry group.

Left translation by gg is a surjective isometry of (G,dL)(G,d_L), and hence extends uniquely to a surjective isometry LgL_g of XX. These maps give a faithful homomorphism. For x∈Gx\in G,

dL(gx,hx)=dL(1,x−1g−1hx).d_L(gx,hx)=d_L(1,x^{-1}g^{-1}hx).

Continuity of conjugation, also for the inverse-coordinate maps, proves continuity into the isometry group on this dense subset. The common isometry bound extends it to all of XX. Evaluation at 1∈G1\in G recovers the metric dL(g,h)d_L(g,h), so this embedding induces exactly the original topology on GG.

We need its image to be closed. Let HH be the closure of the image in the complete isometry group; this is a Polish group. Identify GG with its image and let d0d_0 be a compatible complete metric on GG. For every nn, let OnO_n be the union of the open subsets UU of HH for which the d0d_0-diameter of U∩GU\cap G is less than 2−n2^{-n}. Compatibility of the topologies gives G⊂OnG\subset O_n. In fact

G=⋂nOn.G=\bigcap_n O_n.

For a point hh in the intersection, choose such a neighborhood UnU_n containing hh, and choose gj∈Gg_j\in G in U1∩⋯∩UjU_1\cap\cdots\cap U_j and within 1/j1/j of hh in a metric of HH. Density permits every choice. For j,k≥nj,k\geq n, both points lie in UnU_n, so (gj)(g_j) is d0d_0-Cauchy. It converges to a point of GG; compatibility and uniqueness of its limit in HH identify that point with hh. This proves the equality. Each OnO_n is open and dense in HH, so GG is comeager there. Every translate hGhG is also comeager. The Baire theorem TS5 gives a point in G∩hGG\cap hG, whence h∈GG−1=Gh\in GG^{-1}=G. Thus G=HG=H, proving closedness.

Now let (gj)(g_j) be two-sided Cauchy. For every x∈Gx\in G, the preceding conjugation formula makes (Lgjx)(L_{g_j}x) Cauchy in XX. Applying it to gj−1,gk−1g_j^{-1},g_k^{-1} uses gjgk−1g_jg_k^{-1} and makes the inverse-coordinate sequence Cauchy as well. Density and the common isometry bound extend both assertions to every x∈Xx\in X. Thus (Lgj)(L_{g_j}) is dId_I-Cauchy. It converges in the isometry group, and the closed-image result puts the limit in GG. The embedding then gives convergence in the original group topology.

This also proves completeness for Cauchy filters, the uniform-space formulation. The identity has a countable neighborhood base. From a Cauchy filter choose nested filter members whose pairs lie in the first nn basic two-sided entourages, and choose a point in each member. The resulting sequence is two-sided Cauchy and converges by the argument just given. For any entourage choose a smaller one whose square lies in it; one sufficiently small filter member and a sufficiently late chosen point then put that entire member in the prescribed neighborhood of the limit. Hence the filter converges.

One-sided completeness is different. In Exercise 3, the unitary cycles satisfy

∥(uj∗uk−1)ξ∥=∥(uk−uj)ξ∥⟶0\|(u_j^*u_k-1)\xi\|=\|(u_k-u_j)\xi\|\longrightarrow0

uniformly over late pairs for every fixed vector. For a unitary ww, ∥(w∗−1)ξ∥=∥(w−1)ξ∥\|(w^*-1)\xi\|=\|(w-1)\xi\|, so these relative unitaries tend to one in the group topology. The sequence is left Cauchy. The opposite relative differences test the adjoints, which fail to be Cauchy on e0e_0. Its strong limit is the unilateral shift, outside the unitary group; it therefore has no group limit. This gives a Polish group whose left uniformity is incomplete. Inversion gives the corresponding right-uniformity example. The direct lifting proof below uses summable increments in both faithful-state seminorms.

For implementers, the module convention gives

∥ω∘Ad⁡u−ω∥=∥[u,ω]∥.(15)\|\omega\circ\operatorname{Ad}u-\omega\|=\|[u,\omega]\|. \tag{15}

Indeed ω∘Ad⁡u=u∗ωu\omega\circ\operatorname{Ad}u=u^*\omega u; left multiplication by uu is a predual isometry and turns its difference from ω\omega into ωu−uω\omega u-u\omega. The map u↦Ad⁡uu\mapsto\operatorname{Ad}u is continuous. At one, Schwarz bounds [u,φ][u,\varphi] by φ(1)1/2(∥u−1∥φ+∥u∗−1∥φ)\varphi(1)^{1/2}(\|u-1\|_\varphi+\|u^*-1\|_\varphi). Equation (4) treats aφa\varphi, and their norm density and uniform module bound treat every normal functional. Translation proves continuity everywhere. Its kernel consists exactly of the central unitaries.

Why the quotient map has a continuous inverse when its image is closed

Lemma 3.1. If AA is nonmeager and has the Baire property in a Polish group KK, then AA−1AA^{-1} contains a neighborhood of 11.

Proof. The Baire property gives a nonempty open OO on which AA is comeager. Choose a0∈Oa_0\in O. For k∈Oa0−1k\in Oa_0^{-1}, the point ka0ka_0 lies in O∩kOO\cap kO, so this intersection is nonempty and open. TS5 proves that a nonempty open subset of a Polish space is not meager. The exceptions to membership in AA and in kAkA form a meager set there. Some point therefore has the form a=kba=kb, with a,b∈Aa,b\in A. Then k=ab−1k=ab^{-1}, and the open neighborhood Oa0−1Oa_0^{-1} of one lies in AA−1AA^{-1}. □\square

Theorem 3.2. A continuous bijective homomorphism between Polish groups is a homeomorphism.

Proof. For a neighborhood VV of one in GG, continuity of group operations provides an open neighborhood WW with WW−1⊂VWW^{-1}\subset V. Separability gives a countable translate cover of GG by WW: a dense set meets every translate of W−1W^{-1}. Its images cover KK. TS5's Baire theorem excludes all those translates being meager, so f(W)f(W) is nonmeager. TS4 proves the Borel-image theorem for an injective Borel map on any Polish domain; apply it to this continuous bijection and the open Borel set WW. Thus f(W)f(W) is Borel, and TS5 proves that it has the Baire property. Lemma 3.1 gives a neighborhood of one inside f(W)f(W)−1⊂f(V)f(W)f(W)^{-1}\subset f(V). Translating proves that ff is open. Bijectivity then turns openness into continuity of the inverse. These inputs are proved for all Polish groups; no invariant complete metric or local compactness is assumed. □\square

Lifting convergent inner automorphisms

An algebra is full if its inner automorphism group Int⁡(M)\operatorname{Int}(M) is closed in Aut⁡(M)\operatorname{Aut}(M) for (10).

Theorem 4.1. For every von Neumann algebra with separable predual, the following are equivalent:

  1. MM is full.
  2. Every bounded centralizing sequence is trivial.
  3. Whenever Ad⁡un→id\operatorname{Ad}u_n\to\mathrm{id}, there are central unitaries znz_n with D(un,zn)→0D(u_n,z_n)\to0.

Proof. For the zero algebra each group is a singleton and each sequence is zero, so all three assertions hold. Suppose M≠0M\ne0. If the inner subgroup is closed, Lemma 2.1 makes it Polish. Lemma 2.2 gives a Polish domain for the induced continuous bijection U(M)/U(Z(M))→Int⁡(M)\mathcal U(M)/\mathcal U(Z(M))\to\operatorname{Int}(M). Theorem 3.2 makes this bijection a homeomorphism. An implementing sequence for automorphisms tending to the identity has coset distance tending to zero. Choose central unitaries within an error 1/n1/n of those infima to obtain assertion 3.

Equation (15) identifies the sequences in assertion 3 as the centralizing unitary sequences. The four-unitary decomposition (8) then replaces each term of any bounded centralizing sequence by the same fixed linear combination of bounded central unitary approximants. The errors tend to zero in both seminorms, proving assertion 2.

Conversely, assertion 2 gives bounded an∈Z(M)a_n\in Z(M) with un−an→0u_n-a_n\to0 intrinsic strong* whenever unu_n is centralizing and unitary. NT3 constructs the central phase znz_n, taking phase one on the zero support, and proves both squared operator inequalities from the scalar bound

∣phase⁡(a)−w∣≤2∣a−w∣(∣w∣=1).(16)|\operatorname{phase}(a)-w|\leq2|a-w|\qquad(|w|=1). \tag{16}

It does so by bounded polar operators and continuous approximants, including the zero-support case. Applying φ\varphi gives D(un,zn)→0D(u_n,z_n)\to0, which is assertion 3.

To finish, assume assertion 3 and let θ\theta be in the closure of the inner subgroup. Metrizability turns assertion 3 into continuity at one of the inverse implementing-coset map. In particular, for a faithful positive normal functional ψ\psi and ε>0\varepsilon>0, there is an identity neighborhood W\mathcal W in the uu-topology such that

Ad⁡v∈W ⟹ inf⁡z∈U(Z(M))(∥v−z∥ψ+∥v∗−z∗∥ψ)<ε.(17)\operatorname{Ad}v\in\mathcal W \ \Longrightarrow\ \inf_{z\in\mathcal U(Z(M))} (\|v-z\|_\psi+\|v^*-z^*\|_\psi)<\varepsilon. \tag{17}

If no such neighborhood existed, a decreasing countable base would give a sequence contradicting assertion 3, because NT2 identifies the bounded topology for both faithful functionals.

Set ψ=φ+φ∘θ\psi=\varphi+\varphi\circ\theta. Choose a sequence Ad⁡vn→θ\operatorname{Ad}v_n\to\theta whose consecutive relative automorphisms lie in the neighborhoods for ε=2−n\varepsilon=2^{-n}, and also satisfy

∥φ∘Ad⁡vn+1−φ∘θ∥<4−n.(18)\|\varphi\circ\operatorname{Ad}v_{n+1}-\varphi\circ\theta\|<4^{-n}. \tag{18}

For precision, start with any convergent implementing sequence. For each predetermined neighborhood, the convergence and continuous group operations supply a common threshold for both indices of a relative automorphism. Choose the nn-th subsequence index above the thresholds for neighborhoods n−1,nn-1,n, and above the functional threshold for 4−(n−1)4^{-(n-1)}. This makes all successive choices simultaneous.

Choose central cnc_n with

yn=cn−vn+1∗vn,∥yn∥ψ+∥yn∗∥ψ<2−n.y_n=c_n-v_{n+1}^*v_n,\qquad \|y_n\|_\psi+\|y_n^*\|_\psi<2^{-n}.

Define γ1=1\gamma_1=1, γn+1=cnγn\gamma_{n+1}=c_n\gamma_n, and un=vnγnu_n=v_n\gamma_n. Its difference is vn+1ynγnv_{n+1}y_n\gamma_n. The central unitary γn\gamma_n cancels from both squared seminorms. Thus

∥un+1−un∥φ2=φ(yn∗yn)<4−n.(19)\|u_{n+1}-u_n\|_\varphi^2 =\varphi(y_n^*y_n)<4^{-n}. \tag{19}

For the other square use (18), ∥yn∥≤2\|y_n\|\leq2, and the φ∘θ\varphi\circ\theta part of ψ\psi:

∥(un+1−un)∗∥φ2=(φ∘Ad⁡vn+1)(ynyn∗)<5⋅4−n.(20)\|(u_{n+1}-u_n)^*\|_\varphi^2 =(\varphi\circ\operatorname{Ad}v_{n+1})(y_ny_n^*) <5\cdot4^{-n}. \tag{20}

Both increment norms are summable. Lemma 2.2 gives a unitary limit uu. Continuity of implementation gives Ad⁡u=θ\operatorname{Ad}u=\theta, since the central adjustments leave every implemented automorphism unchanged. This proves closedness and assertion 1. □\square

Exercise 5. Establish (16) also at zero. Then construct a bounded central unitary approximation from a bounded central approximation to any unitary sequence, proving both intrinsic strong* estimates.

Solution. For a=rζ≠0a=r\zeta\ne0, with r>0r>0 and ∣ζ∣=1|\zeta|=1, ∣1−r∣≤∣a−w∣|1-r|\leq|a-w| by the reverse triangle inequality, and ∣ζ−w∣≤∣ζ−a∣+∣a−w∣≤2∣a−w∣|\zeta-w|\leq|\zeta-a|+|a-w|\leq2|a-w|. At a=0a=0 choose phase one; ∣1−w∣≤2=2∣0−w∣|1-w|\leq2=2|0-w|. For a central operator aa, NT3 constructs its polar operator inside the center and extends it by one on the kernel to a central unitary zz. Its continuous regularizations commute with the unitary uu, and their characterwise scalar inequalities pass to bounded strong* limits. This proves

(z−u)∗(z−u)≤4(a−u)∗(a−u),(z−u)(z−u)∗≤4(a−u)(a−u)∗.(z-u)^*(z-u)\leq4(a-u)^*(a-u),\qquad (z-u)(z-u)^*\leq4(a-u)(a-u)^*.

For every positive normal ψ\psi, the two seminorms of z−uz-u are at most twice the corresponding ones of a−ua-u. Apply this construction at every index. The phases have norm one, and both errors tend to zero, including indices at which the central approximant is zero.

Corollary 5.2. Every L(Fn)L(\mathbb F_n), 2≤n≤∞2\le n\le\infty, is full and is not isomorphic to RR.

Proof. A bounded centralizing sequence in L(Fn)L(\mathbb F_n) is central by Lemma 1.1. Use its faithful trace as a seminorm test: the two fixed commutators in (22) tend to zero in 22-norm. Hence ∥xm−τ(xm)1∥2→0\|x_m-\tau(x_m)1\|_2\to0. The scalar approximants are bounded by sup⁡m∥xm∥\sup_m\|x_m\|. NT2 gives bounded intrinsic strong* convergence, and FG1 gives separable predual. Theorem 4.1 therefore proves fullness. In RR, FG2's tensor-tail sequence is central, and its commutator with the faithful trace is zero. Lemma 1.1 makes it centralizing. Equation (28) and the scalar center make it nontrivial, so Theorem 4.1 proves that RR is not full. A normal isomorphism preserves centralizing sequences, both intrinsic seminorms and the center, as verified in Exercise 10. It thus preserves fullness, and cannot identify these factors. □\square

This conclusion applies to every rank in the stated range. It does not compare the isomorphism classes of free-group factors of different ranks.

Exercise 6. Prove fullness for every abelian von Neumann algebra with separable predual. Give a concrete example showing that the sequence criterion in that case requires its full center.

Solution. In an abelian algebra every inner conjugation is the identity. The inner subgroup is the closed singleton in the Hausdorff automorphism group, so the algebra is full. A bounded sequence is trivial by choosing its central approximant equal to itself. In C2\mathbb C^2, the constant sequence (1,0)(1,0) is nonscalar and stays a positive distance from the scalar diagonal, although it lies in the center. Thus replacing central approximants by scalar ones would change the criterion.

Exercise 10. Prove invariance under a normal isomorphism. Include the predual norms, boundedness, the center, and each of the two strong* seminorms.

Solution. Let θ:M→N\theta:M\to N be a normal star isomorphism. Its normal inverse makes pullback ω↦ω∘θ\omega\mapsto\omega\circ\theta an onto isometry of preduals, and θ\theta preserves operator norms. Evaluating against θ(y)\theta(y) gives

[θ(x),ω]∘θ=[x,ω∘θ].[\theta(x),\omega]\circ\theta=[x,\omega\circ\theta].

Thus predual-commutator convergence is equivalent in both algebras. For every positive normal ψ\psi on NN,

∥θ(x)∥ψ=∥x∥ψ∘θ,∥θ(x)∗∥ψ=∥x∗∥ψ∘θ.\|\theta(x)\|_\psi=\|x\|_{\psi\circ\theta},\qquad \|\theta(x)^*\|_\psi=\|x^*\|_{\psi\circ\theta}.

The onto positive pullback gives both directions of bounded strong* convergence. An element commutes with all of MM exactly when its image commutes with all of NN, so θ(Z(M))=Z(N)\theta(Z(M))=Z(N). Bounded central approximating sequences transport with identical seminorm errors. Finally the preduals are isomorphic, hence separability transports; Theorem 4.1 gives invariance of fullness.

Finite group stages and the permutation factor

Let SfinS_{\mathrm{fin}} be the group of permutations of N\mathbb N with finite support. Write SmS_m for the permutations of the first mm points, fixing the rest. Then

Sfin=⋃mSm.(29)S_{\mathrm{fin}}=\bigcup_m S_m. \tag{29}

This countable union of finite sets is countable; the group is infinite.

Proposition 6.1. The algebra L(Sfin)L(S_{\mathrm{fin}}) is an AFD factor of type II1\mathrm{II}_1, hence is isomorphic to RR.

Proof. If g≠eg\ne e, choose a point ii moved by gg. For each jj outside its finite support, conjugation by (i j)(i\ j) changes that support to

(supp⁡g∖{i})∪{j}.(\operatorname{supp}g\setminus\{i\})\cup\{j\}.

The supports are distinct, so the conjugacy class is infinite. FG1 now supplies the faithful normal trace, scalar center, separable predual and type II1\mathrm{II}_1. The spans Dm=span⁡{λg:g∈Sm}D_m=\operatorname{span}\{\lambda_g:g\in S_m\} are increasing unital finite-dimensional star algebras: finite group multiplication and inversion close them under products and adjoints. Their union contains every group unitary. BD1–5 gives bounded strong density of the norm closure of that union in its bicommutant, so these stages provide the AFD approximation. Equivalently their generated von Neumann algebra is all of L(Sfin)L(S_{\mathrm{fin}}). The complete AF1–5 proof of finite AFD uniqueness now identifies it with RR, including the initial direct-sum finite algebras and the exact dyadic-containment construction. □\square

The finite stages may be direct sums of matrix algebras. Their centers can disappear when later group elements are added, as the next calculation shows. AF1–5 turns those finite approximations into a compatible dyadic chain; FG2 identifies its tracial completion with RR.

Exercise 11. Describe the algebra generated by S2S_2, including its two minimal projections. Exhibit a later group unitary that prevents its nonscalar central element from being central in L(Sfin)L(S_{\mathrm{fin}}).

Solution. Put t=(1 2)t=(1\ 2). The two group operators 1,λt1,\lambda_t are linearly independent on δe\delta_e, and λt=λt∗\lambda_t=\lambda_t^*, λt2=1\lambda_t^2=1. Thus

p+=(1+λt)/2,p−=(1−λt)/2p_+=(1+\lambda_t)/2,\qquad p_-=(1-\lambda_t)/2

are nonzero orthogonal projections summing to one. Their spans give an isomorphism of this two-dimensional algebra with C⊕C\mathbb C\oplus\mathbb C; it is abelian and is not a factor. Take s=(2 3)∈S3s=(2\ 3)\in S_3. The permutations st,tsst,ts are different, hence λsλtδe=δst≠δts=λtλsδe\lambda_s\lambda_t\delta_e=\delta_{st}\ne\delta_{ts}=\lambda_t\lambda_s\delta_e. So λt\lambda_t, central in the S2S_2 stage, is not central after the S3S_3 stage is included. Centrality in a finite approximant need not survive in the generated algebra.

Free comparisons and prerequisite proofs

Claire Anantharaman and Sorin Popa, An introduction to II₁ factors, author draft, Theorem 15.3.2, printed 266–267 (PDF 272–273), proves the finite-factor fullness route. Section 15.4 on those and the following page gives the free-word cover and disjoint conjugates, and the trace-zero tensor-tail example. Those methods are credited here. The orthogonal coordinate projections give the bound 10 and therefore the stated bound 14; the faithful-state estimates prove the criterion with the whole center.

Christian Rosendal's author version of Automatic continuity of group homomorphisms, November 2008, Section 2.1, Lemma 2.1 and Theorem 2.2, p.4, gives the category argument. Anush Tserunyan's author-hosted descriptive-set-theory notes, 26 November 2025, Theorem 12.6 p.48 and Theorem 13.3 pp.51–52, provide complete separation and Borel-image comparisons. TS1–6 proves their metric, refinement and category inputs locally on all Polish domains.

Julien Melleray, Some aspects of Topological dynamics of Polish groups, with an introduction to descriptive set theory, author-hosted notes, Definition 4.1 and Theorem 4.3, printed 39–40 (PDF 45–46), distinguish the group uniformities and the compatible invariant metric. Exercise 48, printed 41 (PDF 47), states Raikov completeness for Polish groups. Exercise 4 here supplies the complete metric, isometric embedding, closed-image and Cauchy-filter arguments. The author’s text retains its own rights.

NT1–4 and FG1–2 provide the functional decomposition, faithful-state topology, bounded phase construction, support localization and the two factor constructions. Their exact earlier CF, CP, GNS, bounded-density and normal-range proofs are linked in the foundations. The complete retained PC0–7/FCT0–7 arguments supply Corollary 1.2's general finite center-valued trace. Their method comparison is Jesse Peterson's author-hosted Notes on operator algebras, 27 April 2020, Section 6.4, printed/PDF 102–106. AF1–5 proves the whole finite AFD uniqueness input for Proposition 6.1. Its freely accessible method comparison is Anantharaman–Popa, Lemma 11.2.1 and Theorem 11.2.2, printed 185–188 (PDF 191–194); its local exact-containment argument supplies the nesting step directly.