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

Properly infinite injective algebras and dyadic approximation

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

Finite completely positive models record operators in a matrix algebra. In a properly infinite algebra, their reconstruction map can be implemented by one isometry. Approximating that isometry by unitaries then moves the matrix algebra itself into a position that approximates the original operators.

We use the equivalence of injectivity and semidiscreteness proved in Averaging, crossed products, and injectivity, the Choi matrix criterion in Completely positive finite models, and standard form from OA-MOD. The projection facts are the existing foundations inputs: halving a properly infinite projection, projection comparison and projection Schroeder–Bernstein. The central finite-part criterion for projections and finite absorption are used in (8): a projection with no nonzero finite central summand in its central support is properly infinite. These facts imply a partition of the properly infinite identity into countably many projections equivalent to it. No general weight construction enters this lesson.

Here is the countable-partition argument, including its possible residual projection. Repeated proper halving gives orthogonal projections pj∼1p_j\sim1 and decreasing remainders rj∼1r_j\sim1, with

1=p1+⋯+pj+rj.1=p_1+\cdots+p_j+r_j.

Let r∞=⋀jrjr_\infty=\bigwedge_jr_j. The projections p1+r∞,p2,p3,…p_1+r_\infty,p_2,p_3,\ldots sum strongly to one. Since p1≤p1+r∞≤1p_1\le p_1+r_\infty\le1 and p1∼1p_1\sim1, projection Schroeder–Bernstein makes p1+r∞∼1p_1+r_\infty\sim1. Thus the residual is absorbed and the asserted partition has every member equivalent to one. This argument uses neither a faithful state nor separability.

Write

∥x∥φ#=(φ(x∗x)+φ(xx∗)2)1/2.(1)\|x\|_\varphi^\#=\left(\frac{\varphi(x^*x)+\varphi(xx^*)}{2}\right)^{1/2}. \tag{1}

Here φ\varphi is a normal state, and ξφ\xi_\varphi its standard-form vector. Local AFD means approximation of each finite set in each sigma-strong* neighborhood by one finite-dimensional *-subalgebra. Separability below means separability of the predual. Local AFD makes sense without it; an increasing sequence is a stronger organizational conclusion for which we will explicitly assume it.

1. A unitary can converge strongly to an isometry

Lemma 1.1. In any von Neumann algebra MM, the sigma-strong closure of U(M)\mathcal U(M) is the set of isometries.

Proof. If unitaries converge strongly to vv, then ∥vη∥=∥η∥\|v\eta\|=\|\eta\| for every vector, so v∗v=1v^*v=1. Conversely let v∗v=1v^*v=1, set

e=1−vv∗,ej=vj−1e(v∗)j−1,f=1−∑j≥1ej.e=1-vv^*,\quad e_j=v^{j-1}e(v^*)^{j-1},\quad f=1-\sum_{j\ge1}e_j.

The eje_j's are orthogonal: ev=0ev=0, hence e(v∗)re=0e(v^*)^r e=0 and evre=0ev^r e=0 for positive rr. Also vejv∗=ej+1ve_jv^*=e_{j+1} and vfv∗=fvfv^*=f; on ff, the operator vfvf is unitary. Define

wn=v∑j=1nej+(v∗)nen+1+∑j≥n+2ej+vf.(2)w_n=v\sum_{j=1}^n e_j+(v^*)^n e_{n+1} +\sum_{j\ge n+2}e_j+vf. \tag{2}

On the first n+1n+1 wandering spaces this is a cyclic permutation, using vv to move one step forward and (v∗)n(v^*)^n to return to the first space. It is the identity on the remaining wandering spaces and vfvf on ff. Initial and final projections of these partial isometries are orthogonal partitions of one. Thus wn∗wn=wnwn∗=1w_n^*w_n=w_nw_n^*=1.

The difference from vv vanishes on f+∑j≤nejf+\sum_{j\le n}e_j. Therefore

