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

Quotient norms, trace completions and exact coordinate relations

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

An exact relation in a quotient is an approximation statement for its coordinate representatives. The construction of the quotient must first justify its norm, positivity and Hilbert representation. The central-sequence lesson uses those constructions before repairing projections and matrix units.

We use the complete CF1–10 calculus and Hilbert arguments, concrete preduals CP1–6, and bounded density BD1–5. These are exact earlier programme proofs. Inner products are linear in the second variable.

CQ1. The complete C* quotient construction

Let AA be a unital C* algebra and I⊂AI\subset A a norm-closed two-sided star ideal. Define

∥x+I∥q=inf⁡i∈I∥x−i∥.\|x+I\|_q=\inf_{i\in I}\|x-i\|.

This is a norm on the vector quotient: zero distance is membership in II because II is closed; homogeneity and the triangle inequality follow from their counterparts in AA. Products and adjoints are well defined because II is two-sided and star closed. Taking representatives arbitrarily close to their infimal norms proves submultiplicativity, and taking adjoints in the infimum proves that the involution is isometric.

The quotient is complete. From a Cauchy sequence of classes, choose a subsequence XrX_r with consecutive distances less than 2−r2^{-r}. Lift the first class arbitrarily. At step rr, choose a representative drd_r of Xr+1−XrX_{r+1}-X_r with norm less than 21−r2^{1-r}. The representatives

ar+1=ar+dra_{r+1}=a_r+d_r

are norm Cauchy in AA. Their norm limit represents the quotient limit of the subsequence. The original Cauchy sequence converges to it by the triangle inequality.

We prove the C* norm identity rather than presuming it for this quotient. For a finite set F⊂IF\subset I and t>0t>0, put

bF=∑i∈F(i∗i+ii∗),eF,t=bF(bF+t1)−1.(CQ1.1)b_F=\sum_{i\in F}(i^*i+ii^*),\qquad e_{F,t}=b_F(b_F+t1)^{-1}. \tag{CQ1.1}

The inverse exists by the complete continuous positive calculus. The element eF,te_{F,t} belongs to II, is positive, and has norm at most one. When FF is empty it is zero. For i∈Fi\in F, positive order and that calculus give

∥i(1−eF,t)∥2≤∥(1−eF,t)bF(1−eF,t)∥=∥t2bF(bF+t1)2∥≤t4.(CQ1.2)\begin{aligned} \|i(1-e_{F,t})\|^2 &\leq\|(1-e_{F,t})b_F(1-e_{F,t})\|\\ &=\left\|\frac{t^2b_F}{(b_F+t1)^2}\right\| \leq\frac t4. \end{aligned} \tag{CQ1.2}

The same bound for (1−eF,t)i(1-e_{F,t})i uses ii∗ii^* in place of i∗ii^*i. The scalar estimate is t2s/(s+t)2≤t/4t^2s/(s+t)^2\leq t/4, s≥0s\geq0, obtained from (s−t)2≥0(s-t)^2\geq0. Order the indices by enlarging FF and decreasing tt. For every fixed i∈Ii\in I, eventually FF contains ii, so both errors tend to zero. This is a complete two-sided approximate identity for II, including I=0I=0.

For fixed x∈Ax\in A, it follows that

∥x(1−eF,t)∥⟶∥x+I∥q.(CQ1.3)\|x(1-e_{F,t})\|\longrightarrow\|x+I\|_q. \tag{CQ1.3}

The lower bound holds at each index because xeF,t∈Ixe_{F,t}\in I. For the upper bound, any i∈Ii\in I gives

∥x(1−eF,t)∥≤∥x−i∥+∥i(1−eF,t)∥.\|x(1-e_{F,t})\| \leq\|x-i\|+\|i(1-e_{F,t})\|.

Take its limiting upper bound, then the infimum over ii.

The difference x∗x−(x−i)∗(x−i)x^*x-(x-i)^*(x-i) belongs to II, so

