Finite traces with arbitrary centers
Retained complete programme arguments PC0–7 and FCT0–7. Original programme exposition: CC0-1.0 to the extent of rights held; the same terms remain in force.
The projection comparison proof supplies the cancellation, central corners and arbitrary sums used to construct the trace. The construction proves existence, faithfulness and normal uniqueness for every finite von Neumann algebra, including nonseparable algebras and non-countably-decomposable centers. No scalar faithful trace or direct-integral decomposition is a starting assumption.
These complete proof sections come from the programme's projection comparison and center-valued trace lessons. The links to their earlier proofs below use the retained CF/SF/CP/ST foundations. The remaining sections of those larger lessons are outside this selected prerequisite route.
Projection comparison and the countably decomposable type III case
Independent exposition and original figure/source: CC0-1.0 to the extent of rights held.
Let , where is any complex Hilbert space and the identity is . Zero spaces are permitted. A projection is an element . Write if some has , and if the final projection may instead be any subprojection of . A projection is finite if forces . Proper infiniteness means that and every nonzero central compression of the unit of is infinite. Type III means absence of nonzero finite projections. A projection is countably decomposable if every orthogonal family of its nonzero subprojections is countable.
The actual earlier mathematical inputs are CF Sections 1, 6–8 and 10, with Sections 2–5 as the continuous-calculus predecessors (choice/maximality, norm series, bounded C* calculus, Hilbert projection/adjoints/completion), SF-0 and SB-0 (the commutant-unitary test and elementary Hilbert facts), and CP-01–06 (concrete predual and vector-series topology). The polar construction below is the bounded specialization of the reviewed HA-R4 range-isometry argument, written completely here; its unbounded form theorem is not an additional input. No bounded or unbounded spectral representation theorem, weight theorem, trace existence, spectral classification or cardinal-dimension theorem is an input.
Free source comparison: Jesse Peterson's author notes, 2020, Sections 5.1–5.2, printed 83–90, and Brent Nelson's author notes, Lemma 5.2.9 and Proposition 5.2.13, printed 49–51. Every statement used in this proof is proved below or bound to the specified earlier programme proof. In particular the countability condition will concern only the projection to be embedded.
Actual earlier proof ranges: OA-FLOW.CF.1, OA-FLOW.CF.2, OA-FLOW.CF.3, OA-FLOW.CF.4, OA-FLOW.CF.5, OA-FLOW.CF.6, OA-FLOW.CF.7, OA-FLOW.CF.8, OA-FLOW.CF.10, OA-FLOW.SF.SF0, OA-FLOW.SF.SB0, OA-FLOW.CP.1, OA-FLOW.CP.2, OA-FLOW.CP.3, OA-FLOW.CP.4, OA-FLOW.CP.5, OA-FLOW.CP.6. The bounded polar construction in PC1 is proved locally. Its comparison with the later HA-R range-isometry proof is historical development context and adds no unbounded-form premise.
PC-0. The two set-theoretic operations
We need no unproved infinite-cardinal arithmetic. If and are injections, set and . The map equal to on and to on is a bijection . The second inverse is defined since . Their images are disjoint because . For surjectivity, if , then , so and injectivity gives ; otherwise the inverse branch maps to .
An infinite set is in bijection with for any : choose distinct , shift , and fix all other points.
Every infinite set has a partition with both pieces in bijection with . Here are details at the choice convention of CF-1. Well-order , and identify its cardinal with an infinite initial ordinal . If any infinite cardinal up to failed to have , take the least failing one . Order its pairs first by their ordinal coordinate, then by the second coordinate. The predecessors of any pair have cardinal at most , by minimality when is infinite and by finiteness otherwise; adjoining one point does not change an infinite cardinal by the preceding shift argument. The order type cannot exceed : a point at position would have predecessors. Thus there is an injection of the pairs into ; the converse injection is immediate, and the bijection just proved gives a contradiction. Transport the two images to .
PC-1. Corners, supports and arbitrary orthogonal sums
The orthogonal projection onto an intersection of projection ranges commutes with every unitary of , since that intersection reduces those unitaries. SF-0 puts the projection in . This supplies all meets. Complements give joins; equivalently a join projects onto the closed span of the ranges. Orthogonal joins are their strong sums.
For a projection, acting on is a concrete von Neumann algebra. Indeed extend a weak operator limit on by zero on ; it is a weak operator limit of elements of , hence lies in and is compressed by . The following finite-vector argument gives its bicommutant characterization locally.
For completeness the latter argument uses only Hilbert projection. For a unital *-algebra and a tuple , project onto the closed orbit . Its matrix entries commute with . Every diagonal therefore preserves this space, which contains the original tuple. Thus is a strong limit of elements of , on arbitrary finite tuples. If is weak operator closed the limit belongs to , proving .
Given , put . The rule is a well-defined isometry, because . Extend it to , and set it to zero on . This gives a partial isometry , with
The brackets mean projection onto the closed indicated range. The initial range equality follows from . Every unitary of commutes with , preserves their kernels and ranges, and therefore commutes with this isometry and its zero summand. SF-0 gives ; consequently both support projections lie in . This proves the entire bounded polar input, including zero and noninjective operators.
Suppose are partial isometries with initial projections and final projections , each family separately orthogonal. For every finite ,
The scalar sum is the supremum of its finite subsums. For any a finite subsum is within of that supremum, so every complementary finite vector sum has norm at most . Completeness gives a strong limit ; applying the same argument to the adjoints gives their strong limit . The limits commute with , hence belong to . Uniformly bounded strong products converge strongly by expanding their differences, so
Thus equivalences or subequivalences can be added over arbitrary orthogonal index sets. More generally uniformly bounded operators supported on separate orthogonal corners have a strong-star diagonal sum, by the same squared-norm tail estimate.
Composition of implementing partial isometries proves transitivity of : if , then and . Adjoints give symmetry of ; identity projections give reflexivity.
PC-2. Central supports and comparison
For a projection , let project onto . This space reduces , so its projection commutes with . It also reduces , because . SF-0 puts that projection in ; hence . It dominates . Any central projection contains every , so . This proves the least-central-projection definition without an imported support theorem.
If , then vanishes on , giving . Since is central, minimality gives . Conversely orthogonal central supports force for every . We have proved
When , polar decomposition of a nonzero supplies nonzero equivalent projections below and , respectively. Equivalence also preserves central support: every central projection dominating one initial projection dominates the final projection, by commuting through its partial isometry, and conversely.
Take a maximal collection of nonzero partial isometries with separately orthogonal initial projections below and final projections below . Chain unions supply upper bounds, so CF-1 applies. Let be its PC-1 strong-star sum and set . A nonzero bridge from to could be added, so . With we have and . Compressing gives
This is central comparison for arbitrary projections and arbitrary cardinality.
PC-3. Mutual subequivalence and the join formula
Suppose and , implemented by and . In the corner with unit , is an isometry. Put
Since , the are orthogonal: for , their product contains . Also and , so . The projection is at most . Therefore has initial projection and final projection . Its initial and final projections are orthogonal to those of . Their sum satisfies
This proves mutual subequivalence implies equivalence, including zero projections.
For , its kernel is . Its initial support is therefore . Also , so its final support is . PC-1 gives
PC-4. The center of any projection corner
For , work in , with identity . Compression maps into . It is injective: a central with annihilates , whose span is dense in .
Choose a maximal orthogonal family of nonzero projections subequivalent to , including . The residual projection is zero: otherwise PC3 provides a bridge to and thus an additional member. Choose . For define
Each summand is supported on and has norm at most ; PC-1 supplies the bounded strong-star sum. It compresses to at . For , , so it commutes with . Multiplying this identity by shows . Since finite sums of converge strongly to , all matrix corners determine an operator, and is central.
Commutation of with gives, in each corner, preservation of products and adjoints; hence extension and compression are inverse unital *-isomorphisms. Their continuity is also explicit. For vectors ,
Only countably many coordinates are nonzero: for each integer , finitely many squared norms exceed . Thus this is a CP vector-series functional on . A square-summable series of ambient vector pairs remains square summable after these substitutions, by the same inequality and the countable union of their supports. Extension is ultraweakly continuous on its entire domain; compression is too by its vector-pair substitutions. In particular central projections of are precisely , , and this identification preserves bounded increasing suprema.
PC-5. Finite central parts and properly infinite halving
Finiteness passes to subprojections: a partial isometry from onto a strict subprojection of , added to , would make equivalent to a strict subprojection of itself. Finiteness passes through equivalence by conjugating the corner with its implementing partial isometry. The same corner isomorphism preserves proper infiniteness.
In any projection corner with unit , choose a maximal orthogonal family of finite central projections. Its sum is finite. Indeed an equivalence from to a subprojection commutes with each central summand and restricts there to equality; its full final projection must therefore equal . Every finite central projection is below , since its portion outside , if nonzero, could be added. Hence , when nonzero, has no nonzero finite central compression and is properly infinite. This decomposition is unique and, by PC-4, arises from an ambient central split on .
We prove halving in a corner whose unit is properly infinite. In every nonzero central corner , infiniteness gives . Its defect has orthogonal equivalent translates , because . Let . Equivalence preserves their common central support , so they lie in and have full support there.
Extend this countable seed to a maximal orthogonal family equivalent to inside . Let , and fix . Comparison in gives a central with and . If , another copy of fits in , contradicting maximality. Thus .
The infinite family absorbs this residual on . Every is nonzero because , and they remain mutually equivalent by central compression of their implementing partial isometries. Map into , and use a bijection to map into the other summands. Orthogonal addition gives ; the reverse subequivalence is inclusion. PC-3 gives . Partition into two pieces each in bijection with , using PC-0. Their sums in are each equivalent to . Transport them through the equivalence . We obtain , with .
This construction works inside every nonzero central portion of . A maximal orthogonal family of central portions admitting such a halving must therefore fill . Adding their halves and their equivalences by PC-1 proves
No countability assumption was used. Repeated splitting is consequently legitimate.
There are countably many orthogonal copies of inside : choose an isometry from onto , and put . Their orthogonality follows from ; each is equivalent to . Their sum contains , so and PC-3 gives . Transport the family through this equivalence to obtain a filling family
This argument does not incorrectly assume that the first shift's original ranges already fill .
PC-6. The finite-join consequence
If are finite, NP4 makes finite. Replace by this projection and work in the corner with unit . If that unit were infinite, PC-5 would give a nonzero properly infinite central piece; compress to it. We would have a properly infinite unit with both summands finite.
Choose its halving . Compare and , with central satisfying and the reverse comparison on . On , NP4 and orthogonal addition give
The target summands are orthogonal: is orthogonal to both and , thus to their join. Both lie under . If , is infinite and cannot be subequivalent to finite ; hence . On interchange with to get the same contradiction unless . This is impossible for a nonzero unit. Therefore is finite. Induction also proves every finite orthogonal sum of finite projections finite.
PC-7. Countability belongs to the source corner
A faithful normal state on makes countably decomposable. Every nonzero orthogonal subprojection has strictly positive state value. Finitely many can have value at least , since their finite sums have value at most one; taking their union over proves countability. No state on is inferred.
Conversely suppose is countably decomposable. For a unit vector , let project onto . SF-0 gives , and . The vector functional is faithful on : if a positive there has zero value, then , so commutation makes zero on the dense orbit .
A maximal orthogonal collection of such nonzero fills ; a nonzero remainder would contain a vector providing an additional one. It is finite or countable by assumption. With strictly positive summing to one,
is normal by CP's square-summable vector-series description. It is a state. Zero value on positive forces to vanish on every commutant orbit, hence on their filling sum, proving faithfulness. This proves the exact equivalence of the two corner conventions.
Now let be properly infinite and let be countably decomposable, with . A maximal orthogonal family of nonzero with fills : a nonzero residual has , so PC3 supplies another subprojection. The family is countable by the hypothesis on . Use distinct copies from PC-5 to place each under , then add the implementing partial isometries. We have proved
The zero source case is immediate. In particular two countably decomposable properly infinite projections with the same central support are equivalent by applying PC8 twice and PC-3. The whole ambient algebra need not be countably decomposable.
The normalized trace with its full center retained
Let be a finite von Neumann algebra on an arbitrary complex Hilbert space, and put . Finiteness means that an isometry in every projection corner has full final projection. Equivalently, the identity is a finite projection, since finiteness passes to subprojections by PC5. No countability, factor, separability or scalar-trace assumption is made.
We construct a unique normal positive linear map such that
It is faithful, has norm one when , and preserves all bounded increasing positive suprema. Normal here means continuous on the entire concrete ultraweak space, not just on bounded sets. For the zero algebra the map is zero; its norm is zero and its normalization is .
The construction is quantitative: maps with trace distortion tending to one converge in operator norm. We prove that stability first, under an explicit tiling condition. We then supply the tilings, normal center-valued states and two local balancing arguments needed to produce those maps.
The earlier complete proofs used are CF1/3–8, SF0 and SB1–6, CP1–6, ST1–2, and PC1–7. Only the last automorphism corollary additionally uses the order-normal positive-map criterion NF6. Each use is located below. Scalar trace existence, type-I classification, direct integrals and a fixed-point theorem are not premises.
Original exposition and illustration: CC0-1.0 to the extent of rights held.
FCT0. Three analytic operations
For a positive functional on a unital C-star algebra, the positive/negative decomposition of a self-adjoint element shows that is real on self-adjoint elements, hence . Positivity of for all complex proves
Indeed the diagonal values are nonnegative and the mixed terms are conjugates. If , minimize the scalar quadratic. If that diagonal is zero, a nonzero mixed term would make the quadratic negative by a sufficiently large scalar of the opposite phase. This also proves the zero-diagonal case. Setting and using , from CF7, gives , including .
Suppose is positive and linear. Every character of the commutative unital C-star algebra is positive, by CF6 and positive square roots. Thus is positive and
CF6 proves for every complex . Consequently
This proves boundedness as well as the exact norm. It does not identify a complex image with its real part. The same argument works in a nonzero central corner, using its identity.
For completeness, a bounded increasing net has its supremum as a strong limit in . Its limiting quadratic values define a bounded positive form: homogeneity and the parallelogram identity pass to the scalar limits along the directed net. Polarization and CF8's Hilbert representation theorem give a positive operator . We have for a common bound , so CF6–7 give
Strong closedness puts in , and its quadratic values show that it is the least upper bound. CP4–6's vector-series tail estimate makes every bounded strong limit an ultraweak limit. In particular an ultraweakly continuous positive map preserves these suprema: the bounded increasing have a strong supremum by this same argument, hence an ultraweak limit , while continuity gives the ultraweak limit . Uniqueness of the limit gives .
We will also use the following complete decomposition of normal functionals. By CP4–6 every is , with both vector sequences square summable and inner products linear in the first variable. Polarization gives
For each , the sum of these positive vector functionals is normal: . Thus every normal functional is a linear combination of four positive normal functionals. CP6 also proves that is norm closed in . Finally is normal for bounded : substituting in its vector series replaces by , which are still square summable. These assertions apply equally to and all concrete corners.
FCT1. Quantitative stability, with the tiling premise explicit
Call a nonzero projection a central tile if there are finitely many orthogonal projections
where is a nonzero central projection. Necessarily , by PC2's preservation of central support under equivalence. This definition includes .
For this section alone assume that every projection is an arbitrary orthogonal sum of central tiles. A normal center-valued state is a normal positive linear satisfying and . Suppose decreases to one and such states satisfy, on all of ,
For and a central tile as in (FCT6), a partial isometry between and , used in both directions in (FCT7), gives
The last comparison uses . Thus is nonnegative on tiles. Normality and finite partial sums extend the inequality to every projection. Bounded Borel spectral step approximation, supplied by SF's SB4–6, extends it to every positive element; boundedness permits the norm limit. Hence is a positive map, with . By (FCT3),
The maps are norm Cauchy. Completeness of , applied at each and then to the uniform operator bound, gives a norm limit . Positivity, normalization and the center-module identities pass to it. For ,
The terms belong to , whose norm closedness was proved in CP6. Thus is ultraweakly continuous on its entire domain.
Taking limits in (FCT7) and interchanging gives . For positive and a unitary , apply this to ; it gives . Linearity gives that identity for every , and replacing by gives . Every element is a linear combination of four unitaries: split it into real and imaginary self-adjoint parts, scale each nonzero part to a contraction , and write
CF6–7 verify that is unitary. Consequently for all . The tiling premise and the approximate states used in this conditional stability lemma are proved next, before it is applied to establish existence.
FCT2. Finite cancellation and unitary completion
Suppose in the finite algebra, with prescribed partial isometry from to . PC2 compares their complements centrally: on a central piece , there is a partial isometry from to a subprojection of . Add it to . Orthogonality of the initial and final projections makes the sum an isometry in . Since is finite, its final projection is all of . Therefore that complement subequivalence is an equivalence. On reverse the roles and repeat. PC1 adds the two complement equivalences, proving
Adding the complementary partial isometry to the originally prescribed extends to a unitary. This works in every finite corner.
We need the version for different equivalent finite units. If , , , and , first transport to through an implementing equivalence between . Apply (FCT12) to the resulting two projections in that corner, then transport back. It gives . No trace is used.
A finite algebra contains no infinite orthogonal family of copies of one nonzero projection. Otherwise choose distinct copies , and partial isometries from onto . Their PC1 strong-star sum has initial projection and final projection . This contradicts finiteness of the subprojection .
FCT3. Central tiles without a type-I classification
First split off the part generated by abelian projections. A projection is abelian if is commutative. Let be the join in of the central supports of all such projections. If a nonzero projection had no nonzero abelian subprojection, it would have no polar bridge to any abelian projection: a nonzero bridge gives a subprojection of equivalent to a subprojection of an abelian corner. Equivalence identifies those smaller corners, so the former is abelian. PC2 would then make orthogonal to every central support in that join, a contradiction. Thus every nonzero contains a nonzero abelian .
Fix such , and work on . By PC4, every subprojection of is for a central projection , since . Construct orthogonal projections with . Set and, after choosing , put
We can choose equivalent to ; if the residual is zero all later terms are zero. To see this, compare and . On a central piece where , its final subprojection of that abelian projection is . Its central support is the full comparison piece, because . Thus is that piece and the subequivalence is an equivalence. On the other comparison piece directly. Add the two implementations. This proves the asserted choice.
The decrease. If , the orthogonal would all be equivalent to the nonzero , contradicting FCT2. Thus . The central projections sum to . On , exactly the first constructed projections fill the unit:
The equality follows because , and the equivalences because for . Every nonzero is therefore a central tile, and at least one is nonzero. This is an explicit finite homogeneous matrix-family construction; no classification theorem is hidden in it.
On there is no nonzero abelian projection. Every nonzero corner there contains two nonzero orthogonal equivalent projections. Indeed its algebra is not commutative. If all its projections were central, bounded spectral step approximation would make every self-adjoint element central and hence the algebra commutative. Take a noncentral projection ; some off-diagonal corner , or its adjoint, is nonzero. PC1 polar decomposition gives the required orthogonal equivalent subprojections.
Choose a maximal family of such pairs in any nonzero central unit , with all projections mutually orthogonal. A nonzero residual corner would contain another pair. Hence their sums are equivalent complementary halves of . Repeat in one half and transport its division to the other half. Induction gives, for every , a division of into orthogonal equivalent projections , with decreasing and
All their central supports are , since equivalent projections whose sum is central have that common support.
For a nonzero in this part, work on and make these dyadic divisions there. Compare with . If on some nonzero central piece one has , transport that tile to a subprojection of . FCT2 extends the transport to a unitary in , so conjugating the whole finite division exhibits the transported projection as a central tile. If this never occurs, central comparison gives for every . The projections are mutually orthogonal and equivalent to . Thus each contains a copy of the same , contradicting FCT2.
Every nonzero projection in now has a nonzero central-tile subprojection: cut it first by or , and use the appropriate construction. A maximal orthogonal family of such tiles below any must fill , because otherwise the residual supplies another tile. This proves exactly the tiling premise of FCT1, with arbitrary orthogonal index sets.
FCT4. Normal center-valued states from cyclic central compressions
We first prove a cyclic abelian fact. If an abelian von Neumann algebra has cyclic vector , then . Let and . Choose with . Put
CF6 constructs ; SB4–6 puts its bounded Borel projections in . Since commutes with ,
The first inequality uses the spectral bound on . We have and . For , commutation gives . The common norm bound extends strong convergence from the dense set to every vector in . Strong closedness yields . The zero operator needs no truncation. The approximation sequence concerns one vector; it does not assume that is separable.
Apply PC7's vector-support construction to the concrete algebra . The support of is the projection onto , belongs to , fixes , and makes the restricted vector functional faithful on that central corner. Choose a maximal orthogonal family of nonzero such central supports , with vectors . Their join is one: a nonzero remaining central corner contains a vector with a nonzero support below it.
Let , and let project onto . This subspace reduces , so and . The compression
is a unital normal representation: its vector-series tests are restrictions of the ambient tests. It is faithful because gives , and the support construction makes the functional faithful on . ST2 therefore proves that its image is a von Neumann algebra and its inverse on that image is normal on the entire domain.
For , the compressed operator commutes with , since both and commute with . Its commutant equals that cyclic abelian algebra by the proof above. Consequently
is well defined, positive and normal; and . FCT0 gives . The bounded central diagonal sum
exists strongly by PC1, since the summands have orthogonal central supports and norm at most . It is a unital positive linear center-module map.
Its full normality needs an arbitrary-index check. If , then : finite sums of the projections increase strongly to one and CP's tail estimate applies. Only countably many of these values are nonzero, since at most finitely many exceed . Each positive normal has norm , by FCT0. Their sum therefore converges in norm in , and evaluation of the bounded central sum shows that it is . Formula (FCT5) proves the same assertion for all . Hence is normal, without sigma-finiteness or a direct integral of .
FCT5. A corner with arbitrarily small trace distortion
Fix the normal center-valued state and a number . We construct a nonzero projection with such that
In central inequalities, a positive element with support is positive on its whole central support; this does not assert a uniform positive lower bound.
First choose a maximal orthogonal family of nonzero projections with zero -value. Its sum has by normality. Set ; then , and is faithful on . Indeed a nonzero positive with zero value has a nonzero spectral projection , and , contradicting maximality. For ,
One inclusion follows from the center-module identity. Conversely implies , hence by faithfulness. This proves the reverse inclusion.
Inside , choose a maximal family of pairs with separately orthogonal initial and final families, , and
Chain unions supply the maximal family. Its partial-isometry sum gives . Put and . FCT2 gives . They are nonzero: for an empty family both equal ; otherwise normality gives , with at least one nonzero positive summand. Thus , and equivalence gives .
For equivalent , , maximality forces . If not, cut both projections by the nonzero central positive spectral support of . On this cut the difference is positive with full central support; (FCT22) and equivalence ensure nonzero matching projections. That pair would extend the family, a contradiction.
Let be the infimum of the scalars such that for all these equivalent pairs. The set contains one and is closed, because the positive cone is norm closed. A decreasing sequence of admissible scalars tending to its infimum proves that itself is admissible. It is positive: the pair and exclude zero.
Since is not admissible, there is a matching pair for which . Cut by the nonzero positive central spectral support of that difference. Relabel the cuts; then they are still equivalent and
The first matching-family bound also holds on these central cuts, since it holds for every pair below .
Choose a second maximal separately orthogonal matching family below satisfying
Let and . FCT2 gives . They are nonzero: if , equivalence gives ; normal summation of (FCT25) would contradict (FCT24). Also , since .
For every matching pair , we have . A nonzero negative central spectral part of their difference would cut out a new pair satisfying (FCT25). The cut is nonzero by (FCT22) and preservation of central support, so maximality rules it out. For equivalent , transport through a fixed equivalence , obtaining equivalent to both. Therefore
The factor is present in both comparisons.
If and is a unitary of that corner, approximate in norm by finite nonnegative combinations of its spectral projections. Each projection and its -conjugate are equivalent below . Applying (FCT26) term by term and taking the norm limit gives . For , PC1 polar decomposition and FCT2 extend its partial isometry to a corner unitary , with . This proves (FCT21) on the full corner, including noninvertible .
FCT6. Moving the corner estimate to the whole algebra
Use FCT3 to choose a nonzero central tile , with equivalent orthogonal filling a central unit . It still satisfies (FCT21) on its corner, and by faithfulness on . Choose partial isometries
This finite sum is a normal positive center-module map. For , all belong to . Thus the entire matrix calculation is
Both resolutions of the identity are the actual finite sums . Also , a nonzero central positive element supported on , by (FCT22).
Choose with . On , the central inverse is bounded and positive by SB4–6; it is extended by zero outside . Define
It is normal and positive, is a -module map, has , and satisfies . Normality of multiplication by follows from the vector-series substitution in FCT0. Its norm is one by (FCT3). No unbounded inverse is multiplied into a normal map.
This construction works inside every nonzero central corner of , with the same prescribed . Choose a maximal orthogonal family of central projections carrying these maps. A nonzero remaining central corner would supply another, so . Define
The diagonal sum exists with norm bound , by PC1. It is unital, positive and a center-module map; the distortion estimate holds on each orthogonal central component and hence globally. Its full ultraweak normality follows by the FCT4 summable-predual argument: for each summand has functional norm , whose total is ; use (FCT5) for general . This proves the normality of the whole assembly, for arbitrary index sets.
Choose, for example, . FCT3 and FCT6 now verify both premises of the conditional stability lemma FCT1. It gives the normalized normal center-valued trace in (FCT1).
FCT7. Faithfulness, uniqueness and projection comparison
For every central tile in (FCT6), traciality and normalization give
A nonzero projection contains a nonzero tile , so . If is nonzero, some positive spectral cutoff is nonzero; the squared-integral spectral identity would otherwise make . Then . Thus is faithful on the entire positive cone, and implies .
Any other normal normalized center-valued trace has the same value (FCT31) on every central tile. FCT3 decomposes each projection into tiles, and normality identifies its value with their arbitrary positive sum. Therefore the two traces agree on all projections. Uniform spectral step approximation and boundedness then give equality on all self-adjoint elements and hence all of . This is uniqueness among normal traces; it does not assume or assert normality of an arbitrary algebraic trace.
For projections, the full order criterion is
The forward implication uses the implementing partial isometry and positivity. Conversely PC2 splits centrally into and . On the second piece, place a copy of under . The positive residual has nonnegative trace, whereas makes its trace nonpositive. Faithfulness makes that residual zero, so the reverse subequivalence there is an equivalence. Add the two central implementations to get . Equality of traces gives both subequivalences; PC3 gives equivalence. This proof includes zero projections.
The support identity is : is supported on ; a central annihilating gives , hence by faithfulness.
The converse existence assertion is also precise. If an arbitrary von Neumann algebra has a normal normalized center-valued trace, it is finite. Otherwise PC5 supplies a nonzero properly infinite central unit , split as with . The trace law gives , while additivity gives , a contradiction. After finiteness is established, the preceding construction and normal uniqueness prove that any such trace is faithful. No scalar-trace existence theorem was used to prove this implication.
Free method comparison
Jesse Peterson's author-hosted Notes on operator algebras, 27April2020, Section6.4, printed/PDF102–106, develops the approximate center-valued states and their norm-limit trace. FCT retains and credits that mathematical route. Its characterwise bound proves the norm of a positive central map for complex inputs; its explicit central tiles, cyclic compressions and summable preduals supply the type and arbitrary-assembly steps that the source method requires. Both occurrences of the balancing constant are retained.
The human source remains freely readable on its author's university page. Its text and PDF are not reproduced here or assigned the programme's licence. The complete programme comparison, bounded spectral calculus, predual and normal-range arguments are the actual earlier proof inputs.