∥(wn−v)η∥≤2∥∑j≥n+1ejη∥⟶0.(3)\|(w_n-v)\eta\|\le2\left\|\sum_{j\ge n+1}e_j\eta\right\|\longrightarrow0. \tag{3}

The same estimate in a countable Hilbert-space amplification proves sigma-strong convergence, since its vector tests are exactly square-summable families of vector tests. This argument also covers e=0e=0. □\square

An isometry with nonzero range defect cannot be a strong* limit of unitaries: strong* convergence would give both v∗v=1v^*v=1 and vv∗=1vv^*=1. We will use only the strong convergence in Lemma 1.1.

Lemma 1.2. In a properly infinite MM, there are isometries un→1u_n\to1 sigma-strong* whose defects qn=1−unun∗q_n=1-u_nu_n^* satisfy qn∼1q_n\sim1 and qn→0q_n\to0 sigma-strong.

Proof. Choose orthogonal pj∼1p_j\sim1 with sum one, and put rn=∑j≥npjr_n=\sum_{j\ge n}p_j. Both rnr_n and rn−pnr_n-p_n are equivalent to one: each dominates a projection equivalent to one and is bounded above by one. Projection Schroeder–Bernstein gives the assertion. Choose ana_n with an∗an=rna_n^*a_n=r_n, anan∗=rn−pna_na_n^*=r_n-p_n, and put un=1−rn+anu_n=1-r_n+a_n. Then un∗un=1u_n^*u_n=1, qn=pnq_n=p_n, and

∥(1−un)η∥≤2∥rnη∥,∥(1−un∗)η∥≤2∥rnη∥,∥qnη∥≤∥rnη∥.(4)\|(1-u_n)\eta\|\le2\|r_n\eta\|,\qquad \|(1-u_n^*)\eta\|\le2\|r_n\eta\|,\qquad \|q_n\eta\|\le\|r_n\eta\|. \tag{4}

The tails decrease strongly to zero; square-summable vector tests give the stated topologies. Thus the errors can be made small on any prescribed finite collection of vectors at once. □\square

2. Membership from possibly unbounded approximants

Lemma 2.1. Let N⊂MN\subset M be a unital von Neumann subalgebra and φ\varphi a faithful normal state. If xn∈Nx_n\in N and ∥xn−x∥φ#→0\|x_n-x\|_\varphi^\#\to0, then x∈Nx\in N. No bound on ∥xn∥\|x_n\| is required.

Proof. Splitting real and imaginary parts reduces to self-adjoint xn,xx_n,x. Set η=(x+i)ξφ\eta=(x+i)\xi_\varphi. Resolvent multiplication gives

((xn+i)−1−(x+i)−1)η=(xn+i)−1(x−xn)ξφ⟶0,(5)\bigl((x_n+i)^{-1}-(x+i)^{-1}\bigr)\eta =(x_n+i)^{-1}(x-x_n)\xi_\varphi\longrightarrow0, \tag{5}

because the first resolvent has norm at most one. The vector η\eta is separating for MM: if bη=0b\eta=0, faithfulness of φ\varphi implies b(x+i)=0b(x+i)=0, hence b=0b=0.

A separating vector is cyclic for M′M'. Indeed the projection onto M′η‾\overline{M'\eta} belongs to MM; its complement annihilates η\eta and is therefore zero. A uniformly bounded sequence in MM converging on η\eta converges strongly on M′ηM'\eta, by commutation, and then on the whole Hilbert space by density. This applies to the resolvent differences in (5). Their limit (x+i)−1(x+i)^{-1} belongs to NN. A unital C*-subalgebra is inverse closed; inverting this element shows x+i∈Nx+i\in N, hence x∈Nx\in N. Apply this conclusion to both self-adjoint parts. □\square

The same cyclic-commutant argument shows that, on bounded sets, the seminorm (1) for a faithful normal state determines sigma-strong* convergence. It does not assert that the original unbounded approximants in Lemma 2.1 converge in that topology.

3. Replacing a finite algebra by a dyadic subfactor

