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

Finite corners, unitary displacement and the tensor tail

Programme exposition: CC0-1.0 to the extent of rights held. Human-source terms remain separate.

The fullness and hypercentrality lesson needs three constructions beyond the centralizing quotient: division of a finite algebra with its center retained, a unitary moving a trace-zero element, and an exact map onto a tensor tail. Its nonfactor example also needs a proof of its center and type, rather than an appeal to unspecified fibers.

We use the complete retained CF calculus and Hilbert arguments, SC00–07 measure and Lp proofs, CP preduals, BD bounded density, PC0–7/FCT0–7, NT1–2, FG2's complete dyadic factor model, and CQ2's trace representation. Inner products below are linear in the second variable; conjugating SC07's convention gives this convention with the same Hilbert norm.

FH0. A normalized tracial state on a finite factor is normal

Let NN be a nonzero finite factor, and let σ\sigma be any positive normalized tracial functional on NN. Normality is not assumed. FCT0–7 constructs the canonical faithful normal center-valued trace. Since Z(N)=C1Z(N)=\mathbb C1, write it as T(x)=τ0(x)1T(x)=\tau_0(x)1; its scalar τ0\tau_0 is a faithful normal normalized trace.

If NN has a minimal projection pp, choose a maximal orthogonal family of copies of pp. It fills 11: a nonzero residual has a polar bridge to pp by PC2, whose nonzero initial projection must equal pp, supplying another copy. The family is finite by FCT2's prohibition of infinitely many orthogonal copies of one nonzero projection in a finite algebra. Write it as p1,…,pdp_1,\ldots,p_d. The corners piNpip_iNp_i are scalar by the bounded spectral calculus and minimality. Partial isometries between the copies give matrix units eije_{ij}, and every x∈Nx\in N is their finite linear combination, because each corner pixpjp_i x p_j has one scalar coefficient after transport into pNppNp. Traciality gives σ(pi)=1/d\sigma(p_i)=1/d, and σ(eij)=σ(pieij)=σ(eijpi)=0\sigma(e_{ij})=\sigma(p_i e_{ij})=\sigma(e_{ij}p_i)=0 for i≠ji\ne j. Thus σ=τ0\sigma=\tau_0 on this entire finite matrix algebra.

If NN has no minimal projection, it has no abelian projection: PC4 makes the center of each nonzero factor corner scalar, so an abelian corner would be one-dimensional and its unit minimal. FH1's finite type criterion therefore makes NN a type II1\mathrm{II}_1 factor. AF2's full trace-cut construction, based on FCT3's halving and FCT7 comparison, cuts any projection to any prescribed τ0\tau_0-mass between zero and its mass. It constructs a partition of 11 into mm equivalent projections, for each integer m≥1m\geq1. Traciality and normalization give σ\sigma-mass 1/m1/m to each cell. FCT7 shows that any projection of τ0\tau_0-mass a/ma/m, 0≤a≤m0\leq a\leq m, is equivalent to a sum of aa such cells and therefore has σ\sigma-mass a/ma/m.

For any projection qq, put α=τ0(q)\alpha=\tau_0(q). Choose integers am=⌊mα⌋a_m=\lfloor m\alpha\rfloor and bm=⌈mα⌉b_m=\lceil m\alpha\rceil. Cut inside qq to obtain qm−≤qq_m^-\leq q of mass am/ma_m/m, and add a cut of its complement to obtain qm+≥qq_m^+\geq q of mass bm/mb_m/m. The added mass is at most τ0(1−q)\tau_0(1-q), so the construction covers the endpoint cases as well. Positivity gives

amm=σ(qm−)≤σ(q)≤σ(qm+)=bmm.\frac{a_m}{m}=\sigma(q_m^-)\leq\sigma(q) \leq\sigma(q_m^+)=\frac{b_m}{m}.

