Expected maximal abelian algebras and factor types

Written by GPT-6.1 Sol (OpenAI), Ultra, September 2026. Self-checked by the writing AI. Original text: CC0 1.0.

A normal expectation onto a maximal abelian algebra preserves every semifinite normal trace. This is stronger than saying that the expectation preserves one chosen trace. We prove it by averaging over the abelian algebra's unitaries, then use it to decide the type of a free ergodic crossed product from invariant traces on its coefficient algebra.

The resulting examples have the same diffuse coefficient algebra on the real line. Rational translations give a type-II factor with an infinite semifinite trace. Adding a dilation destroys every invariant semifinite normal trace and gives type III.

Our crossed-product prerequisites are Proposition 1.1, Proposition 3.1 and Theorem 3.2 of Crossed-product coefficients and factor tests: the faithful normal coefficient expectation, the two positive coefficient sums, and the maximal-abelian and factor tests. Its named regular-model and freeness prerequisites remain in force. We use existing trace theory rather than reconstruct it here:

The linked programme lessons contain the complete prerequisite proofs at the stated locators. The elementary examples also use Lebesgue integration, density of interval step functions in L1L^1, Fubini’s theorem and the usual multiplication representation on L2L^2. Anantharaman and Popa’s freely readable draft treats finite trace-preserving expectations and normalizers; Takesaki’s book provides further context. The arguments below establish the arbitrary semifinite MASA trace-restriction theorem and the type-II-infinity/type-III alternatives.

1. Averaging onto an expected maximal abelian algebra

Let MM be a nonzero von Neumann algebra and D⊆MD\subseteq M a maximal abelian unital von Neumann subalgebra. Thus D′∩M=DD'\cap M=D. Suppose P:M⟶D P:M\longrightarrow D is a normal linear retraction of norm one: P(d)=dP(d)=d for d∈Dd\in D. Tomiyama's theorem makes PP positive, unital and DD-bimodular. For x∈Mx\in M, set KD(x)=conv⁡‾ uw{uxu∗:u∈U(D)}.(1.1) K_D(x)=\overline{\operatorname{conv}}^{\,\mathrm{uw}} \{uxu^*:u\in\mathcal U(D)\}. \tag{1.1} This is an ultraweakly compact convex subset of the ball of radius ∥x∥\|x\|.

Lemma 1.1. For every x∈Mx\in M, KD(x)∩D={P(x)}.(1.2) K_D(x)\cap D=\{P(x)\}. \tag{1.2} Consequently there is at most one normal norm-one retraction onto DD.

Proof. We first construct a point of KD(x)K_D(x) fixed by every conjugation from U(D)\mathcal U(D). For a unitary u∈Du\in D, put An,u(y)=1n∑k=0n−1ukyu−k. A_{n,u}(y)=\frac1n\sum_{k=0}^{n-1}u^k y u^{-k}. The maps An,uA_{n,u} are contractions, preserve KD(x)K_D(x), and commute for different uu, since DD is abelian. The telescoping identity gives ∥Ad⁡(u)An,u(y)−An,u(y)∥≤2∥y∥n.(1.3) \|\operatorname{Ad}(u)A_{n,u}(y)-A_{n,u}(y)\| \leq \frac{2\|y\|}{n}. \tag{1.3} For a finite set F⊆U(D)F\subseteq\mathcal U(D), compose An,uA_{n,u} over u∈Fu\in F and apply the composition to xx. The resulting point yF,n∈KD(x)y_{F,n}\in K_D(x) satisfies (1.3), with yy replaced by xx, for every u∈Fu\in F: all the other averages commute with Ad⁡(u)\operatorname{Ad}(u) and are contractions.

For finite FF and ε>0\varepsilon>0, the sets C(F,ε)={y∈KD(x):∥Ad⁡(u)y−y∥≤ε for every u∈F} C(F,\varepsilon)= \{y\in K_D(x):\|\operatorname{Ad}(u)y-y\|\leq\varepsilon \text{ for every }u\in F\} are nonempty and ultraweakly closed. Closedness follows because conjugation is normal and a closed norm ball is ultraweakly closed. They have the finite intersection property: use the union of the finitely many sets FF, the smallest ε\varepsilon, and a sufficiently large nn in (1.3). Compactness therefore gives a point fixed by all these conjugations. It commutes with all unitaries of DD, hence with DD, and lies in D′∩M=DD'\cap M=D.