Lemma 3.1. If a properly infinite algebra is locally AFD, every finite set can be approximated in any sigma-strong* neighborhood by a unital matrix subfactor M2kM_{2^k}. Its size can be required to exceed any fixed bound.

Proof. First approximate by a finite-dimensional unital algebra DD, adjoining 11 if necessary. Write its matrix systems as eij(a)e_{ij}^{(a)}, with block sizes dad_a, and put t=∑adat=\sum_a d_a. Lemma 1.2 gives an isometry uu close enough to one that uzu∗uzu^* is close to zz for each of the finitely many chosen z∈Dz\in D, with small defect q=1−uu∗∼1q=1-uu^*\sim1.

Choose 2k>t2^k>t. Partition qq into 2k2^k projections equivalent to one. For the first tt projections choose block matrix systems gij(a)g_{ij}^{(a)} with the same sizes as DD. Then

fij(a)=ueij(a)u∗+gij(a)(6)f_{ij}^{(a)}=ue_{ij}^{(a)}u^*+g_{ij}^{(a)} \tag{6}

are orthogonal block matrix systems. For z=∑λij(a)eij(a)z=\sum\lambda_{ij}^{(a)}e_{ij}^{(a)}, put ρ(z)=∑λij(a)gij(a)\rho(z)=\sum\lambda_{ij}^{(a)}g_{ij}^{(a)}. This *-homomorphism has norm at most one, range supported on qq, and

ρ(z)∗ρ(z), ρ(z)ρ(z)∗≤∥z∥2q.(7)\rho(z)^*\rho(z),\ \rho(z)\rho(z)^*\le\|z\|^2q. \tag{7}

Thus ρ(z)\rho(z) tends to zero in every specified strong* test as qq does. The new approximant uzu∗+ρ(z)uzu^*+\rho(z) is close to zz.

Every diagonal projection in (6) is equivalent to one, since it dominates the corresponding gii(a)∼1g_{ii}^{(a)}\sim1. Include the unused defect projections too. There are 2k2^k mutually equivalent diagonals summing to one. They extend to a full matrix system respecting all the prescribed block connections: choose a reference diagonal, connect it to the first diagonal of each block, and use that block's existing matrix units to connect to its other diagonals. If these connecting partial isometries are vjv_j, the operators vivj∗v_iv_j^* are the desired system. Its span contains every new approximant. Choosing the original error and the two new errors sufficiently small proves the lemma. □\square

Theorem 3.2. For properly infinite MM with separable predual, local AFD is equivalent to generation by an increasing sequence Ak≅M2kA_k\cong M_{2^k}.

Proof. An increasing generating sequence gives local approximation by Kaplansky density. Conversely choose a faithful normal state φ\varphi and a sigma-strong* dense sequence (xj)(x_j) in the unit ball. Such a sequence exists for separable predual: the standard representation is separable and its bounded strong* balls are metrizable and separable.

Suppose a unital dyadic subfactor A≅MdA\cong M_d has already been chosen, with units eije_{ij}. Matrix coordinates identify

M≅Md⊗ˉe11Me11,C=A′∩M≅e11Me11.(8)M\cong M_d\bar\otimes e_{11}Me_{11},\qquad C=A'\cap M\cong e_{11}Me_{11}. \tag{8}

The projection e11e_{11} is properly infinite. A finite nonzero central cut of it would make the corresponding sum of its dd equivalent cuts finite, contrary to proper infiniteness of MM. A properly infinite projection absorbs finitely many equivalent copies of itself; consequently e11∼1e_{11}\sim1. Thus C≅MC\cong M, so CC is properly infinite and locally AFD.

Write the next finitely many xjx_j's as ∑r,sbrs(j)ers\sum_{r,s}b_{rs}^{(j)}e_{rs}, with brs(j)∈Cb_{rs}^{(j)}\in C. Multiplication by any fixed operator is continuous for sigma-strong*: its seminorms are bounded by finitely many seminorms obtained from normal positive functionals. Lemma 3.1 in CC therefore gives a dyadic B⊂CB\subset C and coefficients in BB whose reconstructed sums approximate the xjx_j's within 1/n1/n in (1). The algebra A∨B≅A⊗BA\vee B\cong A\otimes B is a larger dyadic factor containing AA exactly. This constructs increasing NnN_n, with approximants to the first nn elements and errors tending to zero.

