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:
- Tomiyama's norm-one projection theorem is Theorem 8.5 of The universal enveloping von Neumann algebra. A norm-one linear retraction onto a unital operator subalgebra is positive and bimodular.
- Proposition 2.5 of Traces, part A gives the finite-trace approximation criteria for semifiniteness. Its Theorem 6.7 says that an algebra is semifinite exactly when it has a faithful semifinite normal trace. Theorem 5.2 gives the normal centre-valued trace of a finite algebra.
- Proposition 7.1, Theorem 7.2 and Theorem 9.1 of Traces, part B give ultraweak lower semicontinuity of normal traces, the bounded central density comparing two semifinite normal traces, and the trace-preserving normal expectation when the restricted trace is semifinite.
- Type decomposition and the classification of type-I factors are Theorems 7.2 and 10.3 of Projections and types. Banach–Alaoglu and the elementary operator topologies are in Operator spaces, trace class and preduals.
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 , Fubini’s theorem and the usual multiplication representation on . 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 be a nonzero von Neumann algebra and a maximal abelian unital von Neumann subalgebra. Thus . Suppose is a normal linear retraction of norm one: for . Tomiyama's theorem makes positive, unital and -bimodular. For , set This is an ultraweakly compact convex subset of the ball of radius .
Lemma 1.1. For every , Consequently there is at most one normal norm-one retraction onto .
Proof. We first construct a point of fixed by every conjugation from . For a unitary , put The maps are contractions, preserve , and commute for different , since is abelian. The telescoping identity gives For a finite set , compose over and apply the composition to . The resulting point satisfies (1.3), with replaced by , for every : all the other averages commute with and are contractions.
For finite and , the sets 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 , the smallest , and a sufficiently large in (1.3). Compactness therefore gives a point fixed by all these conjugations. It commutes with all unitaries of , hence with , and lies in .
Bimodularity gives . Normality and linearity then give for every . Any such in satisfies . This proves (1.2), including existence.
If is a second normal norm-one retraction onto , the same argument gives on . Since , we get .
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 is a faithful semifinite normal trace on , then its restriction to is semifinite, and
Proof. By the finite-trace approximation criterion, choose projections with . For , normality and the trace identity give Each is a bounded normal positive functional; its norm is . Thus (1.5) also explains the ultraweak lower semicontinuity furnished by the trace prerequisite.
For positive , every point of the convex orbit in (1.1) is positive and has trace . If , lower semicontinuity puts its entire ultraweak closure in . If , that inequality is automatic. Since , we obtain In particular are positive contractions with . Normality of gives . The positive-contraction approximation criterion for semifiniteness, Proposition 2.5 of the trace prerequisite, now makes 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 with on the positive cone. Lemma 1.1 makes , proving (1.4).
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 be a nonzero abelian von Neumann algebra, a countable discrete group, and an action. Use the regular crossed product , its coefficient representation , and its faithful normal expectation from the preceding lesson. Identifying with , its -valued retraction is .
A trace here is an additive, positively homogeneous map . 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
Proposition 2.1. A faithful invariant semifinite normal trace on extends to the faithful semifinite normal trace It is finite exactly when . If the action is free, every faithful semifinite normal trace on arises in this way from its restriction to .
Proof. Additivity, homogeneity and normality of follow from positivity and normality of . It is faithful because both and are faithful. For the coefficient , the positive sums proved in the preceding lesson are Both are increasing limits of finite sums. Normality, invariance and commutativity of give The equality is valid with infinite values; no subtraction of infinite quantities occurs. This is the trace identity.
Choose finite- projections in . Then in and . The trace approximation criterion makes semifinite. Also .
Conversely, suppose the action is free and is faithful, semifinite and normal on . The coefficient algebra is maximal abelian. Apply Theorem 1.2 to . It gives a faithful semifinite normal trace and . Covariance and unitary invariance of a trace give Thus is invariant.
3. Ergodicity and the four type criteria
The action is ergodic when .
Lemma 3.1. For an ergodic action, every nonzero invariant semifinite normal trace on is faithful. Any two such traces are positive scalar multiples of one another.
Proof. The support of an invariant normal trace is invariant: an automorphism takes its largest zero projection to another zero projection, and invariance gives equality. Ergodicity makes either or . Since , it is , which means faithfulness.
Let 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 is faithful, semifinite and normal, and there is a unique , , such that with .
Invariance of and gives, for every , The analogous identity holds for . Uniqueness in the comparison theorem therefore gives . Ergodicity yields . Its two support assertions give . Equation (3.1) now implies , , and .
Theorem 3.2. Suppose is countably infinite and is free and ergodic. Then is an infinite-dimensional factor, with the following alternatives.
- is type I exactly when contains a minimal projection whose translates satisfy In this case is atomic and is type I.
- is type II exactly when has a faithful finite invariant normal trace.
- is type II exactly when is nonatomic and has a faithful invariant semifinite normal trace with .
- is type III exactly when has no nonzero invariant semifinite normal trace.
Here nonatomic means that 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 are linearly independent: applying to a finite relation selects its coefficient at . Since is infinite, is infinite-dimensional.
The atomic alternative. Let be a minimal projection of . If , the restriction of to is the identity, so for every For this contradicts freeness. The minimal projections are therefore all distinct, and distinct minimal projections in an abelian algebra are orthogonal. Their sum is a nonzero invariant projection, hence is . In particular is atomic with these atoms.
The projection is minimal in . Indeed, for , every is scalar on , so commutes with . Maximal abelianness puts in , and then in . 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. One can also see the countable matrix units directly: The orthogonality in (3.2) makes , and their diagonal sum is . The usual minimal-corner matrix-unit decomposition identifies with .
Conversely, suppose is type I, and identify it normally with . 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 with finite operator trace. For some , its spectral projection is nonzero, and Thus is finite rank in . The nonzero abelian algebra is finite-dimensional and has a minimal projection . It is minimal in too, because any subprojection of in already lies in . 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 gives the faithful finite normal trace on . Thus is finite. A finite type-I factor is a finite matrix algebra, whereas is infinite-dimensional. Hence is type II. Conversely a type-II 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 . This proves the second alternative.
Infinite semifinite traces. Suppose is nonatomic and is faithful, invariant, normal and semifinite with . The trace makes semifinite. The first alternative excludes type I. If were finite, the second alternative would give a finite invariant normal trace on . Lemma 3.1 would make a finite positive multiple of , contrary to . The type decomposition for factors therefore makes type II.
Conversely a type-II factor has a faithful semifinite normal trace by Theorem 6.7 of Traces, part A. Its value at is infinite: a faithful finite trace would make the factor finite. Proposition 2.1 gives the invariant restricted trace , with ; the first alternative makes nonatomic. This proves the third alternative.
Type III. A factor is type III exactly when it is not semifinite. If has a nonzero invariant semifinite normal trace, Lemma 3.1 makes it faithful and Proposition 2.1 makes semifinite. Conversely if is semifinite, the trace existence theorem and Proposition 2.1 supply such an invariant trace on . This proves the fourth alternative.
The infinite-group hypothesis excludes finite matrix factors from the finite-trace alternative. For example the free transitive action of a group of order on atoms gives , with a finite invariant coefficient trace.
4. Rational translations
We establish ergodicity and freeness explicitly for the examples.
Lemma 4.1. On either with Lebesgue measure or with normalized Lebesgue measure, a function in fixed by all rational translations is constant almost everywhere.
Proof. Translation is continuous in the norm. For an indicator of a bounded interval on , the norm difference from a translate is at most twice the translation distance. Arc indicators give the same conclusion on . Finite linear combinations have the property, and their density in , together with the isometric nature of translation, proves it for every function.
For , this makes translation ultraweakly continuous: pairing a translated against is pairing against the oppositely translated . If all rational translations fix , density of in , or of in , shows that every translation fixes .
Choose a measurable bounded representative. For each translation , for almost every . Fubini, on bounded rectangles and then their countable union in the real case, gives this equality for almost every pair . The change of variables preserves product Lebesgue measure (and product normalized Lebesgue measure on the circle). Hence for almost every pair . Fubini once more, with any from the conull set of good sections, makes constant almost everywhere.
Lemma 4.2. Let be an invertible nonsingular Borel transformation of or , and let . If the fixed-point set of has measure zero, then is free on .
Proof. Suppose a nonzero projection supported an identity part, so for all . 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 and in every member of that family agrees for . The separating property gives . Thus is contained, modulo a null set, in the fixed-point set. It is null, contradicting .
Example 4.3: a type-II factor from circle translations. Let Every nonidentity translation has no fixed point, so Lemma 4.2 gives freeness. Lemma 4.1 gives ergodicity. The coefficient algebra is nonatomic, and is faithful, invariant, normal and finite. Theorem 3.2 gives a type-II factor. Its normalized trace is .
Example 4.4: a type-II factor from real translations. Let The same two lemmas give freeness and ergodicity. Lebesgue integration is faithful, invariant and normal, with . It is semifinite because the projections have finite trace. The coefficient algebra is nonatomic. Theorem 3.2 gives type II.
5. A dilation produces type III
Example 5.1. Let be the countable group of affine transformations Composition and inversion are Thus the displayed transformations form a group, with identity . They are distinct for distinct pairs .
On set 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 function .
A nonidentity translation has no fixed point. A transformation with has exactly one fixed point, . 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 were an invariant semifinite normal trace on for this full group. It is invariant under the rational translations. Lebesgue integration is also invariant, faithful, semifinite and normal for that subgroup. Apply Lemma 3.1 to the ergodic rational-translation action: it gives for a finite scalar .
But the dilation obeys For , the values are finite and unequal. Thus is not dilation invariant. This contradicts the assumption on . There is no nonzero invariant semifinite normal trace, and Theorem 3.2 makes 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, II, II and III exist in faithful representations on separable Hilbert spaces.
Proof. The atomic shift example in Exercise 6.3 of the preceding lesson gives , type I; 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 or is separable, and is countable. The regular representation is therefore on the separable Hilbert space .
6. Graded exercises with complete solutions
Exercise 6.1 (introductory: a faithful state need not give a trace). In , let be the diagonal algebra and let be the diagonal of . Put Show that 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. is unital and completely positive. Thus is a positive state; it is normal in this finite-dimensional algebra. If and , all three diagonal entries are zero, because their weights are strictly positive. Then for every standard basis vector, so . This proves faithfulness.
For , The trace identity fails. More generally, with strictly positive weights of sum , testing gives as a necessary condition for a trace. It is sufficient: equal weights give . Invariance under a cyclic permutation of the three atoms is exactly . 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 and , let be the group of actual transformations and let it act by inverse composition on . Prove freeness and ergodicity in both cases. Determine the crossed-product type. Explain why for one must identify exponents with the same transformation.
Solution. Since 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 is a nonzero translation and has no fixed point. Every transformation with slope different from has one fixed point. Thus all nonidentity fixed-point sets are null, and Lemma 4.2 proves freeness.
Change of variables gives, for , For , any invariant nonzero semifinite normal trace would, by uniqueness for the rational-translation subgroup, be with . The transformation of slope multiplies its value on an interval indicator by , contradicting invariance. The factor is type III.
For , every transformation has slope or and preserves Lebesgue measure. Integration is faithful, invariant, semifinite and normal with infinite value at . Since is nonatomic, the factor is type II.
For , exponents differing by give the same slope. The actual group is . Keeping the redundant abstract exponent group 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 act on 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 is invariant under every integer translation; the action is therefore not ergodic.
For , set The density in the second formula is between and . Both traces are faithful and normal, and both are finite on , which increase to ; hence both are semifinite. Periodicity makes invariant, and translation invariance makes invariant.
They are not proportional. Indeed, whereas Proposition 2.1 extends them to faithful semifinite normal traces . The extensions cannot be proportional because their restrictions to are not.
Finally commutes with by commutativity and with every by invariance. It is a nonconstant central element. Equivalently the centre formula for this free action gives . 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.