Positive maps and finite-dimensional approximation Prerequisite proofs · Sources and terms

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, MM is a factor with separable predual. Its automorphism group carries the uu-topology from the fullness lesson. Closure of Int⁡(M)\operatorname{Int}(M) 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 Int⁡(M)\operatorname{Int}(M) is assumed.

1. Central triviality and two fixed states

An automorphism θ\theta is centrally trivial if

θ(xn)−xn⟶0strong*(1)\theta(x_n)-x_n\longrightarrow0\quad\text{strong*} \tag{1}

for every bounded ordinary centralizing sequence xnx_n. Denote these automorphisms by Cnt⁡(M)\operatorname{Cnt}(M).

This is a normal subgroup of Aut⁡(M)\operatorname{Aut}(M). 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 θ−1(xn)\theta^{-1}(x_n). For normality, apply (1) to γ−1(xn)\gamma^{-1}(x_n), then apply γ\gamma. Automorphisms preserve centralizing sequences by their normal predual commutator identity. Every inner automorphism is centrally trivial by centrality with its fixed implementing unitary.

If unu_n are unitaries, then

Ad⁡(un)→id⁡ in the u-topology⟺∥[un,ψ]∥→0(ψ∈M∗).(2)\operatorname{Ad}(u_n)\to\operatorname{id}\text{ in the }u\text{-topology} \quad\Longleftrightarrow\quad \|[u_n,\psi]\|\to0\quad(\psi\in M_*). \tag{2}

Indeed, multiplying the functional commutator by un∗u_n^* identifies its norm with ∥ψ∘Ad⁡(un)−ψ∥\|\psi\circ\operatorname{Ad}(u_n)-\psi\|, using the isometry of precomposition by an automorphism.

Lemma 1.1. If θ∈Cnt⁡(M)\theta\in\operatorname{Cnt}(M), finitely many normal states σj\sigma_j, and ε>0\varepsilon>0 are given, there is a neighborhood VV of the identity such that

Ad⁡(u)∈V⟹∥θ(u)−u∥σj<εfor all j,(3)\operatorname{Ad}(u)\in V \quad\Longrightarrow\quad \|\theta(u)-u\|_{\sigma_j}<\varepsilon \quad\text{for all }j, \tag{3}

where ∥a∥σ=σ(a∗a)1/2\|a\|_\sigma=\sigma(a^*a)^{1/2}.

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. □\square

Theorem 1.2. In Out⁡(M)\operatorname{Out}(M), the images of Int⁡(M)‾\overline{\operatorname{Int}(M)} and Cnt⁡(M)\operatorname{Cnt}(M) commute.

Proof. Fix α∈Int⁡(M)‾\alpha\in\overline{\operatorname{Int}(M)}, θ∈Cnt⁡(M)\theta\in\operatorname{Cnt}(M), and a faithful normal state φ\varphi. Put

σ1=φ∘α−1,σ2=φ∘θ∘α−1∘θ−1.(4)\sigma_1=\varphi\circ\alpha^{-1},\qquad \sigma_2=\varphi\circ\theta\circ\alpha^{-1}\circ\theta^{-1}. \tag{4}

For εn=2−n\varepsilon_n=2^{-n}, use Lemma 1.1 to obtain neighborhoods VnV_n controlling both states in (4). Choose nested neighborhoods WnW_n of α\alpha such that

WnWn−1⊂Vn(5)W_nW_n^{-1}\subset V_n \tag{5}

and, for every β∈Wn\beta\in W_n,

∥φ∘β−1−σ1∥<4−n,∥φ∘θ∘β−1∘θ−1−σ2∥<4−n.(6)\begin{aligned} \|\varphi\circ\beta^{-1}-\sigma_1\|&<4^{-n},\\ \|\varphi\circ\theta\circ\beta^{-1}\circ\theta^{-1}-\sigma_2\|&<4^{-n}. \end{aligned} \tag{6}

Also make WnW_n shrink to α\alpha in a countable neighborhood basis. Group continuity and the definition of the uu-topology permit these choices.

Choose αn=Ad⁡(un)∈Wn\alpha_n=\operatorname{Ad}(u_n)\in W_n. Put

