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

Abelian pinching and relative commutants

Written by GPT-6.1 Sol (OpenAI), Ultra. Course exposition: CC0-1.0 to the extent of rights held. Earlier programme and human-source notices retain their own terms.

The quantity to control is the total diagonal GNS energy of a finite list. A binary cut inside each surviving corner removes a fixed fraction of that energy, simultaneously for the whole list. This gives finite partitions first; their scalar gaps then detect maximal abelianness and prepare MASA constructions inside expected subfactors. The argument uses the state only through centralizer invariance and orthogonal GNS blocks.

Throughout, M≠0M\ne0 is a von Neumann algebra with a faithful normal state φ\varphi. Put

∥x∥φ=φ(x∗x)1/2,Mφ={a∈M:φ(ax)=φ(xa) for all x∈M}.(1)\|x\|_\varphi=\varphi(x^*x)^{1/2},\qquad M_\varphi=\{a\in M:\varphi(ax)=\varphi(xa)\text{ for all }x\in M\}. \tag{1}

No factor or separability hypothesis is imposed in this lesson. We use the complete faithful-state expectation construction: a modular invariant unital subalgebra BB has a unique normal φ\varphi-preserving expectation EBE_B, and

EB(x)Ω=PB(xΩ),PB:Hφ→BΩ‾.(2)E_B(x)\Omega=P_B(x\Omega),\qquad P_B:H_\varphi\to\overline{B\Omega}. \tag{2}

The whole closed-graph reduction, algebra-valued compression, all-net normality and uniqueness are proved in SE1–SE5 of that construction. Subalgebras of MφM_\varphi, their relative commutants, and the algebras generated by those two commuting algebras are modular invariant. The restriction of φ\varphi to MφM_\varphi is a faithful normal trace.

1. Orthogonal energy and scalar gaps

Let e1,…,er∈Mφe_1,\ldots,e_r\in M_\varphi be nonzero mutually orthogonal projections with sum 11, and let A=∑iCeiA=\sum_i\mathbb Ce_i. Define

TA(x)=∑ieixei,SA(x)=∑iφ(eixei)φ(ei)ei.(3)T_A(x)=\sum_i e_i x e_i,\qquad S_A(x)=\sum_i\frac{\varphi(e_i x e_i)}{\varphi(e_i)}e_i. \tag{3}

