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 and decreasing remainders , with
Let . The projections sum strongly to one. Since and , projection Schroeder–Bernstein makes . 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
Here is a normal state, and 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 , the sigma-strong closure of is the set of isometries.
Proof. If unitaries converge strongly to , then for every vector, so . Conversely let , set
The 's are orthogonal: , hence and for positive . Also and ; on , the operator is unitary. Define
On the first wandering spaces this is a cyclic permutation, using to move one step forward and to return to the first space. It is the identity on the remaining wandering spaces and on . Initial and final projections of these partial isometries are orthogonal partitions of one. Thus .
The difference from vanishes on . Therefore
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 .
An isometry with nonzero range defect cannot be a strong* limit of unitaries: strong* convergence would give both and . We will use only the strong convergence in Lemma 1.1.
Lemma 1.2. In a properly infinite , there are isometries sigma-strong* whose defects satisfy and sigma-strong.
Proof. Choose orthogonal with sum one, and put . Both and are equivalent to one: each dominates a projection equivalent to one and is bounded above by one. Projection Schroeder–Bernstein gives the assertion. Choose with , , and put . Then , , and
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.
2. Membership from possibly unbounded approximants
Lemma 2.1. Let be a unital von Neumann subalgebra and a faithful normal state. If and , then . No bound on is required.
Proof. Splitting real and imaginary parts reduces to self-adjoint . Set . Resolvent multiplication gives
because the first resolvent has norm at most one. The vector is separating for : if , faithfulness of implies , hence .
A separating vector is cyclic for . Indeed the projection onto belongs to ; its complement annihilates and is therefore zero. A uniformly bounded sequence in converging on converges strongly on , by commutation, and then on the whole Hilbert space by density. This applies to the resolvent differences in (5). Their limit belongs to . A unital C*-subalgebra is inverse closed; inverting this element shows , hence . Apply this conclusion to both self-adjoint parts.
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 . Its size can be required to exceed any fixed bound.
Proof. First approximate by a finite-dimensional unital algebra , adjoining if necessary. Write its matrix systems as , with block sizes , and put . Lemma 1.2 gives an isometry close enough to one that is close to for each of the finitely many chosen , with small defect .
Choose . Partition into projections equivalent to one. For the first projections choose block matrix systems with the same sizes as . Then
are orthogonal block matrix systems. For , put . This *-homomorphism has norm at most one, range supported on , and
Thus tends to zero in every specified strong* test as does. The new approximant is close to .
Every diagonal projection in (6) is equivalent to one, since it dominates the corresponding . Include the unused defect projections too. There are 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 , the operators are the desired system. Its span contains every new approximant. Choosing the original error and the two new errors sufficiently small proves the lemma.
Theorem 3.2. For properly infinite with separable predual, local AFD is equivalent to generation by an increasing sequence .
Proof. An increasing generating sequence gives local approximation by Kaplansky density. Conversely choose a faithful normal state and a sigma-strong* dense sequence 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 has already been chosen, with units . Matrix coordinates identify
The projection is properly infinite. A finite nonzero central cut of it would make the corresponding sum of its equivalent cuts finite, contrary to proper infiniteness of . A properly infinite projection absorbs finitely many equivalent copies of itself; consequently . Thus , so is properly infinite and locally AFD.
Write the next finitely many 's as , with . 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 therefore gives a dyadic and coefficients in whose reconstructed sums approximate the 's within in (1). The algebra is a larger dyadic factor containing exactly. This constructs increasing , with approximants to the first elements and errors tending to zero.
Let . Lemma 2.1 puts every in , without imposing bounds on the reconstructed sums. Density and closedness give . Between successive dyadic matrix sizes insert the missing tensor levels of their finite-dimensional relative commutants, and insert the initial levels inside . This gives all the sizes .
4. A finite CP reconstruction is one compression
Lemma 4.1. Let be a unital subfactor of . Every cp has
If is properly infinite, it also has for one . If is unital, is an isometry.
Proof. The Choi matrix is positive. Write its positive square root as , so . Put . Matrix-unit multiplication gives
Summing proves (9). In the properly infinite case, (8) makes properly infinite. Choose isometries there with orthogonal ranges, and set . Commutation with and give . At the unital case gives .
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 and cpc reconstruction maps , with sigma-strong* pointwise. Both maps can be made unital. Choose a state on and replace
This is ucp. Since and , the correction tends to zero in every strong* test. It preserves the approximation.
It suffices to approximate finitely many unitaries : every operator is a linear combination of four unitaries, by writing each self-adjoint contraction as the real part of . Fix a normal state and a small . 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 . Embed its matrix algebra unitally as , and use Lemma 4.1 to write , with . Set ; these are contractions.
With inner products linear in the second variable,
Indeed its difference from is bounded by . The same estimate holds for . Lemma 1.1 gives unitaries converging strongly to , on both and . Choose one such that both real parts remain greater than . Since the compared vectors have norms at most one,
Taking sufficiently small gives the desired approximation inside the finite-dimensional subfactor . No faithful state or separability was needed for this local conclusion. Apply Theorem 3.2 when the predual is separable.
5. Problems with complete solutions
Exercise 1. For the unilateral shift on , describe the unitaries (2) and verify (3) directly.
Solution. The defect is the first coordinate, and is the -th coordinate projection. The unitary cycles coordinates , sends the last back to the first, and fixes all later coordinates. It agrees with the shift on the first 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 -st basis vector, of norm one. Strong convergence of the adjoints fails. Alternatively a strong* limit would preserve the identity , while the shift has a one-dimensional range defect.
Exercise 3. Prove the two estimates in (4) involving and .
Solution. Both differences are supported on : the partial isometry and its adjoint have initial and final projections below . On that space each difference is the difference of two contractions, hence has norm at most two. Apply this to . 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 with the integration state take . Their operator norms are , while their -norms are ; 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 , if . The vectors are dense because is separating. If , approximating a vector by such a vector gives an error at most times the approximation error, uniformly in . First take the limit in , then make the density error tend to zero.
Exercise 6. Verify (7), including its adjoint version, without assuming a trace.
Solution. The homomorphism is contractive and supported on . Thus is positive, supported on , and has norm at most , giving the first inequality. Apply the same argument to . Consequently (1) is at most 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 lies in , so it commutes with . Matrix coordinates (8) identify their generated algebra with , a full matrix algebra with the shared identity. The inclusion of 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 . In the product , the nonzero term requires , and equals . The result is . Summing over gives , and summing over gives , 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 is cp at every matrix size. Their sum with is cp and has unit value one. The composite correction is a scalar of modulus at most times , 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 . The vectors have norm one and have norm at most one. Their squared difference is at most . The same bound holds with both operators adjointed. Conjugating by gives the two vector errors defining (1); their squared average is at most . 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.