Bimodularity gives P(uxu∗)=uP(x)u∗=P(x)P(uxu^*)=uP(x)u^*=P(x). Normality and linearity then give P(y)=P(x)P(y)=P(x) for every y∈KD(x)y\in K_D(x). Any such yy in DD satisfies y=P(y)=P(x)y=P(y)=P(x). This proves (1.2), including existence.

If QQ is a second normal norm-one retraction onto DD, the same argument gives Q(y)=Q(x)Q(y)=Q(x) on KD(x)K_D(x). Since P(x)∈KD(x)∩DP(x)\in K_D(x)\cap D, we get Q(x)=Q(P(x))=P(x)Q(x)=Q(P(x))=P(x). □\square

Normality matters here: it passes the retraction through the ultraweak closure in (1.1). No separability or countable family of unitaries was assumed.

Theorem 1.2. If τ\tau is a faithful semifinite normal trace on MM, then its restriction τD\tau_D to DD is semifinite, and τ(x)=τD(P(x))(x∈M+).(1.4) \tau(x)=\tau_D(P(x))\qquad(x\in M_+). \tag{1.4}

Proof. By the finite-trace approximation criterion, choose projections ei↑1e_i\uparrow1 with τ(ei)<∞\tau(e_i)<\infty. For x≥0x\geq0, normality and the trace identity give τ(x)=sup⁡iτ(x1/2eix1/2)=sup⁡iτ(eixei).(1.5) \tau(x) =\sup_i\tau(x^{1/2}e_i x^{1/2}) =\sup_i\tau(e_i x e_i). \tag{1.5} Each x↦τ(eixei)x\mapsto\tau(e_i x e_i) is a bounded normal positive functional; its norm is τ(ei)\tau(e_i). Thus (1.5) also explains the ultraweak lower semicontinuity furnished by the trace prerequisite.

For positive xx, every point of the convex orbit in (1.1) is positive and has trace τ(x)\tau(x). If τ(x)<∞\tau(x)<\infty, lower semicontinuity puts its entire ultraweak closure in {y≥0:τ(y)≤τ(x)}\{y\geq0:\tau(y)\leq\tau(x)\}. If τ(x)=∞\tau(x)=\infty, that inequality is automatic. Since P(x)∈KD(x)P(x)\in K_D(x), we obtain τ(P(x))≤τ(x).(1.6) \tau(P(x))\leq\tau(x). \tag{1.6} In particular bi=P(ei)b_i=P(e_i) are positive contractions with τD(bi)<∞\tau_D(b_i)<\infty. Normality of PP gives bi↑1b_i\uparrow1. The positive-contraction approximation criterion for semifiniteness, Proposition 2.5 of the trace prerequisite, now makes τD\tau_D semifinite. It is faithful and normal by restriction.

The existing trace-preserving expectation theorem applies at this point: Theorem 9.1 of Traces, part B gives a normal norm-one retraction Pτ:M→DP_\tau:M\to D with τ=τDPτ\tau=\tau_D P_\tau on the positive cone. Lemma 1.1 makes Pτ=PP_\tau=P, proving (1.4). □\square

The semifiniteness of the restriction was proved before using the trace-preserving expectation theorem. Assuming that restriction in advance would omit the main step.

2. Invariant coefficient traces and crossed-product traces

Let AA be a nonzero abelian von Neumann algebra, GG a countable discrete group, and α:G→Aut⁡(A)\alpha:G\to\operatorname{Aut}(A) an action. Use the regular crossed product R=A⋊αGR=A\rtimes_\alpha G, its coefficient representation π\pi, and its faithful normal expectation E:R→AE:R\to A from the preceding lesson. Identifying AA with π(A)\pi(A), its RR-valued retraction is πE\pi E.

A trace here is an additive, positively homogeneous map A+→[0,∞]A_+\to[0,\infty]. Normal means preservation of increasing suprema; semifinite has the usual finite-value approximation meaning. On an abelian algebra a normal weight is a trace. Invariant means ν(αg(a))=ν(a)(a∈A+, g∈G).(2.1) \nu(\alpha_g(a))=\nu(a)\qquad(a\in A_+,\ g\in G). \tag{2.1}

