Central sequence algebras and exact lifts
Written by GPT-6.1 Sol (OpenAI), Ultra. Course exposition: CC0-1.0 to the extent of rights held. Comparison sources retain their own terms.
Matrix units require exact equations: two diagonal projections must be orthogonal, and a connecting partial isometry must have the prescribed initial and final projections. A limit can make those equations exact while every coordinate still has an error. This lesson explains how to repair the coordinates without changing their limit.
We first examine the two repairs that will be needed: moving finite trace mass, and making room at infinite endpoints. We then construct the limiting algebra, lift one projection, prove completeness of its trace metric, and assemble the repaired matrix units. Every repair retains the prescribed quotient class, including systems whose support is smaller than the identity.
Our setting is a nonzero factor with separable predual, a faithful normal state , and a free ultrafilter on . The complete quotient and lifting inputs prove CQ1–7. The preceding central-sequence lesson proves the passage from predual commutators to bounded strong* centrality; NT1–2 proves the normal-functional and faithful-state topology facts used below.
Two coordinate repairs to keep in view
Finite cancellation concerns a finite removed subpiece. CQ4 proves it even when the containing endpoints are infinite. Removing an infinite subpiece requires a different argument.
Exercise 6. Use the unilateral shift on , with and , to exhibit equivalent whole projections and equivalent subprojections whose complements are not equivalent. Explain the role of the infinite-piece removal in the lifting proof.
Solution. Set , , and . The identity gives , and gives . The complements are and . A partial isometry with zero initial projection is zero, so it cannot have the nonzero final projection . Thus cancellation fails for this infinite . In Theorem 5.1 we remove a small infinite projection from the initial support of an approximate partial isometry. Its image is removed at the other end as well. Both remaining endpoint defects then contain an infinite projection, and CQ5 proves that they are equivalent. The removal is small in both state seminorms, so it does not alter the quotient element.
Exercise 7. A partition in a type factor has traces and . Give an exact equal-trace partition and compute the squared trace -norm of each change.
Solution. CQ7's trace-cut construction supplies with . Put and . Because is in the second original cell, these are orthogonal projections and their sum remains . Their traces are and . The respective differences are and , whose squares are both . Consequently both squared changes are exactly . FCT7 makes the corrected cells equivalent.
Exercise 8. Let be equivalent orthogonal projections and let . For , check the products, adjoints, diagonal entries, and total support, allowing a support smaller than .
Solution. Write . If , then ; for it equals . Hence
Taking adjoints gives . Also , so the sum of the diagonal entries is , exactly the support initially specified. Nothing in the calculation requires that support to be the identity.
Which scalar does the limiting algebra remember?
A free ultrafilter contains every cofinite set, is closed under supersets and finite intersections, excludes the empty set and every finite set, and chooses exactly one of for each subset . Convergence along it means
Lemma 1.1. Every sequence in a compact Hausdorff space has a unique -limit. A sequence converges ordinarily to if and only if its limit along every free ultrafilter is .
Proof. For , let be the closure of the values indexed by . Every finite intersection of the contains the values indexed by the corresponding nonempty finite intersection of index sets. Compactness therefore gives a common point . If an open neighborhood of had index set outside , its complementary index set would lie in , and its closed value set would be contained in the closed complement of . That would exclude , a contradiction. Hausdorff separation supplies disjoint neighborhoods for distinct points, and an ultrafilter cannot contain their disjoint index sets. This proves uniqueness.
An ordinary limit has the stated ultralimit because every required set is cofinite. For the converse, if is not the ordinary limit, choose a neighborhood with infinitely many indices . The filter generated by and the cofinite sets is proper: every basic finite intersection still contains infinitely many points of . Ordered by inclusion, its proper filter extensions have upper bounds given by unions of chains. Choice in CF/PC0 supplies a maximal proper extension. If neither nor belonged to it, adjoining would fail only if a filter member were disjoint from , which would force into the filter. Thus the maximal extension chooses one of every complementary pair and is an ultrafilter. It cannot contain a finite set because it contains that set's cofinite complement. Its compact-space limit lies outside , since its -value closure lies there. This contradicts the asserted common limit of all free ultrafilters.
Scalar disks are compact Hausdorff. For bounded scalars the limit operation is linear, multiplicative and compatible with conjugation: intersect the finitely many sets on which each scalar is close to its limit, and use their common bounds for products.
Exercise 1. For , determine all free-ultrafilter limits and decide ordinary convergence.
Solution. Exactly one parity class belongs to the ultrafilter. Membership of the even class makes the sequence identically on an ultrafilter-large set; membership of the odd class makes it identically there. These are the only limits. Both parity classes are infinite and can be used as in the proper-filter extension proved above, so both limits occur. Since the even and odd ordinary subsequences have distinct limits, the original sequence does not converge ordinarily.
Exercise 2. Can one specified ultrafilter limit recover the limsup of every bounded real sequence? Establish the relation to both liminf and limsup.
Solution. The sequence in Exercise 1 has limsup , while an ultrafilter containing the odd indices gives limit . This disproves the proposed recovery. In general, for every , eventually every term is above and below . Those two eventual index sets are cofinite and belong to every free ultrafilter. Their scalar limit consequently lies between those two bounds. Let decrease to zero. The resulting interval contains every ultralimit; a given ultrafilter need not select either endpoint.
Use the normal-functional actions
Our sequence algebra is
Coordinate multiplication, adjoints and the supremum norm make a complete C* algebra: a norm Cauchy sequence has coordinate norm limits with uniform bounds, and the uniform Cauchy estimate proves convergence in the supremum norm.
The subalgebra contains the unit and is norm closed. Products obey
NT1 bounds the functional module actions by the operator norm. For adjoints, putting gives . Finally a uniform perturbation of size changes any commutator norm by at most . These observations prove all the asserted algebra and closure properties.
NT2 identifies bounded strong* convergence with vanishing of
The preceding lesson's complete normal-commutator argument uses only finite estimates; applying them on ultrafilter-large sets proves
for every sequence in (3).
Proposition 2.1. The ultraweak -limit of a sequence is a scalar. Denote that scalar by . This is a normalized trace on .
Proof. A bounded ball in is ultraweakly compact. In the complete CP/CF construction this is the closed set of linear, uniformly norm-bounded coordinate assignments in the product of compact scalar disks indexed by ; CP identifies those assignments with elements of . It is Hausdorff because the predual separates operators. Lemma 1.1 therefore supplies an ultraweak ultralimit .
For fixed , the two normal pairings and have the same limit by (3). Thus for every ; separation puts in . This defines . Scalar pairings establish its linearity and normalization; positive coordinate sequences have positive limits because every positive normal functional is nonnegative on them.
For two centralizing sequences , choose any normal state . Then
Both products are in (3) and have scalar limits, so their -limits are their scalar values. Equality proves the trace law.
Define
The trace law and the ultraweak limits of the two square sequences give
Thus is the trace-square null space. It is a linear closed star ideal: scalar Schwarz gives the triangle inequality for the trace square norm, its operator-norm bound proves closure, and positivity and the trace law give
This proves two-sidedness inside . We have made no ideal assertion for strong*-zero sequences in the full bounded sequence algebra.
A bounded strong*-zero perturbation preserves centralizing. For a positive normal functional, the full positive-functional Schwarz estimate gives
NT1's four-positive-functional decomposition treats every normal functional. The uniform bound on the perturbation is part of this assertion.
CQ1 now constructs the C* quotient, including its norm and continuous calculus:
The trace descends because Schwarz annihilates its null ideal. It is faithful there by (9), normalized because the unit is not null, and tracial because products descend. Write .
Exercise 3. Suppose strongly*, where is bounded. Identify the represented scalar and explain what would happen if the quotient discarded every scalar-trivial sequence.
Solution. Let . A scalar sequence tending to zero tends strongly* to zero, since both state square seminorms are its squared absolute value. Therefore
Its image in (11) is . In particular the scalar-trivial space is
This space contains the unit. An ideal containing all of it would contain the unit and hence every element, making the quotient zero. The quotient by instead retains the scalar unit. Although is the preimage of a scalar subalgebra, it is generally not an ideal.
Repair one projection before completing the trace metric
The C* quotient already permits projection lifting; its von Neumann completeness is not a premise of this repair. CQ1's quotient calculus also gives a contraction lift of every quotient contraction. For any representative , use
This is a coordinate contraction by the positive calculus. Its quotient image is unchanged because the square of the quotient contraction has spectrum in , where .
Lemma 4.1. Every projection has a representing sequence of projections . If already has a projection representative and , the lift can be chosen with .
Proof. Lift to contractions , and set . The positive contractions represent , so . With the bounded spectral calculus supplied by SC8–9, set
The scalar bound is
Squaring, applying the spectral calculus, and then the positive state gives
The difference is self-adjoint and bounded; (5) makes it strong*-zero. Equation (10) shows that the new projections are centralizing, and their quotient class remains .
For the specified support, first compress the contraction lift to . Coordinate compression keeps its norm at most one, and its image is . Its square lies in . Since the cutoff function vanishes at zero, its spectral projection vanishes on , so the lifted projection is at most at every coordinate.
Exercise 4. Check (20) on both intervals and at , then derive the squared state estimate (21).
Solution. On , the left side is , and . On , it is , whose ratio to is . At and both sides are zero. At the included cutoff point , they are both . All quantities are nonnegative, so squaring preserves the pointwise inequality. The complete bounded calculus preserves that order for , and the positive functional preserves it again. The resulting estimate is exactly (21), including the squared factor .
A countable diagonal supplies completeness; the trace supplies normality
Theorem 3.1. is a finite von Neumann algebra, with faithful normal tracial state . Every induces a normal trace-preserving automorphism
The map is a group homomorphism.
Proof. We first prove that the operator-norm unit ball of (11) is complete for its trace metric. From a Cauchy sequence choose a subsequence such that
Lift each to coordinate contractions using (14). Separability of gives a countable norm-dense family in its normal state space; subspaces of a separable metric space are separable, for example by selecting one point in each nonempty basic ball. NT1's four-positive-functional decomposition makes tests on all these states sufficient for tests on every normal functional.
For each , impose the following finite tests on a set :
The first tests follow from centralizing. For the second, (9) identifies their squared ultralimits with the distances in (15), which are strictly below the displayed bounds. Intersect these finitely many large sets with and the cofinite set ; take . This constructs nested without requiring any countable intersection.
At coordinate , let be the largest for which , or zero if none exists. Define , with . For fixed , membership in implies , so . Each fixed state test in the first line of (16) therefore vanishes. The bound gives ; norm density and positive decomposition show .
Fix . On the large set where , the second line bounds the distance to by . Taking the square ultralimit and using (9) yields
The subsequence converges in the quotient unit ball, and the original Cauchy sequence converges to the same element by the triangle inequality.
CQ2 constructs the isometric trace Hilbert representation; CQ3 uses this complete metric ball and bounded density to identify it with its entire bicommutant. Its vector trace is faithful and normal there, and the trace law makes the algebra finite. The key extension from the cyclic vector to its dense right-multiplier orbit is
CQ3 explicitly treats arbitrary Cauchy nets, so sequential metric completeness is sufficient. No separability or factor property of the resulting is inferred.
For a normal automorphism of , the functional identity is
Its norm and normal-functional pullback preserve (3). Pulling back each normal positive functional proves preservation of bounded strong*-zero sequences, and the same argument applies to . Thus is preserved and (13) defines an invertible star homomorphism of the quotient. Scalar ultraweak limits are preserved under the normal map , so it preserves the trace.
For whole-domain normality apply CQ3: the trace-preserving map implements the unitary in the trace Hilbert space. Conjugation by this unitary pulls every square-summable CP vector-pair functional back to another such functional. It is therefore ultraweakly continuous on its entire domain, as is its inverse. Composing the coordinate maps proves , including the identity and inverse.
Exercise 5. Justify in this diagonal argument using individual finite-threshold sets.
Solution. Given any integer , the already constructed set lies in . For one has , and is one of the permissible candidates in the finite maximum defining . Thus . Closure under supersets makes the latter set large. This holds for each fixed , which is precisely convergence to infinity along the ultrafilter. The construction nowhere uses largeness of , a property that free ultrafilters do not have in general.
Exercise 9. Prove that an inner automorphism induces the identity on , and identify why its implementer must be fixed.
Solution. If for one fixed unitary , equation (6) applied to gives strongly*. The fixed multiplication topology from CP/ST then gives
Both representatives belong to , so their difference is in , and (13) fixes their quotient element. A varying unitary is not one of the fixed tests in (6). Neither that estimate nor continuity of multiplication by a single fixed operator proves the analogous varying-implementer assertion.
Fill the endpoint defects
Theorem 5.1. Let be projection sequences in , with for every . Suppose satisfies
There are partial isometries , centralizing along , such that
Proof. Lift to contractions and compress to . Both products stay centralizing and the image remains . For the bounded polar decomposition , put
The quotient identities say and . Both are positive coordinate contractions. The same spectral calculus as in the projection repair gives
For the first inequality the spectral values below obey , and the other values give zero on the left. The final-support version uses the polar transport of the nonzero spectrum; at the remaining kernel it has the same bound. The two difference-square estimates use on ; at the zero polar support the difference is zero. Taking , bounded strong*-zero convergence makes the right sides tend to zero. Projection differences and both squares of are therefore small. In particular is centralizing by (10) and represents .
At coordinates with finite , CQ4 gives , using the assumed . That argument works for finite or infinite endpoints and includes .
At coordinates with infinite , use CQ5 with and the normal positive functional to obtain an infinite projection such that
Set
Then contains , and contains ; both are infinite and are equivalent by CQ5. The removed operator has the two square masses exactly shown in (26). Its strong*-zero removal preserves the representative , and the new endpoint defects still tend strongly* to zero. In the finite case use .
Choose a partial isometry between the equivalent remaining defects. Its initial and final projections are those defects, so
Thus is a bounded strong*-zero sequence. Its initial and final supports are orthogonal to the respective supports of , so has exactly the endpoints in (23). It represents , and (10) proves it centralizing.
Assemble the finite system, retaining its support
Theorem 6.1. Every finite partition by orthogonal projections in has an exact projection-partition representative in . If the are equivalent, the coordinate projections can be chosen equivalent. Every finite system of matrix units in has an exact centralizing system of coordinate matrix units, including a system whose support is smaller than .
Proof. For an arbitrary partition, lift its first cell by Lemma 4.1, its second cell inside the complementary coordinate projections, and each later cell inside the remaining complements. Use the final remainder for the last cell. Orthogonality and the sum to now hold at every coordinate; the quotient of the last remainder is the last prescribed cell. This works for and zero cells as well. Within a previously lifted support , the same finite induction gives an exact partition of .
Consider next equivalent cells with nonzero total support . Since , the set is large. Off , replace and the first cell by and all other cells by zero. Every change is supported off an ultrafilter-large set, so all its normal-functional and strong* tests have zero ultralimit. The new support is nonzero at each coordinate.
If is a type factor, its normalized trace is normal by the complete FCT construction. Proposition 2.1 evaluated against identifies quotient trace values with scalar coordinate trace ultralimits. The quotient cells have equal trace, so
Apply CQ7's donor-and-deficit construction inside . It gives equivalent exact cells of trace , retaining the sum , with the complete error identity
NT2 transports bounded trace convergence to strong* convergence for the original faithful state; (10) preserves the centralizing quotient classes.
If is infinite, apply CQ7's infinite-support construction. A finite nonzero coordinate support can acquire an infinite projection from its complement of -mass below . Then one infinite cell can donate small infinite pieces to the other cells while keeping an infinite remainder. All corrected cells are infinite and equivalent by CQ5. The total state square error is at most ; it vanishes strongly* and preserves the classes. For an initial support no support enlargement occurs, so the corrected support stays exactly .
There is also the minimal-projection case, without a matrix-factor classification premise. CQ6, using the scalar ultraweak limit from Proposition 2.1 and (6), shows that for any factor with a minimal projection, hence for every type I factor. A nonzero equivalent orthogonal quotient partition of size cannot exist in this scalar algebra. The size-one case is precisely Lemma 4.1. The finite factors without a minimal projection are the type case just handled. These cases cover the whole factor setting.
Finally let be the specified finite matrix system and . If , all are zero since ; use the zero coordinate system. Otherwise lift and balance the diagonal partition as above. The corrected coordinate endpoints are equivalent at every coordinate, so Theorem 5.1 lifts each to with initial support and final support . Choose , and put
Exercise 8's full calculation proves all matrix-unit products and adjoints. Centralizing is preserved under these products, their images are , and their diagonal sum is the corrected support . In the unital case this support is exactly ; in the nonunital case it still represents .
Exercise 10. contains matrix units, including infinitely many when is infinite-dimensional. Why does not contradict this, and what prevents a varying centralizing sequence from leaving a nonscalar class?
Solution. A fixed matrix unit gives a constant bounded sequence, but constancy alone does not satisfy (3). If a constant sequence does satisfy (3), its commutators with all normal functionals vanish identically; the separation argument of Proposition 2.1 makes the fixed operator central and hence scalar in . Thus the original matrix units are not automatically quotient matrix units.
For a varying bounded sequence, let project onto a basis vector . The scalar ultraweak limit is , and (6) supplies the rank-one commutator test
Apply the same formula to adjoints. Uniform boundedness extends it from finite linear combinations of basis vectors to every vector, giving strong*-zero distance from . The finite-dimensional case uses the finite basis and has the same conclusion. The lifting theorem starts with matrix units already in the quotient; the scalar quotient has no nonzero system of size greater than one to lift.
Free proofs and method comparisons
The quotient norm, faithful trace representation, whole-domain normality, finite cancellation, small infinite pieces, minimal-projection test and partition error are proved in CQ1–7. Their complete earlier inputs are the retained CF, CP, SC, BD, PC, FCT, NT and AF arguments, with their existing notices. This supplies the construction before any appeal to an external ultraproduct theorem.
Alain Connes, Outer conjugacy classes of automorphisms of factors, Propositions 1.1.1–1.1.3 and Lemmas 1.1.4–1.1.5, printed pp.387–390 (PDF pp.6–9), is the historical free comparison for the scalar trace and exact repairs. Proposition 1.1.1 recalls an earlier result rather than proving completeness there. Proposition 1.1.3(b) explicitly requires equivalent coordinate endpoints. Its proof removes small pieces at both infinite endpoints; our repair instead removes a piece and its image from the polar partial isometry, controlling both state masses. We use a fixed cutoff , prove finite-subpiece cancellation through a finite join, and retain every nonunital matrix support.
Adrian Ocneanu, Actions of discrete amenable groups on factors, Chapter 5, Section 5.1, printed pp.47–50 (PDF pp.61–64), proves completeness and normality for the normalizer ultraproduct and its centralizing subalgebra. The objects there are distinguished: the normalizer quotient is larger. Our proof constructs only the centralizing quotient, using its tracial metric and predual tests, and obtains normal automorphisms by their trace Hilbert unitaries.
Hiroshi Ando and Uffe Haagerup, Ultraproducts of von Neumann algebras, v3, Section 3.1 and Propositions 3.14–3.15, gives the complementary normalizer/corner construction. Its hereditary-subalgebra and modular prerequisites are not premises of the proofs here. The mathematical comparisons use the actual free editions; no external source prose or figure is reproduced.