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

Projection comparison and normal center-valued traces

Written by GPT-6.1 Sol (OpenAI), Ultra, October 2026. New original text and embedded diagrams: public domain (CC0).

Projection comparison lets finite corners be matched without a dimension function. We use it first to prove finite matrix stability and finite projection sums. Abelian corners and coherent dyadic partitions then provide monic projections; these allow normal almost traces to converge in norm to the center-valued trace. Every orthogonal sum below is the strong net of finite partial sums.

Let M⊆B(H)M\subseteq B(H) be a unital strongly closed self-adjoint algebra on an arbitrary Hilbert space. The unit is denoted by 11; when working in a corner its unit is the corner projection. The zero Hilbert space and zero corner are allowed and all projection assertions there are immediate. A projection is an operator p=p∗=p2p=p^*=p^2. Write p≤qp\le q when pH⊆qHpH\subseteq qH, equivalently pq=qp=ppq=qp=p. Put

p∼q  ⟺  ∃v∈M: v∗v=p, vv∗=q,p≾q  ⟺  ∃v∈M: v∗v=p, vv∗≤q.p\sim q \iff \exists v\in M:\ v^*v=p,\ vv^*=q, \qquad p\precsim q \iff \exists v\in M:\ v^*v=p,\ vv^*\le q.

Such an operator vv is a partial isometry. A projection pp is finite if every v∈Mv\in M with v∗v=pv^*v=p and vv∗≤pvv^*\le p has vv∗=pvv^*=p. Thus MM is finite exactly when its unit is finite, or equivalently every isometry in MM is unitary.

The external proof inputs are H00 (Hilbert completeness, adjoints, bounded operators), H01 (orthogonal projections and strong closure), H02 (positive supports), the bounded polar construction T04a, and the C*-algebra completeness/calculus/order arguments F01–F08. Zorn's lemma is used for maximal orthonormal sets and for maximal matching families. No trace, countable decomposition, type classification, center-valued trace, predual realization, automatic normality, or properly infinite halving theorem is used. H03 is available but is not needed for this chain.

For an arbitrary Hilbert space, the coordinate version of H00 causes no restriction: a maximal orthonormal set exists by Zorn. A nonzero vector perpendicular to its closed span would enlarge it, so its span is dense. Finite orthogonal projections and completeness identify the space isometrically onto the square-summable coordinates on that set. Conversely square-summable coordinates have norm-convergent finite partial sums. This includes arbitrary cardinalities and the empty basis of the zero space.

How general comparison proves finite orthogonal sums Central comparison zp ≼ zq; (1 − z)q ≼ (1 − z)p C05 Finite complement matching p ∼ q in a finite algebra ⇒ 1 − p ∼ 1 − q C06 Invertibles approximate every x x = u|x|; xε = u(|x| + ε1) C07 Finite matrix corners N finite ⇒ Mn(N) finite by the Schur-complement construction C08 Column embedding on one component a ⟂ b; v*v = a; vv* = r ≤ b T*T = diag(a + b, 0) C10 Finite orthogonal sum TT* ≤ diag(b, b) is finite Patch the two central components C09–C10

Figure 1. The exact comparison, complement and matrix-corner route to finite orthogonal sums. The column operator is computed in C10; this is an operator schematic and makes no assertion about finite Hilbert-space dimension. Human proof methods: Peterson, Theorem 5.1.10 and Propositions 5.2.7–5.2.8.

C01. Strong multiplication, supports and corners

If Ai→AA_i\to A and Bi→BB_i\to B strongly and sup⁡i∥Ai∥≤C\sup_i\|A_i\|\le C, then

∥(AiBi−AB)ξ∥≤C∥(Bi−B)ξ∥+∥(Ai−A)Bξ∥⟶0.\|(A_iB_i-AB)\xi\| \le C\|(B_i-B)\xi\|+\|(A_i-A)B\xi\|\longrightarrow0.

This is the only strong-product passage used below. Strong convergence of both an operator and its adjoint permits applying this estimate to their products. Norm closure of MM follows from strong closure, so its C*-calculus is available by H00 and F01–F08.

H02 supplies the support s(h)∈Ms(h)\in M of a positive h∈Mh\in M, the projection onto hH‾\overline{hH}. For x∈Mx\in M, T04a supplies

x=v∣x∣,∣x∣=(x∗x)1/2,v∗v=[∣x∣H‾],vv∗=[xH‾],v∈M.x=v|x|,\qquad |x|=(x^*x)^{1/2},\qquad v^*v=[\overline{|x|H}],\quad vv^*=[\overline{xH}],\quad v\in M.

Its membership proof is the uniformly bounded strong limit x(∣x∣+ε1)−1→vx(|x|+\varepsilon1)^{-1}\to v. Also ker⁡∣x∣=ker⁡x\ker |x|=\ker x, because ∥∣x∣ξ∥=∥xξ∥\||x|\xi\|=\|x\xi\|.

If v∗v=pv^*v=p, then vv vanishes on (1−p)H(1-p)H and is an isometry on pHpH; its range there is closed. Its range projection is vv∗vv^*, and v=vp=(vv∗)vv=vp=(vv^*)v. These facts follow by evaluating ∥vξ∥2=⟨ξ,pξ⟩\|v\xi\|^2=\langle\xi,p\xi\rangle and by Hilbert completeness. In particular, if both supports are at most ee, then v=evev= eve.

For every projection e∈Me\in M, the corner eMeeMe on eHeH is a unital strongly closed self-adjoint algebra with unit ee: extend its strong limits by zero on (1−e)H(1-e)H and use strong closure of MM. The same applies to Mn(M)M_n(M) on H⊕nH^{\oplus n}: a strong operator limit has strongly convergent entries, obtained by coordinate inclusions and projections, so every limiting entry belongs to MM. Finite matrices are bounded by the triangle inequality, and H00 gives their C*-norm and completeness. A projection ee is finite in MM exactly when the unit of eMeeMe is finite, by the support identity above.

For later optional H03 topology statements, the commutant definition also follows directly from these Hilbert inputs. If T∈M′′T\in M'' and ξ1,…,ξn∈H\xi_1,\ldots,\xi_n\in H, let KK be the closure of {(xξ1,…,xξn):x∈M}\{(x\xi_1,\ldots,x\xi_n):x\in M\} in H⊕nH^{\oplus n}. This set is already a linear subspace because MM is linear. It reduces every diagonal operator from MM, so its orthogonal projection has entries in M′M'. The diagonal operator from TT commutes with those entries and hence with this projection. The tuple (ξ1,…,ξn)(\xi_1,\ldots,\xi_n) belongs to KK, since 1∈M1\in M; therefore its image under TT belongs to KK. Finite-vector approximation follows: for any positive error some x∈Mx\in M approximates TT on all these vectors. Choosing such xx over finite sets of vectors and decreasing errors constructs a net converging strongly to TT. Strong closure gives T∈MT\in M. Thus M=M′′M=M'', proved here without importing a bicommutant or density theorem. Corners, matrices and the center are strongly closed self-adjoint algebras too, so this argument applies to them. H03 consequently supplies their concrete preduals whenever used in the extension.

C02. Arbitrary projection lattice and orthogonal sums

For finitely many projections p1,…,pmp_1,\ldots,p_m, their join is s(p1+⋯+pm)s(p_1+\cdots+p_m). Indeed a vector is in the kernel of this positive sum exactly when it is in every ker⁡pi\ker p_i, because its quadratic value is ∑i∥piξ∥2\sum_i\|p_i\xi\|^2. Thus the support has range p1H+⋯+pmH‾\overline{p_1H+\cdots+p_mH}.

For a set-indexed family (pi)i∈I(p_i)_{i\in I}, let pFp_F be the join for a finite F⊂IF\subset I, with p∅=0p_\varnothing=0. These projections converge strongly to the projection PP onto

L=span⁡⋃i∈IpiH‾.L=\overline{\operatorname{span}\bigcup_{i\in I}p_iH}.

They vanish on L⊥L^\perp. Every vector in a finite sum of the ranges is fixed eventually; density in LL and the common norm bound one prove convergence on all of HH. Strong closure puts PP in MM, and its range description makes it the least upper bound ⋁ipi\bigvee_i p_i. Meets are ⋀ipi=1−⋁i(1−pi)\bigwedge_i p_i=1-\bigvee_i(1-p_i). Empty joins and meets are respectively zero and one. In particular a meet has range equal to the intersection of the ranges.

If the pip_i are pairwise orthogonal, their finite sums are their finite joins, so ∑ipi:=s ⁣-!lim⁡F∑i∈Fpi=⋁ipi\sum_i p_i:=\operatorname{s\!-!lim}_F\sum_{i\in F}p_i=\bigvee_i p_i. Every arbitrary sum in this note means this net of finite partial sums, rather than a chosen enumeration.

Now suppose vi∈Mv_i\in M have pairwise orthogonal initial projections pi=vi∗vip_i=v_i^*v_i and pairwise orthogonal final projections qi=vivi∗q_i=v_iv_i^*. For distinct indices,

vi∗vj=vi∗qiqjvj=0,vivj∗=vipipjvj∗=0.v_i^*v_j=v_i^*q_iq_jv_j=0, \qquad v_iv_j^*=v_ip_ip_jv_j^*=0.

For finite FF, vF=∑i∈Fviv_F=\sum_{i\in F}v_i therefore satisfies

vF∗vF=∑i∈Fpi,vFvF∗=∑i∈Fqi,∥vF∥≤1.v_F^*v_F=\sum_{i\in F}p_i,\quad v_Fv_F^*=\sum_{i\in F}q_i, \qquad \|v_F\|\le1.

For each ξ\xi, the finite sums ∑i∈F∥viξ∥2\sum_{i\in F}\|v_i\xi\|^2 are bounded by ∥ξ∥2\|\xi\|^2. Choose a finite F0F_0 whose sum is within ε2\varepsilon^2 of their supremum. For finite F,G⊇F0F,G\supseteq F_0, orthogonality gives ∥(vF−vG)ξ∥2≤∑i∉F0∥viξ∥2≤ε2\|(v_F-v_G)\xi\|^2\le\sum_{i\notin F_0}\|v_i\xi\|^2\le\varepsilon^2, where the tail is the supremum of finite tail sums. Consequently vFv_F is strong Cauchy; completeness constructs its bounded strong limit vv. The same argument for adjoints constructs a strong limit ww of vF∗v_F^*. Matrix coefficients give w=v∗w=v^*. C01 then gives

v∗v=∑ipi,vv∗=∑iqi,v∈M.(C02.1)v^*v=\sum_i p_i,\qquad vv^*=\sum_i q_i,\qquad v\in M. \tag{C02.1}

This includes empty families, whose sum is zero. It proves both arbitrary orthogonal-sum equivalence and orthogonal additivity of subequivalence: if pi≾qip_i\precsim q_i and the two projection families are separately orthogonal, choose implementing partial isometries with final supports ri≤qir_i\le q_i and apply (C02.1).

C03. Elementary equivalence and finiteness facts

Equivalence is reflexive (implemented by pp), symmetric (use the adjoint), and transitive: if vv implements p∼qp\sim q and ww implements q∼rq\sim r, then wvwv implements p∼rp\sim r. Subequivalence is transitive by the same product: when vv∗≤q=w∗wvv^*\le q=w^*w, its final support is wvv∗w∗≤ww∗wvv^*w^*\le ww^*.