Proposition 2.1. A faithful invariant semifinite normal trace ν\nu on AA extends to the faithful semifinite normal trace τν(x)=ν(E(x)),x∈R+.(2.2) \tau_\nu(x)=\nu(E(x)),\qquad x\in R_+. \tag{2.2} It is finite exactly when ν(1)<∞\nu(1)<\infty. If the action is free, every faithful semifinite normal trace on RR arises in this way from its restriction to AA.

Proof. Additivity, homogeneity and normality of νE\nu E follow from positivity and normality of EE. It is faithful because both ν\nu and EE are faithful. For the coefficient xg=E(xug∗)x_g=E(xu_g^*), the positive sums proved in the preceding lesson are E(xx∗)=∑g∈Gxgxg∗,E(x∗x)=∑g∈Gαg−1(xg∗xg).(2.3) E(xx^*)=\sum_{g\in G}x_gx_g^*,\qquad E(x^*x)=\sum_{g\in G}\alpha_{g^{-1}}(x_g^*x_g). \tag{2.3} Both are increasing limits of finite sums. Normality, invariance and commutativity of AA give τν(x∗x)=∑gν(αg−1(xg∗xg))=∑gν(xg∗xg)=∑gν(xgxg∗)=τν(xx∗).(2.4) \begin{aligned} \tau_\nu(x^*x) &=\sum_g\nu(\alpha_{g^{-1}}(x_g^*x_g))\\ &=\sum_g\nu(x_g^*x_g) =\sum_g\nu(x_gx_g^*) =\tau_\nu(xx^*). \end{aligned} \tag{2.4} The equality is valid with infinite values; no subtraction of infinite quantities occurs. This is the trace identity.

Choose finite-ν\nu projections fi↑1f_i\uparrow1 in AA. Then π(fi)↑1\pi(f_i)\uparrow1 in RR and τν(π(fi))=ν(fi)<∞\tau_\nu(\pi(f_i))=\nu(f_i)<\infty. The trace approximation criterion makes τν\tau_\nu semifinite. Also τν(1)=ν(1)\tau_\nu(1)=\nu(1).

Conversely, suppose the action is free and τ\tau is faithful, semifinite and normal on RR. The coefficient algebra is maximal abelian. Apply Theorem 1.2 to πE\pi E. It gives a faithful semifinite normal trace ν(a)=τ(π(a))\nu(a)=\tau(\pi(a)) and τ=νE\tau=\nu E. Covariance and unitary invariance of a trace give ν(αg(a))=τ(ugπ(a)ug∗)=τ(π(a))=ν(a). \nu(\alpha_g(a)) =\tau(u_g\pi(a)u_g^*) =\tau(\pi(a)) =\nu(a). Thus ν\nu is invariant. □\square

3. Ergodicity and the four type criteria

The action is ergodic when Aα=C1A^\alpha=\mathbb C1.

Lemma 3.1. For an ergodic action, every nonzero invariant semifinite normal trace on AA is faithful. Any two such traces are positive scalar multiples of one another.

Proof. The support s(ν)s(\nu) of an invariant normal trace is invariant: an automorphism takes its largest zero projection to another zero projection, and invariance gives equality. Ergodicity makes s(ν)s(\nu) either 00 or 11. Since ν≠0\nu\ne0, it is 11, which means faithfulness.

Let ν,μ\nu,\mu be two nonzero invariant semifinite normal traces. The bounded density comparison theorem, Theorem 7.2 of Traces, part B, applies to these faithful traces. It states that ρ=ν+μ\rho=\nu+\mu is faithful, semifinite and normal, and there is a unique h∈Ah\in A, 0≤h≤10\leq h\leq1, such that ν(a)=ρ(ha),μ(a)=ρ((1−h)a)(a∈A+),(3.1) \nu(a)=\rho(ha),\qquad \mu(a)=\rho((1-h)a)\qquad(a\in A_+), \tag{3.1} with s(h)=s(1−h)=1s(h)=s(1-h)=1.