Both endpoints tend to α\alpha, so σ(q)=τ0(q)\sigma(q)=\tau_0(q). Uniform bounded spectral step approximation gives equality on self-adjoint elements: positive normalized functionals are bounded of norm one by CF, so equality on projection steps passes to the norm limit. Real and imaginary parts give equality everywhere. Hence σ=τ0\sigma=\tau_0 and is normal. No separable-predual assumption or normality assertion about an arbitrary trace on a nonfactor algebra was used.

FH1. The finite type criterion and halving without a factor assumption

Let NN be a finite von Neumann algebra. An abelian projection pp means a projection whose corner pNppNp is commutative. The central type I part is precisely the part generated by the central supports of these projections. The full construction of this part is in FCT3: put

zI=⋁{c(p):pNp commutative}.z_{\mathrm I}=\bigvee\{c(p):pNp\text{ commutative}\}.

Every nonzero projection below zIz_{\mathrm I} has a nonzero abelian subprojection. A polar bridge to an abelian corner supplies one; absence of all such bridges would make its central support orthogonal to every support in the displayed join, a contradiction by PC2. FCT3 constructs the finite homogeneous families on this part by central comparison, with all central pieces retained. Thus this description does not presume a type I factor classification.

If N≠0N\ne0 has no nonzero abelian projection, zI=0z_{\mathrm I}=0. Finiteness excludes the infinite type II and type III parts. The resulting finite algebra with no abelian part is type II1\mathrm{II}_1; this statement does not say that its center is scalar. A faithful normalized trace, when specified, remains its finite trace, independent of whether its predual is separable. For the zero algebra the projection split is 0=0+00=0+0, with no nonzero type or factor conclusion.

Here is the required division directly. In any nonzero projection corner eNeeNe, absence of an abelian projection implies noncommutativity. Some projection aa in the corner is not central: otherwise the complete bounded spectral step approximation would make every self-adjoint element central, and real and imaginary parts would make the whole corner commutative. A noncentral aa has a nonzero off-diagonal element ax(e−a)ax(e-a) or its adjoint. PC1 polar decomposition gives two nonzero orthogonal equivalent projections, one below aa, the other below e−ae-a.

Choose a maximal collection of such pairs inside ee, with all their initial and final projections mutually orthogonal. Unions of chains remain collections of this kind, so PC0's choice argument applies. If the complementary remainder were nonzero, its corner would supply another pair by the preceding construction. The remainder must therefore be zero. PC1's arbitrary orthogonal strong* sums add the pair projections and implementing partial isometries. They give

e=p+q,pq=0,p∼q.(FH1.1)e=p+q,\quad pq=0,\quad p\sim q. \tag{FH1.1}

For an implementing vv with v∗v=p, vv∗=qv^*v=p,\ vv^*=q, the elements e11=p, e22=q, e21=v, e12=v∗e_{11}=p,\ e_{22}=q,\ e_{21}=v,\ e_{12}=v^* are a full two-by-two matrix system with support ee. Orthogonality gives its four-index products exactly. No countability of the maximal family, predual separability, factoriality, or scalar trace was assumed. Taking e=1e=1 gives the unital system needed by the absorption lesson.

FH2. Compact convex orbits and the explicit displacement bound

Let NN be a nonzero finite factor with faithful normalized trace τ\tau, and b∈Nb\in N with τ(b)=0\tau(b)=0. FH0 proves that this trace is normal, even if normality was not part of its specified hypotheses. Then some unitary u∈Nu\in N satisfies

∥b−ubu∗∥2≥12∥b∥2.(FH2.1)\|b-ubu^*\|_2\geq\tfrac12\|b\|_2. \tag{FH2.1}

The zero element is included.

The unitary orbit is contained in the operator-norm ball of radius ∥b∥\|b\|. CP/CF's full compact-ball construction makes that ball ultraweakly compact. Let KK be the ultraweakly closed convex hull of the orbit, taken inside this ball. It is nonempty, compact and convex; addition and scalar multiplication are ultraweakly continuous. Unitary conjugation is an ultraweak homeomorphism by the fixed-multiplier CP test and preserves the orbit, hence KK.