For r≤p=v∗vr\le p=v^*v, the restriction vrvr implements r∼vrv∗≤vv∗r\sim vrv^*\le vv^*. Thus equivalence preserves subprojection comparisons and gives an algebraic *-isomorphism of the two corners, with maps a↦vav∗a\mapsto vav^* and b↦v∗bvb\mapsto v^*bv.

Finiteness is hereditary. If r≤pr\le p and u∗u=ru^*u=r, uu∗≤ruu^*\le r, then u+(p−r)u+(p-r) has initial support pp and final support uu∗+(p−r)≤puu^*+(p-r)\le p; all mixed products vanish because the two initial and final supports are orthogonal. Finiteness of pp forces uu∗=ruu^*=r. Finiteness is also invariant under equivalence, since the displayed corner maps transport an isometry with a proper final support to one in the other corner. It follows that

p≾q and q finite⟹p finite.(C03.1)p\precsim q\text{ and }q\text{ finite}\quad\Longrightarrow\quad p\text{ finite}. \tag{C03.1}

The zero projection is finite.

C04. Central support and contact between corners

Every element of MM is a linear combination of unitaries. For a self-adjoint contraction hh, F06–F08 give a commuting square root k=(1−h2)1/2k=(1-h^2)^{1/2}; h+ikh+ik is unitary and hh is its real part. Scale arbitrary self-adjoint elements and decompose an arbitrary element into its real and imaginary parts.

For p∈P(M)p\in\mathcal P(M), define

c(p)=⋁u∈U(M)upu∗.c(p)=\bigvee_{u\in\mathcal U(M)}upu^*.

It belongs to MM by C02. Conjugation by any unitary permutes the ranges defining its join; hence it fixes c(p)c(p). The preceding unitary span makes c(p)c(p) central. It majorizes pp, and any central projection majorizing pp majorizes every conjugate and therefore this join. Thus it is the least central projection majorizing pp. Its range is

c(p)H=span⁡{xpξ:x∈M, ξ∈H}‾,(C04.1)c(p)H=\overline{\operatorname{span}\{xp\xi:x\in M,\ \xi\in H\}}, \tag{C04.1}

because every xx is a finite linear combination of unitaries. This is the precise meaning of c(p)=[MpH]c(p)=[MpH]. It includes c(0)=0c(0)=0.

Equivalent projections have the same central support: a central zz with zp=pzp=p also fixes q=vpv∗q=vpv^*, and the adjoint argument reverses the implication.

For arbitrary projections,

c(p)c(q)=0⟺pMq={0}.(C04.2)c(p)c(q)=0\quad\Longleftrightarrow\quad pMq=\{0\}. \tag{C04.2}

If the central supports are orthogonal, pxq=c(p)c(q)pxq=0pxq=c(p)c(q)pxq=0. Conversely, if pMq=0pMq=0, then ⟨xpξ,yqη⟩=⟨ξ,px∗yqη⟩=0\langle xp\xi,yq\eta\rangle=\langle\xi,px^*yq\eta\rangle=0 for all x,y,ξ,ηx,y,\xi,\eta. The two closed spans in (C04.1) are orthogonal, proving the forward product is zero.

Moreover pMq≠0pMq\ne0 exactly when pp and qq have nonzero equivalent subprojections. For a nonzero x∈pMqx\in pMq, C01's polar isometry has initial support under qq and nonzero final support under pp; reverse it to match in the stated order. Conversely a matching vv from p0≤pp_0\le p onto q0≤qq_0\le q has nonzero adjoint v∗=pv∗q∈pMqv^*=pv^*q\in pMq.

C05. General comparison and projection Cantor–Bernstein

Consider sets of triples (pi,qi,vi)(p_i,q_i,v_i) with nonzero pairwise orthogonal pi≤pp_i\le p, nonzero pairwise orthogonal qi≤qq_i\le q, and vi∗vi=piv_i^*v_i=p_i, vivi∗=qiv_iv_i^*=q_i. These sets lie in the fixed set P(M)×P(M)×M\mathcal P(M)\times\mathcal P(M)\times M and are ordered by inclusion. The empty set is admissible. A union of a chain is admissible, since every two of its members lie together in one member of that chain. Zorn supplies a maximal matching family. Put

P=∑ipi,Q=∑iqi,v=∑ivi,p0=p−P,q0=q−Q.P=\sum_i p_i,\quad Q=\sum_i q_i,\quad v=\sum_i v_i,\qquad p_0=p-P,\quad q_0=q-Q.

C02 proves all sums exist in MM and P∼QP\sim Q via vv. If p0Mq0≠0p_0Mq_0\ne0, C04 supplies a further nonzero matching in these residual projections, contradicting maximality. Hence c(p0)c(q0)=0c(p_0)c(q_0)=0. Take z=c(q0)z=c(q_0). Then zp0=0zp_0=0, (1−z)q0=0(1-z)q_0=0, and central restriction of vv gives

zp=zP∼zQ≤zq,(1−z)q=(1−z)Q∼(1−z)P≤(1−z)p.(C05.1)zp=zP\sim zQ\le zq, \qquad (1-z)q=(1-z)Q\sim(1-z)P\le(1-z)p. \tag{C05.1}

Thus, for every pair, there is a central projection zz with zp≾zqzp\precsim zq and (1−z)q≾(1−z)p(1-z)q\precsim(1-z)p. No countability assumption enters the matching. In a factor zz is zero or one, so any two projections are comparable. Zero projections and empty maximal families are already included.

For completeness, two-sided subequivalence gives equivalence without a finiteness assumption. Suppose u∗u=pu^*u=p, uu∗≤quu^*\le q, v∗v=qv^*v=q, vv∗≤pvv^*\le p. Put p′=vv∗p'=vv^*, p0=p−p′p_0=p-p', and w=vuw=vu. This is an isometry on pHpH whose range is under p′p'. Define

pn=wnp0(w∗)n(n≥0),e=∑n≥0pn,f=ueu∗.p_n=w^np_0(w^*)^n\quad(n\ge0),\qquad e=\sum_{n\ge0}p_n,\qquad f=ueu^*.

The pnp_n are pairwise orthogonal: after cancelling common powers of the isometry, p0p_0 is perpendicular to the range of every positive power of ww, because those ranges are under p′p'. C02 gives ee. Strong multiplication gives

vfv∗=wew∗=e−p0,v(q−f)v∗=p′−(e−p0)=p−e.vfv^*=wew^*=e-p_0, \qquad v(q-f)v^*=p'-(e-p_0)=p-e.

Therefore ueue matches ee onto ff, while v∗(p−e)v^*(p-e) matches p−ep-e onto q−fq-f. Their orthogonal sum implements p∼qp\sim q. This also covers p0=0p_0=0, when the first sum is zero. Together with (C05.1), it gives the usual factor trichotomy: either equivalence, or strict subequivalence in exactly one direction, where strict means subequivalent but not equivalent.

C06. Complement cancellation inside a finite algebra

Assume now MM is finite, and let p∼qp\sim q via vv. Apply C05 to 1−p1-p and 1−q1-q. For a central zz, choose w1w_1 with

w1∗w1=z(1−p),w1w1∗=r≤z(1−q),w_1^*w_1=z(1-p),\qquad w_1w_1^*=r\le z(1-q),

and w2w_2 with

w2∗w2=(1−z)(1−q),w2w2∗=s≤(1−z)(1−p).w_2^*w_2=(1-z)(1-q),\qquad w_2w_2^*=s\le(1-z)(1-p).

The orthogonal sum vz+w1vz+w_1 has initial support zz and final support zq+r≤zzq+r\le z. Since z≤1z\le1 is finite by C03, its final support equals zz, forcing r=z(1−q)r=z(1-q). Similarly v∗(1−z)+w2v^*(1-z)+w_2 has initial support 1−z1-z, so finiteness forces s=(1−z)(1−p)s=(1-z)(1-p). Thus

w=w1+w2∗,w∗w=1−p,ww∗=1−q.w=w_1+w_2^*,\qquad w^*w=1-p,\quad ww^*=1-q.

Finally v+wv+w is unitary, and (v+w)p(v+w)∗=q(v+w)p(v+w)^*=q. This proves equivalent complements in every finite algebra. It uses finiteness of central subprojections of the already finite unit; it does not use closure of finite projections under sums or joins.

C07. Dense invertibles in a finite algebra

Let NN be any finite concrete algebra as above, with unit ee. For x∈Nx\in N, write x=v∣x∣x=v|x| by C01. The two supports of vv are equivalent. C06 extends vv to a unitary u∈Nu\in N by matching their complements. Its added part vanishes on the support of ∣x∣|x|, so x=u∣x∣x=u|x|. For ε>0\varepsilon>0,

xε=u(∣x∣+εe)x_\varepsilon=u(|x|+\varepsilon e)

is invertible, with inverse (∣x∣+εe)−1u∗(|x|+\varepsilon e)^{-1}u^*, and ∥xε−x∥≤ε\|x_\varepsilon-x\|\le\varepsilon. The inverse exists by H02 or the continuous reciprocal on the nonnegative spectrum. Hence invertibles are norm dense in NN. This includes each nonzero finite corner; zero corners are handled directly.

C08. Finite matrix algebras over a finite algebra

If invertibles are norm dense in a unital Banach algebra NN, they are norm dense in every Mn(N)M_n(N). Here are the needed algebra and estimates. The assertion for n=1n=1 is the hypothesis. For n>1n>1, write

A=(arcD),A=\begin{pmatrix}a&r\\ c&D\end{pmatrix},

where D∈Mn−1(N)D\in M_{n-1}(N), rr is a row and cc a column. Given ε>0\varepsilon>0, choose invertible b∈Nb\in N with ∥b−a∥<ε/3\|b-a\|<\varepsilon/3. By induction choose invertible E∈Mn−1(N)E\in M_{n-1}(N) satisfying ∥E−(D−cb−1r)∥<ε/3\|E-(D-cb^{-1}r)\|<\varepsilon/3. Then

A′=(brcE+cb−1r)=(10cb−11)(b00E)(1b−1r01)A'=\begin{pmatrix}b&r\\c&E+cb^{-1}r\end{pmatrix} =\begin{pmatrix}1&0\\cb^{-1}&1\end{pmatrix} \begin{pmatrix}b&0\\0&E\end{pmatrix} \begin{pmatrix}1&b^{-1}r\\0&1\end{pmatrix}

is invertible: the triangular factors are inverted by negating their off-diagonal blocks, and the diagonal factor by inverting its blocks. Also ∥A′−A∥<2ε/3<ε\|A'-A\|<2\varepsilon/3<\varepsilon, by the coordinate-block norm bounds. No bound on ∥b−1∥\|b^{-1}\| is required; it is fixed before approximating the Schur complement.

A concrete unital C*-algebra with dense invertibles is finite. Indeed, suppose V∗V=eV^*V=e, choose invertible AA with ∥A−V∥<1\|A-V\|<1, and observe ∥V∗A−e∥<1\|V^*A-e\|<1. The element V∗AV^*A is invertible: for y=e−V∗Ay=e-V^*A, the series ∑k≥0yk\sum_{k\ge0}y^k converges by completeness, since its tail is bounded by a geometric tail, and multiplying its partial sums gives an inverse in the limit. Thus V∗=(V∗A)A−1V^*=(V^*A)A^{-1} is invertible. The identity V∗V=eV^*V=e implies V=(V∗)−1V=(V^*)^{-1}, so VV∗=eVV^*=e.