Invariance of ρ\rho and ν\nu gives, for every gg, ρ(αg(h)a)=ρ(hαg−1(a))=ν(αg−1(a))=ν(a). \rho(\alpha_g(h)a) =\rho(h\alpha_{g^{-1}}(a)) =\nu(\alpha_{g^{-1}}(a)) =\nu(a). The analogous identity holds for μ\mu. Uniqueness in the comparison theorem therefore gives αg(h)=h\alpha_g(h)=h. Ergodicity yields h=t1h=t1. Its two support assertions give 0<t<10<t<1. Equation (3.1) now implies ν=tρ\nu=t\rho, μ=(1−t)ρ\mu=(1-t)\rho, and μ=(1−t)t−1ν\mu=(1-t)t^{-1}\nu. □\square

Theorem 3.2. Suppose GG is countably infinite and α\alpha is free and ergodic. Then R=A⋊αGR=A\rtimes_\alpha G is an infinite-dimensional factor, with the following alternatives.

  1. RR is type I exactly when AA contains a minimal projection pp whose translates satisfy ∑g∈Gαg(p)=1.(3.2) \sum_{g\in G}\alpha_g(p)=1. \tag{3.2} In this case AA is atomic and RR is type I∞_\infty.
  2. RR is type II1_1 exactly when AA has a faithful finite invariant normal trace.
  3. RR is type II∞_\infty exactly when AA is nonatomic and has a faithful invariant semifinite normal trace ν\nu with ν(1)=∞\nu(1)=\infty.
  4. RR is type III exactly when AA has no nonzero invariant semifinite normal trace.

Here nonatomic means that AA has no minimal projection. Under ergodicity, existence of even one minimal projection gives (3.2), so the atomic and nonatomic alternatives exhaust this situation.

Proof. Freeness and ergodicity give factoriality by the preceding lesson. The unitaries ugu_g are linearly independent: applying E( ⋅ uh∗)E(\,\cdot\,u_h^*) to a finite relation selects its coefficient at hh. Since GG is infinite, RR is infinite-dimensional.

The atomic alternative. Let pp be a minimal projection of AA. If αg(p)=p\alpha_g(p)=p, the restriction of αg\alpha_g to Ap=CpAp=\mathbb Cp is the identity, so for every a∈Aa\in A αg(a)p=αg(ap)=ap. \alpha_g(a)p=\alpha_g(ap)=ap. For g≠eg\ne e this contradicts freeness. The minimal projections αg(p)\alpha_g(p) are therefore all distinct, and distinct minimal projections in an abelian algebra are orthogonal. Their sum is a nonzero invariant projection, hence is 11. In particular AA is atomic with these atoms.

The projection π(p)\pi(p) is minimal in RR. Indeed, for y∈π(p)Rπ(p)y\in\pi(p)R\pi(p), every a∈Aa\in A is scalar on pp, so yy commutes with π(A)\pi(A). Maximal abelianness puts yy in π(A)\pi(A), and then in Cπ(p)\mathbb C\pi(p). A factor with a nonzero minimal projection is type I by the type-I classification prerequisite. Infinite dimension excludes finite matrix factors, and gives type I∞_\infty. One can also see the countable matrix units directly: vg=ugπ(p),vg∗vg=π(p),vgvg∗=π(αg(p)),eg,h=vgvh∗.(3.3) v_g=u_g\pi(p),\qquad v_g^*v_g=\pi(p),\qquad v_gv_g^*=\pi(\alpha_g(p)),\qquad e_{g,h}=v_gv_h^*. \tag{3.3} The orthogonality in (3.2) makes eg,hek,l=δh,keg,le_{g,h}e_{k,l}=\delta_{h,k}e_{g,l}, and their diagonal sum is 11. The usual minimal-corner matrix-unit decomposition identifies RR with B(ℓ2(G))B(\ell^2(G)).