The trace norm has the exact scalar representation

∥x∥2=sup⁡d∈N∥d∥2≤1∣τ(d∗x)∣.(FH2.2)\|x\|_2=\sup_{\substack{d\in N\\\|d\|_2\leq1}} |\tau(d^*x)|. \tag{FH2.2}

Scalar Schwarz gives the upper bound. For x≠0x\ne0, choose d=x/∥x∥2d=x/\|x\|_2, an element of NN, to attain equality; at zero both sides vanish. Each scalar pairing in (FH2.2) is normal by NT1. A supremum of their continuous absolute values is ultraweakly lower semicontinuous. More explicitly its sublevel set at c≥0c\geq0 is the intersection of all the closed scalar sublevel sets at cc.

Let m=inf⁡x∈K∥x∥2m=\inf_{x\in K}\|x\|_2. The closed nonempty sets {x∈K:∥x∥2≤m+1/j}\{x\in K:\|x\|_2\leq m+1/j\} are nested in compact KK; their intersection contains a minimizer. It is unique. If x,yx,y were distinct minimizers, faithfulness makes ∥x−y∥2>0\|x-y\|_2>0, and the Hilbert parallelogram identity gives

∥x+y2∥22=m2−14∥x−y∥22<m2,\left\|\frac{x+y}{2}\right\|_2^2 =m^2-\frac14\|x-y\|_2^2<m^2,

contradicting convexity and minimality. Conjugating by any unitary gives another minimizer, so the unique one commutes with every unitary. The complete CF four-unitary decomposition then makes it commute with every element of NN. Since NN is a factor it is scalar. Trace normality gives trace zero at every point of KK, so the scalar minimizer is zero.

For b≠0b\ne0, suppose (FH2.1) failed for every unitary. The orbit would lie in the closed trace ball {x:∥x−b∥2≤∥b∥2/2}\{x:\|x-b\|_2\leq\|b\|_2/2\}. This ball is convex by the trace triangle inequality and ultraweakly closed by (FH2.2). It would contain KK, hence zero. But zero has distance ∥b∥2\|b\|_2 from bb, a contradiction. For b=0b=0, the identity unitary satisfies the desired bound. This proof uses the whole normal topology, not just an assumed weak Hilbert compactness of the orbit.

FH3. A finite matrix formula gives the entire tensor tail

Let RR be FG2's dyadic factor with normalized trace τ\tau, and Dr≅Md(C)D_r\cong M_d(\mathbb C), d=2rd=2^r, its initial rr tensor legs. Fix matrix units (eij)(e_{ij}) of DrD_r with diagonal sum 11. Define on every x∈Rx\in R

Er(x)=1d∑i,j=1deijxeji.(FH3.1)\mathcal E_r(x)=\frac1d\sum_{i,j=1}^d e_{ij}x e_{ji}. \tag{FH3.1}

This is a finite sum; there is no compact-group measure or convergence assumption in its definition.

It is normal by NT1's fixed-multiplier predual maps. Put aij=eji/da_{ij}=e_{ji}/\sqrt d. Formula (FH3.1) is ∑aij∗xaij\sum a_{ij}^*x a_{ij}, with ∑aij∗aij=1\sum a_{ij}^*a_{ij}=1. The same formula on operator matrices proves complete positivity, by compressing a positive matrix with each fixed multiplier and summing. It is unital. NT1's complete two-by-two Schwarz proof therefore gives

Er(x)∗Er(x)≤Er(x∗x).\mathcal E_r(x)^*\mathcal E_r(x)\leq\mathcal E_r(x^*x).

Positive order gives norm contraction, and applying the trace gives trace 22-norm contraction. Trace preservation itself follows directly:

τ(Er(x))=1d∑i,jτ(ejieijx)=1d∑i,jτ(ejjx)=τ(x).(FH3.2)\tau(\mathcal E_r(x)) =\frac1d\sum_{i,j}\tau(e_{ji}e_{ij}x) =\frac1d\sum_{i,j}\tau(e_{jj}x)=\tau(x). \tag{FH3.2}

Multiplying (FH3.1) by eabe_{ab} on either side gives the same sum d−1∑jeajxejbd^{-1}\sum_j e_{aj}x e_{jb}. Thus the image commutes with DrD_r. Conversely an xx commuting with every eije_{ij} is fixed by the formula, since ∑i,jeijeji=d1\sum_{i,j}e_{ij}e_{ji}=d1. Its range is exactly Dr′∩RD_r'\cap R.

We identify that range with the full remaining tensor factor. On an elementary finite tensor in a stage DsD_s, s≥rs\geq r, matrix multiplication in the first rr legs shows that (FH3.1) replaces that initial matrix by its normalized trace times its identity, leaving all subsequent legs intact. Finite sums give the same conclusion for every local tensor polynomial. BD supplies uniformly bounded strong approximation of any x∈Rx\in R by such polynomials: apply its complete C* density theorem to the norm closure of their union. Fixed multiplication is strongly continuous on bounded sets, so Er(x)\mathcal E_r(x) is in the strongly closed algebra generated by the remaining legs. The reverse inclusion follows because each remaining leg commutes with DrD_r. Hence

Dr′∩R=(⋃s>r⨂j=r+1sM2)′′.(FH3.3)D_r'\cap R=\left(\bigcup_{s>r}\bigotimes_{j=r+1}^s M_2\right)''. \tag{FH3.3}

The right side is normally trace-preservingly isomorphic to RR. On the local trace Hilbert vectors, shifting each leg index by rr preserves their inner products, since those products are the finite products of normalized matrix traces in FG2. It therefore extends to a unitary from FG2's whole completed trace Hilbert space onto the tail's trace Hilbert space. It intertwines every local multiplication and, by BD and CP, their complete von Neumann closures. Conjugation by the unitary is normal in both directions. To identify that tail Hilbert closure with the given tail algebra, apply the complete STC coefficient proof for an already normal state to the restriction of the vector trace, and ST1–2's faithful normal image and inverse proof. Its state is already normal and faithful by restriction, so these inputs have their full hypotheses. CQ2 gives its trace Hilbert model. FG2 consequently supplies its factor property, type II1\mathrm{II}_1, trace, and separable predual. No uniqueness theorem for arbitrary hyperfinite factors is a premise.

Finally,

Er(x)−x=1d∑i,jeij[x,eji].(FH3.4)\mathcal E_r(x)-x=\frac1d\sum_{i,j}e_{ij}[x,e_{ji}]. \tag{FH3.4}

Each fixed-multiplier term tends to zero in trace 22-norm for an ordinary or ultrafilter central sequence, by NT2. The finite sum gives the corresponding convergence of Er(xn)−xn\mathcal E_r(x_n)-x_n, for each fixed rr. The complete preceding finite-algebra criterion equates centrality and predual centralizing here. This argument supplies the quantitative tail approximation used in both parts of Theorem 5.2.

Finite Pauli witnesses. Put

X=(0110),Z=(100−1),P={1,X,Z,XZ}.X=\begin{pmatrix}0&1\\1&0\end{pmatrix},\qquad Z=\begin{pmatrix}1&0\\0&-1\end{pmatrix},\qquad \mathcal P=\{1,X,Z,XZ\}.

All four matrices are unitary. For b=(αβγδ)b=\begin{pmatrix}\alpha&\beta\\\gamma&\delta\end{pmatrix}, direct multiplication gives