Applying this to C07 proves

N finite⟹Mn(N) finite for every finite n.(C08.1)N\text{ finite}\quad\Longrightarrow\quad M_n(N)\text{ finite for every finite }n. \tag{C08.1}

This is an actual proof of matrix finiteness, rather than a stable-finiteness import. In particular, for a finite projection b∈Mb\in M, diag⁡(b,b)\operatorname{diag}(b,b) is finite in M2(M)M_2(M): its corner is exactly M2(bMb)M_2(bMb), which is finite by (C08.1).

C09. Central patching of finite projections

Let (pi)i∈I(p_i)_{i\in I} be finite projections with pairwise orthogonal central supports zi=c(pi)z_i=c(p_i). Then p=∑ipip=\sum_i p_i is finite, even if II is uncountable. Indeed zip=piz_ip=p_i. For t∗t=pt^*t=p and tt∗≤ptt^*\le p, centrality gives

(tzi)∗(tzi)=pi,(tzi)(tzi)∗=zitt∗≤pi.(tz_i)^*(tz_i)=p_i,\qquad (tz_i)(tz_i)^*=z_itt^*\le p_i.

Finiteness of pip_i forces zitt∗=piz_itt^*=p_i for every ii. Put Z=∑iziZ=\sum_i z_i. Since p≤Zp\le Z and t=ptpt=ptp, the range of tt∗tt^* is under ZZ. Taking the strong limit of the finite sums ∑i∈Fzitt∗\sum_{i\in F}z_itt^* yields tt∗=ptt^*=p, by C01. This includes the empty family.

The same proof applies to projections supported on any prescribed pairwise orthogonal central projections, without requiring those central projections to be their exact central supports. In particular, for a central zz, if zeze and (1−z)e(1-z)e are finite, then ee is finite.

The bounded central assembly needed for the homogeneous components also has a direct proof. If ziz_i are pairwise orthogonal central projections and xi∈Mzix_i\in Mz_i with sup⁡i∥xi∥≤C\sup_i\|x_i\|\le C, then finite sums xF=∑i∈Fxix_F=\sum_{i\in F}x_i have norm at most CC, because ∥xFξ∥2=∑i∈F∥xiziξ∥2≤C2∑i∈F∥ziξ∥2\|x_F\xi\|^2=\sum_{i\in F}\|x_i z_i\xi\|^2\le C^2\sum_{i\in F}\|z_i\xi\|^2. The tail of the last orthogonal square sum tends to zero, so these sums converge strongly to x∈Mx\in M; the same holds for their adjoints. One has zix=xiz_i x=x_i and x=(∑izi)xx=(\sum_i z_i)x, and the preceding bound and restriction to each central summand give

∥x∥=sup⁡i∥xi∥.(C09.1)\|x\|=\sup_i\|x_i\|. \tag{C09.1}

An empty supremum here is zero. In particular arbitrary central orthogonal families of corner unitaries assemble by C02 to a unitary on the sum of their central units. The uniform norm bounds used by averaging survive this exact assembly.

The supremum of any family of finite central projections is finite. To see this without assuming directed finite joins, well-order the family (zα)(z_\alpha) by ZFC and form dα=zα(1−⋁β<αzβ)d_\alpha=z_\alpha(1-\bigvee_{\beta<\alpha}z_\beta). These are pairwise orthogonal central projections, each finite because it is under zαz_\alpha. Their sum is the original join: by transfinite induction the joins of the two families agree at every initial segment, including limit segments by C02. Apply the central patching argument to the dαd_\alpha. This assertion concerns central projections; arbitrary infinite orthogonal sums of finite projections need not be finite.

C10. Finite orthogonal sums in an arbitrary algebra

Let p,q∈Mp,q\in M be finite and orthogonal. C05 gives a central zz such that zp≾zqzp\precsim zq and (1−z)q≾(1−z)p(1-z)q\precsim(1-z)p. On the first component put a=zpa=zp, b=zqb=zq, and choose vv with v∗v=av^*v=a, vv∗=r≤bvv^*=r\le b. In M2(M)M_2(M), take the concrete column operator

T=(v0b0).T=\begin{pmatrix}v&0\\b&0\end{pmatrix}.

Because a⊥ba\perp b and v=vav=va, vb=0vb=0 and bv∗=0bv^*=0. Consequently

T∗T=(a+b000),TT∗=(r00b)≤(b00b).(C10.1)T^*T=\begin{pmatrix}a+b&0\\0&0\end{pmatrix},\qquad TT^*=\begin{pmatrix}r&0\\0&b\end{pmatrix} \le\begin{pmatrix}b&0\\0&b\end{pmatrix}. \tag{C10.1}

The last projection is finite by C08, because b≤qb\le q is finite by C03. Hence C03 in M2(M)M_2(M) makes diag⁡(a+b,0)\operatorname{diag}(a+b,0) finite. If a+ba+b were not finite in MM, embedding an isometry of its corner as diag⁡(s,0)\operatorname{diag}(s,0) would contradict that matrix projection's finiteness. Thus z(p+q)z(p+q) is finite. The second component uses the same column with a=(1−z)qa=(1-z)q, b=(1−z)pb=(1-z)p, and gives finiteness of (1−z)(p+q)(1-z)(p+q). C09 patches the two components, proving p+qp+q finite.

Induction proves that every finite orthogonal sum of finite projections is finite. The empty sum is zero, already finite. No assertion about an arbitrary infinite orthogonal sum follows. The logical order is C05 → C06 in an already finite algebra → C07 → C08 → C10 in an arbitrary algebra. In particular C06 does not presuppose C10; there is no finite-sum/complement cycle.

C11. Finite joins and complements of equivalent finite projections

For arbitrary p,qp,q, apply C01 to x=(1−p)qx=(1-p)q. Its kernel is the orthogonal direct sum (1−q)H⊕(qH∩pH)(1-q)H\oplus(qH\cap pH), so its initial support is q−p∧qq-p\wedge q. Its range is contained in (p∨q−p)H(p\vee q-p)H. To prove density there, a vector η\eta in that subspace perpendicular to (1−p)qH(1-p)qH has pη=0p\eta=0 and qη=0q\eta=0, so it is perpendicular to both ranges defining p∨qp\vee q, and therefore is zero. Thus

p∨q−p∼q−p∧q.(C11.1)p\vee q-p\sim q-p\wedge q. \tag{C11.1}

If p,qp,q are finite, the right side is finite by C03, hence so is the left. It is orthogonal to pp, and C10 makes their sum p∨qp\vee q finite. Induction gives finite joins of any finite family of finite projections.

If p,qp,q are finite and equivalent in an arbitrary MM, set e=p∨qe=p\vee q. It is finite. C06 in eMeeMe matches e−pe-p with e−qe-q; adding the identity on 1−e1-e matches 1−p1-p with 1−q1-q. Adding this match to the original vv gives a unitary u∈Mu\in M with upu∗=qupu^*=q. This is the stronger arbitrary-ambient form, proved after finite joins. It is kept separate from the earlier finite-ambient C06 used in the noncircular matrix proof.

C12. The exact semifinite projection consequence

If semifinite is defined to mean that each nonzero projection contains a nonzero finite projection, this property is a hypothesis. It gives a net of finite projections increasing strongly to one: the set of finite projections is directed by C11's finite join; its join must be one, since a nonzero complementary projection would contain another nonzero finite projection. C02 gives strong convergence of this directed net.

If instead semifinite is defined to mean that 1=∑i∈Ipi1=\sum_{i\in I}p_i for an orthogonal family of finite projections, the nonzero-corner property follows from C04 and C03. For nonzero qq, some qpi≠0qp_i\ne0; otherwise the finite sums converge strongly to one and qq would be zero. Thus qMpi≠0qMp_i\ne0, and C04 provides a nonzero subprojection of qq equivalent to a subprojection of pip_i, hence finite. Conversely, the nonzero-corner property gives such an orthogonal family by Zorn: a maximal orthogonal family of nonzero finite projections has zero complementary projection. C10 makes each finite partial sum finite, and C02 gives their strong limit one. Both definitions therefore provide the exact SF projection input under either convention, including arbitrary cardinality and the zero algebra.

If the word instead presupposes a faithful normal semifinite weight, its equivalence to these projection definitions is a separate weight-theoretic prerequisite and is not proved here. No measure-theoretic finiteness of a weight is substituted for projection finiteness.

Finite homogeneous components and monic projections

In D04–D10 the ambient algebra is finite. A projection is abelian when its corner is commutative. A nonzero projection is monic when it belongs to a finite orthogonal family of equivalent projections summing to its central support in this ambient algebra.

D01. Finite projection approximants from continuous cutoffs

For a self-adjoint h∈eMeh\in eMe, set

Et=s((h−te)+)≤e(t∈R).E_t=s((h-te)_+)\le e\qquad(t\in\mathbb R).

The continuous positive part is supplied by F06–F08 and its support by H02. Every EtE_t commutes with hh and with every EsE_s: the resolvent construction of a support commutes with any operator commuting with the supported positive element, and the relevant continuous functions of hh commute. Also Et≤EsE_t\le E_s for s<ts<t. Indeed (h−te)+≤(h−se)+(h-te)_+\le(h-se)_+ by continuous calculus; a vector in the kernel of the latter has zero quadratic value for the former, hence is in its kernel by H02's positive-form Cauchy–Schwarz argument.

The positive and negative parts of h−teh-te annihilate each other. The negative part therefore vanishes on the range of EtE_t, and the positive part vanishes on its complementary range. Consequently

(h−te)Et≥0,(h−te)(e−Et)≤0.(D01.1)(h-te)E_t\ge0,\qquad (h-te)(e-E_t)\le0. \tag{D01.1}

Choose C>∥h∥C>\|h\| and a finite grid −C=t0<t1<⋯<tN=C-C=t_0<t_1<\cdots<t_N=C with mesh at most δ\delta. Then Et0=eE_{t_0}=e, because h+Ceh+Ce is positive invertible by F06, and EtN=0E_{t_N}=0. The differences dk=Etk−Etk+1d_k=E_{t_k}-E_{t_{k+1}} are mutually orthogonal projections summing to ee. They reduce hh, and (D01.1) gives

tkdk≤hdk≤tk+1dk.t_kd_k\le hd_k\le t_{k+1}d_k.

Orthogonal decomposition of quadratic forms therefore gives

0≤h−∑k=0N−1tkdk≤δe,∥h−∑k=0N−1tkdk∥≤δ.(D01.2)0\le h-\sum_{k=0}^{N-1}t_kd_k\le\delta e, \qquad \left\|h-\sum_{k=0}^{N-1}t_kd_k\right\|\le\delta. \tag{D01.2}

This proves uniform approximation of every self-adjoint element by finite linear combinations of projections in its corner. If every projection of a corner is central in that corner, then (D01.2), norm closure of the center, and the real/imaginary decomposition show that corner is abelian. Zero corners are included directly.

D02. Abelian projections and their ambient centers

The following facts hold in an arbitrary ambient MM, without finiteness. If pp is abelian and r≤pr\le p, then

c(r)p=r.(D02.1)c(r)p=r. \tag{D02.1}