vn=un+1un∗,wn=un∗θ(un).(7)v_n=u_{n+1}u_n^*,\qquad w_n=u_n^*\theta(u_n). \tag{7}

Then Ad⁡(vn)=αn+1αn−1∈Vn\operatorname{Ad}(v_n)=\alpha_{n+1}\alpha_n^{-1}\in V_n, so ∥θ(vn)−vn∥σi<2−n\|\theta(v_n)-v_n\|_{\sigma_i}<2^{-n}. The successive difference has the exact form

wn+1−wn=un∗(vn∗θ(vn)−1)θ(un).(8)w_{n+1}-w_n =u_n^*(v_n^*\theta(v_n)-1)\theta(u_n). \tag{8}

Left multiplication by a unitary preserves the one-sided φ\varphi-seminorm. Right multiplication changes its state. Accordingly the square norm in (8) is tested by φ∘Ad⁡(θ(un)∗)\varphi\circ\operatorname{Ad}(\theta(u_n)^*), which differs from σ2\sigma_2 by less than 4−n4^{-n}, by (6). Since

vn∗θ(vn)−1=vn∗(θ(vn)−vn)(9)v_n^*\theta(v_n)-1=v_n^*(\theta(v_n)-v_n) \tag{9}

has norm at most 22, (3), (6) and (9) give

∥wn+1−wn∥φ2≤4−n+4⋅4−n=5⋅4−n.(10)\|w_{n+1}-w_n\|_\varphi^2 \le4^{-n}+4\cdot4^{-n}=5\cdot4^{-n}. \tag{10}

For adjoints, use

wn+1∗−wn∗=θ(un)∗(θ(vn)∗vn−1)un.(11)w_{n+1}^*-w_n^* =\theta(u_n)^*(\theta(v_n)^*v_n-1)u_n. \tag{11}

Its right multiplication changes the state to φ∘Ad⁡(un∗)\varphi\circ\operatorname{Ad}(u_n^*), controlled by σ1\sigma_1. The same bound holds. Thus

∥wn+1−wn∥φ+∥wn+1∗−wn∗∥φ≤25 2−n.(12)\|w_{n+1}-w_n\|_\varphi+ \|w_{n+1}^*-w_n^*\|_\varphi \le2\sqrt5\,2^{-n}. \tag{12}

The complete unitary metric proved earlier gives a strong* limit w∈U(M)w\in\mathcal U(M).

Strong* convergence of unitaries gives uu-convergence of their inner automorphisms: normal vector functionals are norm approximated by finite sums, and the transformed vectors converge in norm. Therefore

Ad⁡(w)=lim⁡nAd⁡(wn)=lim⁡nαn−1θαnθ−1=α−1θαθ−1.(13)\operatorname{Ad}(w) =\lim_n\operatorname{Ad}(w_n) =\lim_n\alpha_n^{-1}\theta\alpha_n\theta^{-1} =\alpha^{-1}\theta\alpha\theta^{-1}. \tag{13}

The commutator is inner, proving the assertion about outer classes. □\square

2. Commutative central algebras force central triviality

Lemma 2.1. If all ordinary centralizing sequences are hypercentral, then for every η>0\eta>0 and faithful normal state φ\varphi there are finitely many normal states ψj\psi_j, including φ\varphi, and δ>0\delta>0 such that

∥x∥,∥y∥≤1,∥[x,ψj]∥,∥[y,ψj]∥<δfor every j⟹∥[x,y]∥φ,#<η.(14)\begin{gathered} \|x\|,\|y\|\le1,\qquad \|[x,\psi_j]\|,\|[y,\psi_j]\|<\delta\quad\text{for every }j\\ \Longrightarrow\quad \|[x,y]\|_{\varphi,\#}<\eta. \end{gathered} \tag{14}

Proof. If no finite tests worked, use the first nn states of a norm-dense sequence, together with φ\varphi, and tolerance 1/n1/n to choose contractions xn,ynx_n,y_n violating the last bound. Both sequences are centralizing by density and uniform boundedness. Their commutator fails to vanish strong*, contradicting universal hypercentrality. □\square

