Fullness, hypercentrality and ultrafilter corners
Written by GPT-6.1 Sol (OpenAI), Ultra, September 2026. Self-checked by the writing AI. New original text: public domain (CC0).
The central sequence algebra is finite, but need not be a factor. We now relate its size and commutativity to ordinary sequences. The crucial result is stronger than a single nonzero commutator: if this algebra is noncommutative, every nonzero corner is noncommutative. This gives type , with its center retained. For the hyperfinite factor we can go further and prove that the central sequence algebra is itself a factor.
Throughout Sections 1–4, is a factor with separable predual. We use the preceding lesson's notation and the symmetric faithful-state seminorm . The fullness theorem identifies closedness of with scalar-triviality of all bounded ordinary centralizing sequences. We also use finite von Neumann algebra type decomposition: a finite algebra has no type I part exactly when it has no nonzero abelian projection. Its general halving theorem applies without a separable-predual assumption on that finite algebra. These are selected projection-type inputs, with earlier prerequisites declared.
1. Ordinary and ultrafilter witnesses
Let consist of bounded sequences centralizing in the ordinary sense:
Let consist of those sequences approaching bounded scalars strong*. Define their hypercentral subspace by
Use the same definition with ultralimits to obtain . The inclusions are
There are two distinct selection operations. An ordinary nonvanishing witness can be restricted to an increasing subsequence on which it remains uniformly nonvanishing. An ultrafilter witness can be converted to an ordinary witness by choosing indices satisfying successively larger finite collections of commutator tests.
Lemma 1.1. Let be norm dense in the normal state space.
If and
there is an increasing sequence such that is ordinary centralizing and its squared scalar distance is at least . If and their commutator has positive limiting squared seminorm, the same selection makes both subsequences ordinary centralizing with a uniformly nonvanishing commutator.
Proof. For (4), intersect the -large scalar-distance set with the finitely many sets
That intersection belongs to , hence is infinite. Choose in it. For a pair include the corresponding tests for and the commutator lower bound instead. Every fixed state commutator tends to zero on the selected subsequence. Uniform boundedness and norm density extend this to all normal functionals.
The scalar normalization in (4) detects triviality. If strong*, Cauchy–Schwarz gives ; thus strong*. The converse is immediate.
2. Fullness is independent of the ultrafilter
Theorem 2.1. The following are equivalent:
- is full.
- for some free ultrafilter.
- for every free ultrafilter.
- for some free ultrafilter.
- for every free ultrafilter.
Proof. The quotient characterization equates the corresponding sequence and algebra statements. If is full but an ultrafilter sequence is not trivial, its quotient has positive distance from the scalar ; equivalently (4) is positive. Lemma 1.1 gives an ordinary nontrivial centralizing sequence, contradicting the preceding fullness theorem.
Conversely, if is not full, that theorem gives . Its faithful-state scalar distance has positive limsup. Select an ordinary subsequence along which the squared distance is at least a fixed . This subsequence remains centralizing and is nontrivial along every free ultrafilter. Hence none of its central sequence algebras is scalar.
This criterion retains the scalar-trivial space ; fullness does not mean that every centralizing sequence converges to zero.
3. Hypercentrality is also independent of the ultrafilter
Theorem 3.1. The following are equivalent:
- .
- for some free ultrafilter.
- for every free ultrafilter.
- is commutative for some free ultrafilter.
- is commutative for every free ultrafilter.
Furthermore,
Proof. The commutator of two centralizing sequences is centralizing, and its quotient is their quotient commutator. The zero ideal characterization gives (6) and the equivalence of the respective sequence and algebra conditions.
If two ultrafilter-centralizing sequences have a nonzero quotient commutator, its limiting squared faithful-state seminorm is positive. The pair version of Lemma 1.1 makes them ordinary centralizing sequences with a nonvanishing commutator. Thus ordinary universal hypercentrality implies every ultrafilter version.
If ordinary universal hypercentrality fails, choose a pair in whose commutator does not tend strong* to zero. Along a synchronous subsequence its squared seminorm is bounded below by a positive constant. The two restricted sequences remain ordinary centralizing, so their commutator survives every free ultrafilter. Thus no ultrafilter version can be commutative.
Being commutative is a weaker conclusion than being scalar. Theorem 2.1 and Theorem 3.1 deliberately keep these two tests separate.
4. Moving a commutator into every corner
Theorem 4.1. If is noncommutative, it has no nonzero abelian projection. Consequently it is type . The conclusion describes its type and does not assert trivial center.
Proof. Theorem 3.1 supplies bounded ordinary centralizing sequences with
Put and
Both and have scalar ultraweak limit .
Fix a nonzero projection . By exact projection lifting, choose representing it. Let . Since , the set where belongs to . Replace by outside that set, preserving its representative and centralizing property. Thus we may assume the bound holds at every coordinate.
For each fixed , ordinary centrality gives and strong*. Their differences are bounded strong*-null sequences, hence belong to the zero ideal along . Multiplication by a centralizing sequence preserves that ideal. Fixed multiplication by also preserves strong* convergence. Expanding the commutator therefore gives, as ,
Also strong*, so compressing either side of gives the same limit. Consequently
For example, the first expression differs by a vanishing scalar from , whose limit follows by pairing the scalar ultraweak limit of with the fixed normal functional . This also explains why both halves of the symmetric seminorm are controlled.
For each , choose so large, within the relevant -large finite-test sets, that
The second choice is possible by (9)–(10), whose limit is at least . The first is possible because are ordinary centralizing.
The reindexed sequences are ordinary centralizing by the first line of (11). Multiplying them on both sides by gives centralizing sequences along . Their images lie in , and their commutator has positive quotient -norm by the second line. Thus every nonzero corner is noncommutative.
A projection is abelian precisely when its corner is commutative. There are therefore no nonzero abelian projections. The finite type decomposition eliminates the type I part; the faithful normalized trace makes the remaining type type .
By the general projection-halving input, such an algebra contains a unital two-by-two matrix unit system, even if its predual is nonseparable or its center is nontrivial. The next lesson uses the exact lifts of that system.
5. The center of the hyperfinite central sequence algebra
Let
Its normalized trace is , and is the remaining tensor tail, itself a factor. Let be the compact-unitary average onto . For any bounded centralizing sequence ,
ordinarily or along , as appropriate, for each fixed . Indeed, expand tail averaging using the finitely many matrix units of ; its difference from the identity is a finite sum of fixed multiples of commutators. Centrality and bounded strong* convergence give (13).
Lemma 5.1. If is a finite factor with faithful normalized trace and , there is a unitary such that
Proof. Take the ultraweakly closed convex hull of the bounded unitary orbit of . It is compact. The -norm is ultraweakly lower semicontinuous: it is the supremum of its scalar pairings against bounded trace vectors of -norm at most one. Thus has a point of least -norm. Strict Hilbert-space convexity and trace faithfulness make it unique. Unitary conjugation preserves and the -norm, so this point is central, hence scalar. Every point of has trace zero by normality, so that scalar is zero.
If (14) failed for every unitary, the entire orbit would lie in the -ball of radius centered at , and so would , by convexity and the same lower semicontinuity. But and its distance from is . This is impossible unless , when every unitary works.
Theorem 5.2. Every ordinary hypercentral sequence in is scalar-trivial. For every free ultrafilter, is a factor of type .
Proof. First suppose an ordinary centralizing sequence is not scalar-trivial. Select increasing indices with
This is possible because scalar distance has positive limsup and (13) holds for each fixed . Put . It is trace zero, and choose satisfying (14). Then
Define a unitary sequence on the original indices by putting and elsewhere. For every fixed , these unitaries eventually commute with : the exceptional finitely many with cause no asymptotic problem. Bounded -norm density of the finite stages extends centrality to all of . In a finite algebra centrality and centralizing coincide. But (16) stays positive on the selected indices. Thus the original is not hypercentral, proving .
Now let be a central quotient element that is not scalar. After subtracting the scalar representative , assume and . For each , choose nested -large sets on which
This uses (13) and the quotient -norm limit. Let be the largest with , and set if there is none. Then .
When , put and choose there by (14); otherwise put . For each fixed , commutes with on the -large set where . Finite-stage -density gives centrality along , and the finite-algebra commutator estimate gives centralizing. On ,
Its ultralimit is at least . This contradicts centrality of in the quotient. Hence .
Finally, the matrix units in the individual tensor legs of (12) are ordinary centralizing sequences: they commute with every fixed finite initial stage and are uniformly bounded. They give a unital in every , so these algebras are noncommutative. Theorem 4.1 gives type , now with the trivial center just proved.
6. Exercises with complete solutions
Exercise 1. In Lemma 1.1, explain why the selected indices may be increasing.
Solution. Each finite-test intersection belongs to a free ultrafilter, hence is infinite. Removing the finite set leaves another member of the ultrafilter. Choose in that remainder. This also ensures no fixed original coordinate is reused indefinitely.
Exercise 2. For bounded scalar sequences , compute the quotient image and decide whether they contradict fullness.
Solution. Their quotient image is . They are scalar-trivial, whether or not they converge ordinarily. Fullness requires that all centralizing sequences be equivalent to such scalar sequences, so they satisfy its criterion.
Exercise 3. Prove that ordinary nonhypercentrality produces noncommutative quotient algebras for every free ultrafilter.
Solution. Choose a centralizing pair whose commutator seminorm has positive limsup. Restrict both to the same increasing subsequence on which the squared seminorm is at least . Both remain centralizing in the ordinary sense. Along any free ultrafilter their quotient commutator has squared -norm at least , so that quotient is noncommutative.
Exercise 4. Why is a fixed noncommuting pair insufficient by itself to prove that a finite algebra is type ?
Solution. The finite algebra has noncommuting elements in its first summand, yet the projection onto its second summand is abelian. Theorem 4.1 excludes every nonzero abelian corner by constructing a new commutator inside each chosen corner. Merely having one nonzero commutator would not exclude a type I summand.
Exercise 5. In (10), identify the normal functional that tests the scalar limit of .
Solution. For fixed , it is . Fixed multiplication and normality of make it normal. Pairing ultraweakly with gives the limit . The projection is fixed while this particular -limit is taken.
Exercise 6. Explain why the positive lower bound on may be imposed at all coordinates.
Solution. The set belongs to . Replace by outside . The original and altered sequences agree on , so their difference has zero ultralimit in every seminorm and their quotient images agree. Every centralizing limit also agrees because the commutator sequences agree on .
Exercise 7. Give an example of a finite type algebra with nontrivial center.
Solution. , with product of Lebesgue integration and the normalized trace of , is finite and has only type II fibers. Its center is . Thus “type ” alone does not imply “factor.” This example illustrates the type distinction; it is not an assertion that this particular algebra occurs as a central sequence algebra.
Exercise 8. In Lemma 5.1, prove uniqueness of the point of least -norm.
Solution. If distinct had equal minimum norm , the parallelogram identity would give . Trace faithfulness makes . The midpoint lies in the convex set , a contradiction.
Exercise 9. Verify that the sequence inserted at selected indices in (16) is central.
Solution. Fix . For with , ; elsewhere . Only the finitely many selected indices with are exceptions. If , approximate it in -norm by a bounded finite-stage element . The bound , together with eventual commutation with , proves centrality. Finite trace then gives centralizing.
Exercise 10. Derive the constant in (18).
Solution. Let . Then . The unitary chosen by (14) moves by at least . Replacing by on both sides loses at most . The final lower bound is , as claimed.
References
The free sources are Dusa McDuff, On the structure of II₁-factors, Russian Mathematical Surveys 25(6) (1970), Lemmas 1.1–1.4 and Theorem 1.1, printed pp.32–35 (PDF pp.4–7); and Alain Connes, Outer conjugacy classes of automorphisms of factors, Theorem 2.2.1, implication (d) ⇒ (e), printed pp.400–401 (PDF pp.19–20).
McDuff works with separable finite factors and the tracial 2-norm. In Theorem 1.1 she proves part (iii), leaving parts (i) and (ii) to a similar argument. Here both ordinary and ultrafilter selections are written out, with the faithful-state seminorms needed for arbitrary factors. The corner argument follows Connes's method and keeps the center: noncommutativity gives type II₁, without asserting factoriality. The hyperfinite tensor-tail argument separately proves triviality of its central sequence algebra's center. The preceding fullness theorem, finite type decomposition and projection halving remain declared inputs whose free prerequisite closure is not yet complete.