Indeed rM(p−r)=r(pMp)(p−r)=0rM(p-r)=r(pMp)(p-r)=0 by commutativity. C04 gives c(r)c(p−r)=0c(r)c(p-r)=0, so c(r)(p−r)=0c(r)(p-r)=0, whereas c(r)r=rc(r)r=r.

For a central projection zz, one also has

c(zp)=zc(p).(D02.2)c(zp)=zc(p). \tag{D02.2}

The right side is a central majorant of zpzp. If a central projection dd majorizes zpzp, then d∨(1−z)d\vee(1-z) majorizes pp; multiplying its majorization of c(p)c(p) by zz gives zc(p)≤dzc(p)\le d. This proves minimality.

The map

θ:Z(M)c(p)⟶pMp,a⟼ap(D02.3)\theta:Z(M)c(p)\longrightarrow pMp,\qquad a\longmapsto ap \tag{D02.3}

is a unital *-isomorphism. It is a homomorphism because aa is central. If ap=0ap=0, then aa annihilates every vector xpξxp\xi, since axpξ=xapξ=0axp\xi=xap\xi=0; C04's dense range description implies ac(p)=0ac(p)=0, hence a=0a=0. Thus F05–F07 make θ\theta isometric with closed range. Every projection r≤pr\le p is in that range by (D02.1). D01's finite projection approximants make its range all of pMppMp.

Abelian projections are finite: an isometry in the commutative corner has vv∗=v∗v=pvv^*=v^*v=p. Abelianity is hereditary and preserved by equivalence, by C03's corner maps. A sum of abelian projections with mutually orthogonal central supports is abelian. To check the latter, put p=∑ipip=\sum_i p_i and zi=c(pi)z_i=c(p_i). On each ziz_i, elements of pMppMp lie in piMpip_iMp_i and commute. The strong sum of the ziz_i supports pp, so taking finite central sums shows that their full commutator is zero.

Two abelian projections with the same central support are equivalent. Apply C05 to p,qp,q with c(p)=c(q)=cc(p)=c(q)=c. On a central comparison piece z≤cz\le c, suppose pz∼r≤qzpz\sim r\le qz. Then c(r)=c(pz)=zc(r)=c(pz)=z by equivalence and (D02.2), so (D02.1) for qq gives r=c(r)q=qzr=c(r)q=qz. Thus the subequivalence is equivalence on this piece; the reversed piece is treated the same way, and C02 adds them. This also handles zero comparison pieces.

D03. Every type I corner has an abelian projection of full support

Here type I means every nonzero projection has a nonzero abelian subprojection. If r≠0r\ne0 lies in a type I algebra, choose by Zorn a maximal family of nonzero abelian qi≤rq_i\le r whose central supports are mutually orthogonal. Its sum qq is abelian by D02, and c(q)=⋁ic(qi)c(q)=\bigvee_i c(q_i): any central majorant of the sum majorizes each summand and conversely. This equals c(r)c(r). Otherwise the nonzero central projection z=c(r)−⋁ic(qi)z=c(r)-\bigvee_i c(q_i) has rz≠0rz\ne0, by minimality of c(r)c(r). Type I supplies a nonzero abelian projection under rzrz, with central support at most zz, contradicting maximality. Thus q≤rq\le r is abelian with c(q)=c(r)c(q)=c(r). The family need not be countable.

D04. No infinite orthogonal family of equivalent nonzero projections in a finite algebra

If an orthogonal family (pi)i∈I(p_i)_{i\in I} of nonzero projections in a finite MM is infinite and all its members are equivalent, ZFC selects distinct members p0,p1,…p_0,p_1,\ldots. Choose partial isometries matching pnp_n onto pn+1p_{n+1}. C02's sum has initial projection e=∑n≥0pne=\sum_{n\ge0}p_n and final projection e−p0<ee-p_0<e. This contradicts finiteness of e≤1e\le1 by C03. Consequently every such family is finite. This is an arbitrary-cardinality argument; it does not assume countable decomposition of MM.

D05. Finite type I components are centrally homogeneous

Let MM be finite and type I, and choose a nonzero abelian pp. A maximal orthogonal family p1,…,pnp_1,\ldots,p_n of projections equivalent to pp, containing pp, exists by Zorn and is finite by D04. Its members are abelian by D02, each has central support c=c(p)c=c(p), and their sum ee is at most cc.

If the residual r=c−er=c-e had c(r)=cc(r)=c, D03 would give an abelian q≤rq\le r with c(q)=cc(q)=c. D02 would give q∼pq\sim p, contradicting maximality. Hence c(r)<cc(r)<c, and

z=c−c(r)>0,∑i=1nzpi=z.(D05.1)z=c-c(r)>0,\qquad \sum_{i=1}^n zp_i=z. \tag{D05.1}

The projections zpizp_i are abelian, equivalent, and nonzero, since each has central support zz by (D02.2). Thus MzMz is a finite homogeneous component with nn equivalent abelian projections summing to its unit.

Now take a maximal orthogonal family of nonzero central homogeneous components of a finite type I algebra. Its central sum is one: if the complement were nonzero, it would remain finite and type I and the preceding construction would supply another component. This again uses Zorn on a fixed set of projections and their finite implementing families. For each positive integer nn, group the components having nn members. Their sum znz_n is central. On that sum, add the first, second, ..., nn-th members of their respective families separately. C02's sums of the matching partial isometries give nn equivalent projections, D02's central sums make them abelian, and their sum is znz_n. Consequently

1=∑n≥1zn,Mzn has n equivalent abelian projections summing to zn(D05.2)1=\sum_{n\ge1}z_n, \qquad Mz_n\text{ has }n\text{ equivalent abelian projections summing to }z_n \tag{D05.2}

for each nonzero znz_n. The original collection of components can be uncountable; grouping by nn does not assert a countable central-support family. Uniqueness of the multiplicity labels is not needed or asserted by this existence construction.

D06. Exact matrix-unit realization on a homogeneous piece

Suppose p1,…,pnp_1,\ldots,p_n are equivalent abelian projections summing to a central zz. Their common central support is zz, because the sum is zz. Choose viv_i with vi∗vi=p1v_i^*v_i=p_1, vivi∗=piv_iv_i^*=p_i, and v1=p1v_1=p_1. Then eij=vivj∗e_{ij}=v_iv_j^* satisfy eij∗=ejie_{ij}^*=e_{ji}, eijekl=δjkeile_{ij}e_{kl}=\delta_{jk}e_{il}, and ∑ieii=z\sum_i e_{ii}=z. The maps

Mz⟶Mn(p1Mp1),x⟼[vi∗xvj]ij,[aij]⟼∑i,j=1nviaijvj∗(D06.1)Mz\longrightarrow M_n(p_1Mp_1),\quad x\longmapsto[v_i^*xv_j]_{ij}, \qquad [a_{ij}]\longmapsto\sum_{i,j=1}^n v_i a_{ij}v_j^* \tag{D06.1}

are mutually inverse unital *-homomorphisms. To verify multiplicativity, insert ∑kvkvk∗=z\sum_k v_kv_k^*=z between the factors; to verify the inverse, use vj∗vk=δjkp1v_j^*v_k=\delta_{jk}p_1 and zxz=xzxz=x. All sums are finite, so there is no missing convergence or surjectivity assertion. D02 identifies p1Mp1p_1Mp_1 isometrically with Z(M)zZ(M)z; hence

Mz≅Mn(Z(M)z).(D06.2)Mz\cong M_n(Z(M)z). \tag{D06.2}

F05–F07 give exact norm preservation of these algebraic *-isomorphisms. This is the finite homogeneous matrix identification consumed by the averaging argument. It uses no character theorem, direct-integral classification or representation-independence theorem.

The center of MzMz is exactly Z(M)zZ(M)z, since a central corner element extended by zero commutes with both central pieces of MM. At the concrete level the maps in (D06.1) are finite sums of bounded left/right multiplication and therefore are ultraweak continuous by H03's series-vector formulas. The center/corner identification (D02.3) has the following direct bounded weak-operator inverse estimate: approximate vectors of zHzH by finite sums xp1ξxp_1\xi, using C04. For such vectors,

⟨xp1ξ,ayp1η⟩=⟨p1ξ,(ap1)(p1x∗yp1η)⟩(a∈Z(M)z).\langle xp_1\xi,a yp_1\eta\rangle =\langle p_1\xi,(ap_1)(p_1x^*yp_1\eta)\rangle \qquad(a\in Z(M)z).

Thus bounded weak-operator convergence of ap1ap_1 implies that of aa, first on a dense family and then everywhere. H03 turns bounded weak-operator convergence into ultraweak convergence.

Full ultraweak continuity of this specific inverse follows directly as well. H03 constructs a Banach predual QQ for each concrete corner; its canonical image in the full norm dual is isometric by F01's norming-functional theorem, and hence norm closed. Therefore the corner's series-vector functionals are norm closed. Given a vector coefficient a↦⟨ξ,aη⟩a\mapsto\langle\xi,a\eta\rangle on Z(M)zZ(M)z, replace ξ,η∈zH\xi,\eta\in zH by finite sums of vectors xp1αxp_1\alpha. The preceding coefficient identity expresses each resulting approximant, after applying θ−1\theta^{-1}, as a finite sum of vector coefficients on p1Mp1p_1Mp_1. Vector-norm approximation makes the original functionals converge in functional norm. Because θ−1\theta^{-1} is isometric, their transported functionals converge in the same norm, so norm closure makes the transported coefficient normal. For a series-vector functional, first truncate the series, with functional-norm tail bounded by the sum of the products of the vector norms, and then use the same argument. Hence every concrete normal functional composed with θ−1\theta^{-1} is normal, proving ultraweak continuity for this inverse on arbitrary nets. Forward continuity is bounded multiplication by p1p_1, directly in the series-vector formula. This is a local proved normality statement for (D02.3), rather than a general automatic-normality import. C01's finite-vector argument justifies applying H03 to all the concrete corners and centers involved. Algebraic order and all existing positive suprema are also preserved by the *-isomorphism and its inverse by F08 and the definition of a supremum.

D07. The finite algebra splits into these pieces and a no-abelian piece

In an arbitrary MM, let zIz_I be the join of all abelian projections. The family is preserved by every unitary conjugation, so C04's unitary-span argument makes zIz_I central. If 0≠q≤zI0\ne q\le z_I, then qr≠0qr\ne0 for some abelian rr: otherwise qq would vanish on their joined range and satisfy qzI=0qz_I=0. C04's polar contact gives a nonzero subprojection of qq equivalent to a subprojection of rr, hence abelian by D02. Therefore MzIMz_I is type I. Its complement has no nonzero abelian projection by definition.

For finite MM, both central pieces are finite by C03. Apply D05–D06 to MzIMz_I. We obtain arbitrary central homogeneous matrix pieces, grouped as in (D05.2), together with M(1−zI)M(1-z_I), which is finite and has no nonzero abelian projection. This is the finite central decomposition required here. No infinite or general type classification follows from it.

D08. Halving and coherent dyadic partitions on the no-abelian piece

Suppose NN has no nonzero abelian projection. Every nonzero corner rNrrNr is then nonabelian. D01 implies that some projection a≤ra\le r is not central in that corner. Hence aN(r−a)≠0aN(r-a)\ne0: if this corner and its adjoint were zero, then aa would commute with every element of rNrrNr. C04 gives nonzero equivalent subprojections under aa and r−ar-a, which are orthogonal.