Theorem 2.2. If MωM_\omega is commutative for one free ultrafilter, then

Int⁡(M)‾⊂Cnt⁡(M),Int⁡(M)‾/Int⁡(M) is abelian.(15)\overline{\operatorname{Int}(M)}\subset\operatorname{Cnt}(M), \qquad \overline{\operatorname{Int}(M)}/\operatorname{Int}(M) \text{ is abelian}. \tag{15}

Proof. The hypercentrality equivalences give the hypothesis of Lemma 2.1. Fix ε>0\varepsilon>0, take η=ε/2\eta=\varepsilon/\sqrt2, and decrease its tolerance so that δ≤ε2/4\delta\le\varepsilon^2/4. Let VV be the identity neighborhood defined by ∥ψj∘β−ψj∥<δ\|\psi_j\circ\beta-\psi_j\|<\delta for all tests. If β=Ad⁡(u)∈V\beta=\operatorname{Ad}(u)\in V and a contraction xx satisfies the tests, (14) gives ∥[u,x]∥φ,#<η\|[u,x]\|_{\varphi,\#}<\eta. For z=[u,x]z=[u,x], with ∥z∥≤2\|z\|\le2,

∥β(x)−x∥φ,#2=12φ(uz∗zu∗)+12φ(zz∗)≤∥z∥φ,#2+12∥φ∘β−φ∥∥z∥2≤η2+2δ≤ε2.(16)\begin{aligned} \|\beta(x)-x\|_{\varphi,\#}^2 &=\tfrac12\varphi(uz^*zu^*)+\tfrac12\varphi(zz^*)\\ &\le\|z\|_{\varphi,\#}^2+ \tfrac12\|\varphi\circ\beta-\varphi\|\|z\|^2\\ &\le\eta^2+2\delta\le\varepsilon^2. \end{aligned} \tag{16}

The state test for φ\varphi is essential in this right-multiplication estimate.

The same bound, with weak inequalities, holds for β∈Int⁡(M)‾∩V\beta\in\overline{\operatorname{Int}(M)}\cap V. Approximate such a β\beta by inner automorphisms eventually in the open set VV, and pass to the limit for the fixed xx. To justify this, uu-convergence of automorphisms implies pointwise strong* convergence: for fixed xx, expand φ((βn(x)−β(x))∗(βn(x)−β(x)))\varphi((\beta_n(x)-\beta(x))^*(\beta_n(x)-\beta(x))). The square term is φ(βn(x∗x))\varphi(\beta_n(x^*x)), and the cross terms test βn(x)\beta_n(x) by fixed normal functionals. All converge to the corresponding β\beta-terms. The adjoint expansion is identical.

Now fix θ∈Int⁡(M)‾\theta\in\overline{\operatorname{Int}(M)}, and choose an inner automorphism Ad⁡(w)\operatorname{Ad}(w) such that β=θAd⁡(w)−1∈V\beta=\theta\operatorname{Ad}(w)^{-1}\in V. For a contraction centralizing sequence xnx_n, its finite tests eventually hold, and

θ(xn)−xn=β(wxnw∗−xn)+(β(xn)−xn).(17)\theta(x_n)-x_n =\beta(wx_nw^*-x_n)+(\beta(x_n)-x_n). \tag{17}

The first term tends strong* to zero, by centrality with the fixed ww. The second has symmetric seminorm at most ε\varepsilon, by (16) and its closure version. Taking limsup and then arbitrary ε\varepsilon 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). □\square

3. The complete group criterion for absorption

Theorem 3.1. For a factor MM with separable predual, strong stability is equivalent to noncommutativity of the abstract quotient group

Int⁡(M)‾/Int⁡(M).(18)\overline{\operatorname{Int}(M)}/\operatorname{Int}(M). \tag{18}

Together with the preceding absorption theorem, this completes all four characterizations of strong stability.

Proof. If MM is not strongly stable, that theorem makes its central sequence algebras commutative. Theorem 2.2 then makes (18) abelian.

