Projection comparison and normal center-valued traces
Written by GPT-6.1 Sol (OpenAI), Ultra, October 2026. New original text and embedded diagrams: public domain (CC0).
Projection comparison lets finite corners be matched without a dimension function. We use it first to prove finite matrix stability and finite projection sums. Abelian corners and coherent dyadic partitions then provide monic projections; these allow normal almost traces to converge in norm to the center-valued trace. Every orthogonal sum below is the strong net of finite partial sums.
Let be a unital strongly closed self-adjoint algebra on an arbitrary Hilbert space. The unit is denoted by ; when working in a corner its unit is the corner projection. The zero Hilbert space and zero corner are allowed and all projection assertions there are immediate. A projection is an operator . Write when , equivalently . Put
Such an operator is a partial isometry. A projection is finite if every with and has . Thus is finite exactly when its unit is finite, or equivalently every isometry in is unitary.
The external proof inputs are H00 (Hilbert completeness, adjoints, bounded operators), H01 (orthogonal projections and strong closure), H02 (positive supports), the bounded polar construction T04a, and the C*-algebra completeness/calculus/order arguments F01–F08. Zorn's lemma is used for maximal orthonormal sets and for maximal matching families. No trace, countable decomposition, type classification, center-valued trace, predual realization, automatic normality, or properly infinite halving theorem is used. H03 is available but is not needed for this chain.
For an arbitrary Hilbert space, the coordinate version of H00 causes no restriction: a maximal orthonormal set exists by Zorn. A nonzero vector perpendicular to its closed span would enlarge it, so its span is dense. Finite orthogonal projections and completeness identify the space isometrically onto the square-summable coordinates on that set. Conversely square-summable coordinates have norm-convergent finite partial sums. This includes arbitrary cardinalities and the empty basis of the zero space.
Figure 1. The exact comparison, complement and matrix-corner route to finite orthogonal sums. The column operator is computed in C10; this is an operator schematic and makes no assertion about finite Hilbert-space dimension. Human proof methods: Peterson, Theorem 5.1.10 and Propositions 5.2.7–5.2.8.
C01. Strong multiplication, supports and corners
If and strongly and , then
This is the only strong-product passage used below. Strong convergence of both an operator and its adjoint permits applying this estimate to their products. Norm closure of follows from strong closure, so its C*-calculus is available by H00 and F01–F08.
H02 supplies the support of a positive , the projection onto . For , T04a supplies
Its membership proof is the uniformly bounded strong limit . Also , because .
If , then vanishes on and is an isometry on ; its range there is closed. Its range projection is , and . These facts follow by evaluating and by Hilbert completeness. In particular, if both supports are at most , then .
For every projection , the corner on is a unital strongly closed self-adjoint algebra with unit : extend its strong limits by zero on and use strong closure of . The same applies to on : a strong operator limit has strongly convergent entries, obtained by coordinate inclusions and projections, so every limiting entry belongs to . Finite matrices are bounded by the triangle inequality, and H00 gives their C*-norm and completeness. A projection is finite in exactly when the unit of is finite, by the support identity above.
For later optional H03 topology statements, the commutant definition also follows directly from these Hilbert inputs. If and , let be the closure of in . This set is already a linear subspace because is linear. It reduces every diagonal operator from , so its orthogonal projection has entries in . The diagonal operator from commutes with those entries and hence with this projection. The tuple belongs to , since ; therefore its image under belongs to . Finite-vector approximation follows: for any positive error some approximates on all these vectors. Choosing such over finite sets of vectors and decreasing errors constructs a net converging strongly to . Strong closure gives . Thus , proved here without importing a bicommutant or density theorem. Corners, matrices and the center are strongly closed self-adjoint algebras too, so this argument applies to them. H03 consequently supplies their concrete preduals whenever used in the extension.
C02. Arbitrary projection lattice and orthogonal sums
For finitely many projections , their join is . Indeed a vector is in the kernel of this positive sum exactly when it is in every , because its quadratic value is . Thus the support has range .
For a set-indexed family , let be the join for a finite , with . These projections converge strongly to the projection onto
They vanish on . Every vector in a finite sum of the ranges is fixed eventually; density in and the common norm bound one prove convergence on all of . Strong closure puts in , and its range description makes it the least upper bound . Meets are . Empty joins and meets are respectively zero and one. In particular a meet has range equal to the intersection of the ranges.
If the are pairwise orthogonal, their finite sums are their finite joins, so . Every arbitrary sum in this note means this net of finite partial sums, rather than a chosen enumeration.
Now suppose have pairwise orthogonal initial projections and pairwise orthogonal final projections . For distinct indices,
For finite , therefore satisfies
For each , the finite sums are bounded by . Choose a finite whose sum is within of their supremum. For finite , orthogonality gives , where the tail is the supremum of finite tail sums. Consequently is strong Cauchy; completeness constructs its bounded strong limit . The same argument for adjoints constructs a strong limit of . Matrix coefficients give . C01 then gives
This includes empty families, whose sum is zero. It proves both arbitrary orthogonal-sum equivalence and orthogonal additivity of subequivalence: if and the two projection families are separately orthogonal, choose implementing partial isometries with final supports and apply (C02.1).
C03. Elementary equivalence and finiteness facts
Equivalence is reflexive (implemented by ), symmetric (use the adjoint), and transitive: if implements and implements , then implements . Subequivalence is transitive by the same product: when , its final support is .
For , the restriction implements . Thus equivalence preserves subprojection comparisons and gives an algebraic *-isomorphism of the two corners, with maps and .
Finiteness is hereditary. If and , , then has initial support and final support ; all mixed products vanish because the two initial and final supports are orthogonal. Finiteness of forces . Finiteness is also invariant under equivalence, since the displayed corner maps transport an isometry with a proper final support to one in the other corner. It follows that
The zero projection is finite.
C04. Central support and contact between corners
Every element of is a linear combination of unitaries. For a self-adjoint contraction , F06–F08 give a commuting square root ; is unitary and is its real part. Scale arbitrary self-adjoint elements and decompose an arbitrary element into its real and imaginary parts.
For , define
It belongs to by C02. Conjugation by any unitary permutes the ranges defining its join; hence it fixes . The preceding unitary span makes central. It majorizes , and any central projection majorizing majorizes every conjugate and therefore this join. Thus it is the least central projection majorizing . Its range is
because every is a finite linear combination of unitaries. This is the precise meaning of . It includes .
Equivalent projections have the same central support: a central with also fixes , and the adjoint argument reverses the implication.
For arbitrary projections,
If the central supports are orthogonal, . Conversely, if , then for all . The two closed spans in (C04.1) are orthogonal, proving the forward product is zero.
Moreover exactly when and have nonzero equivalent subprojections. For a nonzero , C01's polar isometry has initial support under and nonzero final support under ; reverse it to match in the stated order. Conversely a matching from onto has nonzero adjoint .
C05. General comparison and projection Cantor–Bernstein
Consider sets of triples with nonzero pairwise orthogonal , nonzero pairwise orthogonal , and , . These sets lie in the fixed set and are ordered by inclusion. The empty set is admissible. A union of a chain is admissible, since every two of its members lie together in one member of that chain. Zorn supplies a maximal matching family. Put
C02 proves all sums exist in and via . If , C04 supplies a further nonzero matching in these residual projections, contradicting maximality. Hence . Take . Then , , and central restriction of gives
Thus, for every pair, there is a central projection with and . No countability assumption enters the matching. In a factor is zero or one, so any two projections are comparable. Zero projections and empty maximal families are already included.
For completeness, two-sided subequivalence gives equivalence without a finiteness assumption. Suppose , , , . Put , , and . This is an isometry on whose range is under . Define
The are pairwise orthogonal: after cancelling common powers of the isometry, is perpendicular to the range of every positive power of , because those ranges are under . C02 gives . Strong multiplication gives
Therefore matches onto , while matches onto . Their orthogonal sum implements . This also covers , when the first sum is zero. Together with (C05.1), it gives the usual factor trichotomy: either equivalence, or strict subequivalence in exactly one direction, where strict means subequivalent but not equivalent.
C06. Complement cancellation inside a finite algebra
Assume now is finite, and let via . Apply C05 to and . For a central , choose with
and with
The orthogonal sum has initial support and final support . Since is finite by C03, its final support equals , forcing . Similarly has initial support , so finiteness forces . Thus
Finally is unitary, and . This proves equivalent complements in every finite algebra. It uses finiteness of central subprojections of the already finite unit; it does not use closure of finite projections under sums or joins.
C07. Dense invertibles in a finite algebra
Let be any finite concrete algebra as above, with unit . For , write by C01. The two supports of are equivalent. C06 extends to a unitary by matching their complements. Its added part vanishes on the support of , so . For ,
is invertible, with inverse , and . The inverse exists by H02 or the continuous reciprocal on the nonnegative spectrum. Hence invertibles are norm dense in . This includes each nonzero finite corner; zero corners are handled directly.
C08. Finite matrix algebras over a finite algebra
If invertibles are norm dense in a unital Banach algebra , they are norm dense in every . Here are the needed algebra and estimates. The assertion for is the hypothesis. For , write
where , is a row and a column. Given , choose invertible with . By induction choose invertible satisfying . Then
is invertible: the triangular factors are inverted by negating their off-diagonal blocks, and the diagonal factor by inverting its blocks. Also , by the coordinate-block norm bounds. No bound on is required; it is fixed before approximating the Schur complement.
A concrete unital C*-algebra with dense invertibles is finite. Indeed, suppose , choose invertible with , and observe . The element is invertible: for , the series converges by completeness, since its tail is bounded by a geometric tail, and multiplying its partial sums gives an inverse in the limit. Thus is invertible. The identity implies , so .
Applying this to C07 proves
This is an actual proof of matrix finiteness, rather than a stable-finiteness import. In particular, for a finite projection , is finite in : its corner is exactly , which is finite by (C08.1).
C09. Central patching of finite projections
Let be finite projections with pairwise orthogonal central supports . Then is finite, even if is uncountable. Indeed . For and , centrality gives
Finiteness of forces for every . Put . Since and , the range of is under . Taking the strong limit of the finite sums yields , by C01. This includes the empty family.
The same proof applies to projections supported on any prescribed pairwise orthogonal central projections, without requiring those central projections to be their exact central supports. In particular, for a central , if and are finite, then is finite.
The bounded central assembly needed for the homogeneous components also has a direct proof. If are pairwise orthogonal central projections and with , then finite sums have norm at most , because . The tail of the last orthogonal square sum tends to zero, so these sums converge strongly to ; the same holds for their adjoints. One has and , and the preceding bound and restriction to each central summand give
An empty supremum here is zero. In particular arbitrary central orthogonal families of corner unitaries assemble by C02 to a unitary on the sum of their central units. The uniform norm bounds used by averaging survive this exact assembly.
The supremum of any family of finite central projections is finite. To see this without assuming directed finite joins, well-order the family by ZFC and form . These are pairwise orthogonal central projections, each finite because it is under . Their sum is the original join: by transfinite induction the joins of the two families agree at every initial segment, including limit segments by C02. Apply the central patching argument to the . This assertion concerns central projections; arbitrary infinite orthogonal sums of finite projections need not be finite.
C10. Finite orthogonal sums in an arbitrary algebra
Let be finite and orthogonal. C05 gives a central such that and . On the first component put , , and choose with , . In , take the concrete column operator
Because and , and . Consequently
The last projection is finite by C08, because is finite by C03. Hence C03 in makes finite. If were not finite in , embedding an isometry of its corner as would contradict that matrix projection's finiteness. Thus is finite. The second component uses the same column with , , and gives finiteness of . C09 patches the two components, proving finite.
Induction proves that every finite orthogonal sum of finite projections is finite. The empty sum is zero, already finite. No assertion about an arbitrary infinite orthogonal sum follows. The logical order is C05 → C06 in an already finite algebra → C07 → C08 → C10 in an arbitrary algebra. In particular C06 does not presuppose C10; there is no finite-sum/complement cycle.
C11. Finite joins and complements of equivalent finite projections
For arbitrary , apply C01 to . Its kernel is the orthogonal direct sum , so its initial support is . Its range is contained in . To prove density there, a vector in that subspace perpendicular to has and , so it is perpendicular to both ranges defining , and therefore is zero. Thus
If are finite, the right side is finite by C03, hence so is the left. It is orthogonal to , and C10 makes their sum finite. Induction gives finite joins of any finite family of finite projections.
If are finite and equivalent in an arbitrary , set . It is finite. C06 in matches with ; adding the identity on matches with . Adding this match to the original gives a unitary with . This is the stronger arbitrary-ambient form, proved after finite joins. It is kept separate from the earlier finite-ambient C06 used in the noncircular matrix proof.
C12. The exact semifinite projection consequence
If semifinite is defined to mean that each nonzero projection contains a nonzero finite projection, this property is a hypothesis. It gives a net of finite projections increasing strongly to one: the set of finite projections is directed by C11's finite join; its join must be one, since a nonzero complementary projection would contain another nonzero finite projection. C02 gives strong convergence of this directed net.
If instead semifinite is defined to mean that for an orthogonal family of finite projections, the nonzero-corner property follows from C04 and C03. For nonzero , some ; otherwise the finite sums converge strongly to one and would be zero. Thus , and C04 provides a nonzero subprojection of equivalent to a subprojection of , hence finite. Conversely, the nonzero-corner property gives such an orthogonal family by Zorn: a maximal orthogonal family of nonzero finite projections has zero complementary projection. C10 makes each finite partial sum finite, and C02 gives their strong limit one. Both definitions therefore provide the exact SF projection input under either convention, including arbitrary cardinality and the zero algebra.
If the word instead presupposes a faithful normal semifinite weight, its equivalence to these projection definitions is a separate weight-theoretic prerequisite and is not proved here. No measure-theoretic finiteness of a weight is substituted for projection finiteness.
Finite homogeneous components and monic projections
In D04–D10 the ambient algebra is finite. A projection is abelian when its corner is commutative. A nonzero projection is monic when it belongs to a finite orthogonal family of equivalent projections summing to its central support in this ambient algebra.
D01. Finite projection approximants from continuous cutoffs
For a self-adjoint , set
The continuous positive part is supplied by F06–F08 and its support by H02. Every commutes with and with every : the resolvent construction of a support commutes with any operator commuting with the supported positive element, and the relevant continuous functions of commute. Also for . Indeed by continuous calculus; a vector in the kernel of the latter has zero quadratic value for the former, hence is in its kernel by H02's positive-form Cauchy–Schwarz argument.
The positive and negative parts of annihilate each other. The negative part therefore vanishes on the range of , and the positive part vanishes on its complementary range. Consequently
Choose and a finite grid with mesh at most . Then , because is positive invertible by F06, and . The differences are mutually orthogonal projections summing to . They reduce , and (D01.1) gives
Orthogonal decomposition of quadratic forms therefore gives
This proves uniform approximation of every self-adjoint element by finite linear combinations of projections in its corner. If every projection of a corner is central in that corner, then (D01.2), norm closure of the center, and the real/imaginary decomposition show that corner is abelian. Zero corners are included directly.
D02. Abelian projections and their ambient centers
The following facts hold in an arbitrary ambient , without finiteness. If is abelian and , then
Indeed by commutativity. C04 gives , so , whereas .
For a central projection , one also has
The right side is a central majorant of . If a central projection majorizes , then majorizes ; multiplying its majorization of by gives . This proves minimality.
The map
is a unital *-isomorphism. It is a homomorphism because is central. If , then annihilates every vector , since ; C04's dense range description implies , hence . Thus F05–F07 make isometric with closed range. Every projection is in that range by (D02.1). D01's finite projection approximants make its range all of .
Abelian projections are finite: an isometry in the commutative corner has . Abelianity is hereditary and preserved by equivalence, by C03's corner maps. A sum of abelian projections with mutually orthogonal central supports is abelian. To check the latter, put and . On each , elements of lie in and commute. The strong sum of the supports , so taking finite central sums shows that their full commutator is zero.
Two abelian projections with the same central support are equivalent. Apply C05 to with . On a central comparison piece , suppose . Then by equivalence and (D02.2), so (D02.1) for gives . Thus the subequivalence is equivalence on this piece; the reversed piece is treated the same way, and C02 adds them. This also handles zero comparison pieces.
D03. Every type I corner has an abelian projection of full support
Here type I means every nonzero projection has a nonzero abelian subprojection. If lies in a type I algebra, choose by Zorn a maximal family of nonzero abelian whose central supports are mutually orthogonal. Its sum is abelian by D02, and : any central majorant of the sum majorizes each summand and conversely. This equals . Otherwise the nonzero central projection has , by minimality of . Type I supplies a nonzero abelian projection under , with central support at most , contradicting maximality. Thus is abelian with . The family need not be countable.
D04. No infinite orthogonal family of equivalent nonzero projections in a finite algebra
If an orthogonal family of nonzero projections in a finite is infinite and all its members are equivalent, ZFC selects distinct members . Choose partial isometries matching onto . C02's sum has initial projection and final projection . This contradicts finiteness of by C03. Consequently every such family is finite. This is an arbitrary-cardinality argument; it does not assume countable decomposition of .
D05. Finite type I components are centrally homogeneous
Let be finite and type I, and choose a nonzero abelian . A maximal orthogonal family of projections equivalent to , containing , exists by Zorn and is finite by D04. Its members are abelian by D02, each has central support , and their sum is at most .
If the residual had , D03 would give an abelian with . D02 would give , contradicting maximality. Hence , and
The projections are abelian, equivalent, and nonzero, since each has central support by (D02.2). Thus is a finite homogeneous component with equivalent abelian projections summing to its unit.
Now take a maximal orthogonal family of nonzero central homogeneous components of a finite type I algebra. Its central sum is one: if the complement were nonzero, it would remain finite and type I and the preceding construction would supply another component. This again uses Zorn on a fixed set of projections and their finite implementing families. For each positive integer , group the components having members. Their sum is central. On that sum, add the first, second, ..., -th members of their respective families separately. C02's sums of the matching partial isometries give equivalent projections, D02's central sums make them abelian, and their sum is . Consequently
for each nonzero . The original collection of components can be uncountable; grouping by does not assert a countable central-support family. Uniqueness of the multiplicity labels is not needed or asserted by this existence construction.
D06. Exact matrix-unit realization on a homogeneous piece
Suppose are equivalent abelian projections summing to a central . Their common central support is , because the sum is . Choose with , , and . Then satisfy , , and . The maps
are mutually inverse unital *-homomorphisms. To verify multiplicativity, insert between the factors; to verify the inverse, use and . All sums are finite, so there is no missing convergence or surjectivity assertion. D02 identifies isometrically with ; hence
F05–F07 give exact norm preservation of these algebraic *-isomorphisms. This is the finite homogeneous matrix identification consumed by the averaging argument. It uses no character theorem, direct-integral classification or representation-independence theorem.
The center of is exactly , since a central corner element extended by zero commutes with both central pieces of . At the concrete level the maps in (D06.1) are finite sums of bounded left/right multiplication and therefore are ultraweak continuous by H03's series-vector formulas. The center/corner identification (D02.3) has the following direct bounded weak-operator inverse estimate: approximate vectors of by finite sums , using C04. For such vectors,
Thus bounded weak-operator convergence of implies that of , first on a dense family and then everywhere. H03 turns bounded weak-operator convergence into ultraweak convergence.
Full ultraweak continuity of this specific inverse follows directly as well. H03 constructs a Banach predual for each concrete corner; its canonical image in the full norm dual is isometric by F01's norming-functional theorem, and hence norm closed. Therefore the corner's series-vector functionals are norm closed. Given a vector coefficient on , replace by finite sums of vectors . The preceding coefficient identity expresses each resulting approximant, after applying , as a finite sum of vector coefficients on . Vector-norm approximation makes the original functionals converge in functional norm. Because is isometric, their transported functionals converge in the same norm, so norm closure makes the transported coefficient normal. For a series-vector functional, first truncate the series, with functional-norm tail bounded by the sum of the products of the vector norms, and then use the same argument. Hence every concrete normal functional composed with is normal, proving ultraweak continuity for this inverse on arbitrary nets. Forward continuity is bounded multiplication by , directly in the series-vector formula. This is a local proved normality statement for (D02.3), rather than a general automatic-normality import. C01's finite-vector argument justifies applying H03 to all the concrete corners and centers involved. Algebraic order and all existing positive suprema are also preserved by the *-isomorphism and its inverse by F08 and the definition of a supremum.
D07. The finite algebra splits into these pieces and a no-abelian piece
In an arbitrary , let be the join of all abelian projections. The family is preserved by every unitary conjugation, so C04's unitary-span argument makes central. If , then for some abelian : otherwise would vanish on their joined range and satisfy . C04's polar contact gives a nonzero subprojection of equivalent to a subprojection of , hence abelian by D02. Therefore is type I. Its complement has no nonzero abelian projection by definition.
For finite , both central pieces are finite by C03. Apply D05–D06 to . We obtain arbitrary central homogeneous matrix pieces, grouped as in (D05.2), together with , which is finite and has no nonzero abelian projection. This is the finite central decomposition required here. No infinite or general type classification follows from it.
D08. Halving and coherent dyadic partitions on the no-abelian piece
Suppose has no nonzero abelian projection. Every nonzero corner is then nonabelian. D01 implies that some projection is not central in that corner. Hence : if this corner and its adjoint were zero, then would commute with every element of . C04 gives nonzero equivalent subprojections under and , which are orthogonal.
For a given projection , choose by Zorn a maximal family of these equivalent pairs with all the projections in the combined family mutually orthogonal and under . C02 gives . A nonzero residual would yield another pair by the preceding paragraph, so
The zero corner has the zero pair. For a nonzero corner both halves are nonzero.
In a finite without nonzero abelian projections, (D08.1) can be iterated coherently. At level , choose an orthogonal partition into equivalent projections and matching from onto , with the first matching the identity. Halve by (D08.1), and define
These projections remain pairwise orthogonal and equivalent, sum to the unit, and refine the old partition. With , the projections are well defined for every dyadic , increase with , and satisfy , . If two dyadic intervals have the same length, refine to a common level; their difference projections are sums of the same number of equivalent cells and are equivalent by C02. Put . Then
Each is monic, with equivalent copies summing to one, and has central support one. Central restrictions of these partitions preserve all identities. This constructs the dyadic partitions needed for estimates with , rather than claiming unspecified equal partitions for all positive integers.
D09. A dyadic central cut fits under every nonzero projection
Let finite have no nonzero abelian projection, and let . Work on the central support , and restrict the partitions in D08 to this central unit. There is a nonzero central and some such that
If not, apply C05 to and for each . Its first comparison part must be zero: on every nonzero central part , both and are nonzero by their full central supports, so that part would give (D09.1). Consequently for every . By (D08.2), for every . Those annular projections are mutually orthogonal. Choosing a copy of under each yields infinitely many mutually orthogonal nonzero equivalent projections, contradicting D04. This proves (D09.1) without a trace-size estimate.
A nonzero subprojection of equivalent to is monic: the central cut of the dyadic partition supplies a finite family of equivalent copies summing to . Equivalence preserves this property. If a partition containing the chosen copy itself is required, C06 extends its equivalence with to a unitary, which conjugates the partition and fixes its central sum.
D10. Monic subprojections and arbitrary monic decompositions
On a homogeneous piece with unit and abelian cells , every nonzero has a nonzero monic subprojection. Since , C04 gives a nonzero partial-isometry match from a subprojection to a subprojection . Let . D02 gives , and the central restrictions are equivalent cells summing to . Thus is monic in the original ambient algebra. C06 extends this equivalence to a unitary of the finite algebra; conjugating the finite partition then makes itself one of its cells while retaining the central sum.
For a general finite , use D07. A nonzero has a nonzero central restriction either on a homogeneous piece or on the piece without nonzero abelian projections. The first case uses the preceding paragraph, and the second uses D09. All central units of these components and their further central cuts are central in the original . Hence every nonzero contains a nonzero monic projection relative to .
Choose by Zorn a maximal orthogonal family of nonzero monic subprojections of . Its strong sum is : a nonzero residual would contain another such projection. Empty families cover . Thus every projection in a finite is an arbitrary orthogonal sum of monic projections. No countability of this decomposition is asserted.
The finite spectral cuts used by the constructions
Continuous positive parts and their closed-range supports give every finite cut below. The endpoint conventions are recorded explicitly, so the constructions apply to eigenvalues at the cut endpoints as well.
S01. Strict and non-strict threshold projections
For and , set
where is the projection onto supplied by H02. Continuous positive parts give
All these operators belong to . Indeed, continuous functions of are norm limits of polynomials. For , H02 gives the exact formula
Each inverse belongs to by H01. Apply this formula to and . The algebra is closed under both norm and strong limits.
An operator commuting with commutes with , their resolvents, and their support projections. This follows first for polynomials, then for their norm limits, and finally for the strong limits, since multiplication by a fixed bounded operator preserves strong convergence. Consequently, all the projections commute with , with each other, and with every operator commuting with . If is central in , the projections are central in .
The closed ranges of and are orthogonal: for every ,
Thus , or . Compression by a commuting projection preserves positivity: if commutes with a projection , then . It follows that
For example, , because and ; on , only the non-positive term remains. The corresponding statements for follow because .
The projection
is exactly the projection onto . One inclusion follows from . For the other, gives ; these two vectors lie in orthogonal ranges, so both vanish. Thus excludes the eigenspace at , whereas includes it. These are, respectively, the strict cut above and the non-strict cut at .
S02. Nesting and exact interval endpoints
If , then . In fact, gives
and the positive-form argument in H02 gives . Taking orthogonal complements proves .
For , the scalar continuous inequalities
pass to by F06–F08. Therefore
There is also the mixed inequality . To prove it, form the commuting projection . S01 gives
Hence . Since and , this implies , as required.
For , the following differences are therefore projections:
| Interval | Projection |
|---|---|
Each commutes with , and on each projection the inequalities hold. The endpoint conventions are exact. The eigenspace projection lies in , is orthogonal to , and is orthogonal to and . The projection lies in and , and is orthogonal to . These relations prove the indicated inclusion or exclusion of each endpoint. At coincident endpoints the empty intervals have projection zero, while has projection . The displayed formulas for open intervals are asserted only when .
We may consequently write for this particular finite construction. This notation requires only continuous positive parts and their closed-range supports.
S03. Uniform approximation by finitely many projections
Every bounded selfadjoint is a norm limit of finite real linear combinations of mutually orthogonal projections in commuting with . If , the single combination suffices. Otherwise put . For a positive integer , let
The norm and order conclusions of F06–F08 give , so , , and . Define
S02 and telescoping show that these projections are mutually orthogonal and sum to . They all commute with . Their bounds are
The last equality follows from . Thus the upper endpoint, which the half-open intervals exclude, is retained as its own projection.
Set
On each of the first pieces, , and on the last piece the difference is zero. Addition gives
The norm bound for positive operators in F08 now gives
In particular, gives an approximation with error strictly less than . Zero pieces may be omitted. The argument works in arbitrary Hilbert-space dimension and introduces no countable spectral resolution.
For a positive element the approximants can themselves be chosen positive. If and , instead use , . Now and ; the same differences and top projection sum to one. Their coefficients and are nonnegative, and the same interval bounds give
The zero positive element uses the zero sum. Thus every positive element is a norm limit of positive finite projection sums, the precise form used by LC and CT.
The upper panel shows the endpoint conventions proved in S01–S02. The lower panel shows the scalar example of S03: each half-open interval receives its lower endpoint coefficient, and receives coefficient one. The shaded difference is at most . These scalar diagrams explain the operator construction from continuous positive parts and range supports; the displayed norm estimate is proved for every bounded selfadjoint operator.
S04. Central cuts for a positive contraction
Let satisfy , and let be an integer. Apply S01 to , writing its projections as . Then
are central, mutually orthogonal, and sum to , because and . They satisfy
The first pieces have the exact half-open convention ; the final piece is the eigenspace at .
For the averaging argument, take , where is a projection and is a positive unital centre-valued trace. Positivity gives , so all these cuts apply. If is faithful and centre-linear, then the last piece has the additional property
The operator is positive, since is central. Faithfulness gives , or . The cuts themselves do not require faithfulness.
S05. Integer central ranks without a representation theorem
Let be a nonzero unital abelian -algebra, let , and let be a projection in . Its ordinary diagonal trace is
It is selfadjoint. The full character construction in T05a and CS01–CS06 supplies characters separating the elements of , and every character extends entrywise to a unital -homomorphism .
For each , the numerical matrix is a selfadjoint projection. Its trace is an integer between zero and . Here is the finite-dimensional argument. Apply Gram–Schmidt successively to its images of the standard basis vectors, discarding zero remainders, to obtain an orthonormal basis for its range. Do the same with the images under its complementary projection to obtain an orthonormal basis for its kernel. These two subspaces are orthogonal and together span . In the combined basis the projection has diagonal entries equal to one and the others zero. Its trace is unchanged by this basis change, since finite sums show , and hence . Thus
Put . Every character vanishes on , so character separation gives . This proves the spectrum assertion directly. If , the polynomial identity
gives
Consequently .
There is also an explicit decomposition into central rank pieces. For , let
These have real coefficients, so the are selfadjoint. For each character,
Applying character separation to each algebraic identity gives
Therefore
Some rank pieces may be zero. When , these are central projections in . If the already established matrix-corner trace formula is , they satisfy , exactly as needed by finite matrix averaging. This deduction uses that formula as a separate hypothesis; it does not establish the centre-valued trace or the alignment of equivalent projections. No normality of the characters is needed. If is the zero algebra, and the assertion is immediate, without characters.
S06. Projections determine bounded linear functionals
Let be bounded linear functionals agreeing on every projection. For , S03 gives finite projection combinations with . Linearity gives , and
Every is , a sum of two selfadjoint parts, so on .
For completeness, a positive complex-linear functional with is automatically bounded with norm one. Positive parts give for selfadjoint , and then . The sesquilinear form is positive. Put , , and . For every complex , positivity gives
If , take . If , take with ; then for every , forcing . These two cases prove
Set . Since ,
Thus , and evaluation at gives equality.
In particular, if is a tracial state and is positive and unital, then is also a positive unital scalar functional, hence has norm one. Agreement of and on projections implies agreement everywhere by S03 and the estimate
This estimate needs neither normality of nor a separately imported norm estimate for .
Constructing the normal center-valued trace
The proofs in this section use C05–C06, D10 and the support-based finite spectral approximation S01–S03. They do not presuppose a scalar trace on a general finite algebra.
Norm of a positive central map (CN). If a positive linear map has commutative unital C*-algebra range and , then .
Proof. For every character of , is a positive scalar functional. Its positive-form Cauchy–Schwarz inequality gives
The inequality is F08. Characters preserve positivity by CS04 and norm by CS05 of Regular-group operator foundations. Hence ; evaluation at the unit proves equality. The positive-form Cauchy–Schwarz argument, including its zero-denominator case, is the quotient argument in GNS.
Assembly on central components (CA). Suppose is an arbitrary orthogonal central partition of the unit, and each is normal and has norm at most . The componentwise map is bounded by and normal.
Proof. The strong orthogonal sum of the output components exists, with norm the supremum of their norms, by H00–H01 and the central product construction SUP in Hypertraces. It is linear and bounded. A series-vector normal test on is , with . Its -component has norm at most . Thus
The last inequality is Cauchy–Schwarz on the orthogonal coordinate families. These sums have countably many nonzero terms, even for an uncountable partition. Pulling each component test back by its normal map and normal central compression gives normal functionals on with summable norms. Their sum belongs to the norm-closed concrete predual H03, and equals . All normal tests on therefore pull back to normal tests on , which proves ultraweak continuity.
Figure 2. The central state, residual matching, finite comparison constant, monic copying and norm limit in NC–CT. The strict central inequalities are interpreted on their stated supports in LC. The argument follows the approximate-trace method in Peterson, Lemmas 6.4.8–6.4.9 and Theorem 6.4.10, with a separate construction of the finite constant in LC1.
A normal center-valued state (NC). Every concrete von Neumann algebra , with center , has a normal positive unital center-linear map .
Proof. SUP constructs an orthogonal central partition from the supports of normal vector states of . On each the corresponding vector state is faithful. To treat one component, write its unit as , choose the normalized vector , and put . Its vector state on is faithful, normal and tracial, because this algebra is abelian. The map identifies its trace Hilbert completion with . The full normal realization proof REP in Hypertraces applies to this faithful normal trace. In an abelian algebra its left and right multiplications coincide, so REP proves
and proves that and its inverse are normal. This invocation of REP uses only its preceding scalar, Hilbert-space and predual constructions, and no center-valued trace theorem.
Let be the projection onto . The subspace reduces , so commutes with it. If , the compression commutes with , and hence belongs to . Define
Compression is positive, unital and normal by H03's series-vector tests. The inverse is a normal *-isomorphism, so this map is positive, unital and normal. Commutation with proves . CN gives its norm one. Assemble these maps by CA. Their componentwise positivity, unit value and center-linearity survive assembly. The zero algebra uses its zero map.
An almost tracial corner (LC). Let be finite, let be a normal center-valued state, and let . There is a nonzero projection such that is faithful on and
Proof. Choose a maximal orthogonal family of projections with , and set . Normality gives . The restriction of to is faithful: a nonzero positive element of weight zero has a nonzero positive spectral threshold projection of weight zero in that corner, contradicting maximality. The threshold projection and its lower order bound are supplied by S01–S03. Center-linearity also shows that, for a nonzero projection , the central support of the positive element is . Indeed a central cut of vanishes exactly when that cut of vanishes, by faithfulness.
We first obtain a finite comparison constant. Fix a real . Choose a maximal family of pairs of equivalent nonzero subprojections of , with each family separately orthogonal, such that is positive with support their common central support. Such families are ordered by inclusion; unions of chains give upper bounds, so Zorn applies. Put
Orthogonal additivity of equivalence and finite-complement matching give . Also : otherwise normality would give , which is impossible. Hence .
For every , with ,
If this failed, the support of the positive part of would give a nonzero central cut on which the inequality is strictly reversed. The equivalent cut projections would extend the maximal family. Their common support is exactly this cut, since it lies under . This proves (LC1).
Let be the infimum of all nonnegative real constants satisfying (LC1) on these residual corners. It is finite, at most , and its defining inequalities hold at the infimum because the positive cone is norm closed. It is positive: the full equivalent pair gives , and both weights are nonzero. Since , there are equivalent , for which . Cut by the support of the positive part of , replacing by . On this central corner
means a positive element with support . All the upper inequalities for equivalent subprojections remain valid after this cut.
Now choose a maximal separately orthogonal family of equivalent nonzero subprojections of , respectively, satisfying on their common central support. Set
They are equivalent by finite-complement matching: transport one sum by an equivalence , then match its complement in the finite corner. If , summing the inequalities would give , contradicting (LC2). Thus . For equivalent , , the first residual bound and the second maximality give
For the second inequality, a nonzero support of the positive part of would provide another admissible central-cut pair. This is again forbidden by maximality.
If are equivalent, transport through an equivalence to obtain equivalent to both. Applying (LC3) to and gives
For a unitary , positive finite spectral sums consequently satisfy . S03's positive spectral sums converge in norm to every ; boundedness CN and closedness of the positive cone preserve the inequality. Finally the polar partial isometry of extends to a unitary of this finite corner by finite-complement matching. Thus , giving (LC). Faithfulness holds because .
A normal almost trace on the whole finite algebra (NA). For every , a finite von Neumann algebra has a normal center-valued state satisfying for all .
Proof. Apply NC and LC with . The monic-decomposition lemma supplies a nonzero monic , so (LC) holds on . Choose equivalent orthogonal copies summing to their central unit , and partial isometries with , . On , define
This is positive, normal and center-linear. Its unit value is , whose support is . For , put . Since ,
Choose with nonzero central threshold . S01 gives , so its inverse exists by the continuous calculus. The map , , is a normal center-valued state on that component, and retains (NA1). Normality of multiplication by follows directly from H03. Positivity follows because the two central factors commute. Center-linearity and prove the unit and central identity conditions.
This construction works in every nonzero remaining central corner of . Zorn therefore gives a maximal orthogonal family of central corners with such maps, and their sum is one: a nonzero remainder would provide another corner. CA assembles them to the required normal center-valued state, whose norm is one by CN. The zero algebra is immediate.
The normal center-valued trace (CT). A finite von Neumann algebra has a unique normal positive unital center-linear tracial map . It has norm one when the algebra is nonzero and is faithful.
Proof. Choose real numbers decreasing to one and normal almost traces supplied by NA. For a monic projection , take equivalent copies , , summing to the central support . The almost-trace inequality applied to their implementing partial isometries gives both and . For , consequently,
Every projection is an orthogonal sum of monic projections. Applying the normal maps to its increasing net of finite sums proves that is nonnegative on every projection. Positive norm spectral approximation S03 then makes it a positive map on all positive elements. Its unit value is , so CN gives
Thus the maps converge in operator norm to a bounded linear map . Positivity, unitality and center-linearity pass to the limit. For every normal functional on , in norm. The concrete predual of is norm closed by H03, so is normal. This proves normality of .
Passing to the limit in the almost-trace inequalities gives . Replacing by gives equality. Polarization of the sesquilinear expression , whose diagonal is now zero, proves ; hence for arbitrary .
For a monic as above, traciality makes the 's equal, and their sum is ; therefore . This forces the value of any normal center-valued trace on all monic projections, on their orthogonal sums by normality, and on every selfadjoint element by S03. Linearity proves uniqueness on . It also proves faithfulness: every nonzero projection contains a nonzero monic projection, whose trace is nonzero; every nonzero positive element dominates a positive scalar multiple of a nonzero threshold projection. Finally CN gives the norm assertion.
Trace detects comparison. For projections in a finite algebra, if and only if . The forward implication is positivity and traciality. For the reverse, comparison supplies a central cut on which , with the reverse subequivalence on its complement. On that complement choose a copy of . The trace inequality makes , and faithfulness forces . Assemble the central equivalences. In particular equal center-valued traces imply equivalence, and finite-complement matching extends its partial isometry to a unitary.
S07. The two trace-factorization applications
For the normal-trace application, suppose that the centre-valued trace and the orthogonal decomposition of projections into monic projections have already been supplied. If is monic, let be equivalent orthogonal copies of summing to a central projection . A partial isometry witnessing the equivalence has and . Traciality gives and . Their sums are and , the latter because is centre-linear and unital. Consequently
Thus . For an orthogonal monic decomposition , the net , over finite subsets , increases strongly to . The normality clauses give and ; the latter uses normality of and of restricted to the centre. Equality for every finite sum therefore gives equality on . S06 then gives on all of .
For the application to an arbitrary tracial state, suppose the finite averaging construction gives, for each projection and each dyadic , a finite average of unitary conjugates with
Traciality gives , so applying the norm-one functional yields . Letting dyadic increase proves agreement on projections, and S06 gives on all of , without normality. S04 provides precisely the finite central thresholds used in that averaging construction, and S05 provides its matrix rank pieces. The existence and faithfulness of the centre-valued trace, the monic decomposition, projection comparison, finite complements, and the dyadic matrix averaging construction remain their respective hypotheses and providers.
Reading
Jesse Peterson, Notes on operator algebras, dated April 27, 2020. Projection comparison and complement methods appear in Lemma 5.1.5, Proposition 5.1.9, Theorem 5.1.10 and Propositions 5.2.7–5.2.8, pp.84–90. The finite homogeneous construction is related to Proposition 5.4.2, p.95; the halving and monic methods are Lemmas 6.4.1–6.4.3 and Proposition 6.4.4, pp.102–103. The approximate center-trace method is Lemmas 6.4.8–6.4.9 and Theorem 6.4.10, pp.104–106. Here LC1 constructs a finite uniform comparison constant before its infimum is taken. CN proves the positive-map norm estimate for arbitrary elements; NA1 gives both different quadratic products explicitly.
The earlier complete proof providers are Regular-group operator foundations, H00–H03, T04a and CS01–CS06, Infinite tensor products, F01–F08, and Hypertraces, GNS, COMPACT, REP and SUP. NC uses only the abelian faithful-trace instance of REP, whose proof precedes every center-valued trace application. The three diagrams are embedded as editable SVG in this lesson source.