For a given projection rr, choose by Zorn a maximal family of these equivalent pairs (ai,bi)(a_i,b_i) with all the projections in the combined family mutually orthogonal and under rr. C02 gives A=∑iai∼B=∑ibiA=\sum_i a_i\sim B=\sum_i b_i. A nonzero residual r−A−Br-A-B would yield another pair by the preceding paragraph, so

r=A+B,A∼B.(D08.1)r=A+B,\qquad A\sim B. \tag{D08.1}

The zero corner has the zero pair. For a nonzero corner both halves are nonzero.

In a finite NN without nonzero abelian projections, (D08.1) can be iterated coherently. At level mm, choose an orthogonal partition (em,k)0≤k<2m(e_{m,k})_{0\le k<2^m} into equivalent projections and matching vm,kv_{m,k} from em,0e_{m,0} onto em,ke_{m,k}, with the first matching the identity. Halve em,0=f0+f1e_{m,0}=f_0+f_1 by (D08.1), and define

em+1,2k+j=vm,kfjvm,k∗(j=0,1).e_{m+1,2k+j}=v_{m,k}f_jv_{m,k}^*\qquad(j=0,1).

These projections remain pairwise orthogonal and equivalent, sum to the unit, and refine the old partition. With Pk/2m=∑i<kem,iP_{k/2^m}=\sum_{i<k}e_{m,i}, the projections PtP_t are well defined for every dyadic t∈[0,1]t\in[0,1], increase with tt, and satisfy P0=0P_0=0, P1=1P_1=1. If two dyadic intervals have the same length, refine to a common level; their difference projections are sums of the same number of equivalent cells and are equivalent by C02. Put qm=P2−m=em,0q_m=P_{2^{-m}}=e_{m,0}. Then

qm=qm+1+(qm−qm+1),qm+1∼qm−qm+1.(D08.2)q_m=q_{m+1}+(q_m-q_{m+1}),\qquad q_{m+1}\sim q_m-q_{m+1}. \tag{D08.2}

Each qmq_m is monic, with 2m2^m equivalent copies summing to one, and has central support one. Central restrictions of these partitions preserve all identities. This constructs the dyadic partitions needed for estimates with N=2m→∞N=2^m\to\infty, rather than claiming unspecified equal partitions for all positive integers.

D09. A dyadic central cut fits under every nonzero projection

Let finite NN have no nonzero abelian projection, and let p≠0p\ne0. Work on the central support c(p)c(p), and restrict the partitions in D08 to this central unit. There is a nonzero central z≤c(p)z\le c(p) and some m≥0m\ge0 such that

qmz≾pz.(D09.1)q_m z\precsim pz. \tag{D09.1}

If not, apply C05 to qmc(p)q_m c(p) and pp for each mm. Its first comparison part must be zero: on every nonzero central part z≤c(p)z\le c(p), both qmzq_mz and pzpz are nonzero by their full central supports, so that part would give (D09.1). Consequently p≾qmc(p)p\precsim q_m c(p) for every mm. By (D08.2), p≾(qm−qm+1)c(p)p\precsim (q_m-q_{m+1})c(p) for every m≥0m\ge0. Those annular projections are mutually orthogonal. Choosing a copy of pp under each yields infinitely many mutually orthogonal nonzero equivalent projections, contradicting D04. This proves (D09.1) without a trace-size estimate.

A nonzero subprojection of pzpz equivalent to qmzq_mz is monic: the central cut of the dyadic partition supplies a finite family of equivalent copies summing to zz. Equivalence preserves this property. If a partition containing the chosen copy itself is required, C06 extends its equivalence with qmzq_mz to a unitary, which conjugates the partition and fixes its central sum.

D10. Monic subprojections and arbitrary monic decompositions

On a homogeneous piece with unit zz and abelian cells e1,…,ene_1,\ldots,e_n, every nonzero p≤zp\le z has a nonzero monic subprojection. Since c(e1)=zc(e_1)=z, C04 gives a nonzero partial-isometry match from a subprojection s≤e1s\le e_1 to a subprojection r≤pr\le p. Let w=c(s)>0w=c(s)>0. D02 gives s=we1s=we_1, and the central restrictions weiwe_i are nn equivalent cells summing to ww. Thus r∼sr\sim s is monic in the original ambient algebra. C06 extends this equivalence to a unitary of the finite algebra; conjugating the finite partition then makes rr itself one of its cells while retaining the central sum.

For a general finite MM, use D07. A nonzero pp has a nonzero central restriction either on a homogeneous piece or on the piece without nonzero abelian projections. The first case uses the preceding paragraph, and the second uses D09. All central units of these components and their further central cuts are central in the original MM. Hence every nonzero pp contains a nonzero monic projection relative to Z(M)Z(M).

Choose by Zorn a maximal orthogonal family (ri)(r_i) of nonzero monic subprojections of pp. Its strong sum is pp: a nonzero residual would contain another such projection. Empty families cover p=0p=0. Thus every projection in a finite MM is an arbitrary orthogonal sum of monic projections. No countability of this decomposition is asserted.

The finite spectral cuts used by the constructions

Continuous positive parts and their closed-range supports give every finite cut below. The endpoint conventions are recorded explicitly, so the constructions apply to eigenvalues at the cut endpoints as well.

S01. Strict and non-strict threshold projections

For h=h∗∈Mh=h^*\in M and t∈Rt\in\mathbb R, set

at=(h−t1)+,bt=(t1−h)+,Pt=s(at),Qt=1−s(bt), a_t=(h-t1)_+,\qquad b_t=(t1-h)_+,\qquad P_t=s(a_t),\qquad Q_t=1-s(b_t),

where s(a)s(a) is the projection onto ran⁡a‾\overline{\operatorname{ran}a} supplied by H02. Continuous positive parts give

h−t1=at−bt,atbt=btat=0. h-t1=a_t-b_t,\qquad a_tb_t=b_ta_t=0.

All these operators belong to MM. Indeed, continuous functions of hh are norm limits of polynomials. For c≥0c\ge0, H02 gives the exact formula

s(c)=1−s-lim⁡r→∞(1+rc)−1. s(c)=1-\underset{r\to\infty}{\operatorname{s-lim}}(1+rc)^{-1}.

Each inverse belongs to MM by H01. Apply this formula to ata_t and btb_t. The algebra is closed under both norm and strong limits.

An operator commuting with hh commutes with at,bta_t,b_t, their resolvents, and their support projections. This follows first for polynomials, then for their norm limits, and finally for the strong limits, since multiplication by a fixed bounded operator preserves strong convergence. Consequently, all the projections Pt,QtP_t,Q_t commute with hh, with each other, and with every operator commuting with hh. If hh is central in MM, the projections are central in MM.

The closed ranges of ata_t and btb_t are orthogonal: for every ξ,η∈H\xi,\eta\in H,

⟨atξ,btη⟩=⟨ξ,atbtη⟩=0. \langle a_t\xi,b_t\eta\rangle =\langle\xi,a_tb_t\eta\rangle=0.

Thus s(at)s(bt)=0s(a_t)s(b_t)=0, or Pt≤QtP_t\le Q_t. Compression by a commuting projection preserves positivity: if c≥0c\ge0 commutes with a projection rr, then cr=c1/2rc1/2≥0cr=c^{1/2}rc^{1/2}\ge0. It follows that

(h−t1)Pt≥0,(h−t1)(1−Pt)≤0, (h-t1)P_t\ge0,\qquad (h-t1)(1-P_t)\le0,
(h−t1)Qt≥0,(h−t1)(1−Qt)≤0. (h-t1)Q_t\ge0,\qquad (h-t1)(1-Q_t)\le0.

For example, (h−t1)Pt=at(h-t1)P_t=a_t, because atPt=ata_tP_t=a_t and btPt=0b_tP_t=0; on 1−Pt1-P_t, only the non-positive term remains. The corresponding statements for QtQ_t follow because btQt=0b_tQ_t=0.

The projection

Et=Qt−Pt=1−s(at)−s(bt) E_t=Q_t-P_t=1-s(a_t)-s(b_t)

is exactly the projection onto ker⁡(h−t1)\ker(h-t1). One inclusion follows from atEt=btEt=0a_tE_t=b_tE_t=0. For the other, (h−t1)ξ=0(h-t1)\xi=0 gives atξ=btξa_t\xi=b_t\xi; these two vectors lie in orthogonal ranges, so both vanish. Thus PtP_t excludes the eigenspace at tt, whereas QtQ_t includes it. These are, respectively, the strict cut above tt and the non-strict cut at tt.

S02. Nesting and exact interval endpoints

If 0≤a≤b0\le a\le b, then ker⁡b⊆ker⁡a\ker b\subseteq\ker a. In fact, bξ=0b\xi=0 gives

0≤⟨aξ,ξ⟩≤⟨bξ,ξ⟩=0, 0\le\langle a\xi,\xi\rangle\le\langle b\xi,\xi\rangle=0,

and the positive-form argument in H02 gives aξ=0a\xi=0. Taking orthogonal complements proves s(a)≤s(b)s(a)\le s(b).

For s<ts<t, the scalar continuous inequalities

(x−t)+≤(x−s)+,(s−x)+≤(t−x)+ (x-t)_+\le(x-s)_+,\qquad (s-x)_+\le(t-x)_+

pass to hh by F06–F08. Therefore

Pt≤Ps,Qt≤Qs. P_t\le P_s,\qquad Q_t\le Q_s.

There is also the mixed inequality Qt≤PsQ_t\le P_s. To prove it, form the commuting projection r=Qt(1−Ps)r=Q_t(1-P_s). S01 gives

tr≤hr≤sr. tr\le hr\le sr.

Hence (t−s)r≤0(t-s)r\le0. Since t−s>0t-s>0 and r≥0r\ge0, this implies r=0r=0, as required.

For s<ts<t, the following differences are therefore projections:

Interval Projection
[s,t)[s,t) Qs−QtQ_s-Q_t
(s,t](s,t] Ps−PtP_s-P_t
(s,t)(s,t) Ps−QtP_s-Q_t
[s,t][s,t] Qs−PtQ_s-P_t

Each commutes with hh, and on each projection rr the inequalities sr≤hr≤trsr\le hr\le tr hold. The endpoint conventions are exact. The eigenspace projection EsE_s lies in QsQ_s, is orthogonal to PsP_s, and is orthogonal to QtQ_t and PtP_t. The projection EtE_t lies in QtQ_t and PsP_s, and is orthogonal to PtP_t. These relations prove the indicated inclusion or exclusion of each endpoint. At coincident endpoints the empty intervals have projection zero, while [s,s][s,s] has projection EsE_s. The displayed formulas for open intervals are asserted only when s<ts<t.

We may consequently write 1[s,t)(h)=Qs−Qt1_{[s,t)}(h)=Q_s-Q_t for this particular finite construction. This notation requires only continuous positive parts and their closed-range supports.

S03. Uniform approximation by finitely many projections

Every bounded selfadjoint h∈Mh\in M is a norm limit of finite real linear combinations of mutually orthogonal projections in MM commuting with hh. If h=0h=0, the single combination 0⋅10\cdot1 suffices. Otherwise put R=∥h∥>0R=\|h\|>0. For a positive integer mm, let

tj=−R+2Rjm(0≤j≤m),Δ=2Rm. t_j=-R+\frac{2Rj}{m}\quad(0\le j\le m), \qquad \Delta=\frac{2R}{m}.