Conversely, write a strongly stable MM as N⊗ˉRN\bar\otimes R, with NN a factor. The finite outer-action construction supplies an action γ\gamma of S3S_3 on RR, outer at every nonidentity element. Take the transpositions s=(12)s=(12) and t=(23)t=(23); their commutator c=sts−1t−1c=sts^{-1}t^{-1} is nonidentity. All automorphisms of RR are approximately inner, by the finite factor lesson. Hence

α=id⁡N⊗γs,β=id⁡N⊗γt(19)\alpha=\operatorname{id}_N\otimes\gamma_s,\qquad \beta=\operatorname{id}_N\otimes\gamma_t \tag{19}

are approximately inner on N⊗ˉRN\bar\otimes R. Tensoring approximating inner automorphisms preserves uu-convergence, by the norm density of elementary normal tensor functionals.

Their commutator is id⁡N⊗γc\operatorname{id}_N\otimes\gamma_c, and it is outer. If implemented by a unitary v∈N⊗ˉRv\in N\bar\otimes R, that unitary would commute with N⊗1N\otimes1. The spatial commutation theorem gives

(N⊗1)′∩(N⊗ˉR)=Z(N)⊗ˉR=1⊗R.(20)(N\otimes1)'\cap(N\bar\otimes R) =Z(N)\bar\otimes R=1\otimes R. \tag{20}

Thus v=1⊗v0v=1\otimes v_0 would implement γc\gamma_c on RR, contradicting its outerness. The two classes in (18) therefore do not commute. Transfer by the normal isomorphism proves the assertion for MM. □\square

The characteristic group is

χ(M)=(Cnt⁡(M)∩Int⁡(M)‾)/Int⁡(M).(21)\chi(M)= \bigl(\operatorname{Cnt}(M)\cap \overline{\operatorname{Int}(M)}\bigr)/ \operatorname{Int}(M). \tag{21}

Its numerator is a normal subgroup and contains Int⁡(M)\operatorname{Int}(M). Theorem 1.2 proves that this group is abelian.

4. A uniform displacement criterion in finite factors

In this section MM can be any II1\mathrm{II}_1 factor, without a separability hypothesis. Let τ\tau be its normalized trace.

Lemma 4.1. Let D⊂MD\subset M be a unital finite type I subfactor and C=D′∩MC=D'\cap M. If α∈Aut⁡(M)\alpha\in\operatorname{Aut}(M) satisfies

d=sup⁡u∈U(C)∥α(u)−u∥2<1,(22)d=\sup_{u\in\mathcal U(C)}\|\alpha(u)-u\|_2<1, \tag{22}

then α\alpha is inner.

Proof. Let KK be the ultraweakly closed convex hull of uα(u∗)u\alpha(u^*), u∈U(C)u\in\mathcal U(C). These elements lie in the operator unit ball and the closed 22-ball of radius dd centered at 11. The latter is ultraweakly closed by lower semicontinuity, so 0∉K0\notin K. Its map into L2(M,τ)L^2(M,\tau) is weakly continuous on this bounded set. For bounded test vectors this follows from normality of x↦τ(b∗x)x\mapsto\tau(b^*x); arbitrary L2L^2 test vectors follow by approximation and the uniform 22-norm bound. Thus KK is weakly compact and convex in L2L^2, hence norm closed. The Hilbert-space projection theorem gives a unique least-norm point y∈Ky\in K, with y≠0y\ne0 because 0∉K0\notin K. This is the same convexity mechanism as the finite trace averaging lemma.

For v∈U(C)v\in\mathcal U(C), the map x↦vxα(v∗)x\mapsto vx\alpha(v^*) preserves KK, bijectively, and is a trace 22-isometry. It therefore fixes yy, yielding

yα(x)=xy,x∈C.(23)y\alpha(x)=xy,\qquad x\in C. \tag{23}

The unitary identity extends to all xx by their linear span.

Choose a unitary w∈Mw\in M implementing α\alpha on DD. For completeness, if eije_{ij} are matrix units and fij=α(eij)f_{ij}=\alpha(e_{ij}), their equal trace diagonal projections are equivalent. Choose vv from e11e_{11} to f11f_{11}; then

w=∑ifi1ve1i(24)w=\sum_i f_{i1}ve_{1i} \tag{24}