∥x∗x+I∥q≤∥x+I∥q2.\|x^*x+I\|_q\leq\|x+I\|_q^2.

Conversely, for any j∈Ij\in I,

∥x(1−eF,t)∥2=∥(1−eF,t)x∗x(1−eF,t)∥≤∥x∗x−j∥+∥(1−eF,t)j(1−eF,t)∥.\begin{aligned} \|x(1-e_{F,t})\|^2 &=\|(1-e_{F,t})x^*x(1-e_{F,t})\|\\ &\leq\|x^*x-j\|+\|(1-e_{F,t})j(1-e_{F,t})\|. \end{aligned}

Use (CQ1.2) for jj, and (CQ1.3) for xx, to pass to the limit. Infimizing over jj proves the reverse bound. Hence

∥x∗x+I∥q=∥x+I∥q2.(CQ1.4)\|x^*x+I\|_q=\|x+I\|_q^2. \tag{CQ1.4}

Thus A/IA/I is a C* algebra, with its inherited products and adjoints. Its quotient map is contractive. If I=AI=A, this is the zero algebra; otherwise its unit is 1+I1+I and has norm one, by the C* norm identity. CF's complete continuous calculus now applies in the quotient itself.

CQ2. A faithful trace gives an isometric Hilbert representation

Let AA be a nonzero unital C* algebra with a faithful tracial state τ\tau. The form

⟨x,y⟩=τ(x∗y)\langle x,y\rangle=\tau(x^*y)

is an inner product: positivity and scalar Schwarz follow from the positive-functional proof in CF, and faithfulness makes its null space zero. Complete this space to HτH_\tau, with Ω=1\Omega=1.

Left multiplication Lax=axL_a x=ax and right multiplication Rax=xaR_a x=xa are bounded. Positivity gives

∥ax∥2≤∥a∥∥x∥2,\|ax\|_2\leq\|a\|\|x\|_2,

and traciality gives the right bound

∥xa∥22=τ(a∗x∗xa)=τ(x∗xaa∗)≤∥a∥2∥x∥22.\|xa\|_2^2=\tau(a^*x^*xa)=\tau(x^*xaa^*)\leq\|a\|^2\|x\|_2^2.

They extend to the Hilbert completion. Pairing local vectors gives La∗=La∗L_a^*=L_{a^*}, Ra∗=Ra∗R_a^*=R_{a^*}. The left action is a unital star representation; the right action is an action of the opposite multiplication. They commute on the dense local vectors and hence everywhere.

The left representation is isometric. We already proved ∥La∥≤∥a∥\|L_a\|\leq\|a\|. If a≠0a\ne0, let h=a∗ah=a^*a, whose spectral maximum is λ=∥a∥2>0\lambda=\|a\|^2>0 by CF. For 0<ε<λ0<\varepsilon<\lambda, choose a continuous function ff, nonzero at λ\lambda, with support in [λ−ε,λ][\lambda-\varepsilon,\lambda] on that spectrum. The calculus makes f(h)≠0f(h)\ne0, so faithfulness gives ∥f(h)∥2>0\|f(h)\|_2>0. Moreover

∥Laf(h)∥22=τ(f(h)∗hf(h))≥(λ−ε)∥f(h)∥22.\|L_a f(h)\|_2^2 =\tau(f(h)^*h f(h)) \geq(\lambda-\varepsilon)\|f(h)\|_2^2.

Thus ∥La∥2≥λ−ε\|L_a\|^2\geq\lambda-\varepsilon. Letting ε\varepsilon decrease to zero proves the lower bound. The zero case is immediate. The image B=L(A)B=L(A) is consequently a norm-closed unital C* algebra.

Put N=B′′N=B''. The vector state

τ~(T)=⟨Ω,TΩ⟩,T∈N,(CQ2.1)\widetilde\tau(T)=\langle\Omega,T\Omega\rangle,\qquad T\in N, \tag{CQ2.1}