The norm and order conclusions of F06–F08 give −R1≤h≤R1-R1\le h\le R1, so Q−R=1Q_{-R}=1, PR=0P_R=0, and QR=ERQ_R=E_R. Define

pj=Qtj−Qtj+1(0≤j<m),pm=QR. p_j=Q_{t_j}-Q_{t_{j+1}}\quad(0\le j<m), \qquad p_m=Q_R.

S02 and telescoping show that these projections are mutually orthogonal and sum to 11. They all commute with hh. Their bounds are

tjpj≤hpj≤tj+1pj(0≤j<m),hpm=Rpm. t_jp_j\le hp_j\le t_{j+1}p_j\quad(0\le j<m), \qquad hp_m=Rp_m.

The last equality follows from pm=ERp_m=E_R. Thus the upper endpoint, which the half-open intervals exclude, is retained as its own projection.

Set

hm=∑j=0m−1tjpj+Rpm. h_m=\sum_{j=0}^{m-1}t_jp_j+Rp_m.

On each of the first mm pieces, 0≤(h−hm)pj≤Δpj0\le(h-h_m)p_j\le\Delta p_j, and on the last piece the difference is zero. Addition gives

0≤h−hm≤Δ∑j=0m−1pj≤Δ1. 0\le h-h_m\le\Delta\sum_{j=0}^{m-1}p_j\le\Delta1.

The norm bound for positive operators in F08 now gives

∥h−hm∥≤2∥h∥m. \|h-h_m\|\le\frac{2\|h\|}{m}.

In particular, m>2∥h∥/εm>2\|h\|/\varepsilon gives an approximation with error strictly less than ε\varepsilon. Zero pieces may be omitted. The argument works in arbitrary Hilbert-space dimension and introduces no countable spectral resolution.

For a positive element the approximants can themselves be chosen positive. If h≥0h\ge0 and R=∥h∥>0R=\|h\|>0, instead use tj=Rj/mt_j=Rj/m, 0≤j≤m0\le j\le m. Now Q0=1Q_0=1 and QR=ERQ_R=E_R; the same differences pj=Qtj−Qtj+1p_j=Q_{t_j}-Q_{t_{j+1}} and top projection pm=QRp_m=Q_R sum to one. Their coefficients tjt_j and RR are nonnegative, and the same interval bounds give

0≤hm=∑j<mtjpj+Rpm≤h,0≤h−hm≤Rm1.0\le h_m=\sum_{j<m}t_jp_j+Rp_m\le h, \qquad 0\le h-h_m\le\frac Rm1.

The zero positive element uses the zero sum. Thus every positive element is a norm limit of positive finite projection sums, the precise form used by LC and CT.

Strict threshold endpoints and the finite lower-step approximation

The upper panel shows the endpoint conventions proved in S01–S02. The lower panel shows the scalar example R=1,m=4R=1,m=4 of S03: each half-open interval receives its lower endpoint coefficient, and {1}\{1\} receives coefficient one. The shaded difference is at most Δ=1/2\Delta=1/2. These scalar diagrams explain the operator construction from continuous positive parts and range supports; the displayed norm estimate is proved for every bounded selfadjoint operator.

S04. Central cuts for a positive contraction

Let a∈Z(M)a\in Z(M) satisfy 0≤a≤10\le a\le1, and let N≥1N\ge1 be an integer. Apply S01 to aa, writing its projections as QtQ_t. Then

zk=Qk/N−Q(k+1)/N(0≤k<N),zN=Q1=E1 z_k=Q_{k/N}-Q_{(k+1)/N}\quad(0\le k<N), \qquad z_N=Q_1=E_1

are central, mutually orthogonal, and sum to 11, because Q0=1Q_0=1 and P1=0P_1=0. They satisfy

kNzk≤azk≤k+1Nzk(0≤k<N),azN=zN. \frac{k}{N}z_k\le az_k\le\frac{k+1}{N}z_k \quad(0\le k<N),\qquad az_N=z_N.

The first pieces have the exact half-open convention [k/N,(k+1)/N)[k/N,(k+1)/N); the final piece is the eigenspace at 11.

For the averaging argument, take a=T(e)a=T(e), where ee is a projection and T:M→Z(M)T:M\to Z(M) is a positive unital centre-valued trace. Positivity gives 0≤T(e)≤10\le T(e)\le1, so all these cuts apply. If TT is faithful and centre-linear, then the last piece has the additional property

T((1−e)zN)=zN−T(e)zN=0. T((1-e)z_N)=z_N-T(e)z_N=0.

The operator (1−e)zN(1-e)z_N is positive, since zNz_N is central. Faithfulness gives (1−e)zN=0(1-e)z_N=0, or ezN=zNez_N=z_N. The cuts themselves do not require faithfulness.

S05. Integer central ranks without a representation theorem

Let DD be a nonzero unital abelian C∗C^*-algebra, let n≥1n\ge1, and let p=(pij)p=(p_{ij}) be a projection in Mn(D)M_n(D). Its ordinary diagonal trace is

d=∑i=1npii∈D. d=\sum_{i=1}^n p_{ii}\in D.

It is selfadjoint. The full character construction in T05a and CS01–CS06 supplies characters separating the elements of DD, and every character χ\chi extends entrywise to a unital ∗*-homomorphism χn:Mn(D)→Mn(C)\chi_n:M_n(D)\to M_n(\mathbb C).

For each χ\chi, the numerical matrix χn(p)\chi_n(p) is a selfadjoint projection. Its trace is an integer between zero and nn. Here is the finite-dimensional argument. Apply Gram–Schmidt successively to its images of the standard basis vectors, discarding zero remainders, to obtain an orthonormal basis for its range. Do the same with the images under its complementary projection to obtain an orthonormal basis for its kernel. These two subspaces are orthogonal and together span Cn\mathbb C^n. In the combined basis the projection has rr diagonal entries equal to one and the others zero. Its trace is unchanged by this basis change, since finite sums show Tr⁡(AB)=Tr⁡(BA)\operatorname{Tr}(AB)=\operatorname{Tr}(BA), and hence Tr⁡(U∗PU)=Tr⁡(PUU∗)\operatorname{Tr}(U^*PU)=\operatorname{Tr}(PUU^*). Thus

χ(d)=Tr⁡(χn(p))∈{0,1,…,n}. \chi(d)=\operatorname{Tr}(\chi_n(p))\in\{0,1,\ldots,n\}.

Put q(X)=∏j=0n(X−j)q(X)=\prod_{j=0}^n(X-j). Every character vanishes on q(d)q(d), so character separation gives q(d)=0q(d)=0. This proves the spectrum assertion directly. If λ∉{0,…,n}\lambda\notin\{0,\ldots,n\}, the polynomial identity

q(X)−q(λ)=(X−λ)rλ(X) q(X)-q(\lambda)=(X-\lambda)r_\lambda(X)

gives

(d−λ1)(−rλ(d)q(λ))=(−rλ(d)q(λ))(d−λ1)=1. (d-\lambda1)\left(-\frac{r_\lambda(d)}{q(\lambda)}\right) =\left(-\frac{r_\lambda(d)}{q(\lambda)}\right)(d-\lambda1)=1.

Consequently σD(d)⊆{0,1,…,n}\sigma_D(d)\subseteq\{0,1,\ldots,n\}.

There is also an explicit decomposition into central rank pieces. For 0≤k≤n0\le k\le n, let

Lk(X)=∏0≤j≤nj≠kX−jk−j,wk=Lk(d). L_k(X)=\prod_{\substack{0\le j\le n\\j\ne k}} \frac{X-j}{k-j},\qquad w_k=L_k(d).

These have real coefficients, so the wkw_k are selfadjoint. For each character,