is unitary and satisfies weijw∗=fijwe_{ij}w^*=f_{ij}. Set β=Ad⁡(w∗)α\beta=\operatorname{Ad}(w^*)\alpha; it fixes DD pointwise and maps CC onto CC. Put a=yw≠0a=yw\ne0. Equation (23) becomes

aβ(x)=xa,x∈C.(25)a\beta(x)=xa,\qquad x\in C. \tag{25}

Expand aa in the matrix coordinates M=D⊗ˉCM=D\bar\otimes C. At least one coefficient z∈Cz\in C is nonzero, and each coefficient obeys zβ(x)=xzz\beta(x)=xz. Since β(C)=C\beta(C)=C, this implies zz∗zz^* commutes with CC and z∗zz^*z commutes with β(C)\beta(C). The relative commutant CC is a factor, so both are positive nonzero scalars, equal because their operator norms are equal. Thus q=z/∥z∥q=z/\|z\| is a unitary in CC, and

β(x)=q∗xq,x∈C.(26)\beta(x)=q^*xq,\qquad x\in C. \tag{26}

It also holds on DD, since β\beta fixes DD and qq commutes with it. These two algebras generate MM; hence α=Ad⁡(wq∗)\alpha=\operatorname{Ad}(wq^*) is inner. The adjoint in (26) follows directly from the intertwining equation. □\square

Theorem 4.2. For the separable AFD II1\mathrm{II}_1 factor RR,

Cnt⁡(R)=Int⁡(R),χ(R)={1}.(27)\operatorname{Cnt}(R)=\operatorname{Int}(R),\qquad \chi(R)=\{1\}. \tag{27}

Every outer α∈Aut⁡(R)\alpha\in\operatorname{Aut}(R) induces a nonidentity automorphism of RωR_\omega, for every free ultrafilter.

Proof. Let DnD_n be the increasing dyadic factors generating RR, and Cn=Dn′∩RC_n=D_n'\cap R. If α\alpha is outer, the contrapositive of Lemma 4.1 gives

sup⁡u∈U(Cn)∥α(u)−u∥2≥1.(28)\sup_{u\in\mathcal U(C_n)}\|\alpha(u)-u\|_2\ge1. \tag{28}

Choose un∈U(Cn)u_n\in\mathcal U(C_n) with displacement at least 1/21/2. For each fixed x∈Rx\in R, choose a∈Dka\in D_k close to xx in 22-norm. When n≥kn\ge k, unu_n commutes with aa, so ∥[un,x]∥2≤2∥x−a∥2\|[u_n,x]\|_2\le2\|x-a\|_2. 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 α\alpha 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 ω\omega, the quotient image of α(un)−un\alpha(u_n)-u_n has 22-norm at least 1/21/2, so the induced automorphism αω\alpha_\omega is nonidentity. No conclusion about continuity of the homomorphism α↦αω\alpha\mapsto\alpha_\omega is needed. □\square

5. Decreasing irreducible hyperfinite subfactors

Theorem 5.1. RR admits a decreasing sequence of AFD II1\mathrm{II}_1 subfactors RnR_n satisfying

Rn′∩R=C,⋂n≥1Rn=C.(29)R_n'\cap R=\mathbb C,\qquad \bigcap_{n\ge1}R_n=\mathbb C. \tag{29}

Proof. Take a countably infinite locally finite group G=⋃nGnG=\bigcup_nG_n, where GnG_n are increasing finite subgroups. Finitary permutations of N\mathbb N, with the subgroups permuting the first nn points, are one example. Form

R0=⨂h∈G‾(Rh,τh),(30)R_0=\overline{\bigotimes_{h\in G}}(R_h,\tau_h), \tag{30}

with identical copies RhR_h of RR. The countable product is a separable AFD II1\mathrm{II}_1 factor, hence isomorphic to RR. Use the left Bernoulli convention

αg(⨂hxh)=⨂hxg−1h.(31)\alpha_g\left(\bigotimes_hx_h\right) =\bigotimes_hx_{g^{-1}h}. \tag{31}

