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

Local approximation and the hyperfinite finite factor

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

A finite-dimensional algebra that approximates a few operators need not contain a previously chosen algebra. The main construction below repairs that defect. A small change of one projection aligns the first matrix corner, and matrix units then align the whole old algebra exactly. Repeating this construction identifies every separable AFD factor of type II1\mathrm{II}_1 with the tracial infinite product of M2M_2.

The complete finite-algebra and vacuum inputs HF0–5 supply the whole trace-preserving expectation onto any unital subalgebra, bounded trace topology, all normal-state cutoff bounds, arbitrary-center and properly infinite projection arguments, and the full vacuum/tracial direct sum. The complete PC0–7 and FCT0–7 supplies center-valued trace existence, normality, faithfulness, uniqueness and comparison with arbitrary center. The dyadic construction AF1–5 proves exact containment and the whole AFD trace-GNS identification. The normal representation and matrix-corner construction NA0–6 supplies arbitrary Hilbert multiplicity and the finite commutant application, using HF0's full tracial commutant. The whole tracial product SS2 supplies the concrete factor RR.

Unless stated otherwise, MM is a factor of type II1\mathrm{II}_1, with normalized faithful normal trace τ\tau, and

∥x∥2=τ(x∗x)1/2.\|x\|_2=\tau(x^*x)^{1/2}.

The inequalities ∥axb∥2≤∥a∥∥x∥2∥b∥\|axb\|_2\le\|a\|\|x\|_2\|b\|, ∥x∗∥2=∥x∥2\|x^*\|_2=\|x\|_2, and ∣τ(x)∣≤∥x∥2|\tau(x)|\le\|x\|_2 follow from the trace and Cauchy–Schwarz. We write ENE_N for the trace-preserving expectation onto a unital subalgebra NN.

Bounded trace topology (PB1–PB2). The normal functionals

ψb(x)=τ(bx),b∈M,(PB1)\psi_b(x)=\tau(bx),\qquad b\in M, \tag{PB1}

are norm dense in M∗M_*. Indeed their span is a linear subspace of the concrete predual. If its norm closure were proper, Hahn–Banach would give a nonzero element of (M∗)∗=M(M_*)^*=M annihilating it, by CP6. Calling that element xx, we would have τ(bx)=0\tau(bx)=0 for every bb; choosing b=x∗b=x^* and using faithfulness gives x=0x=0, a contradiction.

Let ψ\psi be a normal positive functional and ∥x∥≤C\|x\|\le C. Choose b∈Mb\in M with ∥ψ−ψb∥<η\|\psi-\psi_b\|<\eta, by (PB1). Trace Cauchy–Schwarz, applied to x∗xx^*x through its square root, gives ∣τ(bx∗x)∣≤∥b∥τ(x∗x)|\tau(bx^*x)|\le\|b\|\tau(x^*x). Thus

ψ(x∗x)≤∥b∥∥x∥22+ηC2,ψ(xx∗)≤∥b∥∥x∥22+ηC2.(PB2)\psi(x^*x)\le\|b\|\|x\|_2^2+\eta C^2,\qquad \psi(xx^*)\le\|b\|\|x\|_2^2+\eta C^2. \tag{PB2}

This proves that, on every norm-bounded set, the 22-norm gives the intrinsic sigma-strong* topology. The converse uses the trace itself as one of the tests. There is no cardinality restriction on the convergent net.

If a normal positive functional has already been represented as τ(h ⋅)\tau(h\,\cdot), the same estimate can also be written using a bounded positive approximation bb to hh:

τ(hx∗x)≤∥b∥∥x∥22+C2∥h−b∥1.(1)\tau(hx^*x)\le\|b\|\|x\|_2^2+C^2\|h-b\|_1. \tag{1}

This density notation is optional for the topology proof: (PB1)–(PB2) prove the required estimates directly in the concrete predual.

Norm-bounded 22-norm Cauchy sequences have their limit in MM: an ultraweak cluster point of the bounded ball has the same pairings τ(y∗x)\tau(y^*x), y∈My\in M, as the Hilbert-space limit, and those pairings determine that limit.

Replacing finite approximants by dyadic matrix factors

For any von Neumann algebra PP, AFD means that for every finite set x1,…,xm∈Px_1,\ldots,x_m\in P and every sigma-strong* neighborhood UU of zero there is a finite-dimensional *-subalgebra D⊂PD\subset P with xj∈D+Ux_j\in D+U for every jj. This local definition does not require a sequence or separability. A possibly nonunital DD can be replaced by D+C1D+\mathbb C1.

In a finite factor call this property locally AFD when expressed using finite-set 22-norm approximation. The two formulations agree: the intrinsic topology includes the trace seminorm, while applying EDE_D to any 22-norm approximants supplies errors no larger and bounds the approximants by the original operator norms. Equation (PB2) then gives approximation for every specified sigma-strong* neighborhood.

Lemma 3.1. For every finite-dimensional unital subalgebra D⊂MD\subset M and η>0\eta>0, there is a unital matrix subfactor Q≅M2pQ\cong M_{2^p} such that

∥x−EQ(x)∥2≤η∥x∥(x∈D).(10)\|x-E_Q(x)\|_2\le\eta\|x\|\qquad(x\in D). \tag{10}

The integer pp can be required to be arbitrarily large.

Proof. Write D=⨁kMdkD=\bigoplus_k M_{d_k}, with matrix units fij(k)f_{ij}^{(k)}, and put tk=τ(f11(k))t_k=\tau(f_{11}^{(k)}). Choose pp large enough that every rk=⌊2ptk⌋r_k=\lfloor2^p t_k\rfloor is positive. Cut f11(k)f_{11}^{(k)} down to a projection gkg_k of trace rk2−pr_k2^{-p}, and split gkg_k into rkr_k projections of trace 2−p2^{-p}. Transport these pieces by fi1(k)f_{i1}^{(k)}. The remaining projection has trace

1−∑kdkrk2−p,1-\sum_k d_k r_k2^{-p},

an integer multiple of 2−p2^{-p}, and can also be split into pieces of trace 2−p2^{-p}. All the resulting pieces are equivalent.

They form the diagonal of a full 2p2^p-matrix system, chosen to preserve the transported connections inside each kk-block. To see that compatible extension directly, choose one reference diagonal projection. Connect it to the first diagonal in each existing block by a partial isometry; connect it to that block's other diagonals by the prescribed block matrix units. If these connecting maps are vav_a, their initial projection is the reference and their orthogonal final projections sum to one. The operators vavb∗v_av_b^* are a full matrix system extending every prescribed block.

Its algebra QQ contains

f~ij(k)=fi1(k)gkf1j(k),∥fij(k)−f~ij(k)∥22=tk−rk2−p<2−p.(11)\widetilde f_{ij}^{(k)} =f_{i1}^{(k)}g_kf_{1j}^{(k)},\qquad \|f_{ij}^{(k)}-\widetilde f_{ij}^{(k)}\|_2^2 =t_k-r_k2^{-p}<2^{-p}. \tag{11}