is normal by the complete CP single-vector test. It is faithful. If TΩ=0T\Omega=0, then TRaΩ=RaTΩ=0T R_a\Omega=R_aT\Omega=0 for every a∈Aa\in A, because the right multipliers commute with NN. These vectors are dense, so T=0T=0.

It is also tracial on NN, not merely on the local algebra BB. BD1–5 supplies bounded strong approximation by BB, and CP's vector-series bound makes it ultraweak approximation. Hence BB is ultraweakly dense in NN. For a fixed b∈Bb\in B, the two normal functionals T↦τ~(Tb)T\mapsto\widetilde\tau(Tb) and T↦τ~(bT)T\mapsto\widetilde\tau(bT) agree on BB, and thus on NN. Next fix arbitrary T∈NT\in N. The two corresponding normal functionals of a second variable agree on BB, by the first step, and therefore on NN. This proves the trace law for all pairs in NN. A vector state has value one at the unit, and its restriction is τ\tau.

In particular NN is finite: if V∗V=1V^*V=1, the trace law gives τ~(1−VV∗)=0\widetilde\tau(1-VV^*)=0; faithfulness forces VV∗=1VV^*=1. No separability of HτH_\tau, a normality assertion about an abstract state before representation, or a classification of finite factors was assumed.

CQ3. A complete trace-metric unit ball is already von Neumann

Assume, in addition to CQ2, that the operator-norm unit ball of AA is complete for the metric

d2(a,b)=τ((a−b)∗(a−b))1/2.d_2(a,b)=\tau((a-b)^*(a-b))^{1/2}.

Then the isometric image B=L(A)B=L(A) equals its bicommutant NN.

Indeed let TT be any contraction in NN. BD gives a net of contractions LaiL_{a_i} converging strongly to TT. Their values on Ω\Omega are Cauchy, so the net aia_i is d2d_2-Cauchy in that unit ball. Sequential metric completeness suffices for the net as well. To see this explicitly, choose increasing indices imi_m beyond a Cauchy threshold for distance 2−m2^{-m}; directedness permits each to dominate the previous choices. The selected sequence has a limit aa in the complete ball. Any sufficiently late net element is close to a sufficiently late selected element and hence to aa, by the triangle inequality. No countable cofinal subset of the directed set is presumed.

For every local vector bΩb\Omega, the right multiplier bound gives

∥(Lai−La)bΩ∥=∥(ai−a)b∥2≤∥b∥ d2(ai,a)⟶0.(CQ3.1)\|(L_{a_i}-L_a)b\Omega\| =\|(a_i-a)b\|_2 \leq\|b\|\,d_2(a_i,a)\longrightarrow0. \tag{CQ3.1}

The common norm bound extends this to the whole Hilbert space. Uniqueness of the strong limit gives T=LaT=L_a. Thus every contraction of NN belongs to BB; scaling proves N=BN=B. CQ2 supplies its faithful normal normalized trace, and finiteness.

There is a useful whole-domain normality statement. If α\alpha is a trace-preserving star automorphism of AA, the rule

Uα(aΩ)=α(a)ΩU_\alpha(a\Omega)=\alpha(a)\Omega

preserves inner products by the trace law. Its inverse is the analogous rule for α−1\alpha^{-1}, so it extends to a unitary of HτH_\tau. On the dense local vectors,

UαLaUα∗=Lα(a).U_\alpha L_aU_\alpha^*=L_{\alpha(a)}.

Consequently the automorphism of the represented von Neumann algebra is conjugation by this unitary. It is normal on its entire ultraweak domain: pulling back any CP square-summable vector-pair series replaces both vector sequences by their Uα∗U_\alpha^*-images and preserves their sums of squared norms. The same argument treats the inverse. This proves normality without extrapolating bounded strong continuity to arbitrary ultraweak nets.