Conversely, suppose RR is type I, and identify it normally with B(L)B(L). Its canonical operator trace is faithful, semifinite and normal. Theorem 1.2 makes its restriction to the coefficient maximal abelian algebra semifinite. There is therefore a nonzero a∈A+a\in A_+ with finite operator trace. For some ε>0\varepsilon>0, its spectral projection q=1[ε,∞)(a)q=1_{[\varepsilon,\infty)}(a) is nonzero, and Tr⁡(q)≤ε−1Tr⁡(a)<∞. \operatorname{Tr}(q)\leq\varepsilon^{-1}\operatorname{Tr}(a)<\infty. Thus qq is finite rank in B(L)B(L). The nonzero abelian algebra qAq⊆B(qL)qAq\subseteq B(qL) is finite-dimensional and has a minimal projection pp. It is minimal in AA too, because any subprojection of pp in AA already lies in qAqqAq. The previous orbit argument gives (3.2). This proves the first alternative and the asserted atomic dichotomy.

Finite traces. A faithful finite invariant normal trace ν\nu gives the faithful finite normal trace νE\nu E on RR. Thus RR is finite. A finite type-I factor is a finite matrix algebra, whereas RR is infinite-dimensional. Hence RR is type II1_1. Conversely a type-II1_1 factor has its faithful normal finite trace, obtained from the centre-valued trace of a finite algebra. Proposition 2.1 restricts it to the required invariant trace on AA. This proves the second alternative.

Infinite semifinite traces. Suppose AA is nonatomic and ν\nu is faithful, invariant, normal and semifinite with ν(1)=∞\nu(1)=\infty. The trace νE\nu E makes RR semifinite. The first alternative excludes type I. If RR were finite, the second alternative would give a finite invariant normal trace μ\mu on AA. Lemma 3.1 would make ν\nu a finite positive multiple of μ\mu, contrary to ν(1)=∞\nu(1)=\infty. The type decomposition for factors therefore makes RR type II∞_\infty.

Conversely a type-II∞_\infty factor has a faithful semifinite normal trace by Theorem 6.7 of Traces, part A. Its value at 11 is infinite: a faithful finite trace would make the factor finite. Proposition 2.1 gives the invariant restricted trace ν\nu, with ν(1)=∞\nu(1)=\infty; the first alternative makes AA nonatomic. This proves the third alternative.

Type III. A factor is type III exactly when it is not semifinite. If AA has a nonzero invariant semifinite normal trace, Lemma 3.1 makes it faithful and Proposition 2.1 makes RR semifinite. Conversely if RR is semifinite, the trace existence theorem and Proposition 2.1 supply such an invariant trace on AA. This proves the fourth alternative. □\square

The infinite-group hypothesis excludes finite matrix factors from the finite-trace alternative. For example the free transitive action of a group of order nn on nn atoms gives Mn(C)M_n(\mathbb C), with a finite invariant coefficient trace.

4. Rational translations

We establish ergodicity and freeness explicitly for the examples.

Lemma 4.1. On either R\mathbb R with Lebesgue measure or T=R/Z\mathbb T=\mathbb R/\mathbb Z with normalized Lebesgue measure, a function in L∞L^\infty fixed by all rational translations is constant almost everywhere.

Proof. Translation is continuous in the L1L^1 norm. For an indicator of a bounded interval on R\mathbb R, the norm difference from a translate is at most twice the translation distance. Arc indicators give the same conclusion on T\mathbb T. Finite linear combinations have the property, and their density in L1L^1, together with the isometric nature of translation, proves it for every L1L^1 function.

For f∈L∞f\in L^\infty, this makes translation ultraweakly continuous: pairing a translated ff against h∈L1h\in L^1 is pairing ff against the oppositely translated hh. If all rational translations fix ff, density of Q\mathbb Q in R\mathbb R, or of Q/Z\mathbb Q/\mathbb Z in T\mathbb T, shows that every translation fixes ff.

Choose a measurable bounded representative. For each translation tt, f(x−t)=f(x)f(x-t)=f(x) for almost every xx. Fubini, on bounded rectangles and then their countable union in the real case, gives this equality for almost every pair (t,x)(t,x). The change of variables (t,x)↦(x−t,x)(t,x)\mapsto(x-t,x) preserves product Lebesgue measure (and product normalized Lebesgue measure on the circle). Hence f(y)=f(x)f(y)=f(x) for almost every pair (y,x)(y,x). Fubini once more, with any xx from the conull set of good sections, makes ff constant almost everywhere. □\square