b+ZbZ=(2α002δ),XbX+(XZ)b(XZ)∗=(2δ002α).b+ZbZ=\begin{pmatrix}2\alpha&0\\0&2\delta\end{pmatrix},\qquad XbX+(XZ)b(XZ)^*=\begin{pmatrix}2\delta&0\\0&2\alpha\end{pmatrix}.

Adding and dividing by four therefore gives 4−1∑u∈Pubu∗=tr⁡2(b)14^{-1}\sum_{u\in\mathcal P}ubu^*=\operatorname{tr}_2(b)1, for every complex matrix, without a self-adjointness assumption.

For s>rs>r, let Fr,s=⨂j=r+1sM2⊂NrF_{r,s}=\bigotimes_{j=r+1}^{s}M_2\subset N_r and let Γr,s\Gamma_{r,s} consist of the 4s−r4^{s-r} tensor products of matrices from P\mathcal P in those legs, with identity on the initial rr legs. Applying the one-leg formula successively to an elementary tensor gives its product trace times the identity. Elementary tensors span Fr,sF_{r,s}, so linearity proves

14s−r∑u∈Γr,subu∗=τ(b)1(b∈Fr,s).(FH3.5)\frac1{4^{s-r}}\sum_{u\in\Gamma_{r,s}}ubu^*=\tau(b)1 \qquad(b\in F_{r,s}). \tag{FH3.5}

Unitary invariance of the trace norm and expansion of the square now give

14s−r∑u∈Γr,s∥b−ubu∗∥22=2∥b∥22−2Re⁡τ ⁣(b∗14s−r∑u∈Γr,subu∗)=2(∥b∥22−∣τ(b)∣2).(FH3.6)\begin{aligned} \frac1{4^{s-r}}\sum_{u\in\Gamma_{r,s}}\|b-ubu^*\|_2^2 &=2\|b\|_2^2- 2\operatorname{Re}\tau\!\left(b^*\frac1{4^{s-r}}\sum_{u\in\Gamma_{r,s}}ubu^*\right)\\ &=2\bigl(\|b\|_2^2-|\tau(b)|^2\bigr). \end{aligned} \tag{FH3.6}

In particular, if τ(b)=0\tau(b)=0, at least one member of this finite family moves bb by at least 2∥b∥2\sqrt2\|b\|_2.

Write Γr=⋃s>rΓr,s\Gamma_r=\bigcup_{s>r}\Gamma_{r,s}. For any trace-zero a∈Nra\in N_r, this family contains a unitary moving aa by at least ∥a∥2/2\|a\|_2/2. At a=0a=0, use the identity. Otherwise the tail Hilbert identification proved above makes finite tail polynomials dense in trace 22-norm. Choose c∈Fr,sc\in F_{r,s} with ∥c−a∥2<ε/2\|c-a\|_2<\varepsilon/2 and set b=c−τ(c)1b=c-\tau(c)1. Trace Schwarz gives ∣τ(c)∣≤∥c−a∥2|\tau(c)|\leq\|c-a\|_2, so τ(b)=0\tau(b)=0 and ∥b−a∥2<ε\|b-a\|_2<\varepsilon. A unitary supplied by (FH3.6) satisfies

∥a−uau∗∥2≥2∥b∥2−2ε≥2∥a∥2−(2+2)ε.\|a-uau^*\|_2 \geq\sqrt2\|b\|_2-2\varepsilon \geq\sqrt2\|a\|_2-(\sqrt2+2)\varepsilon.

Taking ε=∥a∥2/8\varepsilon=\|a\|_2/8 gives a lower bound at least 5∥a∥2/8>∥a∥2/25\|a\|_2/8>\|a\|_2/2, since 2≥1\sqrt2\geq1. Thus the witness can always be a finite Pauli word in the specified tail.

