Injective algebras and separable tracial envelopes
Written by GPT-6.1 Sol (OpenAI), Ultra, October 2026. New original text: public domain (CC0).
Every injective von Neumann algebra is locally approximately finite dimensional. Countability is needed for the familiar increasing sequence and the center-times- structure, but the local approximation theorem itself has no factor or separability assumption. The bridge is a separable injective algebra containing any prescribed countable set in a faithfully tracial algebra.
We use exact trace-preserving finite models, the separable finite theorem, injectivity and semidiscreteness, the properly infinite local theorem, and the finite AFD structure. The trace inputs include the faithful normal center-valued trace on every finite algebra and the positive densities of normal functionals relative to a faithful finite trace. Standard form, trace-preserving expectations, projection comparison and the finite/type II/properly infinite central decomposition retain their declared foundation and OA-MOD interfaces.
The selected foundation results on projections and types — Lemma 7.4, Proposition 8.4, Lemmas 9.3 and 9.5, Lemma 10.2, Theorem 10.3 and Proposition 15.2 — supply the finite type I structure and countable projection absorption used below. The central decomposition into finite type I, finite type II and properly infinite summands is the one needed for the local approximation theorem.
1. A countable set has a separable injective envelope
Theorem 1.1. Let be injective with faithful normal tracial state . Every countable subset of is contained in a von Neumann subalgebra with separable predual that is injective. The restricted trace on is faithful and normal.
Proof. Start with a norm separable unital C* algebra containing the specified set. Suppose have been constructed, with countable norm dense sets of contractions in . At stage , apply the trace-preserving finite-model theorem to the finite list
It gives normal ucp and ucp , satisfying
Adjoin all the finitely many entries to to form , and choose its dense set. This inductive order uses only already chosen tests.
Put , inside . Each takes values in . Schwarz and the two exact trace identities give
The diagonal choice of tests, norm contractivity and norm density imply in -norm for every . If , Kaplansky density supplies with arbitrarily small. Thus
The maps are normal: is normal by (1), and a positive map from a finite-dimensional algebra is normal. Their compositions converge pointwise -norm, hence pointwise ultraweakly on the bounded image of each fixed . These are finite matrix models for , making it semidiscrete and therefore injective.
Finally is norm separable. In the faithful normal trace GNS representation of , is dense by Kaplansky density. Hence is separable. The predual of a von Neumann algebra represented faithfully and normally on a separable Hilbert space is a quotient of its separable trace-class space, so is separable.
Corollary 1.2. Every injective algebra with faithful normal tracial state is locally AFD, with no separability assumption.
Proof. Place a given finite family in the algebra of Theorem 1.1. The preceding lesson's separable finite theorem supplies a unital finite algebra and contractive tracial approximants to that family. On bounded sets trace -norm convergence is sigma-strong* convergence. To see its intrinsic scope explicitly, if , , and , then
Choose to control the integrable tail and then the -norm error. This handles any finite collection of normal seminorms.
Exact trace preservation in (1) matters. Normal finite-rank maps approximating only a strongly dense C* algebra need not approximate its von Neumann closure; Exercise 7 gives a concrete counterexample.
2. Finite algebras need not carry a faithful normal state
Theorem 2.1. Every finite injective von Neumann algebra is locally AFD.
Proof. Fix a finite family of contraction tests , positive normal functionals , and a required sigma-strong* error. We may suppose at least one functional is nonzero. Let be the faithful normal center-valued trace, put
The restriction of to is faithful. The finite central algebra has the faithful normal tracial state
Injectivity passes to this central corner, so Corollary 1.2 approximates all by contractions in a unital finite algebra .
Each , and Cauchy–Schwarz shows it ignores every operator supported on . Its restriction to has an density. Formula (4), with for the difference of two contractions, makes sufficiently small -norm errors small for both and . For example choose each tail contribution below half the squared desired error and then choose below its other half. Adjoin to , and choose zero approximants there. This is a finite-dimensional unital algebra meeting all original seminorm tests. If all , any scalar algebra works.
The central support cut in (5) depends on the finite neighborhood being tested. The argument neither asserts nor requires a global faithful normal state.
3. The full local equivalence
Theorem 3.1. For every von Neumann algebra , the following are equivalent:
- is injective.
- is locally AFD: every finite subset has approximants in a unital finite-dimensional subalgebra in every sigma-strong* neighborhood.
If is separable, these are also equivalent to generation by an increasing sequence of finite-dimensional unital subalgebras.
Proof. Split into its finite and properly infinite central parts. An injective has injective summands. Theorem 2.1 handles , and the previously proved properly infinite local theorem handles . Approximate the two central restrictions of any finite family and add their finite algebras. Central orthogonality makes the squared normal seminorms add, so halving their squared error budgets gives local AFD in .
Conversely represent a locally AFD in standard form on . Direct the finite tests and sigma-strong* neighborhoods by refinement, and choose a finite-dimensional unital meeting each test. The compact unitary group of gives a ucp map
Each fixes , and . Product ultraweak compactness gives a pointwise convergent subnet with ucp limit . For fixed , vectors , and approximants to , its commutation with gives
The directed tests include these two seminorms; one can choose the for this fixed finite requirement on each tail. Passing to the limit gives . Thus is a ucp retraction onto . If is the standard conjugation, is a linear ucp retraction onto . Complete positivity follows at each matrix size by conjugating on the conjugate Hilbert space twice. The norm-one projection criterion proves injectivity.
For separable predual, the existing local-to-sequential construction treats properly infinite summands by dyadic factors, finite type II summands by finite matrix/central partitions, and finite type I summands by finite central partitions and matrix blocks. It therefore produces the claimed increasing generating sequence. Such a sequence gives local AFD by bounded strong* density of its union, and the directed averaging proof also gives injectivity.
The implication from local AFD in (8) does not assume that the chosen 's are nested. Both error terms act on fixed vectors, which is essential when the averaged operators vary with .
4. The central structure and subalgebras of
Corollary 4.1. If is injective of type or with separable predual, then respectively
Proof. The finite case combines Theorem 3.1 with the already proved central finite AFD structure theorem. For the infinite case choose a finite projection with central support one. Such a projection exists by the semifinite projection lemma. The properly infinite identity splits into countably many equivalent copies of itself; transport into each copy to obtain orthogonal equivalent projections , and put . Their even and odd sums show is properly infinite, and . Since is separable, is sigma-finite. The countable absorption theorem, Proposition 15.2(2), gives ; as , projection Schroeder–Bernstein gives .
Transporting the 's by this equivalence yields a partition of into countably many equivalent finite projections. Its matrix units give , with . The corner is injective, has separable predual, and is type . Its center identifies with by full central support and matrix splitting. Apply the finite case. This proof is valid for nonfactors: every projection equivalence used has full central support, and sigma-finiteness is stated exactly where absorption needs it.
Corollary 4.2. Every von Neumann subalgebra of is injective and AFD. It has the finite central decomposition
where the are commutative von Neumann algebras, any of which may be zero. The countable sum is the von Neumann direct sum.
Proof. First suppose has unit . The normal trace-preserving expectation exists in a finite traced algebra. Composing it with a ucp retraction onto the injective gives a ucp retraction onto , so is injective. It is finite and has separable predual: it acts faithfully and normally on the separable trace Hilbert space of . Theorem 3.1 gives an increasing finite-dimensional generating sequence.
Split into its finite type I and type central parts. The finite type I structure theorem decomposes the first into , ; infinite homogeneous sizes are excluded by finiteness. Corollary 4.1 identifies the second with its center tensored with . This gives (10). If 's unit is a projection , apply the same argument in the injective finite corner , with normalized trace.
5. Exercises with complete solutions
Exercise 1. Why must the entries of , rather than the entries of , be adjoined?
Solution. already maps the prospective algebra into a fixed finite matrix algebra. The range condition needed for a model on is . Its entries span that range linearly, so adjoining all enforces precisely this condition.
Exercise 2. Prove (2).
Solution. Schwarz gives . Taking gives . Apply the same argument to and use . The two contractions compose.
Exercise 3. Show that the diagonal tests imply convergence on .
Solution. Every fixed is tested at every , so its error tends to zero. Approximate a contraction of in norm by one such element. Norm contractivity bounds its two replacement errors by that norm distance. Then approximate an element of by an element of some and repeat. Scaling handles arbitrary norms.
Exercise 4. Derive (4), including its adjoint version.
Solution. Split . The bounded part contributes at most , while the positive tail contributes at most . Apply the same bound to , using . No commutation of and is required.
Exercise 5. Why is (6) faithful?
Solution. If in has , faithfulness of on gives . Faithfulness of the center-valued trace then gives . Its central bimodularity and trace identity make the composition a trace; normality of both maps gives normality.
Exercise 6. Prove that ignores the complementary central summand.
Solution. Since and each term is nonnegative, every term vanishes. Cauchy–Schwarz yields . Centrality removes the other orientation as well.
Exercise 7. Give normal finite matrix models converging on a strongly dense C* algebra but failing on its von Neumann closure.
Solution. In , choose a positive-measure closed nowhere dense set . For every dyadic cell , its complement has positive measure. Let be the diagonal matrix of the averages of on these , and let send a matrix to the step function whose cell values are its diagonal entries. Both maps are normal ucp. Their composition approximates each continuous function uniformly, since the error is at most its oscillation on a dyadic cell. Continuous functions are strongly dense in . Yet for every , so convergence fails in trace norm and ultraweakly on . The models do not preserve Lebesgue trace.
Exercise 8. Why does (8) need sigma-strong* approximation?
Solution. Its first term involves and its second involves . Sigma-strong* neighborhoods control both. Mere strong convergence would not supply the second vector estimate for general .
Exercise 9. Does (8) require uniform strong convergence on all vectors ?
Solution. No. Move the second error to the adjoint acting on the fixed vector , and bound by . The two errors therefore act only on the fixed vectors , exactly as displayed.
Exercise 10. Explain why in Corollary 4.1 is properly infinite.
Solution. A bijection from to its even indices transports the mutually equivalent diagonals to show ; the odd indices give a second orthogonal copy. Central cuts preserve these equivalences and have nonzero diagonal whenever the cut is nonzero, since . Thus every nonzero central cut is infinite.
Exercise 11. Why does finiteness rule out an infinite matrix size in (10)?
Solution. In for infinite , a bijection gives a proper isometry. Its initial projection is the identity and its final projection omits . Thus the identity is infinite. A central summand of finite cannot have this form.
Exercise 12. Why is Corollary 4.2 consistent with having a diffuse center?
Solution. The expectation onto and injectivity do not force to be a factor. Its finite type II central summand has the full center , and every homogeneous finite type I summand has its own center . For example an abelian diffuse subalgebra lies entirely in the summand; no summand is required.
References and proof scope
George A. Elliott, On approximately finite-dimensional von Neuman algebras, II, Canadian Mathematical Bulletin 21 (1978), 415–418: Theorem 2, pp.415–416, proves the local AFD converse by averaging and an ultraweak limit; Theorem 4 and Corollary 5, pp.416–417, give the general injective-to-local-AFD reduction. The finite branch of Theorem 4 also uses injectivity of every von Neumann subalgebra of a finite injective algebra. Combined with the tracial separability argument, it supports the existence asserted in Theorem 1.1. The explicit trace-preserving model construction above is retained in full.
Sorin Popa, A short proof of “injectivity implies hyperfiniteness” for finite von Neumann algebras, Journal of Operator Theory 16 (1986), 261–272: the theorem and full proof in §3, pp.271–272, treat finite algebras without separable predual, using the local matrix-corner approximation proved in Proposition 2.2, p.270. Sections 1–2 use additional primary inputs; their citation does not certify the complete reference chain.
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: §6.3, pp.199–200, discusses the nonfactor extension, and §6.4, p.200, records Elliott’s arbitrary-algebra equivalence. Those final sections are discussion and attribution, not complete proofs of the general central structure and equivalence.
Claire Anantharaman and Sorin Popa, An introduction to II₁ factors, author draft: Proposition 2.6.7, p.48, proves the tracial Hilbert-space separability criterion; Theorems 7.3.8 and 7.4.5, pp.110–111 and 114–115, prove the normal-functional and positive integrable-density inputs; Theorem 9.1.2, p.140, proves existence of the normal trace-preserving expectation. Proposition 10.2.2, p.161, explains the ucp extension and retraction criteria, and Theorem 10.2.4, p.162, proves injectivity of .
The center-times- conclusions retain separable predual. The separable-envelope and finite normal-test arguments above prove the local theorem for arbitrary injective algebras. The local converse is also proved without countability. All twelve exercises have full solutions.