For x=∑λij(k)fij(k)x=\sum\lambda_{ij}^{(k)}f_{ij}^{(k)}, each coefficient has modulus at most ∥x∥\|x\|. With s=∑kdk2s=\sum_k d_k^2, the corresponding sum of the f~\widetilde f's differs from xx by at most s2−p/2∥x∥s2^{-p/2}\|x\|. The expectation is the nearest L2L^2 point of QQ, so taking pp large gives (10). □\square

It follows that in a locally AFD factor every finite-dimensional linear subspace VV can be approximated uniformly on its operator-norm unit ball by a dyadic matrix subfactor. Choose a basis v1,…,vmv_1,\ldots,v_m. The constant

CV=sup⁡{∑j∣λj∣:∥∑jλjvj∥≤1}(12)C_V=\sup\left\{\sum_j|\lambda_j|: \left\|\sum_j\lambda_jv_j\right\|\le1\right\} \tag{12}

is finite, by equivalence of norms on VV. First approximate its basis by a finite-dimensional algebra, using its expectation, then apply Lemma 3.1. The sum of the basis errors times CVC_V controls the whole unit ball. This is the finite-dimensional uniformity needed in the next step.

Making the next matrix algebra contain the old one

Lemma 4.1. Suppose MM is locally AFD, N⊂MN\subset M is a unital copy of MdM_d with d=2nd=2^n, V⊂MV\subset M is finite dimensional, and ε>0\varepsilon>0. There is a unital dyadic matrix subfactor Q⊃NQ\supset N satisfying

∥x−EQ(x)∥2≤ε∥x∥(x∈V).(13)\|x-E_Q(x)\|_2\le\varepsilon\|x\|\qquad(x\in V). \tag{13}

Its matrix size can be made larger than dd.

Proof. Fix matrix units eije_{ij} of NN, put e=e11e=e_{11}, and let

W=Ce+∑i,je1iVej1⊂eMe.W=\mathbb Ce+\sum_{i,j}e_{1i}Ve_{j1}\subset eMe.

Choose a unital D≅M2pD\cong M_{2^p}, p≥np\ge n, with ∥z−ED(z)∥2≤δ∥z∥\|z-E_D(z)\|_2\le\delta\|z\| on WW, where δ>0\delta>0 will tend to zero. Put h=ED(e)h=E_D(e). Then 0≤h≤10\le h\le1 and

∥h−e∥2≤δ,∥h−h2∥2≤3δ.\|h-e\|_2\le\delta,\qquad \|h-h^2\|_2\le3\delta.

For the second estimate expand h−h2=(h−e)+(e−h)e+h(e−h)h-h^2=(h-e)+(e-h)e+h(e-h). Formula (5) gives q∈Dq\in D with ∥q−e∥2≤7δ\|q-e\|_2\le7\delta. Since ∣τ(q)−1/d∣≤7δ|\tau(q)-1/d|\le7\delta, enlarge or shrink qq inside DD to q1q_1 of trace exactly 1/d1/d. This is possible because p≥np\ge n; both traces are integral multiples of 2−p2^{-p}. The two projections are comparable, so

∥q−q1∥22=∣τ(q)−1/d∣,∥q1−e∥2≤a(δ):=7δ+7δ.(14)\|q-q_1\|_2^2=|\tau(q)-1/d|,\qquad \|q_1-e\|_2\le a(\delta):=7\delta+\sqrt{7\delta}. \tag{14}

Lemma 1.1 gives a unitary uu carrying q1q_1 to ee, with ∥u−1∥2≤2 a(δ)\|u-1\|_2\le\sqrt2\,a(\delta).

Choose unital dd-matrix units wijw_{ij} in DD, with w11=q1w_{11}=q_1: split the matrix space into dd equal-dimensional blocks. The operator

v=∑i=1dei1uw1i(15)v=\sum_{i=1}^d e_{i1}u w_{1i} \tag{15}

is unitary. Multiplying its sums gives v∗v=∑iwii=1v^*v=\sum_iw_{ii}=1, vv∗=∑ieii=1vv^*=\sum_ie_{ii}=1, and vwijv∗=eijvw_{ij}v^*=e_{ij}. Thus Q=vDv∗Q=vDv^* contains NN exactly.

Only the first corner needs a small conjugation. For z∈Wz\in W let z′=q1ED(z)q1z'=q_1E_D(z)q_1. Bimodularity and z=ezez=eze give

∥z−z′∥2≤(δ+2a(δ))∥z∥.\|z-z'\|_2\le\bigl(\delta+2a(\delta)\bigr)\|z\|.

Moreover ∥z′∥≤∥z∥\|z'\|\le\|z\|, and vz′v∗=uz′u∗vz'v^*=uz'u^*, since vq1=uq1vq_1=uq_1. Therefore

∥z−vz′v∗∥2≤(δ+(2+22)a(δ))∥z∥.(16)\|z-vz'v^*\|_2 \le\bigl(\delta+(2+2\sqrt2)a(\delta)\bigr)\|z\|. \tag{16}

For x∈Vx\in V, its matrix entries zij=e1ixej1z_{ij}=e_{1i}xe_{j1} lie in WW and have norms at most ∥x∥\|x\|. Reconstruct x=∑i,jei1zije1jx=\sum_{i,j}e_{i1}z_{ij}e_{1j}, replacing every entry by its approximant in eQeeQe. The resulting element of QQ has error at most

d2(δ+(2+22)a(δ))∥x∥.(17)d^2\bigl(\delta+(2+2\sqrt2)a(\delta)\bigr)\|x\|. \tag{17}

This tends to zero with δ\delta; choose it below ε\varepsilon. The nearest-point property of EQE_Q gives (13). The choice of DD can have p>np>n. □\square

There is no assertion that the whole aligning unitary vv is close to one. Its first-corner action is the controlled unitary uu; reconstruction by the old matrix units supplies the required bound.

The projection repair used in exact containment

Lemma 1.1. If e,fe,f are equivalent projections in a finite von Neumann algebra, there is a unitary uu such that

ueu∗=f,(u−1)∗(u−1)≤2(e−f)2.(2)ueu^*=f,\qquad (u-1)^*(u-1)\le2(e-f)^2. \tag{2}

In particular ∥u−1∥2≤2∥e−f∥2\|u-1\|_2\le\sqrt2\|e-f\|_2 whenever a finite trace is specified.

Proof. Set D=e−fD=e-f and

r=fe+(1−f)(1−e).r=fe+(1-f)(1-e).

Multiplication gives re=frre=fr,

r∗r=rr∗=1−D2,r+r∗=2(1−D2).(3)r^*r=rr^*=1-D^2,\qquad r+r^*=2(1-D^2). \tag{3}

The operator D2D^2 commutes with e,f,re,f,r. Let k=1{1}(D2)k=1_{\{1\}}(D^2). On 1−k1-k, the polar part u0u_0 of rr is unitary, carries e(1−k)e(1-k) to f(1−k)f(1-k), and has real part (1−D2)1/2(1-D^2)^{1/2}. Hence on that support