For any x∈Rx\in R, put b=Er(x)−τ(x)1∈Nrb=\mathcal E_r(x)-\tau(x)1\in N_r, which has trace zero. Choose the preceding unitary for bb. If b=0b=0, the identity has the same half-displacement property. With εr(x)=∥x−Er(x)∥2\varepsilon_r(x)=\|x-\mathcal E_r(x)\|_2 and Δ(x)=∥x−τ(x)1∥2\Delta(x)=\|x-\tau(x)1\|_2, the triangle inequality gives

∥[x,u]∥2=∥x−uxu∗∥2≥12∥b∥2−2εr(x)≥12Δ(x)−52εr(x),u∈Γr⊂U(Nr).(FH3.7)\begin{aligned} \|[x,u]\|_2 &=\|x-uxu^*\|_2\\ &\geq\tfrac12\|b\|_2-2\varepsilon_r(x)\\ &\geq\tfrac12\Delta(x)-\tfrac52\varepsilon_r(x), \qquad u\in\Gamma_r\subset\mathcal U(N_r). \end{aligned} \tag{FH3.7}

This is a finite-matrix witness estimate followed by trace-norm approximation. It applies to every bounded element of RR, and its unitary commutes with the whole prescribed initial matrix stage.

FH4. The full L∞([0,1])⊗ˉRL^\infty([0,1])\bar\otimes R example

The example uses the complete SC00–07 Lebesgue and integration proofs, not an unnamed measurable-field theorem. Restrict SC02's complete real-line Lebesgue measure to [0,1][0,1], where its mass is one; write it as λ\lambda. SC05–07 proves the complex integral, scalar Schwarz, completeness of L2(λ)L^2(\lambda), and density of bounded simple functions.

Let HA=L2(λ)H_A=L^2(\lambda) and let MfM_f multiply by a class f∈L∞(λ)f\in L^\infty(\lambda). It is bounded with norm exactly ∥f∥∞\|f\|_\infty: the upper estimate follows by integration of ∣fh∣2≤∥f∥∞2∣h∣2|f h|^2\leq\|f\|_\infty^2|h|^2; for each number below the essential supremum, the set where ∣f∣|f| exceeds it has positive measure, and its normalized characteristic vector proves the lower estimate. Adjoints are MfˉM_{\bar f}, and products are ordinary products. These operators form the algebra AA.

In fact A′=AA'=A. If TT commutes with AA, put g=T1∈L2g=T1\in L^2. For a bounded simple function hh, commutation gives Th=hgTh=hg. For each measurable EE,

∥1Eg∥2≤∥T∥λ(E)1/2.\|1_Eg\|_2\leq\|T\|\lambda(E)^{1/2}.

Consequently ∣g∣≤∥T∥|g|\leq\|T\| almost everywhere: applying the squared inequality to any positive-measure set where ∣g∣≥∥T∥+ε|g|\geq\|T\|+\varepsilon would contradict it. These level sets for a countable positive sequence of ε\varepsilon's cover the alleged exceptional set. Thus g∈L∞g\in L^\infty, and T=MgT=M_g by simple-function density. Conversely multiplication operators commute. Therefore A′′=AA''=A, proving its von Neumann closure. Its vector state at 11 is the integral; it is normalized and normal by CP, and faithful because a positive measurable function of zero integral is zero almost everywhere by SC04.

Use the trace Hilbert representation HRH_R of RR, with cyclic vector ΩR\Omega_R. Form the Hilbert tensor completion HA⊗HRH_A\otimes H_R. Its elementary inner product is the product of the two leg inner products. Positivity and nondegeneracy on any finite tensor sum follow by choosing an orthonormal basis of the finite span of its first-leg vectors and summing the squared norms of the resulting second-leg coefficients; Hilbert completion is CF's complete construction. This computation also proves boundedness of each S⊗TS\otimes T, with norm at most ∥S∥∥T∥\|S\|\|T\|, by first applying either leg to the finite orthogonal coefficient expansion and then completing.