Lemma 4.2. Let TT be an invertible nonsingular Borel transformation of R\mathbb R or T\mathbb T, and let β(f)=f∘T−1\beta(f)=f\circ T^{-1}. If the fixed-point set of TT has measure zero, then β\beta is free on L∞L^\infty.

Proof. Suppose a nonzero projection p=1Sp=1_S supported an identity part, so (β(f)−f)1S=0(\beta(f)-f)1_S=0 for all ff. Apply this to indicators from a countable Borel family separating points, for example rational open intervals or rational arcs. Outside the union of the resulting countably many null exceptional sets, membership of xx and T−1xT^{-1}x in every member of that family agrees for x∈Sx\in S. The separating property gives T−1x=xT^{-1}x=x. Thus SS is contained, modulo a null set, in the fixed-point set. It is null, contradicting p≠0p\ne0. □\square

Example 4.3: a type-II1_1 factor from circle translations. Let A=L∞(T),G=Q/Z,αq(f)(x)=f(x−q). A=L^\infty(\mathbb T),\qquad G=\mathbb Q/\mathbb Z,\qquad \alpha_q(f)(x)=f(x-q). Every nonidentity translation has no fixed point, so Lemma 4.2 gives freeness. Lemma 4.1 gives ergodicity. The coefficient algebra is nonatomic, and ν(f)=∫Tf(x) dx,f≥0, \nu(f)=\int_{\mathbb T}f(x)\,dx,\qquad f\geq0, is faithful, invariant, normal and finite. Theorem 3.2 gives a type-II1_1 factor. Its normalized trace is x↦∫TE(x) dxx\mapsto\int_{\mathbb T}E(x)\,dx.

Example 4.4: a type-II∞_\infty factor from real translations. Let A=L∞(R),G=Q,αq(f)(x)=f(x−q). A=L^\infty(\mathbb R),\qquad G=\mathbb Q,\qquad \alpha_q(f)(x)=f(x-q). The same two lemmas give freeness and ergodicity. Lebesgue integration ν(f)=∫Rf(x) dx \nu(f)=\int_{\mathbb R}f(x)\,dx is faithful, invariant and normal, with ν(1)=∞\nu(1)=\infty. It is semifinite because the projections 1[−n,n]↑11_{[-n,n]}\uparrow1 have finite trace. The coefficient algebra is nonatomic. Theorem 3.2 gives type II∞_\infty.

5. A dilation produces type III

Example 5.1. Let GG be the countable group of affine transformations Tb,n(x)=2nx+b,b∈Q, n∈Z.(5.1) T_{b,n}(x)=2^n x+b,\qquad b\in\mathbb Q,\ n\in\mathbb Z. \tag{5.1} Composition and inversion are Tb,nTc,m=Tb+2nc,n+m,Tb,n−1=T−2−nb,−n.(5.2) T_{b,n}T_{c,m}=T_{b+2^n c,n+m},\qquad T_{b,n}^{-1}=T_{-2^{-n}b,-n}. \tag{5.2} Thus the displayed transformations form a group, with identity T0,0T_{0,0}. They are distinct for distinct pairs (b,n)(b,n).

On A=L∞(R)A=L^\infty(\mathbb R) set αb,n(f)(x)=f(2−n(x−b)).(5.3) \alpha_{b,n}(f)(x)=f(2^{-n}(x-b)). \tag{5.3} The transformations and their inverses preserve null sets, so these formulas give normal automorphisms of the measure algebra and define the required action. To see normality also from the predual, a change of variables pairs (5.3) with the L1L^1 function t↦2nh(2nt+b)t\mapsto2^n h(2^n t+b).

A nonidentity translation has no fixed point. A transformation with n≠0n\ne0 has exactly one fixed point, b/(1−2n)b/(1-2^n). Each nonidentity element therefore has a null fixed-point set. Lemma 4.2 gives freeness. The rational-translation subgroup is already ergodic by Lemma 4.1, so the full action is ergodic.

Suppose η≠0\eta\ne0 were an invariant semifinite normal trace on AA for this full group. It is invariant under the rational translations. Lebesgue integration ν\nu is also invariant, faithful, semifinite and normal for that subgroup. Apply Lemma 3.1 to the ergodic rational-translation action: it gives η=cν\eta=c\nu for a finite scalar c>0c>0.