On finite-support tensors it gives αgαk=αgk\alpha_g\alpha_k=\alpha_{gk}, and the trace GNS unitary extends it normally to R0R_0.

Choose trace-zero unitaries ama_m in successive dyadic tensor legs of ReR_e, and embed them as a~m\widetilde a_m in the single coordinate ee of (30). Finite-stage density makes this an ordinary centralizing sequence in R0R_0. For g≠eg\ne e, its translate is supported on coordinate gg; product trace gives

∥αg(a~m)−a~m∥22=2.(32)\|\alpha_g(\widetilde a_m)-\widetilde a_m\|_2^2=2. \tag{32}

An inner automorphism would move a centralizing sequence by a strong*-vanishing difference, contradicting (32). Thus every nonidentity αg\alpha_g is outer.

Let Dm⊂RhD_m\subset R_h denote the same identified dyadic factor in every coordinate. The finite matrix stages

Am=⨂h∈GmDm⊗1outside Gm(33)A_m=\bigotimes_{h\in G_m}D_m\otimes1_{\text{outside }G_m} \tag{33}

increase and generate R0R_0. For m≥nm\ge n, left translation by GnG_n permutes GmG_m, so AmA_m is invariant under that finite group. Put Rn=R0GnR_n=R_0^{G_n}. The finite outer-action theorem gives Rn′∩R0=CR_n'\cap R_0=\mathbb C and makes RnR_n a II1\mathrm{II}_1 factor. Its finite-dimensional fixed stages AmGnA_m^{G_n} generate it: for x∈Rnx\in R_n, approximate in 22-norm by bounded am∈Ama_m\in A_m, and average over GnG_n. That average is a 22-contraction fixing xx, so the averaged approximants still converge to xx. Thus RnR_n is separable AFD, and isomorphic to RR. Increasing groups make these fixed algebras decreasing.

Their intersection is R0GR_0^G. It is scalar. Indeed, finite-support operators a,ba,b have disjoint translated supports whenever gg lies outside a finite subset of GG, giving

τ(αg(a)b)=τ(a)τ(b).(34)\tau(\alpha_g(a)b)=\tau(a)\tau(b). \tag{34}

If the supports are F,HF,H, the excluded set is HF−1HF^{-1}. Bounded finite-stage 22-approximation and trace Cauchy–Schwarz extend (34) to

lim⁡g→∞τ(αg(a)b)=τ(a)τ(b),a,b∈R0,(35)\lim_{g\to\infty}\tau(\alpha_g(a)b)=\tau(a)\tau(b), \qquad a,b\in R_0, \tag{35}

where g→∞g\to\infty means eventually outside each finite subset. The approximation error is uniform in gg, since all αg\alpha_g preserve the trace and the 22-norm. For a fixed x∈R0Gx\in R_0^G with τ(x)=0\tau(x)=0, take a=x,b=x∗a=x,b=x^*. The left side is the constant τ(xx∗)\tau(xx^*), while the right side is zero. Faithfulness gives x=0x=0. Thus the intersection is C\mathbb C, proving (29) after a normal identification of R0R_0 with RR. □\square

6. Exercises with complete solutions

Exercise 1. Prove normality of Cnt⁡(M)\operatorname{Cnt}(M) directly.

Solution. For a centralizing xnx_n, the sequence γ−1(xn)\gamma^{-1}(x_n) is centralizing by the predual identity for automorphisms. If θ\theta is centrally trivial, its difference on this sequence tends strong* to zero. Applying the fixed normal automorphism γ\gamma gives γθγ−1(xn)−xn→0\gamma\theta\gamma^{-1}(x_n)-x_n\to0 strong*. Hence the conjugate is centrally trivial.

Exercise 2. Derive (8) from (7).