Let P=(⋃nNn)′′P=(\bigcup_nN_n)''. Lemma 2.1 puts every xjx_j in PP, without imposing bounds on the reconstructed sums. Density and closedness give P=MP=M. Between successive dyadic matrix sizes insert the missing M2M_2 tensor levels of their finite-dimensional relative commutants, and insert the initial levels inside N1N_1. This gives all the sizes 2k2^k. □\square

4. A finite CP reconstruction is one compression

Lemma 4.1. Let D≅MmD\cong M_m be a unital subfactor of MM. Every cp T:D→MT:D\to M has

T(x)=∑k,ℓ=1makℓ∗xakℓ.(9)T(x)=\sum_{k,\ell=1}^m a_{k\ell}^*xa_{k\ell}. \tag{9}

If MM is properly infinite, it also has T(x)=v∗xvT(x)=v^*xv for one v∈Mv\in M. If TT is unital, vv is an isometry.

Proof. The Choi matrix [T(eij)][T(e_{ij})] is positive. Write its positive square root as [bki][b_{ki}], so T(eij)=∑kbki∗bkjT(e_{ij})=\sum_kb_{ki}^*b_{kj}. Put akℓ=∑ieiℓbkia_{k\ell}=\sum_i e_{i\ell}b_{ki}. Matrix-unit multiplication gives

akℓ∗eijakℓ=bki∗eℓℓbkj.a_{k\ell}^*e_{ij}a_{k\ell}=b_{ki}^*e_{\ell\ell}b_{kj}.

Summing k,ℓk,\ell proves (9). In the properly infinite case, (8) makes D′∩MD'\cap M properly infinite. Choose m2m^2 isometries skℓs_{k\ell} there with orthogonal ranges, and set v=∑skℓakℓv=\sum s_{k\ell}a_{k\ell}. Commutation with DD and skℓ∗srs=δkrδℓs1s_{k\ell}^*s_{rs}=\delta_{kr}\delta_{\ell s}1 give v∗xv=T(x)v^*xv=T(x). At x=1x=1 the unital case gives v∗v=1v^*v=1. □\square

Theorem 4.2. Every properly infinite injective von Neumann algebra is locally AFD. If its predual is separable, it is generated by an increasing dyadic sequence as in Theorem 3.2.

Proof. Semidiscreteness supplies normal ucp recording maps Si:M→MmiS_i:M\to M_{m_i} and cpc reconstruction maps TiT_i, with TiSi→idT_iS_i\to\mathrm{id} sigma-strong* pointwise. Both maps can be made unital. Choose a state ωi\omega_i on MmiM_{m_i} and replace

Ti(z)byTi(z)+ωi(z)(1−Ti(1)).(10)T_i(z)\quad\hbox{by}\quad T_i(z)+\omega_i(z)(1-T_i(1)). \tag{10}

This is ucp. Since Ti(1)=TiSi(1)→1T_i(1)=T_iS_i(1)\to1 and ∣ωi(Si(x))∣≤∥x∥|\omega_i(S_i(x))|\le\|x\|, the correction tends to zero in every strong* test. It preserves the approximation.

It suffices to approximate finitely many unitaries UjU_j: every operator is a linear combination of four unitaries, by writing each self-adjoint contraction as the real part of a+i(1−a2)1/2a+i(1-a^2)^{1/2}. Fix a normal state φ\varphi and a small θ>0\theta>0. Finitely many normal-functional tests can be dominated by a scalar multiple of one such state, so this handles any requested neighborhood. Choose a unital factorization with ∥TS(Uj)−Uj∥φ#<θ\|T S(U_j)-U_j\|_\varphi^\#<\theta. Embed its matrix algebra unitally as D⊂MD\subset M, and use Lemma 4.1 to write T(z)=v∗zvT(z)=v^*zv, with v∗v=1v^*v=1. Set zj=S(Uj)z_j=S(U_j); these are contractions.