CQ4. Cancel a finite subpiece even when the endpoints are infinite

Suppose e∼fe\sim f are projections of a von Neumann algebra, p≤ep\leq e is finite, q≤fq\leq f, and w∗w=p, ww∗=qw^*w=p,\ ww^*=q. Then

e−p∼f−q.(CQ4.1)e-p\sim f-q. \tag{CQ4.1}

The endpoints e,fe,f themselves need not be finite.

Choose v∗v=e, vv∗=fv^*v=e,\ vv^*=f, and transport qq into eMeeMe:

q′=v∗qv,(v∗w)∗(v∗w)=p,(v∗w)(v∗w)∗=q′.q'=v^*qv,\qquad (v^*w)^*(v^*w)=p,\qquad (v^*w)(v^*w)^*=q'.

Both p,q′p,q' are finite by PC5. Their join j=p∨q′j=p\vee q' is finite by the complete PC6 finite-join proof. Apply FCT2's unitary completion inside the finite corner jMjjMj, extending the prescribed partial isometry v∗wv^*w to a unitary uju_j. Its orthogonal extension

u=uj+(e−j)u=u_j+(e-j)

is unitary in eMeeMe and satisfies upu∗=q′upu^*=q'. Thus vu(e−p)vu(e-p) has initial projection e−pe-p and final projection f−qf-q, proving (CQ4.1). When p=q=0p=q=0, use u=eu=e. This route never cancels an infinite subpiece.

CQ5. Infinite pieces small for several normal states

Let MM be a factor with a faithful normal state. Every nonzero infinite projection pp is properly infinite, and any two such projections are equivalent. Here is the full route from the earlier projection proofs. PC4 identifies Z(pMp)Z(pMp) with Z(M)p=CpZ(M)p=\mathbb Cp. Its central finite/properly-infinite split in PC5 therefore has only the two scalar possibilities; an infinite pp cannot have the finite one. A faithful normal state assigns strictly positive mass to each nonzero member of any orthogonal family. Since their finite sums have mass at most one, only finitely many have mass at least 1/k1/k, for each kk. Every such family is countable. PC7 consequently gives mutual subequivalence between two properly infinite projections with central support 11; PC3 turns this into equivalence.

More precisely, let ψ1,…,ψs\psi_1,\ldots,\psi_s be positive normal functionals, and let ε>0\varepsilon>0. PC5 constructs a filling orthogonal family

p=∑k≥0pk,pk∼p.(CQ5.1)p=\sum_{k\geq0}p_k,\qquad p_k\sim p. \tag{CQ5.1}

Normality gives ∑k∑a=1sψa(pk)=∑aψa(p)<∞\sum_k\sum_{a=1}^s\psi_a(p_k)=\sum_a\psi_a(p)<\infty. For any specified finite integer h≥1h\geq1, select hh distinct sufficiently late members with total mass less than ε\varepsilon, leaving at least one member unselected. All selected members are infinite, and their complementary remainder in pp is infinite because it contains an unselected infinite member. This proves the asserted small-piece construction for one or finitely many pieces.

For the partial-isometry repair use ψ1=φ\psi_1=\varphi and ψ2(a)=φ(waw∗)\psi_2(a)=\varphi(waw^*), where w∗w=pw^*w=p. The second functional is positive and normal by NT1's fixed-multiplier predual proof. Selecting a single r≤pr\leq p gives

p−r infinite,φ(r)+φ(wrw∗)<ε.(CQ5.2)p-r\text{ infinite},\qquad \varphi(r)+\varphi(wrw^*)<\varepsilon. \tag{CQ5.2}

The operator wrwr has the exact two square seminorms

φ((wr)∗(wr))=φ(r),φ((wr)(wr)∗)=φ(wrw∗).\varphi((wr)^*(wr))=\varphi(r),\qquad \varphi((wr)(wr)^*)=\varphi(wrw^*).