(u0−(1−k))∗(u0−(1−k))=2((1−k)−(1−D2)1/2)≤2D2(1−k).(4)(u_0-(1-k))^*(u_0-(1-k)) =2\bigl((1-k)-(1-D^2)^{1/2}\bigr)\le2D^2(1-k). \tag{4}

The last inequality is the scalar inequality 1−1−s≤s1-\sqrt{1-s}\le s, 0≤s≤10\le s\le1.

The exceptional projection kk splits as p+qp+q, where p=e∧(1−f)p=e\wedge(1-f) and q=(1−e)∧fq=(1-e)\wedge f. Indeed D2=1D^2=1 implies r=0r=0; on eHeH its first term forces fe=0fe=0, and on (1−e)H(1-e)H its second term forces f=1f=1. Equivalence of e,fe,f gives equal center-valued traces. The equivalence already established on 1−k1-k then gives equal center-valued traces for p,qp,q. FCT7, equation (FCT32), gives a partial isometry vv with v∗v=p,vv∗=qv^*v=p,vv^*=q from that equality of center-valued traces. The skewadjoint unitary w=v−v∗w=v-v^* on kk carries pp to qq, and (w−k)∗(w−k)=2k(w-k)^*(w-k)=2k. Thus u=u0+wu=u_0+w is the required unitary; (4) and D2k=kD^2k=k give (2). □\square

There is also a useful spectral rounding estimate. If 0≤h≤10\le h\le1, φ\varphi is any normal state, and ∥h−h2∥φ≤δ\|h-h^2\|_\varphi\le\delta, then

q=1[1/2,1](h)⟹∥h−q∥φ≤2δ,∥h1/2−q∥φ≤2δ.(5)q=1_{[1/2,1]}(h) \quad\Longrightarrow\quad \|h-q\|_\varphi\le2\delta,\qquad \|h^{1/2}-q\|_\varphi\le\sqrt{2\delta}. \tag{5}

The two reducing interval calculations in HF1 give the operator inequalities

(h−q)2≤4h2(1−h)2,(h1/2−q)2≤2h(1−h).(h-q)^2\le4h^2(1-h)^2,\qquad (h^{1/2}-q)^2\le2h(1-h).

The whole cutoff projection is constructed there from continuous positive parts and support limits, including the endpoint 1/21/2. Applying φ\varphi to the first inequality and positive-functional Cauchy–Schwarz to the second proves (5) for every normal state, including a nonfaithful one.

A higher cutoff is useful too: for 0<δ<1/40<\delta<1/4, put ϵ=δ\epsilon=\sqrt\delta and q′=1[1−ϵ,1](h)q'=1_{[1-\epsilon,1]}(h). The complete support/order argument of HF1 gives

(1−h)2(1−q′)≥δ(1−q′),(1−h)2q′≤δq′.(1-h)^2(1-q')\ge\delta(1-q'),\qquad (1-h)^2q'\le\delta q'.

The precise calculation below proves the sharper bounds (6a), which imply the following original bounds (6) since 0<δ<10<\delta<1:

∥h−q′∥φ≤2δ,∥h1/2−q′∥φ≤3 δ1/4.(6)\|h-q'\|_\varphi\le2\sqrt\delta,\qquad \|h^{1/2}-q'\|_\varphi\le\sqrt3\,\delta^{1/4}. \tag{6}

The same higher cutoff actually gives the sharper estimate

∥h−q′∥φ≤2δ,∥h1/2−q′∥φ≤3δ.(6a)\|h-q'\|_\varphi\le\sqrt{2\delta},\qquad \|h^{1/2}-q'\|_\varphi\le\sqrt{3\delta}. \tag{6a}

Indeed (1−h)2(1−q′)≥δ(1−q′)(1-h)^2(1-q')\ge\delta(1-q'), so