With inner products linear in the second variable,

Re⁡⟨vUjξφ,zjvξφ⟩>1−2θ.(11)\operatorname{Re}\langle vU_j\xi_\varphi,z_jv\xi_\varphi\rangle>1-\sqrt2\theta. \tag{11}

Indeed its difference from 11 is bounded by ∥(v∗zjv−Uj)ξφ∥\|(v^*z_jv-U_j)\xi_\varphi\|. The same estimate holds for Uj∗,zj∗U_j^*,z_j^*. Lemma 1.1 gives unitaries converging strongly to vv, on both ξφ\xi_\varphi and Ujξφ,Uj∗ξφU_j\xi_\varphi,U_j^*\xi_\varphi. Choose one ww such that both real parts remain greater than 1−(2+1)θ1-(\sqrt2+1)\theta. Since the compared vectors have norms at most one,

∥w∗zjw−Uj∥φ#<(2(2+1)θ)1/2.(12)\|w^*z_jw-U_j\|_\varphi^\# <\bigl(2(\sqrt2+1)\theta\bigr)^{1/2}. \tag{12}

Taking θ\theta sufficiently small gives the desired approximation inside the finite-dimensional subfactor w∗Dww^*Dw. No faithful state or separability was needed for this local conclusion. Apply Theorem 3.2 when the predual is separable. □\square

5. Problems with complete solutions

Exercise 1. For the unilateral shift vv on ℓ2(N)\ell^2(\mathbb N), describe the unitaries (2) and verify (3) directly.

Solution. The defect is the first coordinate, and eje_j is the jj-th coordinate projection. The unitary cycles coordinates 1,…,n+11,\ldots,n+1, sends the last back to the first, and fixes all later coordinates. It agrees with the shift on the first nn coordinates. Thus its difference from the shift has norm at most two and annihilates that initial span, giving exactly the tail bound (3).

Exercise 2. Explain why the same unitaries do not converge strong* to the shift.

Solution. The shift adjoint annihilates the first basis vector, whereas each cycling unitary's adjoint sends it to the (n+1)(n+1)-st basis vector, of norm one. Strong convergence of the adjoints fails. Alternatively a strong* limit would preserve the identity wnwn∗=1w_nw_n^*=1, while the shift has a one-dimensional range defect.

Exercise 3. Prove the two estimates in (4) involving unu_n and un∗u_n^*.

Solution. Both differences are supported on rnr_n: the partial isometry and its adjoint have initial and final projections below rnr_n. On that space each difference is the difference of two contractions, hence has norm at most two. Apply this to rnηr_n\eta. Outside that space the differences vanish.

Exercise 4. Give unbounded approximants converging in a faithful-state norm, and explain why a boundedness argument would miss them.

Solution. In L∞[0,1]L^\infty[0,1] with the integration state take xn=n1[0,n−4]x_n=n1_{[0,n^{-4}]}. Their operator norms are nn, while their 22-norms are 1/n1/n; adjoints are the same, so (1) tends to zero. They lie outside every fixed operator-norm ball. Lemma 2.1 applies through their uniformly bounded resolvents rather than through boundedness of the original sequence.

Exercise 5. Why does a bounded sequence converging on a separating vector converge strongly on every vector?

Solution. For a′∈M′a'\in M', bna′η=a′bnη→0b_n a'\eta=a'b_n\eta\to0 if bnη→0b_n\eta\to0. The vectors a′ηa'\eta are dense because η\eta is separating. If sup⁡∥bn∥=C\sup\|b_n\|=C, approximating a vector by such a vector gives an error at most CC times the approximation error, uniformly in nn. First take the limit in nn, then make the density error tend to zero.

Exercise 6. Verify (7), including its adjoint version, without assuming a trace.