Thus choosing εn=1/n2\varepsilon_n=1/n^2 makes both sides small, rather than estimating only the initial projection. Its removal leaves infinite complementary endpoint projections on both sides of w(p−r)w(p-r).

Deleting a finite projection from an infinite one also leaves an infinite projection: otherwise the original projection would be the join of two finite projections, contradicting PC6. This includes a finite zero subpiece. All these statements concern infinite projections in a countably decomposable factor; no assertion about arbitrary properly infinite projections with different central supports is made.

CQ6. Minimal projections force a scalar centralizing quotient

Suppose the factor MM has a nonzero minimal projection pp. There is a finite or countable orthogonal family (pi)(p_i) of projections equivalent to pp whose sum is 11. To construct it, extend {p}\{p\} to a maximal such family by the choice argument of PC0. If its remainder qq were nonzero, qMp≠0qMp\ne0: otherwise the central support of pp, which is 11 by PC2, would be orthogonal to qq. Polar decomposition of a nonzero qxpqxp supplies an initial nonzero subprojection of pp, hence all of pp, and a final projection in qq equivalent to pp. This contradicts maximality. The filling sum is the PC1 strong sum. Countability follows from the faithful-state mass argument in CQ5. Equivalence transfers minimality to every pip_i.

Each corner is scalar, piMpi=Cpip_iMp_i=\mathbb Cp_i. Indeed a nonscalar self-adjoint element in that corner would have a nontrivial spectral projection by the complete bounded spectral calculus; minimality excludes one. Real and imaginary parts treat all elements.

Let (xn)(x_n) be bounded, with scalar ultraweak ultralimit λ1\lambda1, and suppose

[xn,a]⟶ω0 strongly*(a∈M).(CQ6.1)[x_n,a]\longrightarrow_\omega0\text{ strongly*}\quad(a\in M). \tag{CQ6.1}

Write pixnpi=αi(n)pip_i x_n p_i=\alpha_i(n)p_i. Evaluating on any unit vector of piHp_iH shows αi(n)→ωλ\alpha_i(n)\to_\omega\lambda, since that vector functional is normal. For ξ∈piH\xi\in p_iH,

(xn−λ)ξ=[xn,pi]ξ+(αi(n)−λ)ξ⟶ω0.(CQ6.2)(x_n-\lambda)\xi=[x_n,p_i]\xi+ (\alpha_i(n)-\lambda)\xi\longrightarrow_\omega0. \tag{CQ6.2}

Apply the same reasoning to xn∗x_n^*, whose ultraweak limit is λ‾1\overline\lambda1. Finite sums of piHp_iH are dense because the projections fill 11. The uniform bound on xn−λx_n-\lambda, approximation by one such finite sum, and then a finite intersection of its ultrafilter convergence sets prove strong convergence on every vector; adjoints give strong*. CP's square-summable vector-series test makes this the intrinsic strong* assertion.

Consequently every such sequence is scalar modulo the strong*-zero ideal. This treats every type I factor without assuming a classification M=B(H)M=B(H): by the definition of type I it has a nonzero abelian projection, whose corner center is scalar by PC4, so that projection is minimal. Finite-dimensional and infinite-dimensional cases both occur in the argument; no separability of an ambient faithful Hilbert representation was needed.

CQ7. Balancing a whole finite partition with a quantitative error

Fix a finite integer m≥1m\geq1 and projection partitions

qn=∑j=1mej(n),ej(n)ek(n)=0(j≠k).q_n=\sum_{j=1}^m e_j(n),\qquad e_j(n)e_k(n)=0\quad(j\ne k).

In a type II1\mathrm{II}_1 factor with normalized trace τ\tau, put dn=τ(qn)/md_n=\tau(q_n)/m. The full AF2 trace-cut proof constructs a cut of any prescribed trace between zero and the trace of its containing projection. Cut each overfull cell to trace dnd_n. The removed projections are orthogonal; their sum DnD_n has trace equal to the sum of the deficits in the underfull cells, since the total trace of the partition is mdnmd_n.