Solution. From un+1=vnunu_{n+1}=v_nu_n, one has wn+1=un∗vn∗θ(vn)θ(un)w_{n+1}=u_n^*v_n^*\theta(v_n)\theta(u_n). Subtract wn=un∗θ(un)w_n=u_n^*\theta(u_n) 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 θ(un)\theta(u_n), changing the state to φ∘Ad⁡(θ(un)∗)\varphi\circ\operatorname{Ad}(\theta(u_n)^*), whose limit is σ2\sigma_2. The right factor in the adjoint difference (11) is unu_n, changing it to φ∘Ad⁡(un∗)\varphi\circ\operatorname{Ad}(u_n^*), whose limit is σ1\sigma_1. 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 m>nm>n, the triangle inequality bounds the metric distance by ∑k=nm−125 2−k≤45 2−n\sum_{k=n}^{m-1}2\sqrt5\,2^{-k}\le4\sqrt5\,2^{-n}. This tends to zero uniformly in mm. 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 z=[u,x]z=[u,x], the square of the first seminorm of zu∗zu^* is φ(uz∗zu∗)\varphi(uz^*zu^*), while its adjoint seminorm has square φ(zz∗)\varphi(zz^*). The first differs from φ(z∗z)\varphi(z^*z) by at most ∥φ∘Ad⁡(u)−φ∥∥z∥2\|\varphi\circ\operatorname{Ad}(u)-\varphi\|\|z\|^2. The symmetric seminorm divides this error by two. Since ∥z∥≤2\|z\|\le2, its contribution is at most 2δ2\delta.

Exercise 6. Verify that s=(12)s=(12) and t=(23)t=(23) have nonidentity commutator in S3S_3.

Solution. Both are involutions, so their commutator is stst=(st)2stst=(st)^2. With rightmost-first composition, st=(123)st=(123), whose square is (132)(132). Thus the commutator is nonidentity and the everywhere-outer action sends it to an outer automorphism.

Exercise 7. Why does innerness of id⁡N⊗γ\operatorname{id}_N\otimes\gamma imply innerness of γ\gamma when NN is a factor?

Solution. An implementing unitary must commute with every a⊗1a\otimes1, because the automorphism fixes them. Equation (20) places it in 1⊗R1\otimes R. Its second coordinate unitary then implements γ\gamma. The factor hypothesis makes Z(N)=CZ(N)=\mathbb C in that commutant calculation.

Exercise 8. In Lemma 4.1, explain why the least-norm intertwiner is nonzero.

Solution. The convex set KK lies in the ultraweakly closed 22-ball of radius d<1d<1 around 11. Zero is at distance exactly 11, hence is outside KK. Its minimum-norm point therefore cannot be zero. Strict convexity gives uniqueness, allowing invariance of KK to produce the intertwining equation.

Exercise 9. Starting with zβ(x)=xzz\beta(x)=xz and unitary q=z/∥z∥q=z/\|z\|, determine the implementing unitary and its adjoint.

Solution. Divide the equation by ∥z∥\|z\| to get qβ(x)=xqq\beta(x)=xq. Multiplication on the left by q∗q^* gives β(x)=q∗xq\beta(x)=q^*xq. Under Ad⁡(v)(x)=vxv∗\operatorname{Ad}(v)(x)=vxv^*, the implementer is q∗q^*. Thus α=Ad⁡(wq∗)\alpha=\operatorname{Ad}(wq^*), as in the proof.

Exercise 10. Show that any outer automorphism of RR acts nontrivially on every RωR_\omega.

Solution. Choose unu_n in successive finite-head commutants as in (28), with ∥α(un)−un∥2≥1/2\|\alpha(u_n)-u_n\|_2\ge1/2. They are ordinary centralizing, hence centralizing along every free ω\omega. Their quotient difference has 22-norm at least 1/21/2, 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 22-norm 11. Their mixed trace is the product of their single-coordinate traces, both zero. Expanding the squared norm of their difference gives 1+1−2Re⁡(0)=21+1-2\operatorname{Re}(0)=2. 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 gFgF meets HH only if gf=hgf=h for some f∈F,h∈Hf\in F,h\in H, that is, g=hf−1∈HF−1g=hf^{-1}\in HF^{-1}. Outside that finite set, tensor independence gives (34). Extend by 22-approximation as in (35). A trace-zero fixed operator xx then satisfies τ(xx∗)=0\tau(xx^*)=0 by taking a=x,b=x∗a=x,b=x^*. Trace faithfulness makes x=0x=0, 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 S3S_3 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 II1\mathrm{II}_1 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 RR. 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.