But the dilation d=T0,1d=T_{0,1} obeys ν(αd(f))=∫Rf(x/2) dx=2∫Rf(x) dx=2ν(f).(5.4) \nu(\alpha_d(f)) =\int_{\mathbb R}f(x/2)\,dx =2\int_{\mathbb R}f(x)\,dx =2\nu(f). \tag{5.4} For f=1[0,1]f=1_{[0,1]}, the values are finite and unequal. Thus cνc\nu is not dilation invariant. This contradicts the assumption on η\eta. There is no nonzero invariant semifinite normal trace, and Theorem 3.2 makes L∞(R)⋊G L^\infty(\mathbb R)\rtimes G a type-III factor.

The uniqueness lemma applies to the translation subgroup before the dilation is added. This avoids an assumption that an arbitrary invariant trace must first be presented by a measurable density.

Corollary 5.2. Factors of types I, II1_1, II∞_\infty and III exist in faithful representations on separable Hilbert spaces.

Proof. The atomic shift example in Exercise 6.3 of the preceding lesson gives B(ℓ2(Z))B(\ell^2(\mathbb Z)), type I∞_\infty; finite matrix factors give the finite type-I cases. Examples 4.3, 4.4 and 5.1 supply the other three types. In each new example the multiplication space H=L2(T)H=L^2(\mathbb T) or L2(R)L^2(\mathbb R) is separable, and GG is countable. The regular representation is therefore on the separable Hilbert space H⊗ℓ2(G)H\otimes\ell^2(G). □\square

6. Graded exercises with complete solutions

Exercise 6.1 (introductory: a faithful state need not give a trace). In M3(C)M_3(\mathbb C), let DD be the diagonal algebra and let P(x)P(x) be the diagonal of xx. Put ν(diag⁡(a1,a2,a3))=a1+2a2+4a37. \nu(\operatorname{diag}(a_1,a_2,a_3)) =\frac{a_1+2a_2+4a_3}{7}. Show that νP\nu P is a faithful normal state but is not a trace. Determine exactly which positive diagonal weights give a trace, and relate the answer to invariance under cyclic permutation of the atoms.

Solution. P(x)=∑j=13ejjxejjP(x)=\sum_{j=1}^3 e_{jj}xe_{jj} is unital and completely positive. Thus νP\nu P is a positive state; it is normal in this finite-dimensional algebra. If x≥0x\geq0 and νP(x)=0\nu P(x)=0, all three diagonal entries are zero, because their weights are strictly positive. Then ∥x1/2ej∥2=xjj=0\|x^{1/2}e_j\|^2=x_{jj}=0 for every standard basis vector, so x=0x=0. This proves faithfulness.

For y=e12y=e_{12}, (νP)(y∗y)=(νP)(e22)=27,(νP)(yy∗)=(νP)(e11)=17. (\nu P)(y^*y)=(\nu P)(e_{22})=\frac27,\qquad (\nu P)(yy^*)=(\nu P)(e_{11})=\frac17. The trace identity fails. More generally, with strictly positive weights wjw_j of sum 11, testing eije_{ij} gives wi=wjw_i=w_j as a necessary condition for a trace. It is sufficient: equal weights give 3−1Tr⁡3^{-1}\operatorname{Tr}. Invariance under a cyclic permutation of the three atoms is exactly w1=w2=w3w_1=w_2=w_3. Thus it is invariance, in addition to faithfulness and normality, that is missing in the displayed example.

Exercise 6.2 (intermediate: the absolute dilation factor). For λ=−3/2\lambda=-3/2 and λ=−1\lambda=-1, let GλG_\lambda be the group of actual transformations x⟼λnx+b,b∈Q, n∈Z, x\longmapsto\lambda^n x+b,\qquad b\in\mathbb Q,\ n\in\mathbb Z, and let it act by inverse composition on L∞(R)L^\infty(\mathbb R). Prove freeness and ergodicity in both cases. Determine the crossed-product type. Explain why for λ=−1\lambda=-1 one must identify exponents with the same transformation.

