Injective algebras and separable tracial envelopes
AI-generated exposition by OpenAI GPT models. CC0-1.0 to the extent of rights held.
The local approximation theorem is governed by finite tests of normal functionals. We first prove the full injectivity/local-AFD equivalence, then localize a finite collection of normal tests to a faithfully tracial central piece. A countable trace-preserving matrix construction supplies the separable injective envelope used on that piece. Expected subalgebras of and the central type II structure are applications; their increasing sequences and tensor-product conclusions retain separable predual.
The complete trace-preserving matrix models, separable finite theorem, properly infinite theorem and dyadic construction, and central finite AFD structure supply the approximation arguments. The semidiscrete retraction proof is used at its full normal finite-matrix scope.
The remaining foundations are the complete central trace, comparison, corner-center and countable absorption proofs, faithful normal-state topology, trace Hilbert space and trace-preserving expectations, and actual measurable operators and positive integrable densities. In particular TI.19–20 proves the onto positive isometry for every faithful normal semifinite trace, including nonseparable finite algebras. Its measure-completion, closed-domain, spectral-tail, normality and predual prerequisites are included in that proof route. Formula (4) uses that actual density theorem.
The projection proofs PC1–7 include arbitrary orthogonal sums, central comparison, mutual subequivalence, the normal corner-center isomorphism, the finite central-part criterion and PC8 countable absorption. Here type II means that there is no nonzero abelian projection and that the central supports of finite projections fill the identity. The full-support finite corner and its countable matrix decomposition will be constructed below. The zero algebra has the zero finite-dimensional algebra as its unital approximant; the faithful-state arguments concern nonzero algebras.
Theorem 3.1 uses the finite normal-test argument of Theorem 2.1 below and the previously proved properly infinite theorem. Theorem 2.1 in turn uses Corollary 1.2 and the complete diagonal envelope construction of Theorem 1.1. The finite normal-test proof is therefore followed by its tracial envelope input.
The general 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. For the finite implication use Theorem 2.1 below, whose complete proof follows this theorem. 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
The average in (7) has an explicit finite formula. If has matrix units with their block identities summing to one, put
Each summand is a completely positive Kraus term. Summing its value at one gives one. Matrix-unit multiplication shows that the output commutes with every block and every matrix unit, hence belongs to . If , moving past the units shows that this sum is . Conjugating the input by any block unitary and summing its scalar matrix entries uses , proving invariance. Thus this finite formula is the normalized invariant unitary average denoted by the integral in (7); no general existence theorem for Haar measure is a prerequisite here. It is normal and ucp. 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 .
Localizing finite normal tests
Theorem 2.1. Every finite injective von Neumann algebra is locally AFD.
Proof. Use the faithfully tracial conclusion of Corollary 1.2, proved from the full diagonal envelope construction below. 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 support in (5) can be constructed without a global faithful state. In the commutative algebra , finite joins of projections of zero -value again have zero value. Normality makes their full supremum have zero value. Put . If a positive central element on had zero value, each of its positive spectral cuts would be a zero-value projection dominated by both and , hence zero. This proves faithfulness on , and also . 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.
Constructing the tracial 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. For a separable Hilbert space , its completed Hilbert projective tensor is separable: finite rational combinations of tensor pairs from countable dense sets are dense. The complete predual coefficient theorem identifies as the quotient of this space by the kernel of its normal coefficient map. Indeed finite sums give vector coefficients and the completed projective tensors give their absolutely summable series; every normal functional has such a series. Thus is separable. The restricted trace is faithful, and normality follows by the normal inclusion .
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.
The scalar construction for the normal-model counterexample
Here are all the measure and positivity inputs for Exercise 7. Enumerate the rationals in as , and choose an open interval about of length at most . Their union is dense and has Lebesgue measure at most . Hence is closed, nowhere dense, and has measure at least . Every dyadic cell has nonempty interior meeting the open set , so its intersection with has positive measure. Endpoints can be assigned to one of their adjacent cells without changing any integral.
The averages on these intersections are positive normal unital scalar functionals. Positivity makes a scalar functional completely positive: for a positive operator matrix and a scalar vector, its scalar quadratic form is the functional applied to a positive element. Taking their diagonal direct sum therefore gives normal ucp . At each point of a dyadic cell, is one diagonal matrix coefficient, a ucp scalar functional; positivity at every matrix size proves that is ucp. Its finite-dimensional domain makes it normal. Oscillation of a continuous function on intervals of length tends uniformly to zero, so these maps approximate every continuous function uniformly.
For completeness continuous functions are strongly dense in the represented . Finite regularity and compact cutoffs give, for every measurable set modulo a null set, continuous functions between zero and one converging to its indicator in . Approximate bounded functions first by simple functions, then their indicators this way. Apply the continuous radial retraction to the original bound disk; its error from a point in that disk is at most twice the original error. Thus the continuous approximants have a common norm bound and converge in , as do their conjugates. If , truncate to a bounded function; the bounded part of tests the error, and the remaining tail is controlled by the common sup norm bound. This proves strong convergence of the multiplication operators and their adjoints. Conversely every multiplication operator in this von Neumann algebra is bounded and measurable, so the closure is precisely .
Finally the averages of on every chosen intersection are zero, while its Lebesgue integral is positive. This supplies the failure on the closure and the failure of trace preservation, without changing the full example of Exercise 7.
Expected subalgebras and central structure
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. The type II central identification uses Corollary 4.1 below and its full nonfactor matrix reduction. If , all the summands in (10) are zero. Otherwise 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.
Corollary 4.1. If is injective of type or with separable predual, then respectively
Here is the full projection construction needed for the infinite case. A separable predual gives a faithful normal state by NT2, so every orthogonal family of nonzero projections is countable. Every nonzero projection contains a nonzero finite subprojection: its central support meets that of some finite projection ; PC2 supplies a nonzero polar bridge between subprojections of and , and finiteness passes to equivalent subprojections. Choose a maximal orthogonal family of finite nonzero projections ; the preceding argument forces their sum to be one. Their central supports therefore have supremum one. Define disjoint central projections
They fill the center, and . The projection is finite: an isometry in compresses on each to an isometry in the finite corner of , so each compressed defect is zero; their strong sum is the entire defect. The corner has no abelian nonzero projection, hence is of type .
A properly infinite identity has an orthogonal countable partition , with any residual absorbed into the first member by PC3 and PC5. Transport into these corners to obtain , as in the proof below. If , , the strong sums of and implement equivalences of with its even and odd sums. PC1 justifies the sums and all initial and final projections. The same holds on every nonzero central cut; full central support of ensures those cuts are nonzero. Thus is properly infinite and . The countable absorption proof PC8 applies to the source projection , giving ; PC3 then gives . This is the countable absorption theorem in exactly the nonfactor scope used here.
Choose , and put . These are equivalent finite projections with sum one. Set , and choose , , with . The map
is unitary: orthogonality gives equality of squared norms, and the inverse on finitely supported vectors is . Completeness extends that inverse to all vectors. For , all its matrix entries belong to . Its finite block compressions lie in , are uniformly bounded and converge strongly to . Conversely the elementary matrices correspond to , so taking the von Neumann closure gives both inclusions and
Commuting with every scalar matrix unit forces a central element to be a constant diagonal; commuting with makes its entry central. Equivalently PC4 identifies , normally and onto, since . Compression extends every normal corner functional normally to , so the corner has separable predual. A ucp retraction onto , compressed by after extending an operator on by zero, is a ucp retraction onto , with unit . Thus injectivity also passes to this corner.
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 PC8, proved above at its exact source-countability scope, 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.
5. Exercises with complete solutions
Normal tests and the commutant limit.
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 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.
Trace-preserving envelopes and the counterexample.
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 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.
Central matrix structure and expected subalgebras.
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
The local equivalence uses a finite/properly-infinite split. The finite branch localizes the prescribed normal seminorms to one central summand with a faithful trace, then builds a separable injective envelope by exact trace-preserving matrix models. Its bounded trace estimates use the full positive integrable-density theorem. The converse has an explicit finite Kraus formula for averaging onto a matrix-algebra commutant and a pointwise ultraweak limit; the two commutator errors act on fixed vectors.
George A. Elliott, On approximately finite-dimensional von Neuman algebras, II, Canadian Mathematical Bulletin 21 (1978), 415–418, Theorem 2, pp.415–416, gives the classical averaging/ultraweak-limit converse. Theorem 4 and Corollary 5, pp.416–417, give the general injective-to-local-AFD reduction through countably generated algebras, crossed products and separable classification. The particular central normal-test localization, exact trace-preserving diagonal model construction, finite averaging formula and conjugation back to the algebra are proved above. The broader crossed-product and type III decompositions in Elliott's reduction are not premises of that local route.
Sorin Popa, A short proof of “injectivity implies hyperfiniteness” for finite von Neumann algebras, Journal of Operator Theory 16 (1986), 261–272, Section 3, pp.271–272, proves finite local approximation using maximal orthogonal matrix corners and the local corner input of Proposition 2.2, p.270. The present finite argument uses the complete separable finite theorem and its trace-preserving envelope instead. The full arbitrary finite countable and maximality corner proofs are given in Small corners and the second injective proof.
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, Sections 6.3–6.4, pp.199–200, gives nonfactor discussion and attribution of Elliott's arbitrary-algebra equivalence. These sections are contextual; the full equivalence, central normal-test reduction and nonfactor projection construction used here are supplied by the local proofs.
Claire Anantharaman and Sorin Popa, An introduction to II₁ factors, author draft, provides the trace Hilbert-space, normal-functional, integrable-density, expectation and injectivity context, including injectivity of . The complete linked trace-density, coefficient, expectation and retraction arguments are the particular proof inputs here. The center-times- conclusions and increasing generating sequences retain separable predual; the local equivalence and finite normal-test argument have arbitrary-algebra scope. All twelve exercises have full solutions, including the failure of non-trace-preserving models on a strongly dense algebra's closure and the finite central decomposition of expected subalgebras of .