Successive cuts of DnD_n supply orthogonal pieces of those deficits, including zero deficits, using the final exact remainder for the last one. Add them to the respective underfull cells. The result is a partition qn=∑jej′(n)q_n=\sum_j e'_j(n) with all traces dnd_n. Overfull cells were only decreased and underfull cells only increased, so in both cases the difference has square equal to the projection that was removed or added. Hence

∥ej′(n)−ej(n)∥2,τ2=∣τ(ej(n))−dn∣.(CQ7.1)\|e'_j(n)-e_j(n)\|_{2,\tau}^2 =|\tau(e_j(n))-d_n|. \tag{CQ7.1}

FCT7's scalar trace comparison proves equivalence of the corrected cells. If each right side tends to zero along ω\omega, NT2 transports their bounded trace convergence to intrinsic strong* convergence, and hence to either square seminorm of any faithful normal state. If qn=0q_n=0, every cell and every correction is zero; otherwise dn>0d_n>0 makes every corrected cell nonzero.

For an infinite factor, suppose qn≠0q_n\ne0 at each coordinate. When qnq_n is finite, its complement is infinite by CQ5. Add to it an infinite subprojection rnr_n of φ\varphi-mass less than 1/n21/n^2, using CQ5, and add the same projection to the first cell. If qnq_n was already infinite, do nothing. The support is now infinite. At least one of its finitely many cells is infinite, since PC6 makes a finite join of finite cells finite.

If the original qnq_n was finite, choose m−1m-1 orthogonal infinite pieces inside the newly added rnr_n, leaving an infinite remainder inside rnr_n, by CQ5. Give one piece to each cell other than the first; the first retains that remainder along with its original cell. Every corrected cell is therefore its original projection plus an orthogonal subprojection of rnr_n. Its difference from the original is a projection of φ\varphi-mass below 1/n21/n^2. In particular there is no estimate for the difference of two unrelated small projections hidden in this step.

If the original qnq_n was already infinite, choose an infinite original cell and remove m−1m-1 orthogonal infinite pieces of total φ\varphi-mass less than 1/n21/n^2, leaving an infinite remainder, by CQ5. Give one to each other cell. The donor is only decreased and the recipients only increased, so each change is a signed projection with square mass below 1/n21/n^2. In both cases all resulting cells are infinite and equivalent. The stated bound 2/n22/n^2 holds for every support and cell square mass, and their changes vanish strongly* ordinarily by NT2 and along the free ultrafilter. For m=1m=1 there are no pieces to transfer.

If the original support is 11, it is already infinite in an infinite factor; the support stays exactly 11. In a nonunital application the invisible change to a finite support is permitted and the new support remains its quotient representative. A zero quotient support is treated separately by the identically zero system. CQ6 covers factors with a minimal projection; in their scalar quotient there is no nonzero equivalent orthogonal partition of size greater than one. Thus no finite matrix case or smaller-than-unit support is lost.

Proof routes used here

CQ1 uses only the complete C* positive and continuous calculus, norm completeness and finite-set approximate-identity estimates. CQ2–3 uses CF's Hilbert completion, the exact CP predual/vector-series proofs and BD's bounded-density proof. The central-sequence quotient's separate diagonal construction supplies the trace-metric completeness hypothesis of CQ3; this module does not assume that an arbitrary traced C* unit ball is complete in that weaker metric.

CQ4–7 use the complete retained PC0–7/FCT0–7 projection and center-trace arguments, AF2's full scalar-cut construction, and NT1–2's normal-functional and faithful-state topology proofs. These are programme proofs retained under their existing notices. The displayed balancing hypotheses are conditional estimates on coordinate partitions; this module does not infer them from equivalence in a quotient before that quotient and its trace have been constructed.