Solution. Since λ,λ−1\lambda,\lambda^{-1} are rational, composition and inversion preserve the displayed set of affine transformations. The group is countable and contains all rational translations. Hence the action is ergodic by Lemma 4.1.

Every nonidentity transformation with slope 11 is a nonzero translation and has no fixed point. Every transformation with slope different from 11 has one fixed point. Thus all nonidentity fixed-point sets are null, and Lemma 4.2 proves freeness.

Change of variables gives, for f≥0f\geq0, ∫Rf(x/λ) dx=∣λ∣∫Rf(x) dx. \int_{\mathbb R}f(x/\lambda)\,dx =|\lambda|\int_{\mathbb R}f(x)\,dx. For λ=−3/2\lambda=-3/2, any invariant nonzero semifinite normal trace would, by uniqueness for the rational-translation subgroup, be cνc\nu with c>0c>0. The transformation of slope −3/2-3/2 multiplies its value on an interval indicator by 3/23/2, contradicting invariance. The factor is type III.

For λ=−1\lambda=-1, every transformation has slope 11 or −1-1 and preserves Lebesgue measure. Integration is faithful, invariant, semifinite and normal with infinite value at 11. Since L∞(R)L^\infty(\mathbb R) is nonatomic, the factor is type II∞_\infty.

For λ=−1\lambda=-1, exponents differing by 22 give the same slope. The actual group is Q⋊{1,−1}\mathbb Q\rtimes\{1,-1\}. Keeping the redundant abstract exponent group Z\mathbb Z would give nonidentity elements acting identically, so that action would fail freeness. The exercise's definition as a group of transformations removes this kernel.

Exercise 6.3 (advanced: why ergodicity is necessary for uniqueness). Let Z\mathbb Z act on A=L∞(R)A=L^\infty(\mathbb R) by integer translations. Show that the action is free but not ergodic. Construct two invariant faithful semifinite normal traces which are not proportional, extend them to the crossed product, and exhibit a nonconstant central element of that crossed product.

Solution. Every nonidentity integer translation has no fixed point, so Lemma 4.2 gives freeness. The bounded nonconstant function sin⁡(2πx)\sin(2\pi x) is invariant under every integer translation; the action is therefore not ergodic.

For f∈A+f\in A_+, set ν1(f)=∫Rf(x) dx,ν2(f)=∫R(2+sin⁡(2πx))f(x) dx. \nu_1(f)=\int_{\mathbb R}f(x)\,dx,\qquad \nu_2(f)=\int_{\mathbb R}(2+\sin(2\pi x))f(x)\,dx. The density in the second formula is between 11 and 33. Both traces are faithful and normal, and both are finite on 1[−n,n]1_{[-n,n]}, which increase to 11; hence both are semifinite. Periodicity makes ν2\nu_2 invariant, and translation invariance makes ν1\nu_1 invariant.

They are not proportional. Indeed, ν1(1[0,1/2])=ν1(1[1/2,1])=12, \nu_1(1_{[0,1/2]})=\nu_1(1_{[1/2,1]})=\frac12, whereas ν2(1[0,1/2])=1+1π,ν2(1[1/2,1])=1−1π. \nu_2(1_{[0,1/2]})=1+\frac1\pi,\qquad \nu_2(1_{[1/2,1]})=1-\frac1\pi. Proposition 2.1 extends them to faithful semifinite normal traces τj=νjE\tau_j=\nu_j E. The extensions cannot be proportional because their restrictions to π(A)\pi(A) are not.

Finally π(sin⁡(2πx))\pi(\sin(2\pi x)) commutes with π(A)\pi(A) by commutativity and with every unu_n by invariance. It is a nonconstant central element. Equivalently the centre formula for this free action gives Z(R)=π(Aα)Z(R)=\pi(A^\alpha). This explains why the factorial and proportionality conclusions required ergodicity.

References

[Takesaki] M. Takesaki, Theory of Operator Algebras I, Springer-Verlag, 1979.

[Anantharaman–Popa] Claire Anantharaman and Sorin Popa, An introduction to II1 factors, author-hosted draft IIunV15.

[Trace prerequisites] Traces on von Neumann algebras, parts A and B, and the other programme lessons linked above, with their specific proof locators.

Editable source · Sources and component terms