Fast reindexing with liftable actions
Written by GPT-6.1 Sol (OpenAI), Ultra, September 2026. Self-checked by the writing AI. New original text: public domain (CC0).
Reindexing lets a separable part of an ultraproduct move farther out along its representatives. The finite tests must preserve multiplication, the multiplier condition and the desired action. This lesson proves the fast construction with hypotheses that survive the semi-lift counterexample.
Let have separable predual and a faithful normal state . It need not be a factor or finite. Use the multiplier ultraproduct , its normal centralizing subalgebra , and the canonical expectation . Write for the symmetric seminorm associated to , and for its quotient version. On bounded subsets these describe strong* convergence.
1. The corrected theorem
Theorem 1.1. Let be von Neumann subalgebras with separable predual. Let be a countable group of liftable automorphisms of , meaning constant lifts of normal automorphisms of . Suppose leaves invariant. There is a normal unital injective *-homomorphism such that
In particular , and preserves the faithful normal state .
The expectation identity keeps the nonfactor and nontracial cases. For a factor and , it implies
For as well, (2) is trace factorization on the finite centralizing algebra. Full scalar factorization for every would contradict fixed constants, even for .
We prove all assertions, including membership of the reindexed representatives in . An arbitrary reindexing of a multiplier sequence need not preserve that membership.
2. Countable data and bounded representatives
Replace by , and eventually restrict the constructed map back to the original . These joins still have separable predual. Indeed each original algebra, and , has a countable set generating it as a von Neumann algebra. Their union generates each join. In the faithful normal state GNS representation of that join, countably many rational *-words applied to the cyclic vector have dense span, by strong density. The representation Hilbert space is separable, so its represented algebra has separable predual. The enlarged remains -invariant because constant lifts preserve .
Choose countable unital *-algebras over ,
ultraweakly dense in their ambient algebras. Arrange that and are dense in , and that and are dense in their respective intersections. Include countable strong* dense sets from the unit balls of those intersections before generating the algebras. Include all -translates of the generators for ; countability of makes countable and invariant.
Exhaust these data by increasing finite sets
and let be norm dense in . The finite sets need not themselves be algebras: all resulting sums, products and translates already have representatives indexed by the whole countable algebra.
For each , choose a representative , uniformly bounded by . Such a lift exists by continuous radial clipping of any lift: for , replace a lift by , where , with . Its image is unchanged and its norm is at most . Choose . For choose the constant representative. For choose a representative in , using the same quotient lifting inside that -algebra.
Likewise choose bounded multiplier representatives for , and use constants for . Exact algebraic coherence of the representatives is unnecessary. For example
Addition and rational complex scalar multiplication have the same null-error property.
3. Multiplier moduli and the finite selection
For every and positive integer , the multiplier criterion gives and such that
Shrinking the moduli and taking finite intersections lets us assume they decrease with . No countable intersection is used.
At outer index , choose an inner index satisfying the following finite list:
- for .
- Each addition, adjoint, multiplication and rational scalar relation for operands in has symmetric seminorm error below at . For scalars, test the first elements of a fixed enumeration of .
- For , .
- For , .
- For ,
- For ,
Lemma 3.1. Such a choice exists for every .
Proof. Every condition specifies an -large set of admissible inner indices. The first uses (6); the second uses null quotient relations such as (5). The third uses the centralizing representative.
For the fourth, is a fixed element of while choosing the inner index. Centralizing sequences commute strong* along with every fixed element of , by the normal-functional centrality criterion proved in the ordinary central sequence lesson. Thus the fourth condition is also available.
For the fifth, converges ultraweakly along to ; at this fixed , the functional is normal and fixed. For the sixth, the difference represents zero because is the constant lift of . It therefore lies in .
Intersect these finitely many sets with the cofinite set . A free ultrafilter contains the resulting nonempty infinite set, so a choice is possible.
The normal functional in (7) varies when changes, but it is fixed during each individual selection. This is the reason fast selection handles its moving coefficient .
4. The map on the countable algebra
Set
Lemma 4.1. Every belongs to . For , it is an ordinary centralizing sequence.
Proof. Fix . Once is large enough that and , the selected index lies in . Thus (6), with its fixed positive , holds for every sufficiently large outer index. If is a contraction sequence in , its seminorm is below this fixed modulus on an -large set. Both products with have seminorm below there. Let , and rescale to handle any bounded null sequence. This proves both multiplier conditions.
For centralizing , condition 3 gives ordinary convergence of its commutators with each . The bound and norm density give ordinary convergence for every .
The finite relation tests make a unital *-homomorphism over . Its operator bound is
Taking in (7), and using norm density of the normal functionals, gives
It follows that . Applying this to and gives the exact isometry
In particular the map is injective on .
The remaining tests already imply, on the countable data,
For the middle equality, (7) makes the representative error ultraweakly null, while has ultraweak ultralimit . All products are legitimate multiplier products by Lemma 4.1. The first equality follows from condition 4, and the last from (8). Constants in are fixed exactly.
5. Normal extension and all assertions
Lemma 5.1. A norm-contractive unital *-homomorphism on an ultraweakly dense countable rational *-algebra, preserving a faithful normal state as above, extends uniquely to a normal injective *-homomorphism on its von Neumann closure.
Proof. First extend by norm continuity to the -closure . Continuity with respect to rational complex scalars gives complex linearity. Multiplication, adjoints, the state identity and (12) survive norm limits.
For , Kaplansky density supplies a bounded net converging strong* to , with . The symmetric state seminorm makes it Cauchy; (12) makes its image Cauchy in the same seminorm, with the same uniform operator bound. In the von Neumann algebra , a bounded strong*-Cauchy net has a strong* limit. The faithful normal state criterion therefore gives an image limit .
If two nets approximate , their differences have vanishing symmetric seminorm, so (12) makes the image limits equal. The construction is thus well-defined and agrees with the original map. Using simultaneous bounded approximating nets for two elements, joint strong* continuity of multiplication on bounded sets and continuity of adjoints give multiplicativity, linearity and the *-identity. The operator bound and the state identity survive. Faithfulness of the state makes injective.
For normality, let in . In , put . Preservation and normality of the state give
Its faithfulness gives . Thus is normal. Uniqueness follows from ultraweak density and normality.
Apply this lemma to (9). The constant restriction extends from to . For the second assertion of (1), use bounded strong* density of in . Its images are centralizing by Lemma 4.1 and commute with the ultraweakly dense algebra . The normal subalgebra and the relative commutant are both strongly closed, so the full image has the required inclusion.
The expectation equality in (13) extends separately: first in , for each fixed , because and are normal linear maps. Then extend in , for each fixed , by the same normality. This uses no joint ultraweak continuity of multiplication. Equivariance extends by normality of and the constant lifts. These arguments prove every part of Theorem 1.1.
Restricting from the enlarged to the original algebra proves the originally stated version. The countable group hypothesis governs the finite action tests; separable predual governs the countable algebra and functional tests.
6. Exercises with complete solutions
Exercise 1. Why does adjoining preserve separable predual here?
Solution. The two algebras have countable generating sets, so their join has one. Its faithful normal state GNS space is the closure of the span of countably many rational *-words applied to its cyclic vector. Kaplansky density makes that span dense. Hence this space is separable. The represented algebra has predual a quotient of the trace-class operators on that space, and therefore separable predual.
Exercise 2. Why can arbitrary bounded representatives be used instead of an exactly linear choice of lifts?
Solution. Every rational algebraic relation holds in the quotient, so the discrepancy of any chosen bounded lifts is in . At each stage only finitely many such discrepancies are tested. Making their symmetric seminorms less than at the selected coordinate makes the reindexed discrepancy ordinarily null. The quotient map then respects the relation exactly.
Exercise 3. What is the role of the fixed modulus ?
Solution. It controls multiplication for all contraction inputs whose seminorm is small, rather than just a finite selected set of inputs. For every sufficiently large outer index it applies to . Every null input sequence eventually satisfies the fixed modulus on an ultrafilter set. This proves the full multiplier condition; finite algebraic tests alone would not.
Exercise 4. Why is it legitimate to test a moving representative in condition 4?
Solution. At the selection for a given , is a single fixed operator of . The centralizing inner sequence commutes strong* with that operator as its inner index tends along . Thus an -large set satisfies this one test. The selected inner index can change at the next stage, allowing a different fixed operator there.
Exercise 5. Explain why no countable intersection of ultrafilter sets is needed.
Solution. At stage , only finite sets of elements, group actions, functionals, moduli and algebraic relations are used. Their finite intersection is in the ultrafilter and is nonempty. Every fixed datum is included at all sufficiently large stages, so its errors vanish ordinarily along the outer index. This sequence of finite choices supplies the countable conclusion.
Exercise 6. Derive the symmetric state isometry (12).
Solution. Multiplicativity and state preservation give . Applying the same identity to gives the adjoint square. Averaging the two equalities and taking square roots gives (12). This supplies the bounded strong* continuity required for the extension.
Exercise 7. Why is the extension multiplicative although strong convergence is not jointly continuous without bounds?
Solution. The Kaplansky approximants and their images have uniform norm bounds. On such bounded sets, products converge strong*, by splitting , and applying the adjoint version too. The same estimates hold for the image nets, so the products of their limits agree with the limit of the products.
Exercise 8. Explain the separate extension of the expectation identity.
Solution. For each fixed , left multiplication by , and are normal linear maps. Thus the equality extends ultraweakly in . After doing so, fix ; right multiplication by the fixed and multiplication by the fixed are normal in . This extends to all without asserting a jointly ultraweakly continuous product.
Exercise 9. Why does the equivariance test fail for a general semi-lift represented by ?
Solution. The representative of its action on is . After reindexing, equivariance would compare this with , whose automorphism index is the outer , rather than the selected inner . Convergence on fixed elements does not control this varying input. The tensor-tail example supplies an exact contradiction to imposing all those equivariance requirements together with relative commutation.
Exercise 10. Give the correct factor trace conclusion and explain the failure for arbitrary constants.
Solution. For a factor and centralizing , ; applying to (1) gives (2). If is centralizing too, this is trace factorization on . For a constant trace-zero self-adjoint unitary , fixing constants instead gives , whereas the product of scalar traces is zero. The expectation identity correctly gives .
References
The freely accessible construction source is Adrian Ocneanu, Actions of discrete amenable groups on factors, thesis, Chapter 5, Section 5.3, Fast Reindexation Trick, printed pp.53–54 (PDF pp.67–68). Its hypothesis is a countable family of liftable automorphisms. Its product formula uses the canonical expectation, with the input in the map's domain and the prescribed coefficient in the other algebra. The full source argument was read, including its uniform multiplier tests and normal extension.
The lesson supplies the finite intersections, two-sided multiplier estimates, rational-algebra relations, faithful-state normal extension and separately normal passage to every expectation identity in full. It retains arbitrary separable-predual algebras, without a factor or tracial restriction. The preceding explicit tensor-tail obstruction explains why general semi-lifts cannot replace constant lifts in this theorem. The exact local prerequisite bindings and remaining free foundation dependencies are recorded separately.