Local approximation and the hyperfinite finite factor
Written by GPT-6.1 Sol (OpenAI), Ultra, September 2026. Self-checked by the writing AI. New original text: public domain (CC0).
A finite-dimensional algebra that approximates a few operators need not contain a previously chosen algebra. The main construction below repairs that defect. A small change of one projection aligns the first matrix corner, and matrix units then align the whole old algebra exactly. Repeating this construction identifies every separable AFD factor of type with the tracial infinite product of .
The complete finite-algebra and vacuum inputs HF0–5 supply the whole trace-preserving expectation onto any unital subalgebra, bounded trace topology, all normal-state cutoff bounds, arbitrary-center and properly infinite projection arguments, and the full vacuum/tracial direct sum. The complete PC0–7 and FCT0–7 supplies center-valued trace existence, normality, faithfulness, uniqueness and comparison with arbitrary center. The dyadic construction AF1–5 proves exact containment and the whole AFD trace-GNS identification. The normal representation and matrix-corner construction NA0–6 supplies arbitrary Hilbert multiplicity and the finite commutant application, using HF0's full tracial commutant. The whole tracial product SS2 supplies the concrete factor .
Unless stated otherwise, is a factor of type , with normalized faithful normal trace , and
The inequalities , , and follow from the trace and Cauchy–Schwarz. We write for the trace-preserving expectation onto a unital subalgebra .
Bounded trace topology (PB1–PB2). The normal functionals
are norm dense in . Indeed their span is a linear subspace of the concrete predual. If its norm closure were proper, Hahn–Banach would give a nonzero element of annihilating it, by CP6. Calling that element , we would have for every ; choosing and using faithfulness gives , a contradiction.
Let be a normal positive functional and . Choose with , by (PB1). Trace Cauchy–Schwarz, applied to through its square root, gives . Thus
This proves that, on every norm-bounded set, the -norm gives the intrinsic sigma-strong* topology. The converse uses the trace itself as one of the tests. There is no cardinality restriction on the convergent net.
If a normal positive functional has already been represented as , the same estimate can also be written using a bounded positive approximation to :
This density notation is optional for the topology proof: (PB1)–(PB2) prove the required estimates directly in the concrete predual.
Norm-bounded -norm Cauchy sequences have their limit in : an ultraweak cluster point of the bounded ball has the same pairings , , as the Hilbert-space limit, and those pairings determine that limit.
Replacing finite approximants by dyadic matrix factors
For any von Neumann algebra , AFD means that for every finite set and every sigma-strong* neighborhood of zero there is a finite-dimensional *-subalgebra with for every . This local definition does not require a sequence or separability. A possibly nonunital can be replaced by .
In a finite factor call this property locally AFD when expressed using finite-set -norm approximation. The two formulations agree: the intrinsic topology includes the trace seminorm, while applying to any -norm approximants supplies errors no larger and bounds the approximants by the original operator norms. Equation (PB2) then gives approximation for every specified sigma-strong* neighborhood.
Lemma 3.1. For every finite-dimensional unital subalgebra and , there is a unital matrix subfactor such that
The integer can be required to be arbitrarily large.
Proof. Write , with matrix units , and put . Choose large enough that every is positive. Cut down to a projection of trace , and split into projections of trace . Transport these pieces by . The remaining projection has trace
an integer multiple of , and can also be split into pieces of trace . All the resulting pieces are equivalent.
They form the diagonal of a full -matrix system, chosen to preserve the transported connections inside each -block. To see that compatible extension directly, choose one reference diagonal projection. Connect it to the first diagonal in each existing block by a partial isometry; connect it to that block's other diagonals by the prescribed block matrix units. If these connecting maps are , their initial projection is the reference and their orthogonal final projections sum to one. The operators are a full matrix system extending every prescribed block.
Its algebra contains
For , each coefficient has modulus at most . With , the corresponding sum of the 's differs from by at most . The expectation is the nearest point of , so taking large gives (10).
It follows that in a locally AFD factor every finite-dimensional linear subspace can be approximated uniformly on its operator-norm unit ball by a dyadic matrix subfactor. Choose a basis . The constant
is finite, by equivalence of norms on . First approximate its basis by a finite-dimensional algebra, using its expectation, then apply Lemma 3.1. The sum of the basis errors times controls the whole unit ball. This is the finite-dimensional uniformity needed in the next step.
Making the next matrix algebra contain the old one
Lemma 4.1. Suppose is locally AFD, is a unital copy of with , is finite dimensional, and . There is a unital dyadic matrix subfactor satisfying
Its matrix size can be made larger than .
Proof. Fix matrix units of , put , and let
Choose a unital , , with on , where will tend to zero. Put . Then and
For the second estimate expand . Formula (5) gives with . Since , enlarge or shrink inside to of trace exactly . This is possible because ; both traces are integral multiples of . The two projections are comparable, so
Lemma 1.1 gives a unitary carrying to , with .
Choose unital -matrix units in , with : split the matrix space into equal-dimensional blocks. The operator
is unitary. Multiplying its sums gives , , and . Thus contains exactly.
Only the first corner needs a small conjugation. For let . Bimodularity and give
Moreover , and , since . Therefore
For , its matrix entries lie in and have norms at most . Reconstruct , replacing every entry by its approximant in . The resulting element of has error at most
This tends to zero with ; choose it below . The nearest-point property of gives (13). The choice of can have .
There is no assertion that the whole aligning unitary is close to one. Its first-corner action is the controlled unitary ; reconstruction by the old matrix units supplies the required bound.
The projection repair used in exact containment
Lemma 1.1. If are equivalent projections in a finite von Neumann algebra, there is a unitary such that
In particular whenever a finite trace is specified.
Proof. Set and
Multiplication gives ,
The operator commutes with . Let . On , the polar part of is unitary, carries to , and has real part . Hence on that support
The last inequality is the scalar inequality , .
The exceptional projection splits as , where and . Indeed implies ; on its first term forces , and on its second term forces . Equivalence of gives equal center-valued traces. The equivalence already established on then gives equal center-valued traces for . FCT7, equation (FCT32), gives a partial isometry with from that equality of center-valued traces. The skewadjoint unitary on carries to , and . Thus is the required unitary; (4) and give (2).
There is also a useful spectral rounding estimate. If , is any normal state, and , then
The two reducing interval calculations in HF1 give the operator inequalities
The whole cutoff projection is constructed there from continuous positive parts and support limits, including the endpoint . Applying to the first inequality and positive-functional Cauchy–Schwarz to the second proves (5) for every normal state, including a nonfaithful one.
A higher cutoff is useful too: for , put and . The complete support/order argument of HF1 gives
The precise calculation below proves the sharper bounds (6a), which imply the following original bounds (6) since :
The same higher cutoff actually gives the sharper estimate
Indeed , so
Also . Adding these positive operator estimates gives . On , both and are at most . Split the two squared errors over and to obtain (6a). This is the higher-cutoff mechanism of Connes’s Lemma 1.1.5; the lower bound for supplies the spectral inequality needed in its proof. The preceding bounds (6) follow as well, since .
Only the simpler cutoff (5) will be needed below.
Trace cuts and first-corner coordinates
Halving means that every projection in a type II algebra is the sum of two equivalent orthogonal projections. In a factor this gives every scalar trace cut: for , expand in binary, repeatedly halve the current remainder of , and retain the half prescribed by each digit. The selected orthogonal pieces have traces . Their strong sum has trace , by normality. Equal-trace projections are equivalent by finite trace comparison.
If are unital matrix units in an arbitrary von Neumann algebra , then
The inverse is . The matrix-unit rules check the products, adjoints and inverses; finite sums and normal corners show normality. The relative commutant of the matrix algebra is the diagonal copy of the corner. Thus the matrix algebra and its relative commutant generate . Type II is preserved in this corner: an abelian projection there would be abelian in .
Identifying the dyadic limit and all finite corners
Let
The tracial product construction gives its faithful normal product trace and separable trace GNS space. The explicit finite-stage projections in the matrix-stage expectation theorem applied to its local matrix factors give scalar center: a central element has scalar projection at every stage and is their GNS limit. Their matrix sizes are unbounded, so is of type .
Theorem 5.1. For a factor with separable predual, the following are equivalent:
- .
- is generated by an increasing sequence of finite-dimensional *-subalgebras.
- is locally AFD.
- Every nonzero corner of every finite matrix amplification of is locally AFD.
Proof. The first implication gives the initial tensor factors. For the second, Kaplansky density in the increasing union supplies bounded strong* approximants, hence the third condition.
For , choose a -norm dense sequence in the unit ball. Such a sequence exists: the ball is compact metrizable in the weak* topology; a countable weak* dense subset is weakly dense in , and its rational convex combinations are norm dense by convex separation. Apply Lemma 4.1 successively to , keeping the previous dyadic matrix algebra exactly and making the error tend to zero. This gives increasing , with strictly increasing , whose union generates . Indeed in -norm with bounds one; the bounded-ball completeness and (PB2) put every , hence the entire ball, in the generated algebra.
A unital inclusion has and relative commutant : its action on is a sum of copies of the defining -dimensional module, or equivalently use (7). Between and insert the successive factors of this relative commutant. Insert the earlier tensor levels inside too. We obtain , , with the same generated algebra. Their relative commutants commute, and their finite products equal , by (7). The trace on each finite product is its unique normalized trace. The trace-preserving isomorphism of the algebraic unions therefore extends to a unitary of trace GNS spaces and, by intertwining left multiplication, to a normal isomorphism .
To prove , finite amplification can be handled directly on a finite set of matrix entries. Approximate all entries by one finite-dimensional ; then approximates the matrices, since the normalized squared -norm is times the sum of the entries' squared norms. This argument needs no generating sequence. It suffices next to handle a nonzero . Choose of dyadic trace , so close in -norm that . Extend its equal dyadic pieces to a full unital system as in Lemma 3.1. Lemma 4.1 gives a finite matrix containing that system and approximating , for a prescribed finite-dimensional . Then is finite dimensional, and for , ,
Both terms can be made arbitrarily small. The normalized corner trace divides the squared norm by , so its -norm is times the ambient norm. This fixed factor does not affect approximation. Adding the missing corner identity if desired preserves finite dimension. Condition 4 implies 3 by taking the identity corner.
Corollary 5.2. If one nonzero corner of is locally AFD, then is locally AFD. All separable AFD factors, and all their nonzero amplified finite corners, are isomorphic to .
Proof. First establish the local permanence statements without a separability assumption. For finite amplification of any locally AFD factor , approximate the finitely many entries of the desired matrices by one finite-dimensional . The identity
makes an arbitrarily good finite-dimensional approximant. Its trace expectation supplies contractions when the original matrices are contractions.
For a nonzero corner , cut with dyadic trace as close to as desired. Split into equal dyadic pieces and extend them to a unital dyadic matrix system in . Apply Lemma 4.1 to that system and the finite span of the 's. The resulting matrix algebra contains exactly. The algebra
is finite dimensional and has identity . Equation (18), with in place of , bounds the approximation error by plus the independently chosen matrix error. Divide by for the normalized corner norm. Both errors can be arbitrarily small. Thus every nonzero corner and every finite amplification of is locally AFD, using only finite-set approximation, trace cuts and Lemma 4.1.
Now write , , and . In , the projection has normalized trace , whereas has trace . Choose so that . Comparison gives a subprojection of equivalent to the latter projection. Its corner, inside , is isomorphic to . The local permanence just proved makes this corner locally AFD, proving the first assertion at its full stated generality. When the original factor has separable predual, so do its finite amplifications and corners. Theorem 5.1 then identifies each locally AFD corner with .
Finite commutants of normal representations. A faithful normal representation of , with the usual unital representation convention, has commutant isomorphic to whenever that commutant is finite. Here is the full construction. NA3–4 realizes every normal positive coefficient by a bounded dominated form and embeds every cyclic summand into an amplification of the trace GNS space. Taking the whole orthogonal family gives an isometry , with arbitrary , intertwining the representation and the left action. Its reducing range projection is nonzero. The full tracial conjugation and matrix-entry argument NA0, NA5 gives
Finiteness of this algebra means that is finite in the containing matrix algebra. The diagonal trace is faithful, normal and semifinite by the full NA1 proof. The countable-shift argument NA2 gives . If is infinite dimensional, choose an integer . Factor comparison puts a projection equivalent to under a rank- matrix projection. If is finite dimensional, the matrix corner is already finite. Thus is a nonzero corner of .
Compatible transposition on every local dyadic matrix level extends to a unitary of the full trace GNS space. Its conjugation carries the left algebra onto the right algebra, proving by NA6. Corollary 5.2 identifies the nonzero finite amplified corner with . That corollary's full AFD proof precedes this commutant application; the construction introduces no proof cycle.
If a representation is instead allowed a proper identity projection , apply this statement on . The full commutant on splits as , since commutation with kills the two off-diagonal blocks. Finiteness forces finite dimensional, and the active corner has commutant . A nonzero zero-action summand therefore gives , rather than . This states the identity convention and its exact degenerate variant explicitly.
Averaging over any subgroup
More generally, if is a subfactor and , multiplication identifies
For , bimodularity gives ; trace preservation makes it . Hence . On algebraic tensors, multiplication is therefore an isometry of the two trace Hilbert spaces, by expanding inner products. Its range is dense by the generation hypothesis and Kaplansky density. The resulting unitary intertwines left multiplication by each tensor leg with multiplication by its image. It implements the asserted normal spatial isomorphism.
Lemma 2.1. If is any subgroup of and , then is the unique element of in the ultraweakly closed convex hull of .
Proof. Work in the faithful normal trace GNS model from HF0, with . For , the rule extends to a unitary, and . We will construct bounded finite averages whose limits give the required expectation.
First fix a nonempty finite set ; it need not be a subgroup. Define bounded operators on by
The operator is selfadjoint of norm at most one, so . Moreover
Consequently its fixed space is
The powers of a positive contraction converge strongly to the orthogonal projection onto . Here is the elementary estimate needed for that assertion. The powers decrease in operator order; multiplying their commuting positive differences by gives
Thus , so the powers tend to zero on . Uniform boundedness extends this limit to its closure. Since is selfadjoint, that closure is the orthogonal complement of its kernel. On the kernel every power is the identity. This proves the strong convergence, without invoking a mean ergodic theorem. Apply it to , and denote the resulting projection by .
For the chosen , write . Each is a finite convex combination of , : expand the power of
All coefficients are nonnegative and sum to one. Hence , and their vectors converge to .
We use the bounded -norm completeness explicitly. If is -norm Cauchy and , then
The left multiplication operators are therefore strongly Cauchy on the dense set ; their common bound gives a bounded strong limit on all of . The trace model is strongly closed by HF0, so the limit is left multiplication by some , with . Its value at is the -norm limit. This works for nets as well as sequences. On such bounded families, the trace topology (PB1)–(PB2) also gives ultraweak convergence.
It follows that for an element , with . If denotes the ultraweakly closed convex hull in the statement, the finite averages and their bounded -norm limit show .
Now direct the nonempty finite subsets of by inclusion. The spaces decrease. For a fixed vector , set . If , orthogonality of the nested projections gives
Choose with . Comparing two supersets of with their union bounds their vector difference by . Thus is Cauchy. Its limit lies in every , while is orthogonal to their intersection. The limit is exactly the projection of onto
No enumeration of is used.
Apply this to . The uniformly bounded have a -norm limit , and ultraweak closedness gives . Its vector is fixed by every , so . Faithfulness of the trace implies . Every , , belongs to . The projection characterization therefore gives
HF0's full trace-preserving expectation has exactly these pairings, so . This proves membership in the hull.
Finally, for and , traciality gives . The same projection characterization makes constant on the orbit. Its normality makes it constant on its ultraweakly closed convex hull. If , then , proving uniqueness. The trivial subgroup is included: its averaging operators and fixed-space projection are the identity.
Applying the lemma to proves the quantitative commutant estimate
Every orbit point lies in the indicated -norm ball around . For , trace Cauchy–Schwarz and the test , when the denominator is nonzero, give
Each pairing on the right is ultraweakly continuous. Hence the ball is ultraweakly closed and convex, contains the entire orbit, and contains its ultraweakly closed convex hull. The lemma puts the expectation in that ball and proves (9). The zero denominator gives the same identity with value zero. None of these statements requires separability.
6. Subfactors and automorphisms
Lemma 6.1. A finite von Neumann algebra generated by an increasing directed family of unital subfactors is a factor.
Proof. Let be the normal faithful center-valued trace constructed in FCT0–7, with the full arbitrary-center proof. Every normal state of gives a normalized normal scalar trace . Such center states exist and separate the center: vector functionals of any faithful concrete representation give positive normal tests, and a nonzero one is normalized by its value at the identity. No faithful scalar state on all of is presumed.
Every normalized normal trace on restricts to the unique normalized normal trace on each generating subfactor, by FCT7 in that finite factor. Thus any two agree on the directed union. This union is a unital star algebra; bounded strong density from Kaplansky and the vector-series tail estimate make it ultraweakly dense. Normality therefore makes the two traces agree everywhere.
In particular all the 's agree. Restriction back to , where , makes all normal center states agree. A nonscalar center would have a nontrivial central projection ; vector states supported on and give two normal states taking respectively values one and zero on . This is a contradiction. Hence , as required.
Every type von Neumann algebra, including a nonfactor or a nonseparable one, contains a unital copy of . Halve its identity to embed . Formula (7) identifies the relative commutant with a type corner. Halve there and repeat, obtaining commuting 's. Their generated algebra is finite and is a factor by Lemma 6.1. It contains matrices of unbounded size, hence is type . Its normal trace restricts to the product trace on the finite tensor levels; the trace GNS identification makes this algebra .
If the ambient algebra has separable predual, every such copy lies in a maximal AFD subfactor. For a chain of AFD subfactors, its generated algebra is a finite factor by Lemma 6.1. It is locally AFD: approximate a finite set by bounded elements of the chain union, choose one chain member containing those finitely many approximants, and approximate them by a finite-dimensional algebra in that member. The two errors add. Separability of the ambient predual passes to the subalgebra, so Theorem 5.1 identifies this upper bound with . Zorn's lemma now supplies a maximal member. No maximality assertion here identifies the ambient algebra with that member.
Automorphisms on finite levels and a distant tensor leg
Lemma 6.2. If is a unital subfactor of any von Neumann algebra , then for every automorphism of there is a unitary satisfying .
Proof. Let be its matrix units. The projections are equivalent pieces of one, and so are . PC5 gives the unique finite/properly infinite central split. An automorphism preserves it, since it preserves projection equivalence, finiteness, centrality and their suprema.
On the finite central part, FCT7 gives the normal center-valued trace, its equivalence criterion. The equivalent diagonals sum to the central identity, so all their trace values are that identity divided by . The images have the same values. Thus there.
On the properly infinite central part, is properly infinite. Indeed its central support is the whole part, since its equivalent diagonals sum to that identity. By PC4, every central projection in its corner is the compression of an ambient central projection. A nonzero finite such cut would make the sum of its equivalent diagonal cuts finite by PC6, contrary to proper infiniteness of the central summand.
The full halving proof in PC5 permits finitely many orthogonal copies of inside : iterate to equivalent copies and retain . Match the old diagonals to those copies and add the implementations. This gives the central identity subequivalent to . The reverse subequivalence is inclusion, so PC3 gives on that part. Apply the same argument to . Adding the central implementations gives a partial isometry with , . Then
is unitary, and multiplication gives .
Theorem 6.3. Every automorphism of is a limit of inner automorphisms in the point-predual norm topology, and has outer automorphisms.
Proof. For , apply Lemma 6.2 on the initial dyadic algebra , obtaining . Uniqueness of the trace makes a -norm isometry. Thus
The expectations converge in because the finite tensor vectors are dense. The inverse automorphisms converge in -norm too: for ,
For , trace preservation gives . On the operator unit ball, Cauchy–Schwarz bounds its norm by , tending to zero. The norm density (PB1) and the automorphisms' uniform predual isometry bounds give convergence for every normal functional. This is the stated topology.
For an outer example, take and the product automorphism . It preserves the product trace. Here is a direct proof of outerness. Write , and let be this unitary in tensor leg . The product automorphism sends to , since . If it were , then and . On the other hand converges to in -norm, and for it commutes with . Therefore
a contradiction. The zero overlaps also agree with the preceding lesson's product criterion. The finite prefix implementations converge as in (20).
Problems with complete solutions
Exercise 1. For two rank-one projections in whose ranges make angle , compare the -norms of their difference and of the planar rotation minus one, using normalized trace.
Solution. In an orthonormal planar basis take , onto , and . Then and . Thus , , and (2) follows from . At its constant is attained.
Exercise 2. Let in . Calculate the nearest spectral projection and verify (5)'s first inequality.
Solution. The projection is . One has , whereas . Hence , as required. The cutoff is applied to the spectrum of , not to its matrix entries in an arbitrary basis.
Exercise 3. A unital has minimal projection trace . Explain why it cannot be contained exactly in a unital dyadic matrix subfactor, and why Lemma 3.1 still approximates it.
Solution. A unital embedding would require , by (7), which is impossible. For approximation choose , truncate each diagonal to trace , and retain the connected dyadic pieces. Each matrix-unit error has squared -norm below , and the unused dyadic pieces complete the full matrix algebra. Exact containment and arbitrarily good approximation have different divisibility requirements.
Exercise 4. Why does the proof of Lemma 4.1 approximate all the corner entries , rather than only ?
Solution. The aligning unitary need not be close to one on the whole algebra. Its restriction to the first corner agrees with the controlled . The corner entries have that common control, and multiplication by the old , which lie exactly in the new algebra, reconstructs the approximation to . Approximating only would supply no estimate for its conjugate by the uncontrolled .
Exercise 5. In a corner of trace , convert an ambient -norm error to the normalized corner -norm.
Solution. Divide the squared norm by , so multiply the norm by . The answer is . This normalization is a square-root factor, as in (18).
Exercise 6. Prove that , although divides no .
Solution. The increasing algebras generate a separable finite factor and make it locally AFD. It is infinite dimensional, hence type . Theorem 5.1 identifies it with . The proof permits approximating those -dimensional matrix factors by different dyadic factors; it does not put them exactly into a fixed dyadic tensor level.
Exercise 7. Show that the finiteness hypothesis in Lemma 6.1 is necessary, using the direct sum of the CAR vacuum and tracial representations.
Solution. In the vacuum representation, the average converges strongly to zero on finite occupation vectors, hence everywhere by boundedness. In the tracial representation, independence gives . For a fixed local polynomial , all but finitely many occupation projections commute with , so . Thus ; boundedness and local cyclic density give the strong limit .
On the direct sum the strong limit is , giving a nontrivial central projection. The local CAR algebras are still increasing full matrix subfactors. Their closure is : the central projection separates the summands and each component has that closure. It is not finite because the infinite-dimensional summand is properly infinite. This exhibits the source's finite-versus-infinite distinction directly.
Exercise 8. For , prove the isomorphism with without an injectivity-to-AFD theorem.
Solution. Its initial tensor levels are ; they form an increasing sequence whose union generates the spatial tensor product. Its product trace is faithful and normal, and it is a factor by the tensor commutation theorem. It is infinite dimensional and has separable predual. Theorem 5.1 therefore gives . Interleaving the two sequences of factors gives the same trace GNS isomorphism directly.
Exercise 9. For the outer automorphism in Theorem 6.3, write explicit inner approximants and estimate their error on an arbitrary .
Solution. Put . Its adjoint action agrees with the product automorphism on . Both maps preserve the trace, so their difference on is at most , tending to zero. The product innerness criterion excludes a global inner implementation, since its overlap-defect sum is .
Exercise 10. Prove that every factor of type contains a unital , and explain why it also contains a unital .
Solution. Cut its identity into seven projections of trace . They are equivalent, so connecting them to a common reference constructs full unital -matrix units. For , use successive halvings in the relative commutants of the already chosen dyadic matrix factors, as in Section 6. The increasing union has factorial finite closure by Lemma 6.1, unbounded matrix sizes, and the product trace. It is the tracial GNS model of , regardless of the ambient factor's own separability or AFD status.
References and continuation
Claire Anantharaman and Sorin Popa, An introduction to II₁ factors, author draft. Lemma 11.2.1 and Theorem 11.2.2, printed pp.185–188, develop dyadic matrix approximation and trace-GNS identification with . Their containment induction uses amenability to obtain AFD corners. Sections 3–5 above instead give exact containment and local corner permanence directly from finite-set approximation, with no injectivity assumption and no separability needed for the local permanence argument. Separability is used only for the generating sequence and identification with .
Alain Connes, Outer conjugacy classes of automorphisms of factors, Annales scientifiques de l’École Normale Supérieure, series 4, 8 (1975), 383–419, DOI 10.24033/asens.1295. Lemmas 1.1.4–1.1.5, printed pp.388–389, develop projection repair and spectral rounding. The finite direct rotation above supplies a unitary and the stronger operator bound (2), including its exceptional orthogonal supports, for an arbitrary finite algebra. Equations (5), (6) and (6a) give the complete state spectral estimates.
The exact foundational inputs remain center-valued trace comparison, type II halving, projection support, normal representation amplification and trace densities. The finite trace expectations onto all unital subalgebras are constructed directly in HF0, and (PB1)–(PB2) prove the bounded trace topology and predual density used here. The general center-trace and arbitrary properly infinite projection arguments use the full local FCT0–7 and PC0–7 proofs linked above, including their exact scalar/spectral/predual inputs. The whole normal representation amplification and canonical semifinite finite-projection criterion are proved in NA0–6, including arbitrary multiplicity, all-net trace normality and the full finite matrix-corner reduction. The later finite outer-action and central-sequence arguments have their own prerequisites.
Jesse Peterson, Notes on operator algebras, April 27, 2020, printed/PDF pp.83–90 and102–107. The general projection and approximate-center-trace methods are written there. PC1–7 and FCT0–7 supply full arbitrary sums, central supports, finite cancellation, central tilings and normal assemblies. FCT0 also corrects the complex norm estimate in the source’s Lemma6.4.5; FCT5 retains both factors of its distortion parameter, and FCT6 uses the intended inequality throughout. These are full general finite proofs, beyond the tracial comparison in the Anantharaman–Popa draft.