Solution. The homomorphism ρ\rho is contractive and supported on qq. Thus ρ(z)∗ρ(z)\rho(z)^*\rho(z) is positive, supported on qq, and has norm at most ∥z∥2\|z\|^2, giving the first inequality. Apply the same argument to z∗z^*. Consequently (1) is at most ∥z∥φ(q)1/2\|z\|\varphi(q)^{1/2} for every normal state, whether tracial or not.

Exercise 7. Explain why the relative-commutant step in Theorem 3.2 gives exact containment of the old factor.

Solution. The new matrix factor BB lies in A′∩MA'\cap M, so it commutes with AA. Matrix coordinates (8) identify their generated algebra with Md⊗BM_d\otimes B, a full matrix algebra with the shared identity. The inclusion of AA is its first tensor leg, so every old matrix unit is retained exactly; only the other leg is being approximated.

Exercise 8. Check the reconstruction formula (9) on a matrix unit.

Solution. Expand akℓ∗eijakℓa_{k\ell}^*e_{ij}a_{k\ell}. In the product eℓreijesℓe_{\ell r}e_{ij}e_{s\ell}, the nonzero term requires r=i,s=jr=i,s=j, and equals eℓℓe_{\ell\ell}. The result is bki∗eℓℓbkjb_{ki}^*e_{\ell\ell}b_{kj}. Summing over ℓ\ell gives bki∗bkjb_{ki}^*b_{kj}, and summing over kk gives T(eij)T(e_{ij}), as required.

Exercise 9. Why does (10) preserve complete positivity and convergence?

Solution. A positive scalar functional is cp, and multiplication of its scalar values by the fixed positive element 1−Ti(1)1-T_i(1) is cp at every matrix size. Their sum with TiT_i is cp and has unit value one. The composite correction is a scalar of modulus at most ∥x∥\|x\| times 1−Ti(1)1-T_i(1), which tends to zero sigma-strong*. Both incoming and outgoing maps therefore become unital without losing the finite approximation.

Exercise 10. Derive (12) from the two real-part bounds following (11).

Solution. Put c=(2+1)θc=(\sqrt2+1)\theta. The vectors wUjξwU_j\xi have norm one and zjwξz_jw\xi have norm at most one. Their squared difference is at most 2−2(1−c)=2c2-2(1-c)=2c. The same bound holds with both operators adjointed. Conjugating by w∗w^* gives the two vector errors defining (1); their squared average is at most 2c2c. Taking square roots gives (12).

References and proof scope

George A. Elliott and E. J. Woods, The equivalence of various definitions for a properly infinite von Neumann algebra to be approximately finite dimensional, Proceedings of the American Mathematical Society 60 (October 1976), 175–178, DOI 10.1090/S0002-9939-1976-0512370-0. Lemma 1 on printed p.175 constructs an isometry close to one with a small defect equivalent to one. Lemma 2 on p.176 proves membership from potentially unbounded approximants by using resolvents and a separating vector. Theorem 3, pp.176–178, proves dyadic finite-factor replacement and increasing dyadic assembly for a properly infinite algebra on a separable Hilbert space. The proofs above give the normal-state formulation, explicit matrix-system extension, and exact containment through the relative commutant. Separability is used for the generating sequence, while the local replacement remains valid without it.

Uffe Haagerup, A new proof of the equivalence of injectivity and hyperfiniteness for factors on a separable Hilbert space, Journal of Functional Analysis 62 (1985), 160–201. Proposition 2.1 and Theorem 2.2 develop the internal matrix reconstruction and isometry-conjugation method. Here the matrix calculation is given explicitly, the isometry is approximated by a constructed unitary sequence, and the local conclusion retains arbitrary properly infinite algebras. The dyadic assembly and exact containment arguments are proved above, with separable predual required for the generating sequence. The finite injective converse is developed separately. The existing programme lesson Injective von Neumann algebras, Sections 2 and 4, supplies the declared abstract injectivity and permanence prerequisites; its directed AFD statement does not supply the local-to-sequential construction proved here.