χ(wk)={1,χ(d)=k,0,χ(d)≠k. \chi(w_k)= \begin{cases}1,&\chi(d)=k,\\0,&\chi(d)\ne k.\end{cases}

Applying character separation to each algebraic identity gives

wk2=wk,wkwl=0 (k≠l),∑k=0nwk=1,(d−k1)wk=0. w_k^2=w_k,\quad w_kw_l=0\ (k\ne l),\quad \sum_{k=0}^n w_k=1,\quad (d-k1)w_k=0.

Therefore

d=∑k=0nkwk,0≤d≤n1. d=\sum_{k=0}^n k w_k, \qquad 0\le d\le n1.

Some rank pieces may be zero. When D=Z(M)D=Z(M), these are central projections in MM. If the already established matrix-corner trace formula is T(p)=d/nT(p)=d/n, they satisfy T(p)wk=(k/n)wkT(p)w_k=(k/n)w_k, exactly as needed by finite matrix averaging. This deduction uses that formula as a separate hypothesis; it does not establish the centre-valued trace or the alignment of equivalent projections. No normality of the characters is needed. If DD is the zero algebra, p=d=wk=0p=d=w_k=0 and the assertion is immediate, without characters.

S06. Projections determine bounded linear functionals

Let f,g:M→Cf,g:M\to\mathbb C be bounded linear functionals agreeing on every projection. For h=h∗h=h^*, S03 gives finite projection combinations hmh_m with ∥h−hm∥→0\|h-h_m\|\to0. Linearity gives f(hm)=g(hm)f(h_m)=g(h_m), and

∣f(h)−g(h)∣≤(∥f∥+∥g∥)∥h−hm∥⟶0. |f(h)-g(h)|\le(\|f\|+\|g\|)\|h-h_m\|\longrightarrow0.

Every x∈Mx\in M is (x+x∗)/2+i(x−x∗)/(2i)(x+x^*)/2+i(x-x^*)/(2i), a sum of two selfadjoint parts, so f=gf=g on MM.

For completeness, a positive complex-linear functional φ\varphi with φ(1)=1\varphi(1)=1 is automatically bounded with norm one. Positive parts give φ(h)∈R\varphi(h)\in\mathbb R for selfadjoint hh, and then φ(x∗)=φ(x)‾\varphi(x^*)=\overline{\varphi(x)}. The sesquilinear form (a,b)↦φ(b∗a)(a,b)\mapsto\varphi(b^*a) is positive. Put α=φ(b∗a)\alpha=\varphi(b^*a), β=φ(b∗b)\beta=\varphi(b^*b), and γ=φ(a∗a)\gamma=\varphi(a^*a). For every complex tt, positivity gives

0≤γ−t‾α−tα‾+∣t∣2β. 0\le\gamma-\overline t\alpha-t\overline\alpha+|t|^2\beta.

If β>0\beta>0, take t=α/βt=\alpha/\beta. If β=0\beta=0, take t=rαt=r\alpha with r>0r>0; then 0≤γ−2r∣α∣20\le\gamma-2r|\alpha|^2 for every rr, forcing α=0\alpha=0. These two cases prove

∣φ(b∗a)∣2≤φ(a∗a)φ(b∗b). |\varphi(b^*a)|^2\le\varphi(a^*a)\varphi(b^*b).

Set b=1b=1. Since 0≤a∗a≤∥a∥210\le a^*a\le\|a\|^2 1,

∣φ(a)∣2≤φ(a∗a)≤∥a∥2. |\varphi(a)|^2\le\varphi(a^*a)\le\|a\|^2.

Thus ∥φ∥≤1\|\varphi\|\le1, and evaluation at 11 gives equality.

In particular, if ρ\rho is a tracial state and T:M→Z(M)T:M\to Z(M) is positive and unital, then ρ∘T\rho\circ T is also a positive unital scalar functional, hence has norm one. Agreement of ρ\rho and ρ∘T\rho\circ T on projections implies agreement everywhere by S03 and the estimate

∣ρ(h)−ρ(T(h))∣≤2∥h−hm∥. |\rho(h)-\rho(T(h))|\le2\|h-h_m\|.

This estimate needs neither normality of ρ\rho nor a separately imported norm estimate for TT.

Constructing the normal center-valued trace

The proofs in this section use C05–C06, D10 and the support-based finite spectral approximation S01–S03. They do not presuppose a scalar trace on a general finite algebra.

Norm of a positive central map (CN). If a positive linear map F:A→ZF:A\to Z has commutative unital C*-algebra range and F(1)=c≥0F(1)=c\ge0, then ∥F∥=∥c∥\|F\|=\|c\|.

Proof. For every character χ\chi of ZZ, χF\chi F is a positive scalar functional. Its positive-form Cauchy–Schwarz inequality gives

∣χF(x)∣2≤χ(c) χF(x∗x)≤χ(c)2∥x∥2.|\chi F(x)|^2\le \chi(c)\,\chi F(x^*x) \le \chi(c)^2\|x\|^2.

The inequality x∗x≤∥x∥21x^*x\le\|x\|^2 1 is F08. Characters preserve positivity by CS04 and norm ZZ by CS05 of Regular-group operator foundations. Hence ∥F(x)∥≤∥c∥∥x∥\|F(x)\|\le\|c\|\|x\|; evaluation at the unit proves equality. The positive-form Cauchy–Schwarz argument, including its zero-denominator case, is the quotient argument in GNS. □\square

Assembly on central components (CA). Suppose (zα)(z_\alpha) is an arbitrary orthogonal central partition of the unit, and each Fα:Mzα→ZzαF_\alpha:Mz_\alpha\to Zz_\alpha is normal and has norm at most CC. The componentwise map F:M→ZF:M\to Z is bounded by CC and normal.

Proof. The strong orthogonal sum of the output components exists, with norm the supremum of their norms, by H00–H01 and the central product construction SUP in Hypertraces. It is linear and bounded. A series-vector normal test on ZZ is η(d)=∑j⟨ξj,dηj⟩\eta(d)=\sum_j\langle\xi_j,d\eta_j\rangle, with ∑j∥ξj∥∥ηj∥<∞\sum_j\|\xi_j\|\|\eta_j\|<\infty. Its α\alpha-component has norm at most ∑j∥zαξj∥∥zαηj∥\sum_j\|z_\alpha\xi_j\|\|z_\alpha\eta_j\|. Thus

∑α∥η∣Zzα∥≤∑j,α∥zαξj∥∥zαηj∥≤∑j∥ξj∥∥ηj∥.\sum_\alpha\|\eta|_{Zz_\alpha}\| \le\sum_{j,\alpha}\|z_\alpha\xi_j\|\|z_\alpha\eta_j\| \le\sum_j\|\xi_j\|\|\eta_j\|.

The last inequality is Cauchy–Schwarz on the orthogonal coordinate families. These sums have countably many nonzero terms, even for an uncountable partition. Pulling each component test back by its normal map and normal central compression gives normal functionals on MM with summable norms. Their sum belongs to the norm-closed concrete predual H03, and equals ηF\eta F. All normal tests on ZZ therefore pull back to normal tests on MM, which proves ultraweak continuity. □\square

Construction of the normal center-valued trace Normal central compression Φ : M → Z; Φ(1) = 1 Faithful restriction to q₀Mq₀ NC, LC Remove pairs with ratio greater than C C > 1; eᵢ ∼ fᵢ; Φ(eᵢ) > CΦ(fᵢ) Residual e₀ ∼ f₀ ≠ 0 LC1 A finite comparison constant Φ(a) ≤ μΦ(b) for all matched cuts 0 < μ ≤ C LC Refine within matched corners p ∼ q ≠ 0; x ∈ pMp Φ(xx*) ≤ (1 + ε)Φ(x*x) LC3, LC Copy a monic corner and normalize bᵢⱼ = wᵢxwⱼ*; sum both indices Ψ(xx*) ≤ aΨ(x*x); a > 1 NA1, NA Take the norm limit aₙ ↓ 1; Ψₙ → T in operator norm T normal, faithful, central and tracial CT

Figure 2. The central state, residual matching, finite comparison constant, monic copying and norm limit in NC–CT. The strict central inequalities are interpreted on their stated supports in LC. The argument follows the approximate-trace method in Peterson, Lemmas 6.4.8–6.4.9 and Theorem 6.4.10, with a separate construction of the finite constant in LC1.

A normal center-valued state (NC). Every concrete von Neumann algebra MM, with center ZZ, has a normal positive unital center-linear map Φ:M→Z\Phi:M\to Z.

Proof. SUP constructs an orthogonal central partition (zα)(z_\alpha) from the supports of normal vector states of ZZ. On each ZzαZz_\alpha the corresponding vector state is faithful. To treat one component, write its unit as zz, choose the normalized vector ξ=zξ\xi=z\xi, and put K=Zzξ‾K=\overline{Zz\xi}. Its vector state ω(d)=⟨ξ,dξ⟩\omega(d)=\langle\xi,d\xi\rangle on ZzZz is faithful, normal and tracial, because this algebra is abelian. The map d1↦dξd1\mapsto d\xi identifies its trace Hilbert completion with KK. The full normal realization proof REP in Hypertraces applies to this faithful normal trace. In an abelian algebra its left and right multiplications coincide, so REP proves

θ(Zz)′=θ(Zz),θ(d)=d∣K,\theta(Zz)'=\theta(Zz),\qquad \theta(d)=d|_K,

and proves that θ\theta and its inverse are normal. This invocation of REP uses only its preceding scalar, Hilbert-space and predual constructions, and no center-valued trace theorem.

Let PP be the projection onto KK. The subspace reduces ZZ, so PP commutes with it. If x∈Mzx\in Mz, the compression PxP∣KPxP|_K commutes with θ(Zz)\theta(Zz), and hence belongs to θ(Zz)\theta(Zz). Define

Φz(x)=θ−1(PxP∣K).\Phi_z(x)=\theta^{-1}(PxP|_K).

Compression is positive, unital and normal by H03's series-vector tests. The inverse θ−1\theta^{-1} is a normal *-isomorphism, so this map is positive, unital and normal. Commutation with ZZ proves Φz(dx)=dΦz(x)\Phi_z(dx)=d\Phi_z(x). CN gives its norm one. Assemble these maps by CA. Their componentwise positivity, unit value and center-linearity survive assembly. The zero algebra uses its zero map. □\square

An almost tracial corner (LC). Let M≠0M\ne0 be finite, let Φ:M→Z\Phi:M\to Z be a normal center-valued state, and let ε>0\varepsilon>0. There is a nonzero projection pp such that Φ\Phi is faithful on pMppMp and

Φ(xx∗)≤(1+ε)Φ(x∗x)(x∈pMp).(LC)\Phi(xx^*)\le(1+\varepsilon)\Phi(x^*x)\qquad(x\in pMp). \tag{LC}

Proof. Choose a maximal orthogonal family of projections qiq_i with Φ(qi)=0\Phi(q_i)=0, and set q0=1−∑iqiq_0=1-\sum_i q_i. Normality gives Φ(q0)=1\Phi(q_0)=1. The restriction of Φ\Phi to q0Mq0q_0Mq_0 is faithful: a nonzero positive element of weight zero has a nonzero positive spectral threshold projection of weight zero in that corner, contradicting maximality. The threshold projection and its lower order bound are supplied by S01–S03. Center-linearity also shows that, for a nonzero projection a≤q0a\le q_0, the central support of the positive element Φ(a)\Phi(a) is c(a)c(a). Indeed a central cut of Φ(a)\Phi(a) vanishes exactly when that cut of aa vanishes, by faithfulness.

We first obtain a finite comparison constant. Fix a real C>1C>1. Choose a maximal family of pairs (ei,fi)(e_i,f_i) of equivalent nonzero subprojections of q0q_0, with each family separately orthogonal, such that Φ(ei)−CΦ(fi)\Phi(e_i)-C\Phi(f_i) is positive with support their common central support. Such families are ordered by inclusion; unions of chains give upper bounds, so Zorn applies. Put

e0=q0−∑iei,f0=q0−∑ifi.e_0=q_0-\sum_i e_i,\qquad f_0=q_0-\sum_i f_i.

Orthogonal additivity of equivalence and finite-complement matching give e0∼f0e_0\sim f_0. Also f0≠0f_0\ne0: otherwise normality would give 1≥Φ(∑iei)≥CΦ(∑ifi)=C11\ge\Phi(\sum_i e_i)\ge C\Phi(\sum_i f_i)=C1, which is impossible. Hence e0≠0e_0\ne0.

For every a≤e0a\le e_0, b≤f0b\le f_0 with a∼ba\sim b,

Φ(a)≤CΦ(b).(LC1)\Phi(a)\le C\Phi(b). \tag{LC1}

If this failed, the support of the positive part of Φ(a)−CΦ(b)\Phi(a)-C\Phi(b) would give a nonzero central cut on which the inequality is strictly reversed. The equivalent cut projections would extend the maximal family. Their common support is exactly this cut, since it lies under c(a)=c(b)c(a)=c(b). This proves (LC1).

Let μ\mu be the infimum of all nonnegative real constants satisfying (LC1) on these residual corners. It is finite, at most CC, and its defining inequalities hold at the infimum because the positive cone is norm closed. It is positive: the full equivalent pair e0,f0e_0,f_0 gives ∥Φ(e0)∥≤μ∥Φ(f0)∥\|\Phi(e_0)\|\le\mu\|\Phi(f_0)\|, and both weights are nonzero. Since μ/(1+ε)<μ\mu/(1+\varepsilon)<\mu, there are equivalent e≤e0e\le e_0, f≤f0f\le f_0 for which (1+ε)Φ(e)≰μΦ(f)(1+\varepsilon)\Phi(e)\not\le\mu\Phi(f). Cut by the support z≠0z\ne0 of the positive part of (1+ε)Φ(e)−μΦ(f)(1+\varepsilon)\Phi(e)-\mu\Phi(f), replacing e,fe,f by ez,fzez,fz. On this central corner

(1+ε)Φ(e)−μΦ(f)>0(LC2)(1+\varepsilon)\Phi(e)-\mu\Phi(f)>0 \tag{LC2}

means a positive element with support z=c(e)=c(f)z=c(e)=c(f). All the upper inequalities Φ(a)≤μΦ(b)\Phi(a)\le\mu\Phi(b) for equivalent subprojections remain valid after this cut.

Now choose a maximal separately orthogonal family (e^i,f^i)(\widehat e_i,\widehat f_i) of equivalent nonzero subprojections of e,fe,f, respectively, satisfying (1+ε)Φ(e^i)≤μΦ(f^i)(1+\varepsilon)\Phi(\widehat e_i)\le\mu\Phi(\widehat f_i) on their common central support. Set

p=e−∑ie^i,q=f−∑if^i.p=e-\sum_i\widehat e_i,\qquad q=f-\sum_i\widehat f_i.

They are equivalent by finite-complement matching: transport one sum by an equivalence e∼fe\sim f, then match its complement in the finite corner. If p=0p=0, summing the inequalities would give (1+ε)Φ(e)≤μΦ(f)(1+\varepsilon)\Phi(e)\le\mu\Phi(f), contradicting (LC2). Thus p∼q≠0p\sim q\ne0. For equivalent a≤pa\le p, b≤qb\le q, the first residual bound and the second maximality give

Φ(a)≤μΦ(b)≤(1+ε)Φ(a).(LC3)\Phi(a)\le\mu\Phi(b)\le(1+\varepsilon)\Phi(a). \tag{LC3}

For the second inequality, a nonzero support of the positive part of μΦ(b)−(1+ε)Φ(a)\mu\Phi(b)-(1+\varepsilon)\Phi(a) would provide another admissible central-cut pair. This is again forbidden by maximality.

If p1,p2≤pp_1,p_2\le p are equivalent, transport p1p_1 through an equivalence p∼qp\sim q to obtain r≤qr\le q equivalent to both. Applying (LC3) to (p1,r)(p_1,r) and (p2,r)(p_2,r) gives

Φ(p1)≤μΦ(r)≤(1+ε)Φ(p2).\Phi(p_1)\le\mu\Phi(r)\le(1+\varepsilon)\Phi(p_2).

For a unitary u∈pMpu\in pMp, positive finite spectral sums consequently satisfy Φ(udu∗)≤(1+ε)Φ(d)\Phi(udu^*)\le(1+\varepsilon)\Phi(d). S03's positive spectral sums converge in norm to every d≥0d\ge0; boundedness CN and closedness of the positive cone preserve the inequality. Finally the polar partial isometry of x∈pMpx\in pMp extends to a unitary of this finite corner by finite-complement matching. Thus xx∗=u(x∗x)u∗xx^*=u(x^*x)u^*, giving (LC). Faithfulness holds because p≤q0p\le q_0. □\square

A normal almost trace on the whole finite algebra (NA). For every a>1a>1, a finite von Neumann algebra has a normal center-valued state Ψ\Psi satisfying Ψ(xx∗)≤aΨ(x∗x)\Psi(xx^*)\le a\Psi(x^*x) for all xx.

Proof. Apply NC and LC with ε=a−1\varepsilon=a-1. The monic-decomposition lemma supplies a nonzero monic h≤ph\le p, so (LC) holds on hMhhMh. Choose equivalent orthogonal copies h1,…,hkh_1,\ldots,h_k summing to their central unit z0=c(h)z_0=c(h), and partial isometries wiw_i with wi∗wi=hiw_i^*w_i=h_i, wiwi∗=hw_iw_i^*=h. On Mz0Mz_0, define

F(x)=∑i=1kΦ(wixwi∗).F(x)=\sum_{i=1}^k\Phi(w_ixw_i^*).

This is positive, normal and center-linear. Its unit value is kΦ(h)k\Phi(h), whose support is z0z_0. For x∈Mz0x\in Mz_0, put bij=wixwj∗∈hMhb_{ij}=w_ixw_j^*\in hMh. Since ∑jhj=z0\sum_jh_j=z_0,

F(xx∗)=∑i,jΦ(bijbij∗)≤a∑i,jΦ(bij∗bij)=aF(x∗x).(NA1)F(xx^*)=\sum_{i,j}\Phi(b_{ij}b_{ij}^*) \le a\sum_{i,j}\Phi(b_{ij}^*b_{ij})=aF(x^*x). \tag{NA1}

Choose δ>0\delta>0 with nonzero central threshold z=1[δ,∞)(F(z0))z=1_{[\delta,\infty)}(F(z_0)). S01 gives F(z0)z≥δzF(z_0)z\ge\delta z, so its inverse y∈Zzy\in Zz exists by the continuous calculus. The map x↦yF(x)x\mapsto yF(x), x∈Mzx\in Mz, is a normal center-valued state on that component, and retains (NA1). Normality of multiplication by yy follows directly from H03. Positivity follows because the two central factors commute. Center-linearity and yF(z)=zyF(z)=z prove the unit and central identity conditions.

This construction works in every nonzero remaining central corner of MM. Zorn therefore gives a maximal orthogonal family of central corners with such maps, and their sum is one: a nonzero remainder would provide another corner. CA assembles them to the required normal center-valued state, whose norm is one by CN. The zero algebra is immediate. □\square

The normal center-valued trace (CT). A finite von Neumann algebra has a unique normal positive unital center-linear tracial map T:M→Z(M)T:M\to Z(M). It has norm one when the algebra is nonzero and is faithful.

Proof. Choose real numbers an>1a_n>1 decreasing to one and normal almost traces Ψn\Psi_n supplied by NA. For a monic projection hh, take equivalent copies hih_i, 1≤i≤k1\le i\le k, summing to the central support zz. The almost-trace inequality applied to their implementing partial isometries gives both Ψn(h)≤anΨn(hi)\Psi_n(h)\le a_n\Psi_n(h_i) and Ψn(hi)≤anΨn(h)\Psi_n(h_i)\le a_n\Psi_n(h). For m<nm<n, consequently,

kΨn(h)≤anz=an∑iΨm(hi)≤kanamΨm(h)≤kam2Ψm(h).k\Psi_n(h)\le a_n z =a_n\sum_i\Psi_m(h_i) \le k a_na_m\Psi_m(h) \le k a_m^2\Psi_m(h).

Every projection is an orthogonal sum of monic projections. Applying the normal maps to its increasing net of finite sums proves that am2Ψm−Ψna_m^2\Psi_m-\Psi_n is nonnegative on every projection. Positive norm spectral approximation S03 then makes it a positive map on all positive elements. Its unit value is (am2−1)1(a_m^2-1)1, so CN gives

∥am2Ψm−Ψn∥=am2−1,∥Ψm−Ψn∥≤2(am2−1).\|a_m^2\Psi_m-\Psi_n\|=a_m^2-1, \qquad \|\Psi_m-\Psi_n\|\le2(a_m^2-1).

Thus the maps converge in operator norm to a bounded linear map TT. Positivity, unitality and center-linearity pass to the limit. For every normal functional η\eta on ZZ, ηΨn→ηT\eta\Psi_n\to\eta T in norm. The concrete predual of MM is norm closed by H03, so ηT\eta T is normal. This proves normality of TT.

Passing to the limit in the almost-trace inequalities gives T(xx∗)≤T(x∗x)T(xx^*)\le T(x^*x). Replacing xx by x∗x^* gives equality. Polarization of the sesquilinear expression T(x∗y)−T(yx∗)T(x^*y)-T(yx^*), whose diagonal is now zero, proves T(x∗y)=T(yx∗)T(x^*y)=T(yx^*); hence T(ab)=T(ba)T(ab)=T(ba) for arbitrary a,ba,b.

For a monic hh as above, traciality makes the T(hi)T(h_i)'s equal, and their sum is zz; therefore T(h)=z/kT(h)=z/k. This forces the value of any normal center-valued trace on all monic projections, on their orthogonal sums by normality, and on every selfadjoint element by S03. Linearity proves uniqueness on MM. It also proves faithfulness: every nonzero projection contains a nonzero monic projection, whose trace is nonzero; every nonzero positive element dominates a positive scalar multiple of a nonzero threshold projection. Finally CN gives the norm assertion. □\square

Trace detects comparison. For projections in a finite algebra, p≾qp\precsim q if and only if T(p)≤T(q)T(p)\le T(q). The forward implication is positivity and traciality. For the reverse, comparison supplies a central cut on which p≾qp\precsim q, with the reverse subequivalence on its complement. On that complement choose a copy q′≤pq'\le p of qq. The trace inequality makes T(p−q′)=0T(p-q')=0, and faithfulness forces p=q′p=q'. Assemble the central equivalences. In particular equal center-valued traces imply equivalence, and finite-complement matching extends its partial isometry to a unitary.