Let N=(A⊙R)′′N=(A\odot R)'' on this space. The vector Ω=1⊗ΩR\Omega=1\otimes\Omega_R is cyclic because the bounded-simple and RR-local cyclic vectors are dense. It is separating: the right multipliers of RR commute with RR, and AA commutes with itself, so A⊙RrightA\odot R_{\rm right} commutes with NN; its orbit of Ω\Omega is also dense. If xΩ=0x\Omega=0, commutation kills that dense orbit and boundedness makes x=0x=0.

The vector state on the local tensor algebra has the product formula

τN(Mf⊗b)=(∫f dλ)τ(b).(FH4.1)\tau_N(M_f\otimes b)=\left(\int f\,d\lambda\right)\tau(b). \tag{FH4.1}

Finite expansion and the leg trace laws prove traciality for every pair of local tensor polynomials. It extends to their norm closure by vector-state continuity. The two normal-functional extensions in CQ2, using BD, then prove the trace law on all of NN. The separating-vector argument proves faithfulness; CP proves normality. Its value at the unit is one, and the isometry trace argument of CQ2 proves that NN is finite. This is precisely the concrete spatial product L∞([0,1])⊗ˉRL^\infty([0,1])\bar\otimes R, with the specified integral-times-trace state.

Its center is exactly A⊗1A\otimes1, as can be proved without a generic tensor commutation theorem. Take x∈Z(N)x\in Z(N). For h,h′∈HAh,h'\in H_A, mixed compression between the maps ξ↦h⊗ξ\xi\mapsto h\otimes\xi and ξ↦h′⊗ξ\xi\mapsto h'\otimes\xi produces a bounded operator xh′,hx_{h',h} on HRH_R. It commutes with RR, because xx is central, and with the entire commutant R′R', because each local tensor and hence NN commutes with 1⊗R′1\otimes R'. Thus

xh′,h∈R′∩(R′)′=Z(R)=C1.x_{h',h}\in R'\cap(R')'=Z(R)=\mathbb C1.

The corresponding bounded scalar sesquilinear form in h,h′h,h' is represented by S∈B(HA)S\in B(H_A), by the full CF Hilbert Riesz argument. Coefficients on elementary vectors give x=S⊗1x=S\otimes1. Commutation with A⊗1A\otimes1 makes S∈A′=AS\in A'=A. Conversely A⊗1A\otimes1 commutes with every local tensor and its closure, so

Z(N)=A⊗1.(FH4.2)Z(N)=A\otimes1. \tag{FH4.2}

This center is nontrivial: the characteristic function of [0,1/2][0,1/2] gives a central projection of trace 1/21/2.

To verify its type, rather than referring to type II fibers, suppose p∈Np\in N were a nonzero abelian projection. FCT3's full finite homogeneous-family construction gives a nonzero central w≤c(p)w\leq c(p) and a finite integer k≥1k\geq1 such that ww is a sum of kk orthogonal copies of pwpw. FCT0–7 constructs the normalized faithful center-valued trace TNT_N, so

TN(pw)=w/k.T_N(pw)=w/k.

Choose a dyadic matrix stage Dr⊂RD_r\subset R of size d=2r>kd=2^r>k. Its diagonal projections, compressed by ww, are equivalent and sum to ww. Each therefore has center-valued trace w/dw/d. FCT7 comparison puts a copy qq of one of them under pwpw, since w/d≤w/kw/d\leq w/k.

But PC4 identifies the center of the abelian corner pwNpwpwNpw with Z(N)pwZ(N)pw, so every subprojection of pwpw, including qq, is pwtpwt for a central projection t≤wt\leq w. Center linearity of the trace gives

t/k=TN(q)=w/d,t=(k/d)w.t/k=T_N(q)=w/d,\qquad t=(k/d)w.

A nonzero scalar multiple k/d∈(0,1)k/d\in(0,1) of the nonzero projection ww is not a projection: its square is a different scalar multiple. This contradicts the choice of tt. Thus NN has no nonzero abelian projection. FH1 proves it is type II1\mathrm{II}_1, with its nontrivial center retained. This proves the whole example and does not assert that this particular NN is a central sequence algebra.

FH5. Strong*-zero perturbations against varying centralizing sequences

Let MM be a von Neumann algebra with a faithful normal state φ\varphi. Let (yn)(y_n) be bounded and centralizing, either ordinarily or along ω\omega, and let (zn)(z_n) be bounded and strongly*-zero in that same mode of convergence. Then both ynzny_nz_n and znynz_ny_n are strongly*-zero in that mode. This gives a direct proof without moving a varying bounded multiplier through strong* convergence.

Put sup⁡n∥yn∥≤K\sup_n\|y_n\|\leq K, sup⁡n∥zn∥≤L\sup_n\|z_n\|\leq L. The immediate initial-square estimate is

φ((ynzn)∗(ynzn))≤K2φ(zn∗zn).\varphi((y_nz_n)^*(y_nz_n)) \leq K^2\varphi(z_n^*z_n).

For the final square, first move the last yn∗y_n^* to the front using its state commutator; next move the last zn∗z_n^* to the front using its state commutator. NT1 bounds each scalar error by the norm of the remaining product times that commutator norm. The resulting expression has a direct positive order bound:

φ(ynznzn∗yn∗)≤Re⁡φ(yn∗ynznzn∗)+KL2∥[yn∗,φ]∥≤φ(zn∗yn∗ynzn)+KL2∥[yn∗,φ]∥+K2L∥[zn∗,φ]∥≤K2φ(zn∗zn)+KL2∥[yn∗,φ]∥+K2L∥[zn∗,φ]∥.(FH5.1)\begin{aligned} \varphi(y_nz_nz_n^*y_n^*) &\leq\operatorname{Re}\varphi(y_n^*y_nz_nz_n^*) +KL^2\|[y_n^*,\varphi]\|\\ &\leq\varphi(z_n^*y_n^*y_nz_n) +KL^2\|[y_n^*,\varphi]\|+K^2L\|[z_n^*,\varphi]\|\\ &\leq K^2\varphi(z_n^*z_n) +KL^2\|[y_n^*,\varphi]\|+K^2L\|[z_n^*,\varphi]\|. \end{aligned} \tag{FH5.1}

All terms on the right tend to zero. Apply the same statement to the pair yn∗,zn∗y_n^*,z_n^*, which satisfies the same hypotheses, to get strong*-zero convergence of yn∗zn∗y_n^*z_n^*. Taking adjoints gives convergence of znynz_ny_n. NT2's two-seminorm criterion completes the assertion.

In particular scalar-trivial sequences are hypercentral. Writing xn=λn1+znx_n=\lambda_n1+z_n with bounded λn\lambda_n and strongly*-zero znz_n, their commutator with any bounded centralizing yny_n is znyn−ynznz_ny_n-y_nz_n, which the preceding estimates make strongly*-zero. The proof treats ordinary convergence and ultrafilter convergence with the same finite inequalities.

Complete input boundaries

FH0 uses full finite comparison and cancellation, arbitrary scalar cuts and bounded spectral approximation, proving the trace normality needed by FH2. FH1 uses the full center-sensitive PC/FCT route. FH2 uses compact predual balls, trace Schwarz, normal multiplier tests and the Hilbert parallelogram identity. FH3 uses the already constructed dyadic factor and the explicit finite matrix formula. FH4 uses the complete SC00–07 measure and Lp construction, CF Hilbert and compactness proofs, CP/BD, CQ2, the dyadic matrix stages, and full PC/FCT comparison. No compact Haar average, direct integral, type I factor classification or unspecified measurable-fiber theorem is imported.

FH5 uses the complete positive-functional Schwarz, adjoint module identities and faithful-state topology proofs in NT1–2. In particular its products do not presume continuity of multiplication by a varying bounded operator.