Lemma 1.1. TA=EA′∩MT_A=E_{A'\cap M} and SA=EAS_A=E_A.

Proof. A′∩M=∑ieiMeiA'\cap M=\sum_i e_iMe_i, so TAT_A is a normal unital positive retraction onto that algebra and is bimodular there. Centralizer membership gives

φ(eixei)=φ(xei),φ(TA(x))=φ(x).\varphi(e_i x e_i)=\varphi(xe_i),\qquad \varphi(T_A(x))=\varphi(x).

Thus it is the expectation in (2). The coefficients in SAS_A are normal states of the corners; its formula gives a normal positive retraction fixing every eie_i, preserving φ\varphi, and bimodular over AA. Uniqueness gives its identification. Faithfulness ensures that every displayed denominator is positive. □\square

The corner vectors are pairwise orthogonal:

∥x∥φ2=∑i,j∥eixej∥φ2,∥TA(x)∥φ2=∑i∥eixei∥φ2.(4)\|x\|_\varphi^2=\sum_{i,j}\|e_i x e_j\|_\varphi^2,\qquad \|T_A(x)\|_\varphi^2=\sum_i\|e_i x e_i\|_\varphi^2. \tag{4}

Indeed, unequal left indices give zero by projection multiplication. For equal left indices and unequal right indices, move the final centralizer projection around the state pairing to obtain zero. This explains both identities.

The GNS projections satisfy SA≤TAS_A\le T_A, so TA−SAT_A-S_A is another orthogonal projection. Here and below inequalities between these maps mean inequalities between their GNS projections. If A⊂D⊂MφA\subset D\subset M_\varphi are finite-dimensional abelian algebras, their partitions refine one another and

SA≤SD≤TD≤TA,TD−SD≤TA−SA.(5)S_A\le S_D\le T_D\le T_A,\qquad T_D-S_D\le T_A-S_A. \tag{5}

For the last assertion, the range of TD−SDT_D-S_D lies in the range of TAT_A and is orthogonal to the range of SAS_A. Consequently a refinement never increases either the pinched norm or the gap norm.

2. The relative commutant in every surviving corner

For this section let N⊂MN\subset M be any unital von Neumann subalgebra, and let e∈Ne\in N be a nonzero projection. Write Ne=eNeN_e=eNe, Me=eMeM_e=eMe, and Nc=N′∩MN^c=N'\cap M.

Lemma 3.1. With z=cN(e)z=c_N(e), compression gives an isomorphism

Ncz⟶(Ne)′∩Me,y⟼ye.(8)N^c z\longrightarrow (N_e)'\cap M_e,\qquad y\longmapsto ye. \tag{8}

In particular

Ne∨((Ne)′∩Me)=(N∨Nc)e.(9)N_e\vee((N_e)'\cap M_e)=(N\vee N^c)_e. \tag{9}

Proof. Choose partial isometries vi∈Nv_i\in N with v0=ev_0=e, vi∗vi≤ev_i^*v_i\le e, and mutually orthogonal final projections summing strongly to zz. Such a family exists by maximal exhaustion: any nonzero remaining projection under zz has a nonzero corner with NeNe, since zz is the central support of ee; its polar part supplies another member.

For x∈(Ne)′∩Mex\in(N_e)'\cap M_e, define

y=∑ivixvi∗.(10)y=\sum_i v_i x v_i^*. \tag{10}

The sum is strong and bounded by ∥x∥\|x\|, because its summands act on orthogonal final subspaces and xx commutes with each initial projection. For a∈Nza\in Nz, the coefficients vi∗avj∈eNev_i^*av_j\in eNe commute with xx. Multiplying the two bounded sums therefore gives ya=ayya=ay. Also ye=xye=x: the other final projections are orthogonal to ee. Thus y∈Nczy\in N^c z.

If y∈Nczy\in N^c z and ye=0ye=0, then yvi=viye=0yv_i=v_i ye=0 for every ii, so y=0y=0. This proves uniqueness and injectivity; compression preserves products because yy commutes with ee. Finally, NN and NcN^c commute, and products abab, a∈N,b∈Nca\in N,b\in N^c, span an ultraweakly dense subalgebra of their join. Their compressions are (eae)(be)(eae)(be). Equation (8) now gives (9). □\square

This proof permits an arbitrary index set of partial isometries and imposes no type, factor, state or separability hypothesis.

3. Reduce the total energy by binary cuts

Return to N⊂MφN\subset M_\varphi, and put Nc=N′∩MN^c=N'\cap M and B=N∨NcB=N\vee N^c.

Theorem 5.1. Given x1,…,xs∈ker⁡EBx_1,\ldots,x_s\in\ker E_B and ε>0\varepsilon>0, there is a finite partition (ei)(e_i) of 11 in NN with

∥∑ieixjei∥φ≤ε∥xj∥φ(1≤j≤s).(14)\left\|\sum_i e_i x_j e_i\right\|_\varphi \le\varepsilon\|x_j\|_\varphi\qquad(1\le j\le s). \tag{14}

If Nc=CN^c=\mathbb C, the same conclusion applies to xj−EN(xj)x_j-E_N(x_j).

Proof. Remove the zero members of the list and let qq be the number remaining. If q=0q=0, the partition {1}\{1\} works. Otherwise write cj=∥xj∥φ>0c_j=\|x_j\|_\varphi>0. For a finite partition Q⊂N\mathcal Q\subset N define

E(Q)=∑j=1q∥TQ(xj)∥φ2cj2=∑e∈Q∑j=1q∥exje∥φ2cj2.(BP1)\mathcal E(\mathcal Q) =\sum_{j=1}^{q}\frac{\|T_{\mathcal Q}(x_j)\|_\varphi^2}{c_j^2} =\sum_{e\in\mathcal Q}\sum_{j=1}^{q} \frac{\|ex_je\|_\varphi^2}{c_j^2}. \tag{BP1}

The second equality is (4). In particular E({1})=q\mathcal E(\{1\})=q. We will refine every nonzero corner by at most one binary cut and reduce this single quantity by a factor 15/1615/16.

Zero averages for a whole tuple. Let Q⊂PωQ\subset P_\omega be a unital subalgebra of a von Neumann algebra PP with a faithful normal state ω\omega. Suppose z1,…,zqz_1,\ldots,z_q are orthogonal to Q′∩PQ'\cap P in its GNS space, and put Z=(zj)jZ=(z_j)_j in the Hilbert direct sum Hω⊕qH_\omega^{\oplus q}. Conjugation by u∈U(Q)u\in\mathcal U(Q) is an isometry on every component, since uu is in the centralizer.

Take the ultraweakly closed convex hull C⊂PqC\subset P^q of these tuple conjugates. Each component has the fixed operator bound ∥zj∥\|z_j\|, so Banach–Alaoglu gives compactness of CC. The map C→Hω⊕qC\to H_\omega^{\oplus q}, (yj)↦(yjΩω)(y_j)\mapsto(y_j\Omega_\omega), is weakly continuous: against bΩωb\Omega_\omega this is the normal functional ω(b∗yj)\omega(b^*y_j), and density and the uniform bounds extend the assertion to every Hilbert vector. Its image is weakly compact, convex and norm closed. It has a vector of smallest norm; for completeness, a sequence whose squared norms decrease to their infimum is Cauchy by the parallelogram identity applied to its midpoints. Its limit lies in this closed image. The same identity proves uniqueness.

The minimizing tuple Y0Y_0 is fixed by every conjugation, because conjugation preserves the image and its norm. Faithfulness puts each of its operator components in Q′∩PQ'\cap P. For b∈Q′∩Pb\in Q'\cap P, centralizer membership gives

ω(b∗uzju∗)=ω(u∗b∗uzj)=ω(b∗zj)=0.\omega(b^*u z_j u^*)=\omega(u^*b^*u z_j) =\omega(b^*z_j)=0.

These normal pairings vanish on the whole of CC. Taking b=(Y0)jb=(Y_0)_j shows that every component of the minimizer is zero. Thus 0∈C0\in C.

If Z≠0Z\ne0, some u∈U(Q)u\in\mathcal U(Q) satisfies ∥uZu∗−Z∥>∥Z∥\|uZu^*-Z\|>\|Z\|. Otherwise expansion of that squared norm gives Re⁡∑jω(zj∗uzju∗)≥∥Z∥2/2\operatorname{Re}\sum_j\omega(z_j^*u z_j u^*)\ge\|Z\|^2/2 for every uu. This is a normal real linear functional on tuples, so the inequality would also hold at 0∈C0\in C, a contradiction.

Choose one cut from a finite spectral grid. Set a=Re⁡ua=\operatorname{Re}u, b=Im⁡ub=\operatorname{Im}u, self-adjoint contractions in QQ. The finite Borel sums

an=−1+2n∑k=0n−11(−1+2k/n,∞)(a),bn=−1+2n∑k=0n−11(−1+2k/n,∞)(b)a_n=-1+\frac2n\sum_{k=0}^{n-1} 1_{(-1+2k/n,\infty)}(a),\qquad b_n=-1+\frac2n\sum_{k=0}^{n-1} 1_{(-1+2k/n,\infty)}(b)

approximate a,ba,b in operator norm, with error at most 2/n2/n, as is checked on each scalar spectral value in [−1,1][-1,1]. Left and right multiplication by a centralizer element are bounded on HωH_\omega, with bound its operator norm. For positivity on the centralizer, ω(z∗z h)=ω(h1/2z∗zh1/2)≥0\omega(z^*z\,h)=\omega(h^{1/2}z^*z h^{1/2})\ge0 for h≥0h\ge0. For the right bound, ω((zd)∗(zd))=ω(z∗z dd∗)\omega((zd)^*(zd))=\omega(z^*z\,dd^*), and the positive functional h↦ω(z∗z h)h\mapsto\omega(z^*z\,h) on the centralizer gives ω(z∗z dd∗)≤∥d∥2ω(z∗z)\omega(z^*z\,dd^*)\le\|d\|^2\omega(z^*z). Consequently [an+ibn,Z]→[u,Z][a_n+ib_n,Z]\to[u,Z] in the direct-sum norm. Right multiplication by uu is an isometry, so ∥[u,Z]∥=∥uZu∗−Z∥>∥Z∥\|[u,Z]\|=\|uZu^*-Z\|>\|Z\|. Choose nn so that ∥[an+ibn,Z]∥>∥Z∥\|[a_n+ib_n,Z]\|>\|Z\|.

The two displayed sums have total absolute coefficient 44; their constant terms commute with ZZ. If every one of their 2n2n spectral projections pp satisfied ∥[p,Z]∥≤∥Z∥/4\|[p,Z]\|\le\|Z\|/4, the triangle inequality would give ∥[an+ibn,Z]∥≤∥Z∥\|[a_n+ib_n,Z]\|\le\|Z\|, a contradiction. Thus one of these projections has ∥[p,Z]∥>∥Z∥/4\|[p,Z]\|>\|Z\|/4.

Let r=1−pr=1-p. The four blocks pzjp,pzjr,rzjp,rzjrpz_jp,pz_jr,rz_jp,rz_jr are orthogonal for every jj, by (4). Since [p,zj]=pzjr−rzjp[p,z_j]=pz_jr-rz_jp, removing the two off-diagonal blocks gives the exact identity and strict bound

∑j∥pzjp+rzjr∥ω2=∥Z∥2−∑j∥[p,zj]∥ω2<1516∥Z∥2.(BP2)\sum_j\|pz_jp+rz_jr\|_\omega^2 =\|Z\|^2-\sum_j\|[p,z_j]\|_\omega^2 <\frac{15}{16}\|Z\|^2. \tag{BP2}

The chosen projection is neither 00 nor 11. A zero tuple requires no cut.

Repeat inside the current corners. For e∈Qe\in\mathcal Q, use the faithful normal state φe=φ(e)−1φ∣eMe\varphi_e=\varphi(e)^{-1}\varphi|_{eMe} and the subalgebra eNeeNe in its centralizer. Lemma 3.1 identifies its relative commutant with eNceeN^ce, which is contained in eBeeBe. Each exjeex_je is orthogonal to eBeeBe: for x=xjx=x_j and b∈Bb\in B,

φ(b∗exe)=φ((eb∗e)x)=0,(15)\varphi(b^*exe)=\varphi((eb^*e)x)=0, \tag{15}

using centralizer membership of ee and EB(x)=0E_B(x)=0. Apply the tuple construction to zj=exje/cjz_j=ex_je/c_j in this corner. Its identity is ee, so the complement of the selected p≤ep\le e is e−pe-p. Multiplying (BP2) by φ(e)\varphi(e) gives the corresponding bound in the original state. Combine the cuts in the finitely many corners. Formula (BP1) now gives E(Qnew)≤(15/16)E(Q)\mathcal E(\mathcal Q_{\mathrm{new}})\le(15/16)\mathcal E(\mathcal Q); zero corners contribute zero and remain unsplit.

Starting from {1}\{1\}, after mm rounds this yields

E(Qm)≤(15/16)mq,∣Qm∣≤2m.(BP3)\mathcal E(\mathcal Q_m)\le(15/16)^m q,\qquad |\mathcal Q_m|\le2^m. \tag{BP3}

Choose a nonnegative integer mm with (15/16)mq≤ε2(15/16)^m q\le\varepsilon^2. Every individual nonnegative summand in (BP1) is then at most ε2\varepsilon^2, which proves (14) for every member simultaneously. The removed zero members also satisfy it. If Nc=CN^c=\mathbb C, then B=NB=N, so apply this argument to xj−EN(xj)x_j-E_N(x_j). □\square

A binary cut removes the two off-diagonal GNS blocks and reduces the energy of the entire tuple.

Figure 1. The rectangles represent closed GNS block subspaces, not one-dimensional matrix entries. In a corner with identity ee, put r=e−pr=e-p; the squared norms of the two removed blocks sum to ∑j∥[p,zj]∥φe2\sum_j\|[p,z_j]\|_{\varphi_e}^2. The finite real/imaginary spectral grid selects a cut for the whole tuple, giving the exact energy identity (BP2) and the round estimate (BP3). The zero-average method has its finite tracial predecessor in Popa's preprint, printed pp.5–8; the simultaneous binary construction and this figure are supplied here.

4. The limiting scalar-gap test

Theorem 2.1. Let (Ai)(A_i) be an increasing directed net of finite-dimensional abelian subalgebras of MφM_\varphi, and put A=(⋃iAi)′′A=(\bigcup_i A_i)''. Then AA is maximal abelian in MM if and only if

∥TAi(x)−SAi(x)∥φ⟶0(x∈M).(6)\|T_{A_i}(x)-S_{A_i}(x)\|_\varphi\longrightarrow0 \qquad(x\in M). \tag{6}

Proof. The subspaces AiΩ‾\overline{A_i\Omega} increase to AΩ‾\overline{A\Omega}, by bounded strong density of the increasing union. Thus their projections converge strongly to PAP_A, and SAi(x)→EA(x)S_{A_i}(x)\to E_A(x) in φ\varphi-norm.

The projections onto (Ai′∩M)Ω‾\overline{(A_i'\cap M)\Omega} decrease. Call their strong limit PP. We identify it without assuming that arbitrary intersections commute with Hilbert space closure. Fix x∈Mx\in M. The elements TAi(x)T_{A_i}(x) have norm at most ∥x∥\|x\|, and their GNS vectors converge to P(xΩ)P(x\Omega). An ultraweakly convergent subnet has a limit b∈Mb\in M. For every z∈Mz\in M, normality of φ(z∗ ⋅)\varphi(z^*\,\cdot) identifies

φ(z∗b)=lim⁡iφ(z∗TAi(x)),bΩ=P(xΩ).(7)\varphi(z^*b)=\lim_i\varphi(z^*T_{A_i}(x)), \qquad b\Omega=P(x\Omega). \tag{7}

The subnet is eventually in Aj′∩MA_j'\cap M for each fixed jj; these algebras are ultraweakly closed. Hence b∈A′∩Mb\in A'\cap M. Conversely (A′∩M)Ω‾\overline{(A'\cap M)\Omega} lies in every one of the decreasing subspaces. Since MΩM\Omega is dense, (7) proves that P=PA′∩MP=P_{A'\cap M}.

Therefore TAi(x)→EA′∩M(x)T_{A_i}(x)\to E_{A'\cap M}(x) in φ\varphi-norm. Condition (6) is equivalent to EA′∩M=EAE_{A'\cap M}=E_A, by faithfulness, and hence to A′∩M=AA'\cap M=A. □\square

In particular the test applies to finite partitions generating any abelian algebra in the centralizer. It does not require a sequence: finite spectral partitions form a directed generating family even when the algebra is nonseparable.

5. Scalar approximation and equal atoms

Theorem 6.1. Suppose N⊂MφN\subset M_\varphi and N′∩M⊂NN'\cap M\subset N. For a finite F⊂MF\subset M and ε>0\varepsilon>0, there is a finite-dimensional abelian A⊂NA\subset N such that

∥TA(x)−SA(x)∥φ<ε(x∈F).(16)\|T_A(x)-S_A(x)\|_\varphi<\varepsilon\qquad(x\in F). \tag{16}

If NN is a II1\mathrm{II}_1 factor, AA can be chosen with 2k2^k mutually equivalent minimal projections, with kk as large as prescribed. If NN is a finite type I factor, it can be chosen as a full diagonal algebra.

Proof. Our relative-commutant hypothesis gives B=NB=N. Decompose x=y+zx=y+z, with y=EN(x)y=E_N(x), z=x−EN(x)z=x-E_N(x). Theorem 5.1 supplies a finite abelian A0⊂NA_0\subset N with

∥TA0(z)∥φ≤δ∥z∥φ(x∈F).(17)\|T_{A_0}(z)\|_\varphi\le\delta\|z\|_\varphi \quad(x\in F). \tag{17}

In each minimal corner eNeeNe of A0A_0, choose a MASA DeD_e. It lies in the centralizer of the corner state, since that state is tracial on eNeeNe. Finite spectral partitions generate DeD_e. Theorem 2.1, now in eNeeNe, supplies a finite abelian refinement whose gap on the finitely many eyeeye is at most δ∥eye∥φ\delta\|eye\|_\varphi. Combine these refinements into A⊃A0A\supset A_0.

For y∈Ny\in N, formula (3) shows that the ambient and the NN-internal gap agree. Corner orthogonality gives

∥(TA−SA)(y)∥φ≤δ∥y∥φ.\|(T_A-S_A)(y)\|_\varphi\le\delta\|y\|_\varphi.

Also SA(z)=0S_A(z)=0, since A⊂NA\subset N, and TA≤TA0T_A\le T_{A_0}. Therefore

∥(TA−SA)(x)∥φ≤δ(∥y∥φ+∥z∥φ)≤2 δ∥x∥φ.(18)\|(T_A-S_A)(x)\|_\varphi \le\delta(\|y\|_\varphi+\|z\|_\varphi) \le\sqrt2\,\delta\|x\|_\varphi. \tag{18}

The last step uses the orthogonal decomposition in (2). Choose δ\delta small enough for all x∈Fx\in F. This proves (16).

The sharper bound δ∥x∥φ\delta\|x\|_\varphi also follows by orthogonality: (TA−SA)(y)∈N(T_A-S_A)(y)\in N, while TA(z)T_A(z) is orthogonal to NN, since TAT_A is self-adjoint on GNS space and preserves NN. Add their squared estimates rather than their norms to obtain that bound.

Now let NN be a II1\mathrm{II}_1 factor. Its restricted state is its normalized trace τ\tau. For the minimal projections f1,…,frf_1,\ldots,f_r of AA, choose positive dyadic numbers mi/2km_i/2^k summing to 11 and approaching τ(fi)\tau(f_i). Transfer small orthogonal subprojections from the atoms with excess trace to those with deficit trace, using the continuous trace cuts in a type II factor. This gives a partition fi(k)f_i^{(k)} of those exact traces with

∑i∥fi(k)−fi∥22=∑i∣τ(fi(k))−τ(fi)∣⟶0.(19)\sum_i\|f_i^{(k)}-f_i\|_2^2 =\sum_i|\tau(f_i^{(k)})-\tau(f_i)|\longrightarrow0. \tag{19}

Their differences are self-adjoint centralizer elements, so they tend strong* to zero in MM. Bounded multiplication is strong* continuous. Formula (3), normality of φ\varphi, and the positive limiting denominators consequently show that both expectations on each fixed x∈Fx\in F converge in φ\varphi-norm. Preserve the strict margin in (16).

Split each fi(k)f_i^{(k)} into mim_i projections of trace 2−k2^{-k}. They are equivalent by finite-factor projection comparison. Their diagonal algebra refines the perturbed one, so (5) preserves the gap bound. Increasing kk makes its size arbitrarily large.

Finally, if NN is a finite type I factor, a full diagonal algebra has equal rank-one atoms and is maximal abelian in MM. Indeed N′∩M⊂NN'\cap M\subset N gives N′∩M=CN'\cap M=\mathbb C; the type I matrix decomposition then gives M=NM=N. Its gap is zero. □\square

The equal atoms can have dyadic size, as required for later exact matrix containment. The triangle inequality in (18) has the factor 2\sqrt2; the orthogonal decomposition gives the sharper estimate described immediately after it.

6. Separate quantitative displacement estimates

The collective construction above also has useful single-operator estimates. Again put Nc=N′∩MN^c=N'\cap M for N⊂MφN\subset M_\varphi.

Lemma 4.1. If x≠0x\ne0, ENc(x)=0E_{N^c}(x)=0, and η>0\eta>0, there is a unitary u∈Nu\in N such that

∥uxu∗−x∥φ2>(2−η)∥x∥φ2.(11)\|uxu^*-x\|_\varphi^2>(2-\eta)\|x\|_\varphi^2. \tag{11}

Proof. Let CC be the ultraweakly closed convex hull of the unitary conjugates of xx. It is compact and bounded. Its GNS image is weakly compact, hence norm closed: the map is weakly continuous on a bounded set, first against zΩz\Omega by the normal pairings φ(z∗ ⋅)\varphi(z^*\,\cdot), then against every vector by density and uniform bounds. It has a unique vector of least norm, represented by y0∈Cy_0\in C.

Conjugation by v∈U(N)v\in\mathcal U(N) is a φ\varphi-norm isometry preserving CC. Uniqueness and faithfulness give vy0v∗=y0vy_0v^*=y_0, so y0∈Ncy_0\in N^c. For b∈Ncb\in N^c and u∈U(N)u\in\mathcal U(N),

φ(b∗uxu∗)=φ(u∗b∗ux)=φ(b∗x)=0.\varphi(b^*uxu^*)=\varphi(u^*b^*ux) =\varphi(b^*x)=0.

Every vector of CΩC\Omega is thus orthogonal to NcΩ‾\overline{N^c\Omega}; in particular y0Ωy_0\Omega is orthogonal to itself. Hence y0=0y_0=0.

If every unitary failed (11), expanding the squared norm and using its isometry would give

2Re⁡φ(x∗uxu∗)≥η∥x∥φ2.2\operatorname{Re}\varphi(x^*uxu^*)\ge\eta\|x\|_\varphi^2.

The same inequality holds on the convex hull and its ultraweak closure, since this pairing is normal. It cannot hold at 0∈C0\in C. □\square

Lemma 4.2. If u∈U(Mφ)u\in\mathcal U(M_\varphi) and ∥uxu∗−x∥φ>∥x∥φ\|uxu^*-x\|_\varphi>\|x\|_\varphi, there is a finite spectral partition e1,…,ere_1,\ldots,e_r of uu such that

∥∑ieixei∥φ2≤34∥x∥φ2.(12)\left\|\sum_i e_i x e_i\right\|_\varphi^2 \le\frac34\|x\|_\varphi^2. \tag{12}

Proof. Approximate uu in operator norm by v=∑iλieiv=\sum_i\lambda_i e_i, ∣λi∣=1|\lambda_i|=1, retaining ∥vxv∗−x∥φ>∥x∥φ\|vxv^*-x\|_\varphi>\|x\|_\varphi. Right multiplication by a centralizer element has norm at most its operator norm on HφH_\varphi, so this follows from norm approximation of uu. The orthogonal blocks in (4) give

∥vxv∗−x∥φ2=∑i≠j∣λiλj‾−1∣2∥eixej∥φ2≤4∑i≠j∥eixej∥φ2.(13)\|vxv^*-x\|_\varphi^2 =\sum_{i\ne j}|\lambda_i\overline{\lambda_j}-1|^2 \|e_i x e_j\|_\varphi^2 \le4\sum_{i\ne j}\|e_i x e_j\|_\varphi^2. \tag{13}

At least one quarter of the total energy is off diagonal; subtract it using (4). □\square

7. Exercises with complete solutions

Exercise 1. Derive both formulas (3) when M=M3M=M_3, φ(x)=Tr⁡(ρx)\varphi(x)=\operatorname{Tr}(\rho x), and ρ=diag⁡(1/2,1/3,1/6)\rho=\operatorname{diag}(1/2,1/3,1/6), using the rank-one diagonal partition.

Solution. Each eie_i commutes with ρ\rho, so is in the centralizer. Pinching keeps the three diagonal entries. Its scalar coefficient in the ii-th corner is φ(eixei)/φ(ei)=ρiixii/ρii=xii\varphi(e_i x e_i)/\varphi(e_i)=\rho_{ii}x_{ii}/\rho_{ii}=x_{ii}. Thus TA=SA=diag⁡(x11,x22,x33)T_A=S_A=\operatorname{diag}(x_{11},x_{22},x_{33}). The unequal state weights cancel inside each atom.

Exercise 2. Show that refinement can remove diagonal energy that survived an earlier partition.

Solution. In M3M_3 take the coarse partition e1=p1+p2,e2=p3e_1=p_1+p_2,e_2=p_3 and x=e12x=e_{12}. Then TA(x)=xT_A(x)=x. Refining to the three rank-one projections makes every pixpi=0p_i x p_i=0, so TD(x)=0T_D(x)=0. This is consistent with TD≤TAT_D\le T_A.

Exercise 3. Prove the final inequality of (5) from subspace inclusions.

Solution. A vector in the range of TD−SDT_D-S_D belongs to (D′∩M)Ω‾⊂(A′∩M)Ω‾\overline{(D'\cap M)\Omega}\subset\overline{(A'\cap M)\Omega} and is orthogonal to DΩ‾⊃AΩ‾\overline{D\Omega}\supset\overline{A\Omega}. It therefore lies in the range of TA−SAT_A-S_A. Inclusion of closed subspaces is exactly the asserted order of their orthogonal projections.

Exercise 4. Why is an ultraweak cluster point in Theorem 2.1 sufficient to identify the decreasing GNS projection?

Solution. The pinched operators are bounded. Against every vector zΩz\Omega, their GNS pairings are the normal functionals φ(z∗ ⋅)\varphi(z^*\,\cdot), so the cluster point bb has GNS vector equal to the already existing projection limit. Eventual membership in each Aj′∩MA_j'\cap M puts bb in their intersection. Density of MΩM\Omega identifies the entire projection, not merely its value on one test vector.

Exercise 5. Check (8) in N=M2⊗1⊂M=M2⊗ˉPN=M_2\otimes1\subset M=M_2\bar\otimes P, with e=e11⊗1e=e_{11}\otimes1.

Solution. N′∩M=1⊗PN'\cap M=1\otimes P. The corner eMe=e11⊗PeMe=e_{11}\otimes P, while eNe=CeeNe=\mathbb Ce, so its relative commutant is the entire corner. Compression sends 1⊗y1\otimes y to e11⊗ye_{11}\otimes y, an isomorphism. Equation (9) is then e11⊗P=eMee_{11}\otimes P=eMe.

Exercise 6. Explain where central support enters the uniqueness in (8).

Solution. If y∈Nczy\in N^c z and ye=0ye=0, commutation gives yvi=viye=0yv_i=v_i ye=0. The final projections vivi∗v_i v_i^* sum to zz, so yz=0yz=0, and its support condition gives y=0y=0. Without that support restriction an element on 1−z1-z would also compress to zero.

Exercise 7. Verify the coefficient 44 in (13) for u=diag⁡(1,−1)u=\operatorname{diag}(1,-1) and x=e12x=e_{12} with normalized trace on M2M_2.

Solution. uxu∗=−xuxu^*=-x, so the squared displacement is 4∥x∥22=24\|x\|_2^2=2. The sole nonzero block is off diagonal, with coefficient ∣1(−1)−1∣2=4|1(-1)-1|^2=4. Thus (13) is an equality. The pinched operator is zero.

Exercise 8. How many single-element refinement rounds suffice to make a pinched norm at most 10−2∥x∥φ10^{-2}\|x\|_\varphi?

Solution. It suffices that (3/4)m≤10−4(3/4)^m\le10^{-4}, or m≥log⁡(10−4)/log⁡(3/4)m\ge\log(10^{-4})/\log(3/4). This quotient is between 3232 and 3333, so 3333 rounds suffice. Each round has a finite partition; no uniform bound on its number of atoms is asserted.

Exercise 9. Prove (15) directly using the GNS orthogonality of xx to BB.

Solution. For b∈Bb\in B, centralizer membership of ee gives φ(b∗exe)=φ(eb∗ex)\varphi(b^*exe)=\varphi(eb^*ex). Since ebe∈Bebe\in B, this is the inner product of xΩx\Omega with (ebe)Ω(ebe)\Omega, hence zero. Dividing by φ(e)\varphi(e) gives the identical corner-state orthogonality.

Exercise 10. Give a finite example showing why the last bound in (18) needs 2\sqrt2.

Solution. With normalized trace on M2M_2 and NN its diagonal algebra, take x=e11+e12x=e_{11}+e_{12}. Then EN(x)=e11E_N(x)=e_{11}, x−EN(x)=e12x-E_N(x)=e_{12}, and both component norms are 1/21/\sqrt2. Their sum is 2\sqrt2, whereas ∥x∥2=1\|x\|_2=1. Orthogonality gives the corrected factor exactly.

Exercise 11. Explain why dyadic perturbation in (19) preserves (16) even though the ambient state need not be tracial.

Solution. The projection differences lie in NN, where φ\varphi is tracial, and are self-adjoint. Their small 22-norm therefore gives small symmetric state seminorm, hence bounded strong* convergence in MM. Fixed multiplication and normal scalar pairings in (3) preserve that convergence, and the finitely many denominators tend to positive numbers. Both expectation values on each prescribed xx converge in φ\varphi-norm. A strict finite margin remains for sufficiently large kk.

Exercise 12. Why does splitting a perturbed atom into equal subatoms require no new gap estimate?

Solution. The new diagonal algebra contains the old one. Its scalar GNS projection increases and its commutant projection decreases, so its gap projection is below the old gap by (5). Applying the two projections to any xΩx\Omega proves the required norm inequality immediately.

Reading and prerequisites

Sorin Popa, On a problem of R. V. Kadison on maximal abelian *-subalgebras in factors, INCREST preprint 41/1981, May 1981, second version, printed pp.3–10 (PDF pp.7–14). The finite-trace expectation and scalar-gap framework, corner compression, convex-orbit averaging and spectral pinching are the classical antecedents. The source treats a finite list by successive refinement. Section 3 here instead controls one normalized direct-sum energy: a grid for the real and imaginary parts of a unitary selects one binary cut in each corner, with squared-energy factor 15/1615/16 and at most 2m2^m atoms after mm rounds. The separate 3/43/4 estimate remains available for one operator. The arbitrary-index corner lifting, directed GNS limit, nontracial centralizer scope and exact dyadic perturbation are supplied at their stated hypotheses. In the preprint's Lemma 1.5, two half-error estimates control the two components separately.

The faithful-state expectation and its GNS projection identity are supplied by the linked SE1–SE5 proof, built from the bounded-graph modular foundations; the broader general-weight expectation route is not consumed here. Projection central support, polar decomposition, type II trace cuts and finite projection comparison are the selected projection and trace foundations. The projection and trace arguments are supplied by PC1–7 and TL5; the following details give the directed and perturbative steps used here.

Directed limits and finite trace refinements

Maximal abelian algebras and finite partitions. In a unital von Neumann algebra, order its unital abelian von Neumann subalgebras by inclusion. For a chain, its union is a commuting star algebra. Its generated von Neumann algebra is still abelian: every member of the union commutes with the union and hence with its bicommutant; taking commutants once more proves commutation of that bicommutant with itself. Thus every chain has an upper bound. The maximal principle gives a maximal member DD. If D′∩ND'\cap N contained a self-adjoint element outside DD, adjoining that element would give a larger abelian algebra; real and imaginary parts therefore give D′∩N=DD'\cap N=D.

The finite Boolean algebras generated by finite lists of projections of DD form a directed family of finite partitions. They generate DD: finite spectral step sums approximate each bounded self-adjoint element of DD in operator norm, and real and imaginary parts span DD. Consequently their union has bounded strong-dense unit ball by the bounded density argument. These facts apply in each corner eNeeNe, without a countability assumption.

Directed Hilbert projections. If (pi)(p_i) is an increasing net of orthogonal projections and i≤ji\le j, then

∥(pj−pi)ξ∥2=∥pjξ∥2−∥piξ∥2.\|(p_j-p_i)\xi\|^2=\|p_j\xi\|^2-\|p_i\xi\|^2.

The scalar net on the right has a finite supremum. For any tolerance choose one index whose squared norm is sufficiently close to that supremum, then take a common upper bound for any two later indices. The triangle inequality through that upper bound makes (piξ)(p_i\xi) a Cauchy net. Its limit lies in the closed span of the ranges and fixes that span, so the strong limit is its orthogonal projection. Apply the same proof to 1−pi1-p_i for a decreasing family. The bounded cluster-point argument in Theorem 2.1 identifies the latter range in the particular von Neumann commutants; no general equality between an intersection of closures and the closure of an intersection is used.

Finite dyadic transfers. Write ti=τ(fi)>0t_i=\tau(f_i)>0 for the finitely many atoms in Theorem 6.1. For all sufficiently large kk, set mi=⌊2kti⌋m_i=\lfloor2^kt_i\rfloor for i<ri<r and mr=2k−∑i<rmim_r=2^k-\sum_{i<r}m_i. These integers are positive, their sum is 2k2^k, and si=mi2−k→tis_i=m_i2^{-k}\to t_i. Let di=ti−sid_i=t_i-s_i on the donor indices and cj=sj−tjc_j=s_j-t_j on the recipient indices. Their positive totals agree. Pair a remaining donor with a remaining recipient and transfer the smaller remaining amount, continuing finitely many times; at each step at least one index is exhausted. TL5 cuts the required projection inside the unused part of that donor. The transfers are mutually orthogonal and each original atom only gives or only receives. The resulting projections form a partition and satisfy

fi(k)≤fi(si≤ti),fi(k)≥fi(si≥ti).f_i^{(k)}\le f_i\quad(s_i\le t_i),\qquad f_i^{(k)}\ge f_i\quad(s_i\ge t_i).

Their signed differences are projections, so their squared trace norms are exactly ∣si−ti∣|s_i-t_i|, proving (19) with the stated constant.

On bounded subsets a faithful normal state's symmetric seminorm gives the strong-star topology, by the normal-functional domination proof NT2. Thus those self-adjoint differences converge strong-star in the ambient algebra, even though its state need not be a trace. For a fixed xx, bounded strong-star multiplication gives fi(k)xfi(k)→fixfif_i^{(k)}xf_i^{(k)}\to f_ixf_i strong-star. Each normal state pairing converges, and each denominator in (3) tends to ti>0t_i>0. Finite sums then prove the asserted convergence of both expectations, preserving every strict finite error margin. Cutting fi(k)f_i^{(k)} into mim_i projections of trace 2−k2^{-k} and using finite-factor comparison supplies all the equivalent atoms, for arbitrarily large kk.

The finite type I endpoint. If N=MdN=M_d, choose matrix units (eij)(e_{ij}) in NN. The hypothesis N′∩M⊂NN'\cap M\subset N makes that relative commutant scalar. Lemma 3.1 at e=e11e=e_{11} gives eMe=CeeMe=\mathbb Ce, because eNe=CeeNe=\mathbb Ce. For any x∈Mx\in M, expand

x=∑i,jei1(e1ixej1)e1j.x=\sum_{i,j}e_{i1}(e_{1i}xe_{j1})e_{1j}.

Each parenthesized coefficient lies in eMeeMe and is scalar there, so x∈Nx\in N. Hence M=NM=N, and a full diagonal has zero scalar gap as claimed. This includes d=1d=1.