S07. The two trace-factorization applications

For the normal-trace application, suppose that the centre-valued trace and the orthogonal decomposition of projections into monic projections have already been supplied. If pp is monic, let p1,…,pnp_1,\ldots,p_n be equivalent orthogonal copies of pp summing to a central projection zz. A partial isometry viv_i witnessing the equivalence has vi∗vi=pv_i^*v_i=p and vivi∗=piv_iv_i^*=p_i. Traciality gives τ(pi)=τ(p)\tau(p_i)=\tau(p) and T(pi)=T(p)T(p_i)=T(p). Their sums are τ(z)\tau(z) and T(z)=zT(z)=z, the latter because TT is centre-linear and unital. Consequently

τ(p)=τ(z)n,T(p)=zn. \tau(p)=\frac{\tau(z)}n,\qquad T(p)=\frac zn.

Thus τ(p)=τ(T(p))\tau(p)=\tau(T(p)). For an orthogonal monic decomposition e=∑αpαe=\sum_{\alpha}p_\alpha, the net eG=∑α∈Gpαe_G=\sum_{\alpha\in G}p_\alpha, over finite subsets GG, increases strongly to ee. The normality clauses give τ(eG)→τ(e)\tau(e_G)\to\tau(e) and τ(T(eG))→τ(T(e))\tau(T(e_G))\to\tau(T(e)); the latter uses normality of TT and of τ\tau restricted to the centre. Equality for every finite sum therefore gives equality on ee. S06 then gives τ=τ∘T\tau=\tau\circ T on all of MM.

For the application to an arbitrary tracial state, suppose the finite averaging construction gives, for each projection ee and each dyadic NN, a finite average of unitary conjugates with

∥1L∑j=1Lujeuj∗−T(e)∥≤2N. \left\|\frac1L\sum_{j=1}^L u_j e u_j^*-T(e)\right\|\le\frac2N.

Traciality gives ρ(ujeuj∗)=ρ(e)\rho(u_j e u_j^*)=\rho(e), so applying the norm-one functional ρ\rho yields ∣ρ(e)−ρ(T(e))∣≤2/N|\rho(e)-\rho(T(e))|\le2/N. Letting dyadic NN increase proves agreement on projections, and S06 gives ρ=ρ∘T\rho=\rho\circ T on all of MM, without normality. S04 provides precisely the finite central thresholds used in that averaging construction, and S05 provides its matrix rank pieces. The existence and faithfulness of the centre-valued trace, the monic decomposition, projection comparison, finite complements, and the dyadic matrix averaging construction remain their respective hypotheses and providers.

Reading

Jesse Peterson, Notes on operator algebras, dated April 27, 2020. Projection comparison and complement methods appear in Lemma 5.1.5, Proposition 5.1.9, Theorem 5.1.10 and Propositions 5.2.7–5.2.8, pp.84–90. The finite homogeneous construction is related to Proposition 5.4.2, p.95; the halving and monic methods are Lemmas 6.4.1–6.4.3 and Proposition 6.4.4, pp.102–103. The approximate center-trace method is Lemmas 6.4.8–6.4.9 and Theorem 6.4.10, pp.104–106. Here LC1 constructs a finite uniform comparison constant before its infimum is taken. CN proves the positive-map norm estimate for arbitrary elements; NA1 gives both different quadratic products explicitly.

The earlier complete proof providers are Regular-group operator foundations, H00–H03, T04a and CS01–CS06, Infinite tensor products, F01–F08, and Hypertraces, GNS, COMPACT, REP and SUP. NC uses only the abelian faithful-trace instance of REP, whose proof precedes every center-valued trace application. The three diagrams are embedded as editable SVG in this lesson source.