φ(h2(1−q′))≤δ−1φ(h2(1−h)2)≤δ.\varphi(h^2(1-q')) \le\delta^{-1}\varphi(h^2(1-h)^2)\le\delta.

Also φ(h(1−h))≤∥h−h2∥φ≤δ\varphi(h(1-h))\le\|h-h^2\|_\varphi\le\delta. Adding these positive operator estimates gives φ(h(1−q′))≤2δ\varphi(h(1-q'))\le2\delta. On q′q', both (1−h)2(1-h)^2 and (1−h1/2)2(1-h^{1/2})^2 are at most δq′\delta q'. Split the two squared errors over q′q' and 1−q′1-q' to obtain (6a). This is the higher-cutoff mechanism of Connes’s Lemma 1.1.5; the lower bound for (1−h)2(1-h)^2 supplies the spectral inequality needed in its proof. The preceding bounds (6) follow as well, since 0<δ<10<\delta<1.

Only the simpler cutoff (5) will be needed below.

Trace cuts and first-corner coordinates

Halving means that every projection in a type II algebra is the sum of two equivalent orthogonal projections. In a II1\mathrm{II}_1 factor this gives every scalar trace cut: for 0≤s≤τ(e)0\le s\le\tau(e), expand s/τ(e)s/\tau(e) in binary, repeatedly halve the current remainder of ee, and retain the half prescribed by each digit. The selected orthogonal pieces have traces τ(e)2−j\tau(e)2^{-j}. Their strong sum has trace ss, by normality. Equal-trace projections are equivalent by finite trace comparison.

If (eij)i,j=1d(e_{ij})_{i,j=1}^d are unital matrix units in an arbitrary von Neumann algebra PP, then

P≅Md⊗ˉe11Pe11,x⟼[e1ixej1]i,j.(7)P\cong M_d\bar\otimes e_{11}Pe_{11},\qquad x\longmapsto[e_{1i}xe_{j1}]_{i,j}. \tag{7}

The inverse is [xij]↦∑i,jei1xije1j[x_{ij}]\mapsto\sum_{i,j}e_{i1}x_{ij}e_{1j}. The matrix-unit rules check the products, adjoints and inverses; finite sums and normal corners show normality. The relative commutant of the matrix algebra is the diagonal copy x↦∑iei1xe1ix\mapsto\sum_i e_{i1}xe_{1i} of the corner. Thus the matrix algebra and its relative commutant generate PP. Type II is preserved in this corner: an abelian projection there would be abelian in PP.

Identifying the dyadic limit and all finite corners

Let

R=⨂ˉj≥1(M2,tr⁡2).R=\bar\bigotimes_{j\ge1}(M_2,\operatorname{tr}_2).

The tracial product construction gives its faithful normal product trace and separable trace GNS space. The explicit finite-stage projections in the matrix-stage expectation theorem applied to its local matrix factors give scalar center: a central element has scalar projection at every stage and is their GNS limit. Their matrix sizes are unbounded, so RR is of type II1\mathrm{II}_1.

Theorem 5.1. For a II1\mathrm{II}_1 factor MM with separable predual, the following are equivalent:

  1. M≅RM\cong R.
  2. MM is generated by an increasing sequence of finite-dimensional *-subalgebras.
  3. MM is locally AFD.
  4. Every nonzero corner of every finite matrix amplification of MM is locally AFD.

Proof. The first implication gives the initial tensor factors. For the second, Kaplansky density in the increasing union supplies bounded strong* approximants, hence the third condition.

For 3⇒13\Rightarrow1, choose a 22-norm dense sequence (xj)(x_j) in the unit ball. Such a sequence exists: the ball is compact metrizable in the weak* topology; a countable weak* dense subset is weakly dense in L2L^2, and its rational convex combinations are norm dense by convex separation. Apply Lemma 4.1 successively to Vk=span⁡{x1,…,xk}V_k=\operatorname{span}\{x_1,\ldots,x_k\}, keeping the previous dyadic matrix algebra exactly and making the error tend to zero. This gives increasing Nk≅M2nkN_k\cong M_{2^{n_k}}, with strictly increasing nkn_k, whose union generates MM. Indeed ENk(xj)→xjE_{N_k}(x_j)\to x_j in 22-norm with bounds one; the bounded-ball completeness and (PB2) put every xjx_j, hence the entire ball, in the generated algebra.

A unital inclusion Ma⊂MbM_a\subset M_b has b=arb=ar and relative commutant MrM_r: its action on Cb\mathbb C^b is a sum of rr copies of the defining aa-dimensional module, or equivalently use (7). Between NkN_k and Nk+1N_{k+1} insert the successive M2M_2 factors of this relative commutant. Insert the earlier tensor levels inside N1N_1 too. We obtain Am≅M2mA_m\cong M_{2^m}, Am⊂Am+1A_m\subset A_{m+1}, with the same generated algebra. Their relative commutants Am′∩Am+1≅M2A_m'\cap A_{m+1}\cong M_2 commute, and their finite products equal Am+1A_{m+1}, by (7). The trace on each finite product is its unique normalized trace. The trace-preserving isomorphism of the algebraic unions therefore extends to a unitary of trace GNS spaces and, by intertwining left multiplication, to a normal isomorphism M≅RM\cong R.

To prove 3⇒43\Rightarrow4, finite amplification can be handled directly on a finite set of matrix entries. Approximate all entries by one finite-dimensional D⊂MD\subset M; then D⊗MnD\otimes M_n approximates the matrices, since the normalized squared 22-norm is n−1n^{-1} times the sum of the entries' squared norms. This argument needs no generating sequence. It suffices next to handle a nonzero e∈Me\in M. Choose e1≤ee_1\le e of dyadic trace q2−nq2^{-n}, so close in 22-norm that ∥e−e1∥2<η\|e-e_1\|_2<\eta. Extend its qq equal dyadic pieces to a full unital M2nM_{2^n} system as in Lemma 3.1. Lemma 4.1 gives a finite matrix NN containing that system and approximating e1Ve1e_1Ve_1, for a prescribed finite-dimensional V⊂eMeV\subset eMe. Then e1Ne1⊂eMee_1Ne_1\subset eMe is finite dimensional, and for x∈Vx\in V, ∥x∥≤1\|x\|\le1,

∥x−e1EN(e1xe1)e1∥2≤2∥e−e1∥2+∥e1xe1−EN(e1xe1)∥2.(18)\|x-e_1E_N(e_1xe_1)e_1\|_2 \le2\|e-e_1\|_2+\|e_1xe_1-E_N(e_1xe_1)\|_2. \tag{18}

Both terms can be made arbitrarily small. The normalized corner trace divides the squared norm by τ(e)\tau(e), so its 22-norm is τ(e)−1/2\tau(e)^{-1/2} times the ambient norm. This fixed factor does not affect approximation. Adding the missing corner identity if desired preserves finite dimension. Condition 4 implies 3 by taking the identity corner. □\square

Corollary 5.2. If one nonzero corner of M⊗ˉMnM\bar\otimes M_n is locally AFD, then MM is locally AFD. All separable AFD II1\mathrm{II}_1 factors, and all their nonzero amplified finite corners, are isomorphic to RR.

Proof. First establish the local permanence statements without a separability assumption. For finite amplification of any locally AFD II1\mathrm{II}_1 factor LL, approximate the finitely many entries of the desired matrices by one finite-dimensional D⊂LD\subset L. The identity

∥[aij]∥2,L⊗Mr2=r−1∑i,j∥aij∥2,L2\|[a_{ij}]\|_{2,L\otimes M_r}^2=r^{-1}\sum_{i,j}\|a_{ij}\|_{2,L}^2

makes D⊗MrD\otimes M_r an arbitrarily good finite-dimensional approximant. Its trace expectation supplies contractions when the original matrices are contractions.

For a nonzero corner pLppLp, cut p1≤pp_1\le p with dyadic trace as close to τL(p)\tau_L(p) as desired. Split p1p_1 into equal dyadic pieces and extend them to a unital dyadic matrix system in LL. Apply Lemma 4.1 to that system and the finite span of the p1xp1p_1xp_1's. The resulting matrix algebra NN contains p1p_1 exactly. The algebra

p1Np1⊕C(p−p1)⊂pLpp_1Np_1\oplus\mathbb C(p-p_1)\subset pLp

is finite dimensional and has identity pp. Equation (18), with p,p1p,p_1 in place of e,e1e,e_1, bounds the approximation error by 2∥p−p1∥22\|p-p_1\|_2 plus the independently chosen matrix error. Divide by τL(p)\sqrt{\tau_L(p)} for the normalized corner norm. Both errors can be arbitrarily small. Thus every nonzero corner and every finite amplification of LL is locally AFD, using only finite-set approximation, trace cuts and Lemma 4.1.

Now write P=M⊗ˉMnP=M\bar\otimes M_n, Q=ePeQ=ePe, and t=τP(e)>0t=\tau_P(e)>0. In P⊗ˉMrP\bar\otimes M_r, the projection e⊗1e\otimes1 has normalized trace tt, whereas 1M⊗e11⊗e111_M\otimes e_{11}\otimes e_{11} has trace 1/(nr)1/(nr). Choose rr so that 1/(nr)≤t1/(nr)\le t. Comparison gives a subprojection of e⊗1e\otimes1 equivalent to the latter projection. Its corner, inside Q⊗ˉMrQ\bar\otimes M_r, is isomorphic to MM. The local permanence just proved makes this corner locally AFD, proving the first assertion at its full stated generality. When the original factor has separable predual, so do its finite amplifications and corners. Theorem 5.1 then identifies each locally AFD corner with RR. □\square

Finite commutants of normal representations. A faithful normal representation of RR, with the usual unital representation convention, has commutant isomorphic to RR whenever that commutant is finite. Here is the full construction. NA3–4 realizes every normal positive coefficient by a bounded dominated form and embeds every cyclic summand into an amplification of the trace GNS space. Taking the whole orthogonal family gives an isometry V:L→L2(R)⊗KV:L\to L^2(R)\otimes K, with arbitrary KK, intertwining the representation and the left action. Its reducing range projection p=VV∗p=VV^* is nonzero. The full tracial conjugation and matrix-entry argument NA0, NA5 gives

ρ(R)′≅p(Rop⊗ˉB(K))p.\rho(R)'\cong p(R^{\mathrm{op}}\bar\otimes B(K))p.

Finiteness of this algebra means that pp is finite in the containing matrix algebra. The diagonal trace T(X)=∑iτ(Xii)\mathcal T(X)=\sum_i\tau(X_{ii}) is faithful, normal and semifinite by the full NA1 proof. The countable-shift argument NA2 gives T(p)<∞\mathcal T(p)<\infty. If KK is infinite dimensional, choose an integer n>T(p)n>\mathcal T(p). Factor comparison puts a projection equivalent to pp under a rank-nn matrix projection. If KK is finite dimensional, the matrix corner is already finite. Thus ρ(R)′\rho(R)' is a nonzero corner of Rop⊗ˉMnR^{\mathrm{op}}\bar\otimes M_n.

Compatible transposition on every local dyadic matrix level extends to a unitary of the full trace GNS space. Its conjugation carries the left algebra onto the right algebra, proving Rop≅RR^{\mathrm{op}}\cong R by NA6. Corollary 5.2 identifies the nonzero finite amplified corner with RR. That corollary's full AFD proof precedes this commutant application; the construction introduces no proof cycle.

If a representation is instead allowed a proper identity projection e=ρ(1)e=\rho(1), apply this statement on eLeL. The full commutant on LL splits as B((1−e)L)⊕(ρ(R)∣eL)′B((1-e)L)\oplus(\rho(R)|_{eL})', since commutation with ee kills the two off-diagonal blocks. Finiteness forces (1−e)L(1-e)L finite dimensional, and the active corner has commutant RR. A nonzero zero-action summand therefore gives Md⊕RM_d\oplus R, rather than RR. This states the identity convention and its exact degenerate variant explicitly.

Averaging over any subgroup

More generally, if N⊂MN\subset M is a subfactor and M=N∨(N′∩M)M=N\vee(N'\cap M), multiplication identifies

M≅N⊗ˉ(N′∩M).(8)M\cong N\bar\otimes(N'\cap M). \tag{8}

For y∈N′∩My\in N'\cap M, bimodularity gives EN(y)∈Z(N)=C1E_N(y)\in Z(N)=\mathbb C1; trace preservation makes it τ(y)1\tau(y)1. Hence τ(xy)=τ(x)τ(y)\tau(xy)=\tau(x)\tau(y). On algebraic tensors, multiplication is therefore an isometry of the two trace Hilbert spaces, by expanding inner products. Its range is dense by the generation hypothesis and Kaplansky density. The resulting unitary intertwines left multiplication by each tensor leg with multiplication by its image. It implements the asserted normal spatial isomorphism.

Lemma 2.1. If GG is any subgroup of U(M)\mathcal U(M) and B=G′∩MB=G'\cap M, then EB(x)E_B(x) is the unique element of BB in the ultraweakly closed convex hull of {uxu∗:u∈G}\{uxu^*:u\in G\}.

Proof. Work in the faithful normal trace GNS model H=L2(M,τ)H=L^2(M,\tau) from HF0, with Ω=1\Omega=1. For g∈Gg\in G, the rule Ug(aΩ)=gag∗ΩU_g(a\Omega)=gag^*\Omega extends to a unitary, and Ug∗=Ug−1U_g^*=U_{g^{-1}}. We will construct bounded finite averages whose limits give the required expectation.

First fix a nonempty finite set F⊂GF\subset G; it need not be a subgroup. Define bounded operators on HH by

TF=12∣F∣∑g∈F(Ug+Ug∗),AF=I+TF2. T_F=\frac1{2|F|}\sum_{g\in F}(U_g+U_g^*),\qquad A_F=\frac{I+T_F}{2}.

The operator TFT_F is selfadjoint of norm at most one, so 0≤AF≤I0\le A_F\le I. Moreover

⟨η,(I−AF)η⟩=14∣F∣∑g∈F∥Ugη−η∥2. \langle\eta,(I-A_F)\eta\rangle =\frac1{4|F|}\sum_{g\in F}\|U_g\eta-\eta\|^2.

Consequently its fixed space is

HF=ker⁡(I−AF)=⋂g∈Fker⁡(I−Ug). H_F=\ker(I-A_F)=\bigcap_{g\in F}\ker(I-U_g).

The powers of a positive contraction AA converge strongly to the orthogonal projection onto ker⁡(I−A)\ker(I-A). Here is the elementary estimate needed for that assertion. The powers decrease in operator order; multiplying their commuting positive differences by I−AI-A gives

0≤(n+1)An(I−A)≤∑j=0nAj(I−A)=I−An+1≤I. 0\le(n+1)A^n(I-A) \le\sum_{j=0}^n A^j(I-A) =I-A^{n+1}\le I.

Thus ∥An(I−A)∥≤1/(n+1)\|A^n(I-A)\|\le1/(n+1), so the powers tend to zero on ran⁡(I−A)\operatorname{ran}(I-A). Uniform boundedness extends this limit to its closure. Since I−AI-A is selfadjoint, that closure is the orthogonal complement of its kernel. On the kernel every power is the identity. This proves the strong convergence, without invoking a mean ergodic theorem. Apply it to AFA_F, and denote the resulting projection by PFP_F.

For the chosen x∈Mx\in M, write AFn(xΩ)=aF,nΩA_F^n(x\Omega)=a_{F,n}\Omega. Each aF,na_{F,n} is a finite convex combination of wxw∗wxw^*, w∈Gw\in G: expand the power of

x⟼x2+14∣F∣∑g∈F(gxg∗+g∗xg). x\longmapsto\frac{x}{2} +\frac1{4|F|}\sum_{g\in F}(gxg^*+g^*xg).

All coefficients are nonnegative and sum to one. Hence ∥aF,n∥≤∥x∥\|a_{F,n}\|\le\|x\|, and their vectors converge to PF(xΩ)P_F(x\Omega).

We use the bounded 22-norm completeness explicitly. If (zi)⊂M(z_i)\subset M is 22-norm Cauchy and ∥zi∥≤C\|z_i\|\le C, then

∥(zi−zj)b∥2≤∥b∥ ∥zi−zj∥2(b∈M). \|(z_i-z_j)b\|_2\le\|b\|\,\|z_i-z_j\|_2 \qquad(b\in M).

The left multiplication operators are therefore strongly Cauchy on the dense set MΩM\Omega; their common bound gives a bounded strong limit on all of HH. The trace model is strongly closed by HF0, so the limit is left multiplication by some z∈Mz\in M, with ∥z∥≤C\|z\|\le C. Its value at Ω\Omega is the 22-norm limit. This works for nets as well as sequences. On such bounded families, the trace topology (PB1)–(PB2) also gives ultraweak convergence.

It follows that PF(xΩ)=yFΩP_F(x\Omega)=y_F\Omega for an element yF∈My_F\in M, with ∥yF∥≤∥x∥\|y_F\|\le\|x\|. If KK denotes the ultraweakly closed convex hull in the statement, the finite averages and their bounded 22-norm limit show yF∈Ky_F\in K.

Now direct the nonempty finite subsets FF of GG by inclusion. The spaces HFH_F decrease. For a fixed vector ξ∈H\xi\in H, set c=inf⁡F∥PFξ∥2c=\inf_F\|P_F\xi\|^2. If F⊂F′F\subset F', orthogonality of the nested projections gives

∥PFξ−PF′ξ∥2=∥PFξ∥2−∥PF′ξ∥2. \|P_F\xi-P_{F'}\xi\|^2 =\|P_F\xi\|^2-\|P_{F'}\xi\|^2.

Choose F0F_0 with ∥PF0ξ∥2<c+ε\|P_{F_0}\xi\|^2<c+\varepsilon. Comparing two supersets of F0F_0 with their union bounds their vector difference by 2ε2\sqrt\varepsilon. Thus (PFξ)(P_F\xi) is Cauchy. Its limit lies in every HFH_F, while ξ−PFξ\xi-P_F\xi is orthogonal to their intersection. The limit is exactly the projection of ξ\xi onto

HG=⋂g∈Gker⁡(I−Ug). H_G=\bigcap_{g\in G}\ker(I-U_g).

No enumeration of GG is used.

Apply this to ξ=xΩ\xi=x\Omega. The uniformly bounded yFy_F have a 22-norm limit y∈My\in M, and ultraweak closedness gives y∈Ky\in K. Its vector is fixed by every UgU_g, so (gyg∗−y)Ω=0(gyg^*-y)\Omega=0. Faithfulness of the trace implies y∈G′∩M=By\in G'\cap M=B. Every bΩb\Omega, b∈Bb\in B, belongs to HGH_G. The projection characterization therefore gives

τ(b∗y)=τ(b∗x)(b∈B). \tau(b^*y)=\tau(b^*x)\qquad(b\in B).

HF0's full trace-preserving expectation has exactly these pairings, so y=EB(x)y=E_B(x). This proves membership in the hull.

Finally, for b∈Bb\in B and g∈Gg\in G, traciality gives τ(b∗gxg∗)=τ(b∗x)\tau(b^*gxg^*)=\tau(b^*x). The same projection characterization makes EBE_B constant on the orbit. Its normality makes it constant on its ultraweakly closed convex hull. If z∈K∩Bz\in K\cap B, then z=EB(z)=EB(x)z=E_B(z)=E_B(x), proving uniqueness. The trivial subgroup is included: its averaging operators and fixed-space projection are the identity. □\square

Applying the lemma to G=U(N)G=\mathcal U(N) proves the quantitative commutant estimate

∥x−EN′∩M(x)∥2≤sup⁡y∈N∥y∥≤1∥[x,y]∥2.(9)\|x-E_{N'\cap M}(x)\|_2 \le\sup_{\substack{y\in N\\\|y\|\le1}}\|[x,y]\|_2. \tag{9}

Every orbit point lies in the indicated 22-norm ball around xx. For z∈Mz\in M, trace Cauchy–Schwarz and the test b=(z−x)/∥z−x∥2b=(z-x)/\|z-x\|_2, when the denominator is nonzero, give

∥z−x∥2=sup⁡b∈M∥b∥2≤1∣τ(b∗(z−x))∣. \|z-x\|_2 =\sup_{\substack{b\in M\\\|b\|_2\le1}} |\tau(b^*(z-x))|.

Each pairing on the right is ultraweakly continuous. Hence the ball is ultraweakly closed and convex, contains the entire orbit, and contains its ultraweakly closed convex hull. The lemma puts the expectation in that ball and proves (9). The zero denominator gives the same identity with value zero. None of these statements requires separability.

6. Subfactors and automorphisms

Lemma 6.1. A finite von Neumann algebra generated by an increasing directed family of unital subfactors is a factor.

Proof. Let T:M→Z(M)T:M\to Z(M) be the normal faithful center-valued trace constructed in FCT0–7, with the full arbitrary-center proof. Every normal state ω\omega of Z(M)Z(M) gives a normalized normal scalar trace ωT\omega T. Such center states exist and separate the center: vector functionals of any faithful concrete representation give positive normal tests, and a nonzero one is normalized by its value at the identity. No faithful scalar state on all of MM is presumed.

Every normalized normal trace on MM restricts to the unique normalized normal trace on each generating subfactor, by FCT7 in that finite factor. Thus any two agree on the directed union. This union is a unital star algebra; bounded strong density from Kaplansky and the vector-series tail estimate make it ultraweakly dense. Normality therefore makes the two traces agree everywhere.

In particular all the ωT\omega T's agree. Restriction back to Z(M)Z(M), where T(z)=zT(z)=z, makes all normal center states agree. A nonscalar center would have a nontrivial central projection zz; vector states supported on zz and 1−z1-z give two normal states taking respectively values one and zero on zz. This is a contradiction. Hence Z(M)=C1Z(M)=\mathbb C1, as required. □\square

Every type II1\mathrm{II}_1 von Neumann algebra, including a nonfactor or a nonseparable one, contains a unital copy of RR. Halve its identity to embed M2M_2. Formula (7) identifies the relative commutant with a type II1\mathrm{II}_1 corner. Halve there and repeat, obtaining commuting M2M_2's. Their generated algebra is finite and is a factor by Lemma 6.1. It contains matrices of unbounded size, hence is type II1\mathrm{II}_1. Its normal trace restricts to the product trace on the finite tensor levels; the trace GNS identification makes this algebra RR.

If the ambient algebra has separable predual, every such copy lies in a maximal AFD II1\mathrm{II}_1 subfactor. For a chain of AFD subfactors, its generated algebra is a finite factor by Lemma 6.1. It is locally AFD: approximate a finite set by bounded elements of the chain union, choose one chain member containing those finitely many approximants, and approximate them by a finite-dimensional algebra in that member. The two errors add. Separability of the ambient predual passes to the subalgebra, so Theorem 5.1 identifies this upper bound with RR. Zorn's lemma now supplies a maximal member. No maximality assertion here identifies the ambient algebra with that member.

Automorphisms on finite levels and a distant tensor leg

Lemma 6.2. If A≅MdA\cong M_d is a unital subfactor of any von Neumann algebra PP, then for every automorphism α\alpha of PP there is a unitary u∈Pu\in P satisfying α∣A=Ad⁡(u)∣A\alpha|_A=\operatorname{Ad}(u)|_A.

Proof. Let eije_{ij} be its matrix units. The projections eiie_{ii} are dd equivalent pieces of one, and so are α(eii)\alpha(e_{ii}). PC5 gives the unique finite/properly infinite central split. An automorphism preserves it, since it preserves projection equivalence, finiteness, centrality and their suprema.

On the finite central part, FCT7 gives the normal center-valued trace, its equivalence criterion. The dd equivalent diagonals sum to the central identity, so all their trace values are that identity divided by dd. The images have the same values. Thus e11∼α(e11)e_{11}\sim\alpha(e_{11}) there.

On the properly infinite central part, e11e_{11} is properly infinite. Indeed its central support is the whole part, since its dd equivalent diagonals sum to that identity. By PC4, every central projection in its corner is the compression of an ambient central projection. A nonzero finite such cut would make the sum of its dd equivalent diagonal cuts finite by PC6, contrary to proper infiniteness of the central summand.

The full halving proof in PC5 permits finitely many orthogonal copies of e11e_{11} inside e11e_{11}: iterate to 2k≥d2^k\ge d equivalent copies and retain dd. Match the dd old diagonals to those copies and add the implementations. This gives the central identity subequivalent to e11e_{11}. The reverse subequivalence is inclusion, so PC3 gives e11∼1e_{11}\sim1 on that part. Apply the same argument to α(e11)\alpha(e_{11}). Adding the central implementations gives a partial isometry ww with w∗w=e11w^*w=e_{11}, ww∗=α(e11)ww^*=\alpha(e_{11}). Then

u=∑i=1dα(ei1)we1i(19)u=\sum_{i=1}^d\alpha(e_{i1})w e_{1i} \tag{19}

is unitary, and multiplication gives ueiju∗=α(eij)ue_{ij}u^*=\alpha(e_{ij}). □\square

Theorem 6.3. Every automorphism of RR is a limit of inner automorphisms in the point-predual norm topology, and RR has outer automorphisms.

Proof. For α∈Aut⁡(R)\alpha\in\operatorname{Aut}(R), apply Lemma 6.2 on the initial dyadic algebra AnA_n, obtaining unu_n. Uniqueness of the trace makes α\alpha a 22-norm isometry. Thus

∥α(x)−unxun∗∥2≤2∥x−EAn(x)∥2⟶0.(20)\|\alpha(x)-u_nxu_n^*\|_2 \le2\|x-E_{A_n}(x)\|_2\longrightarrow0. \tag{20}

The expectations converge in L2L^2 because the finite tensor vectors are dense. The inverse automorphisms converge in 22-norm too: for αn=Ad⁡(un)\alpha_n=\operatorname{Ad}(u_n),

∥αn−1(b)−α−1(b)∥2=∥b−αn(α−1(b))∥2→0.\|\alpha_n^{-1}(b)-\alpha^{-1}(b)\|_2 =\|b-\alpha_n(\alpha^{-1}(b))\|_2\to0.

For ψb=τ(b ⋅)\psi_b=\tau(b\,\cdot), trace preservation gives ψb∘αn−ψb∘α=τ((αn−1(b)−α−1(b)) ⋅)\psi_b\circ\alpha_n-\psi_b\circ\alpha=\tau((\alpha_n^{-1}(b)-\alpha^{-1}(b))\,\cdot). On the operator unit ball, Cauchy–Schwarz bounds its norm by ∥αn−1(b)−α−1(b)∥2\|\alpha_n^{-1}(b)-\alpha^{-1}(b)\|_2, tending to zero. The norm density (PB1) and the automorphisms' uniform predual isometry bounds give convergence for every normal functional. This is the stated topology.

For an outer example, take Z=diag⁡(1,−1)Z=\operatorname{diag}(1,-1) and the product automorphism ⨂jAd⁡(Z)\bigotimes_j\operatorname{Ad}(Z). It preserves the product trace. Here is a direct proof of outerness. Write X=(0110)X=\begin{pmatrix}0&1\\1&0\end{pmatrix}, and let XkX_k be this unitary in tensor leg kk. The product automorphism sends XkX_k to −Xk-X_k, since ZXZ=−XZXZ=-X. If it were Ad⁡(u)\operatorname{Ad}(u), then uXk=−XkuuX_k=-X_ku and ∥[u,Xk]∥2=2\|[u,X_k]\|_2=2. On the other hand bn=EAn(u)b_n=E_{A_n}(u) converges to uu in 22-norm, and for k>nk>n it commutes with XkX_k. Therefore

2=∥[u,Xk]∥2=∥[u−bn,Xk]∥2≤2∥u−bn∥2⟶0,(OA1)2=\|[u,X_k]\|_2 =\|[u-b_n,X_k]\|_2\le2\|u-b_n\|_2\longrightarrow0, \tag{OA1}

a contradiction. The zero overlaps ∣tr⁡2(Z)∣|\operatorname{tr}_2(Z)| also agree with the preceding lesson's product criterion. The finite prefix implementations converge as in (20). □\square

Problems with complete solutions

Exercise 1. For two rank-one projections in M2M_2 whose ranges make angle θ∈[0,π/2]\theta\in[0,\pi/2], compare the 22-norms of their difference and of the planar rotation minus one, using normalized trace.

Solution. In an orthonormal planar basis take e=diag⁡(1,0)e=\operatorname{diag}(1,0), ff onto (cos⁡θ,sin⁡θ)(\cos\theta,\sin\theta), and u=(cos⁡θ−sin⁡θsin⁡θcos⁡θ)u=\begin{pmatrix}\cos\theta&-\sin\theta\\\sin\theta&\cos\theta\end{pmatrix}. Then (e−f)2=sin⁡2θ 1(e-f)^2=\sin^2\theta\,1 and (u−1)∗(u−1)=2(1−cos⁡θ)1(u-1)^*(u-1)=2(1-\cos\theta)1. Thus ∥e−f∥2=sin⁡θ\|e-f\|_2=\sin\theta, ∥u−1∥2=2sin⁡(θ/2)\|u-1\|_2=2\sin(\theta/2), and (2) follows from 1−cos⁡θ≤sin⁡2θ1-\cos\theta\le\sin^2\theta. At θ=π/2\theta=\pi/2 its constant is attained.

Exercise 2. Let h=diag⁡(1/10,4/5)h=\operatorname{diag}(1/10,4/5) in M2M_2. Calculate the nearest spectral projection and verify (5)'s first inequality.

Solution. The projection is q=diag⁡(0,1)q=\operatorname{diag}(0,1). One has ∥h−q∥22=(1/100+1/25)/2=1/40\|h-q\|_2^2=(1/100+1/25)/2=1/40, whereas ∥h−h2∥22=((9/100)2+(4/25)2)/2=337/20000\|h-h^2\|_2^2=((9/100)^2+(4/25)^2)/2=337/20000. Hence 1/40≤4(337/20000)1/40\le4(337/20000), as required. The cutoff is applied to the spectrum of hh, not to its matrix entries in an arbitrary basis.

Exercise 3. A unital M3⊂MM_3\subset M has minimal projection trace 1/31/3. Explain why it cannot be contained exactly in a unital dyadic matrix subfactor, and why Lemma 3.1 still approximates it.

Solution. A unital embedding M3→M2pM_3\to M_{2^p} would require 2p=3r2^p=3r, by (7), which is impossible. For approximation choose r=⌊2p/3⌋r=\lfloor2^p/3\rfloor, truncate each diagonal to trace r2−pr2^{-p}, and retain the 3r3r connected dyadic pieces. Each matrix-unit error has squared 22-norm below 2−p2^{-p}, and the unused dyadic pieces complete the full matrix algebra. Exact containment and arbitrarily good approximation have different divisibility requirements.

Exercise 4. Why does the proof of Lemma 4.1 approximate all the corner entries e1ixej1e_{1i}xe_{j1}, rather than only xx?

Solution. The aligning unitary vv need not be close to one on the whole algebra. Its restriction to the first corner agrees with the controlled uu. The d2d^2 corner entries have that common control, and multiplication by the old ei1,e1je_{i1},e_{1j}, which lie exactly in the new algebra, reconstructs the approximation to xx. Approximating only xx would supply no estimate for its conjugate by the uncontrolled vv.

Exercise 5. In a corner of trace 1/91/9, convert an ambient 22-norm error 1/3001/300 to the normalized corner 22-norm.

Solution. Divide the squared norm by 1/91/9, so multiply the norm by 33. The answer is 1/1001/100. This normalization is a square-root factor, as in (18).

Exercise 6. Prove that R⊗ˉM3≅RR\bar\otimes M_3\cong R, although 33 divides no 2p2^p.

Solution. The increasing algebras M2p⊗M3M_{2^p}\otimes M_3 generate a separable finite factor and make it locally AFD. It is infinite dimensional, hence type II1\mathrm{II}_1. Theorem 5.1 identifies it with RR. The proof permits approximating those 3⋅2p3\cdot2^p-dimensional matrix factors by different dyadic factors; it does not put them exactly into a fixed dyadic tensor level.

Exercise 7. Show that the finiteness hypothesis in Lemma 6.1 is necessary, using the direct sum of the CAR vacuum and tracial representations.

Solution. In the vacuum representation, the average qn=n−1∑j≤naj∗ajq_n=n^{-1}\sum_{j\le n}a_j^*a_j converges strongly to zero on finite occupation vectors, hence everywhere by boundedness. In the tracial representation, independence gives ∥(qn−1/2)Ω∥22=1/(4n)\|(q_n-1/2)\Omega\|_2^2=1/(4n). For a fixed local polynomial xx, all but finitely many occupation projections commute with xx, so ∥[qn,x]∥→0\|[q_n,x]\|\to0. Thus qnxΩ→xΩ/2q_nx\Omega\to x\Omega/2; boundedness and local cyclic density give the strong limit 1/21/2.

On the direct sum the strong limit is 0⊕(1/2)10\oplus(1/2)1, giving a nontrivial central projection. The local CAR algebras are still increasing full matrix subfactors. Their closure is B(F(K))⊕RB(\mathcal F(K))\oplus R: the central projection separates the summands and each component has that closure. It is not finite because the infinite-dimensional B(F(K))B(\mathcal F(K)) summand is properly infinite. This exhibits the source's finite-versus-infinite distinction directly.

Exercise 8. For R⊗ˉRR\bar\otimes R, prove the isomorphism with RR without an injectivity-to-AFD theorem.

Solution. Its initial tensor levels are M2n⊗M2n≅M22nM_{2^n}\otimes M_{2^n}\cong M_{2^{2n}}; they form an increasing sequence whose union generates the spatial tensor product. Its product trace is faithful and normal, and it is a factor by the tensor commutation theorem. It is infinite dimensional and has separable predual. Theorem 5.1 therefore gives R⊗ˉR≅RR\bar\otimes R\cong R. Interleaving the two sequences of M2M_2 factors gives the same trace GNS isomorphism directly.

Exercise 9. For the outer automorphism in Theorem 6.3, write explicit inner approximants and estimate their error on an arbitrary x∈Rx\in R.

Solution. Put un=Z⊗n⊗1u_n=Z^{\otimes n}\otimes1. Its adjoint action agrees with the product automorphism on AnA_n. Both maps preserve the trace, so their difference on xx is at most 2∥x−EAn(x)∥22\|x-E_{A_n}(x)\|_2, tending to zero. The product innerness criterion excludes a global inner implementation, since its overlap-defect sum is ∑j1\sum_j1.

Exercise 10. Prove that every factor of type II1\mathrm{II}_1 contains a unital M7M_7, and explain why it also contains a unital RR.

Solution. Cut its identity into seven projections of trace 1/71/7. They are equivalent, so connecting them to a common reference constructs full unital 77-matrix units. For RR, use successive halvings in the relative commutants of the already chosen dyadic matrix factors, as in Section 6. The increasing union has factorial finite closure by Lemma 6.1, unbounded matrix sizes, and the product trace. It is the tracial GNS model of RR, regardless of the ambient factor's own separability or AFD status.

References and continuation

Claire Anantharaman and Sorin Popa, An introduction to II₁ factors, author draft. Lemma 11.2.1 and Theorem 11.2.2, printed pp.185–188, develop dyadic matrix approximation and trace-GNS identification with RR. Their containment induction uses amenability to obtain AFD corners. Sections 3–5 above instead give exact containment and local corner permanence directly from finite-set approximation, with no injectivity assumption and no separability needed for the local permanence argument. Separability is used only for the generating sequence and identification with RR.

Alain Connes, Outer conjugacy classes of automorphisms of factors, Annales scientifiques de l’École Normale Supérieure, series 4, 8 (1975), 383–419, DOI 10.24033/asens.1295. Lemmas 1.1.4–1.1.5, printed pp.388–389, develop projection repair and spectral rounding. The finite direct rotation above supplies a unitary and the stronger operator bound (2), including its exceptional orthogonal supports, for an arbitrary finite algebra. Equations (5), (6) and (6a) give the complete state spectral estimates.

The exact foundational inputs remain center-valued trace comparison, type II halving, projection support, normal representation amplification and trace densities. The finite trace expectations onto all unital subalgebras are constructed directly in HF0, and (PB1)–(PB2) prove the bounded trace topology and predual density used here. The general center-trace and arbitrary properly infinite projection arguments use the full local FCT0–7 and PC0–7 proofs linked above, including their exact scalar/spectral/predual inputs. The whole normal representation amplification and canonical semifinite finite-projection criterion are proved in NA0–6, including arbitrary multiplicity, all-net trace normality and the full finite matrix-corner reduction. The later finite outer-action and central-sequence arguments have their own prerequisites.

Jesse Peterson, Notes on operator algebras, April 27, 2020, printed/PDF pp.83–90 and102–107. The general projection and approximate-center-trace methods are written there. PC1–7 and FCT0–7 supply full arbitrary sums, central supports, finite cancellation, central tilings and normal assemblies. FCT0 also corrects the complex norm estimate in the source’s Lemma6.4.5; FCT5 retains both factors of its distortion parameter, and FCT6 uses the intended xx∗/x∗xxx^*/x^*x inequality throughout. These are full general finite proofs, beyond the tracial comparison in the Anantharaman–Popa draft.