Centrally trivial automorphisms and decreasing AFD factors
Written by GPT-6.1 Sol (OpenAI), Ultra, September 2026. Author self-checked relative to the stated prerequisites; not independently reviewed. New original text: public domain (CC0).
The absorption theorem characterized strong stability by noncommuting central sequences. We complete its group-theoretic characterization, then show that the hyperfinite factor has no outer automorphism acting trivially on central sequences. Finally, a locally finite group action constructs decreasing irreducible hyperfinite subfactors with scalar intersection.
For Sections 1–3, is a factor with separable predual. Its automorphism group carries the -topology from the fullness lesson. Closure of always means closure in that topology. We use that lesson's complete strong* unitary metric and continuous group operations, the preceding hypercentrality/absorption proofs, the finite outer-action theorem, and the explicitly constructed finite matrix averages. Outer quotients below are used as abstract groups; no closedness of is assumed.
1. Central triviality and two fixed states
An automorphism is centrally trivial if
for every bounded ordinary centralizing sequence . Denote these automorphisms by .
This is a normal subgroup of . For composition, apply one fixed automorphism to the other's vanishing difference and then add its own difference. For inverses, apply (1) to the centralizing sequence . For normality, apply (1) to , then apply . Automorphisms preserve centralizing sequences by their normal predual commutator identity. Every inner automorphism is centrally trivial by centrality with its fixed implementing unitary.
If are unitaries, then
Indeed, multiplying the functional commutator by identifies its norm with , using the isometry of precomposition by an automorphism.
Lemma 1.1. If , finitely many normal states , and are given, there is a neighborhood of the identity such that
where .
Proof. Otherwise, in successively smaller members of a countable neighborhood basis choose implementing unitaries violating at least one bound. Their inner automorphisms tend to the identity. By (2) they form a centralizing sequence, so (1) makes every displayed seminorm tend to zero. This contradicts the violation.
Theorem 1.2. In , the images of and commute.
Proof. Fix , , and a faithful normal state . Put
For , use Lemma 1.1 to obtain neighborhoods controlling both states in (4). Choose nested neighborhoods of such that
and, for every ,
Also make shrink to in a countable neighborhood basis. Group continuity and the definition of the -topology permit these choices.
Choose . Put
Then , so . The successive difference has the exact form
Left multiplication by a unitary preserves the one-sided -seminorm. Right multiplication changes its state. Accordingly the square norm in (8) is tested by , which differs from by less than , by (6). Since
has norm at most , (3), (6) and (9) give
For adjoints, use
Its right multiplication changes the state to , controlled by . The same bound holds. Thus
The complete unitary metric proved earlier gives a strong* limit .
Strong* convergence of unitaries gives -convergence of their inner automorphisms: normal vector functionals are norm approximated by finite sums, and the transformed vectors converge in norm. Therefore
The commutator is inner, proving the assertion about outer classes.
2. Commutative central algebras force central triviality
Lemma 2.1. If all ordinary centralizing sequences are hypercentral, then for every and faithful normal state there are finitely many normal states , including , and such that
Proof. If no finite tests worked, use the first states of a norm-dense sequence, together with , and tolerance to choose contractions violating the last bound. Both sequences are centralizing by density and uniform boundedness. Their commutator fails to vanish strong*, contradicting universal hypercentrality.
Theorem 2.2. If is commutative for one free ultrafilter, then
Proof. The hypercentrality equivalences give the hypothesis of Lemma 2.1. Fix , take , and decrease its tolerance so that . Let be the identity neighborhood defined by for all tests. If and a contraction satisfies the tests, (14) gives . For , with ,
The state test for is essential in this right-multiplication estimate.
The same bound, with weak inequalities, holds for . Approximate such a by inner automorphisms eventually in the open set , and pass to the limit for the fixed . To justify this, -convergence of automorphisms implies pointwise strong* convergence: for fixed , expand . The square term is , and the cross terms test by fixed normal functionals. All converge to the corresponding -terms. The adjoint expansion is identical.
Now fix , and choose an inner automorphism such that . For a contraction centralizing sequence , its finite tests eventually hold, and
The first term tends strong* to zero, by centrality with the fixed . The second has symmetric seminorm at most , by (16) and its closure version. Taking limsup and then arbitrary proves central triviality; bounded sequences follow by scaling. Theorem 1.2 now makes the outer classes of any two approximately inner automorphisms commute. This is exactly the quotient conclusion in (15).
3. The complete group criterion for absorption
Theorem 3.1. For a factor with separable predual, strong stability is equivalent to noncommutativity of the abstract quotient group
Together with the preceding absorption theorem, this completes all four characterizations of strong stability.
Proof. If is not strongly stable, that theorem makes its central sequence algebras commutative. Theorem 2.2 then makes (18) abelian.
Conversely, write a strongly stable as , with a factor. The finite outer-action construction supplies an action of on , outer at every nonidentity element. Take the transpositions and ; their commutator is nonidentity. All automorphisms of are approximately inner, by the finite factor lesson. Hence
are approximately inner on . Tensoring approximating inner automorphisms preserves -convergence, by the norm density of elementary normal tensor functionals.
Their commutator is , and it is outer. If implemented by a unitary , that unitary would commute with . The spatial commutation theorem gives
Thus would implement on , contradicting its outerness. The two classes in (18) therefore do not commute. Transfer by the normal isomorphism proves the assertion for .
The characteristic group is
Its numerator is a normal subgroup and contains . Theorem 1.2 proves that this group is abelian.
4. A uniform displacement criterion in finite factors
In this section can be any factor, without a separability hypothesis. Let be its normalized trace.
Lemma 4.1. Let be a unital finite type I subfactor and . If satisfies
then is inner.
Proof. Let be the ultraweakly closed convex hull of , . These elements lie in the operator unit ball and the closed -ball of radius centered at . The latter is ultraweakly closed by lower semicontinuity, so . Its map into is weakly continuous on this bounded set. For bounded test vectors this follows from normality of ; arbitrary test vectors follow by approximation and the uniform -norm bound. Thus is weakly compact and convex in , hence norm closed. The Hilbert-space projection theorem gives a unique least-norm point , with because . This is the same convexity mechanism as the finite trace averaging lemma.
For , the map preserves , bijectively, and is a trace -isometry. It therefore fixes , yielding
The unitary identity extends to all by their linear span.
Choose a unitary implementing on . For completeness, if are matrix units and , their equal trace diagonal projections are equivalent. Choose from to ; then
is unitary and satisfies . Set ; it fixes pointwise and maps onto . Put . Equation (23) becomes
Expand in the matrix coordinates . At least one coefficient is nonzero, and each coefficient obeys . Since , this implies commutes with and commutes with . The relative commutant is a factor, so both are positive nonzero scalars, equal because their operator norms are equal. Thus is a unitary in , and
It also holds on , since fixes and commutes with it. These two algebras generate ; hence is inner. The adjoint in (26) follows directly from the intertwining equation.
Theorem 4.2. For the separable AFD factor ,
Every outer induces a nonidentity automorphism of , for every free ultrafilter.
Proof. Let be the increasing dyadic factors generating , and . If is outer, the contrapositive of Lemma 4.1 gives
Choose with displacement at least . For each fixed , choose close to in -norm. When , commutes with , so . The same estimate for adjoints proves centrality, and the finite tracial centrality criterion makes this an ordinary centralizing sequence. Its displacement never tends to zero, so is not centrally trivial. Inner automorphisms are centrally trivial by Section 1, proving the first equality in (27), and the definition (21) gives the second.
For every free , the quotient image of has -norm at least , so the induced automorphism is nonidentity. No conclusion about continuity of the homomorphism is needed.
5. Decreasing irreducible hyperfinite subfactors
Theorem 5.1. admits a decreasing sequence of AFD subfactors satisfying
Proof. Take a countably infinite locally finite group , where are increasing finite subgroups. Finitary permutations of , with the subgroups permuting the first points, are one example. Form
with identical copies of . The countable product is a separable AFD factor, hence isomorphic to . Use the left Bernoulli convention
On finite-support tensors it gives , and the trace GNS unitary extends it normally to .
Choose trace-zero unitaries in successive dyadic tensor legs of , and embed them as in the single coordinate of (30). Finite-stage density makes this an ordinary centralizing sequence in . For , its translate is supported on coordinate ; product trace gives
An inner automorphism would move a centralizing sequence by a strong*-vanishing difference, contradicting (32). Thus every nonidentity is outer.
Let denote the same identified dyadic factor in every coordinate. The finite matrix stages
increase and generate . For , left translation by permutes , so is invariant under that finite group. Put . The finite outer-action theorem gives and makes a factor. Its finite-dimensional fixed stages generate it: for , approximate in -norm by bounded , and average over . That average is a -contraction fixing , so the averaged approximants still converge to . Thus is separable AFD, and isomorphic to . Increasing groups make these fixed algebras decreasing.
Their intersection is . It is scalar. Indeed, finite-support operators have disjoint translated supports whenever lies outside a finite subset of , giving
If the supports are , the excluded set is . Bounded finite-stage -approximation and trace Cauchy–Schwarz extend (34) to
where means eventually outside each finite subset. The approximation error is uniform in , since all preserve the trace and the -norm. For a fixed with , take . The left side is the constant , while the right side is zero. Faithfulness gives . Thus the intersection is , proving (29) after a normal identification of with .
6. Exercises with complete solutions
Exercise 1. Prove normality of directly.
Solution. For a centralizing , the sequence is centralizing by the predual identity for automorphisms. If is centrally trivial, its difference on this sequence tends strong* to zero. Applying the fixed normal automorphism gives strong*. Hence the conjugate is centrally trivial.
Exercise 2. Derive (8) from (7).
Solution. From , one has . Subtract to obtain (8). Adjointing gives (11). These two identities determine which fixed state controls each seminorm.
Exercise 3. Explain why the two states in (4) are both needed.
Solution. The right factor in (8) is , changing the state to , whose limit is . The right factor in the adjoint difference (11) is , changing it to , whose limit is . Control of one seminorm alone would not prove strong* Cauchy convergence to a unitary.
Exercise 4. Show that the bound (12) gives a Cauchy sequence for the complete unitary metric.
Solution. For , the triangle inequality bounds the metric distance by . This tends to zero uniformly in . Completeness yields a unitary limit, which then implements the automorphism commutator in (13).
Exercise 5. In (16), identify the error caused by right multiplication.
Solution. With , the square of the first seminorm of is , while its adjoint seminorm has square . The first differs from by at most . The symmetric seminorm divides this error by two. Since , its contribution is at most .
Exercise 6. Verify that and have nonidentity commutator in .
Solution. Both are involutions, so their commutator is . With rightmost-first composition, , whose square is . Thus the commutator is nonidentity and the everywhere-outer action sends it to an outer automorphism.
Exercise 7. Why does innerness of imply innerness of when is a factor?
Solution. An implementing unitary must commute with every , because the automorphism fixes them. Equation (20) places it in . Its second coordinate unitary then implements . The factor hypothesis makes in that commutant calculation.
Exercise 8. In Lemma 4.1, explain why the least-norm intertwiner is nonzero.
Solution. The convex set lies in the ultraweakly closed -ball of radius around . Zero is at distance exactly , hence is outside . Its minimum-norm point therefore cannot be zero. Strict convexity gives uniqueness, allowing invariance of to produce the intertwining equation.
Exercise 9. Starting with and unitary , determine the implementing unitary and its adjoint.
Solution. Divide the equation by to get . Multiplication on the left by gives . Under , the implementer is . Thus , as in the proof.
Exercise 10. Show that any outer automorphism of acts nontrivially on every .
Solution. Choose in successive finite-head commutants as in (28), with . They are ordinary centralizing, hence centralizing along every free . Their quotient difference has -norm at least , so the induced automorphism cannot fix their quotient image.
Exercise 11. Verify (32) using the two distinct tensor coordinates.
Solution. Both translated and original unitaries have squared -norm . Their mixed trace is the product of their single-coordinate traces, both zero. Expanding the squared norm of their difference gives . Specifying trace-zero unitaries is necessary; scalar units would have zero displacement.
Exercise 12. Determine the finite exceptional set in the disjoint-support argument and prove the scalar fixed-point conclusion.
Solution. Translated support meets only if for some , that is, . Outside that finite set, tensor independence gives (34). Extend by -approximation as in (35). A trace-zero fixed operator then satisfies by taking . Trace faithfulness makes , so every fixed operator is scalar.
Reading and prerequisites
Alain Connes, Outer conjugacy classes of automorphisms of factors, Annales scientifiques de l’École Normale Supérieure, series 4, 8 (1975), 383–419. Lemma 2.2.2, printed p.402, gives the two-state telescoping method for central triviality and approximate innerness. Theorem 2.2.1 and its proof, printed pp.400–402, give the commutative-central-algebra implication and group criterion. The proofs here include the exact right-multiplication state changes, both adjoint seminorms, finite test quantifiers and the noncommuting outer action omitted from the source’s brief converse. The absorption implication in that paper cites Araki’s theorem; this course retains its earlier full absorption construction as a separate dependency.
Alain Connes, Periodic automorphisms of the hyperfinite factor of type II₁, Acta Scientiarum Mathematicarum 39 (1977), 39–66. Lemma 3.4 and its full proof, printed p.50 (PDF p.12), give the uniform displacement criterion in an arbitrary factor. Theorem 3.2(1), stated on printed p.49 and proved on pp.50–51 (PDF pp.11–13), constructs displaced central sequences for outer automorphisms of . Lemma 4.1 here includes the bounded convex-hull compactness, explicit finite matrix implementation, coefficient polar argument and implementing-unitary orientation. Theorem 4.2 uses fixed dyadic heads to prove its stated nonidentity conclusion for every free ultrafilter; the source additionally proves that the induced automorphism is outer, which is not asserted here.
Claire Anantharaman and Sorin Popa, An introduction to II₁ factors, author draft. Example 5.2.4, printed pp.69–70, gives Bernoulli mixing and outerness, with an infinite index and the inverse-index convention checked explicitly here. Exercise 5.11, printed p.81, supplies the finite crossed-product realization route expanded in the finite outer-action lesson. Section 5 above gives the full locally finite invariant stages, finite fixed factors and scalar intersection; it does not assume a decreasing-factor existence theorem. Sections 4 and 5 retain their own exact stated hypotheses. The ordinary-sequence, asymptotic-centralizer, full absorption, unitary topology and matrix foundations remain separately declared prerequisites, with accessible transitive verification pending.