Exact matrix averages and complete tracial product inputs
Programme exposition: CC0-1.0 to the extent of rights held. Human-source terms remain separate.
The tensor-absorption lesson needs a finite matrix average, two kinds of normal limit map, and the entire tracial product for varying matrix sizes. These constructions retain arbitrary centers; a factor assumption will be used only where it is explicitly specified.
The complete earlier inputs are CF's calculus and Hilbert constructions, CP preduals, BD bounded density, STC for an already normal state, ST1–2 for its faithful normal image and inverse, NT1–2, PC/FCT, AF1–5, and CQ2's full trace representation. Inner products are linear in the second variable.
SS0. Coordinates, a finite unitary average and the full numerical bound
Let be a von Neumann algebra containing unital matrix units , . Put and . The Hilbert-space map
is unitary. The summands are isometric with mutually orthogonal ranges, and those ranges fill because . It carries the scalar matrix units to the given .
Writing , compression gives
Indeed the entry of is , and every matrix of entries in is obtained from . An element commutes with all matrix units exactly when this matrix is , . Thus compression identifies with , with inverse
These are normal maps on their entire domains by CP's fixed-multiplier and finite-vector-coordinate tests. Unitary conjugation is normal by the same vector-pair substitution. Consequently multiplication identifies normally with the concrete spatial product .
In the original algebra the full coordinates are
Under , is the diagonal amplification of . Hence
This bound does not come from summing separate norm estimates. The coefficient of , , is ; the matrix products and adjoints therefore give the claimed full algebra isomorphism.
Define the finite formula
It is the normalized matrix trace on the first leg of SS0.2, times the identity on . To realize it as a finite unitary average, let , , and let for a permutation of . Both are unitary. Averaging over all signs kills each off-diagonal entry: flipping just its first sign pairs cancelling terms. Averaging the surviving diagonals over permutations distributes each to every diagonal position equally, with occurrences at each position. Thus
This includes , where the map is the identity. No existence or integration theorem for Haar measure is a premise.
The finite multiplier formula proves normality and complete positivity at every matrix level. It is unital, has range , fixes , and is a -bimodule map. It is faithful: for , vanishing of the sum in SS0.4 makes every positive summand zero. In particular , so for every ; their sum gives . NT1's unital positive-map bound gives norm contraction. A faithful normal tracial state, when given, is preserved by the finite formula, and its Schwarz inequality gives trace -norm contraction.
The numerical bounds follow from the finite matrix-unit formula itself. With the normal-functional convention , expansion gives
These identities hold for every ; its entries need not commute with one another. Since , taking the supremum over the operator unit ball gives
For a faithful normal tracial state, the trace law and positive order prove the right-multiplier estimate
Apply it to , then use the second identity and the triangle inequality. Thus both complete bounds are
They imply the bounds in the lesson because . The coefficient calculation in Exercise 2 gives that stated factor as well. All assertions apply to every positive finite matrix size, including , when the two defects are zero.
SS1. Trace-preserving positive maps are normal on the whole domain
Let be nonzero finite von Neumann algebras with faithful normal normalized traces . If a bounded positive map satisfies
then is ultraweakly continuous on its entire domain. Neither algebra has to be a factor or have separable predual.
First prove a domination fact. If a positive bounded functional on satisfies , , on the positive cone, it is normal. At it is zero. Otherwise its sesquilinear form on the trace Hilbert vectors is bounded:
CF's full Hilbert Riesz construction gives with . The identity makes on dense vectors, hence everywhere. Thus commutes with the represented algebra, as does its continuous positive square root. Therefore
STC and ST1–2 apply because the trace used for this representation was already normal and faithful. CP now makes SS1.2 a normal functional on the original .
For , the normal positive functional satisfies . To check this for , use the trace law and . The span of these functionals is norm dense in . CP expresses each normal functional as a summable vector-pair series in the faithful normal trace representation. Truncate the series and approximate its finitely many vectors by ; the operator-norm coefficient bound controls the predual error. These bounded-vector pairings are linear combinations of the positive , by the exact complex polarization identity
The identity follows by expanding all four terms and cancelling the two geometric scalar sums.
For each , positivity and SS1.1 give
The domination fact makes it normal. Norm approximation and then make every , , normal, because CP proves norm closedness of . This is exactly whole-domain ultraweak continuity. In particular a trace-preserving star isomorphism and its inverse are normal by applying this argument in both directions.
We also need completeness of bounded trace balls. The trace -norm has the scalar formula
proved by scalar Schwarz and at nonzero . It is consequently ultraweakly lower semicontinuous. For a trace-Cauchy sequence of operator-norm contractions, CP/CF's compact unit ball gives an ultraweak ultrafilter limit in that ball. For each fixed sequence index , apply the scalar formula to its difference from this limit:
The Cauchy tails make the right side arbitrarily small for all sufficiently large . Thus the sequence converges in trace norm inside the same ball. Scaling handles every fixed operator-norm bound. Arbitrary Cauchy nets are covered by metric completeness: choose a sequence of increasingly late indices beyond the successive Cauchy thresholds, dominating the previously chosen indices, and then use the triangle inequality to compare every sufficiently late net element with that sequence's limit. No countable cofinal subset is assumed.
Finally NT2 makes bounded trace -convergence intrinsic strong* convergence. Hence a uniformly bounded sequence of completely positive maps with pointwise trace-Cauchy values has a linear unital completely positive limit if the original maps were unital. Entrywise bounded strong convergence preserves positive matrices by testing all their vector quadratic forms. Trace preservation passes to the limit by scalar Schwarz. SS1.1 then proves whole-domain normality of that limit. This supplies the finite-trace summability proof without an unproved general order-normality criterion.
SS2. The tracial product for every sequence of finite matrix sizes
Let be integers. Embed
by unit padding, with the consistent product of normalized matrix traces. Finite tensor matrix units explicitly identify with the displayed full matrix algebra; matrix entries show their multiplication, adjoints and unit sum. The normalized trace is the product trace on elementary tensors.
On the algebraic local union , complete the inner product to , with vector . Positivity and faithfulness on any finite collection follow in a containing full matrix stage. Left and right multiplication by a local are bounded by , using positive order and that stage's trace law, and have the expected adjoints. They commute. The finite trace version of CQ2's spectral argument proves that each local left representation is isometric. Let be its norm closure and .
The vector is cyclic. It is separating for because the bounded right local multipliers commute with that whole bicommutant and their orbit of is dense. Its vector state is normal by CP. It is tracial on the local union, hence on by norm continuity, and on the whole bicommutant by CQ2's two normal-functional extensions using BD. Separation makes it faithful. The isometry trace argument makes finite.
AF1's complete finite-dimensional trace projection gives a normal trace-preserving conditional expectation . In the trace Hilbert space it is exactly the orthogonal projection onto : its explicit matrix coefficients satisfy the trace pairings with every matrix unit. The union of these finite subspaces is dense by the construction of , so
If is central, bimodularity makes central in the full matrix algebra , so it is the scalar . Faithfulness and SS2.1 make that scalar. Thus is a factor.
Its Hilbert space is separable: finite rational complex matrix combinations in countably many finite stages are a countable dense set. CP's summable vector-pair predual construction then gives a separable predual, by truncating the series and approximating each vector from a countable dense Hilbert set.
If infinitely many , then . This factor has no minimal projection. If a nonzero minimal had trace , choose with . A diagonal cell of has trace . FCT7 comparison would place a nonzero copy under , with trace strictly between zero and , contradicting minimality. PC4 and FH1's full-center type criterion therefore make it type . The increasing full matrix stages are strongly dense by definition and BD; it is AFD. AF5's entire finite AFD uniqueness theorem identifies it normally with .
If only finitely many sizes are nontrivial, the unit-padded union is a single finite matrix algebra. Its whole closure remains that algebra. If every size is one, the product is . These are the exact boundary cases; summability by itself does not change them.
For later use, for every finite : the same construction with sizes gives its faithful product trace representation and increasing matrix stages, and AF5 applies. Also . Interleave its two dyadic strings. On the finite local trace vectors this reindexing preserves all inner products, so it extends to a unitary between their whole trace Hilbert completions. It intertwines the local algebras and their BD closures. STC/ST1–2 identifies the given faithful normal trace representations; CP makes conjugation normal in both directions. Thus the interleaving is a whole normal von Neumann algebra isomorphism.
SS3. A faithful normal product state supplies the spatial splitting
Let be commuting unital von Neumann subalgebras, with . Suppose faithful normal states satisfy
Then multiplication gives a normal spatial isomorphism . No factor or tracial hypothesis is assumed.
STC and ST1–2 give faithful normal GNS representations, with whole-domain normal inverses onto their concrete images, because these states are already normal. On the dense product vectors define
For two such vectors, commutation and SS3.1 give
For the Hilbert tensor construction itself, expand the first-leg vectors of any finite tensor sum in an orthonormal basis of their finite-dimensional span. Its squared norm is the sum of the squared norms of the resulting second-leg coefficients. This proves positivity and nondegeneracy of the elementary product inner product. CF's Hilbert completion gives the whole tensor space. Applying this expansion in each leg separately proves the bounds for the two tensor leg actions and their adjoints. Expanding SS3.1 on finite sums now proves isometry and that respects every null vector relation.
The map is onto. Products span a unital star algebra because the two legs commute, and its generated von Neumann algebra is . BD gives bounded strong approximation by its norm closure; norm approximation of each of those approximants by products then makes the product vectors dense in , hence in the cyclic GNS Hilbert space. Thus extends to a unitary. On dense vectors it intertwines each leg action with that action in . Taking their complete von Neumann closures gives the spatial product, carried onto the whole represented . Unitary conjugation is normal by CP's entire vector-pair-series substitution, and the faithful normal GNS identifications have normal inverses. This proves the asserted whole spatial isomorphism.
The normal states needed in the nontracial summability proof can be supplied from its given dense normal-state family. If is such a family, is a normalized normal state by predual norm completeness. It is faithful: a nonzero positive operator is detected by a positive normal vector state; norm density gives some detecting it, and its strictly positive coefficient gives . Composing it with a faithful normal conditional expectation gives the required faithful normal state . The summability argument must prove that expectation's faithfulness and generation; SS3.1 does not assume them without that proof.
SS4. A stable factor that does not absorb
Let . For each positive finite integer , finite matrix coordinates identify with : every operator on the finite direct sum of copies of is exactly its finite matrix of bounded -operators. The basis bijection , , gives a Hilbert unitary . Conjugation therefore gives a normal isomorphism onto , with normal inverse by CP. This is stability for every , including one.
The algebra is a factor: commuting with each rank-one diagonal and off-diagonal matrix unit forces every operator in its center to be one common scalar on the basis, and boundedness extends that scalar action to all vectors. Its predual is separable by CP's trace-class/vector-pair model on the separable . The normal state is faithful, since a positive operator annihilating all its basis square masses is zero.
CQ6's complete rank-one/minimal-projection argument consequently gives for every free ultrafilter. The absorption equivalence in the main lesson rules out strong stability. This supplies the specified example at its full finite amplification and scalar quotient scope.
Combining the finite and infinite constructions
The main summability theorems construct the limit expectations, prove faithfulness from their converging tails, establish generation by the two commuting algebras, and prove the normal product-state identity needed by SS3. Finite-head quotient removal then lets each exact coordinate lift be taken inside the preceding head's relative commutant. These constructions combine SS0–4 into the full tensor-absorption argument.