Diagonal expectations and invariant measures
Written by GPT-6.1 Sol (OpenAI), Ultra, September 2026. New original text is public domain (CC0).
Introduction
A relation operator is a matrix on every orbit. Reading its diagonal at the point that labels the orbit fibre gives a function on the measured space. Integrating that function gives a state or a weight. Invariance of the measure is exactly what allows us to exchange the two indices in the trace calculation.
We use the countable nonsingular action, relation , algebra , and diagonal of Orbits, stabilizers, and relation algebras. The positive-measure density theorem used below is proved in Measurable actions and compact models, Theorem 0.1. General type decomposition and the structure of type I factors are written prerequisites from the programme lesson Projections and types of von Neumann algebras, Theorems 7.2 and 10.3 and Corollary 10.4. We also reuse the written programme lesson Traces on von Neumann algebras, Corollary 5.12 and Theorem 6.7: a finite factor has a faithful normal tracial state, and a semifinite algebra with a faithful normal state has a faithful normal semifinite trace. These results are owned by the programme's operator-algebra foundations course; their compared proofs cover our countable-relation factors. The measurable-relation implications are proved below, including the sigma-finiteness of the invariant measure and the obstruction to a diffuse diagonal in a type I factor. Basic references are [Anantharaman–Popa] and [Takesaki].
1. Compressing to the diagonal
First replace by an equivalent probability measure. Let project onto functions supported on the diagonal. This subspace is naturally .
Theorem 1.1. There is a faithful normal conditional expectation
characterized by
We identify with its bounded function. For a finite sum of orbit-map kernels ,
Proof. Every commutes with second-coordinate multiplication , and so does . Thus , on the diagonal subspace, commutes with every multiplication operator on . Such an operator is itself multiplication: apply it to the constant function , use commutation on bounded functions, and use its norm bound on indicators to show that its value at is essentially bounded. Density of bounded functions then determines the operator.
Compression is unital on this subspace and completely positive. Identifying the multiplication algebra with therefore makes a unital completely positive map. Since commutes with the left diagonal, the map is -bimodular and fixes . If is a bounded increasing net of positive operators, compression gives . Hence is normal.
For ,
If , the separating-vector theorem implies . This is faithfulness. Finally, convolution of a finite orbit-map kernel with the diagonal vector has diagonal value , proving (1.2).
The expectation does not depend on the equivalent probability measure chosen. The unitary changing the measure multiplies by a positive function of the source coordinate. It preserves the diagonal subspace and conjugates its multiplication operators to themselves. Thus (1.1) gives the same function after any equivalent sigma-finite change of measure.
Proposition 1.2. The expectation is the unique normal conditional expectation onto . For a full-group map ,
Proof. Let be another such expectation. Bimodularity and force to be supported on the fixed points of , by a countable separating family. On that set is the identity, so . This is also the value of . Both maps agree on , hence on their algebraic span and, by normality, on .
Conjugating by gives another normal expectation onto . Uniqueness and the action of on functions give (1.4).
2. When diagonal integration is a trace
Call invariant for if every partial orbit map preserves measure between its domain and range. In the countable-action setting this is equivalent to invariance under every group element. One direction is immediate; the other follows by partitioning a partial orbit map into restrictions of group elements.
It is also equivalent to . To verify this, decompose a Borel subset of into disjoint partial-map graphs as in the prerequisite lesson. On each graph, equality of the two counting integrals says exactly that the partial map preserves measure.
Theorem 2.1. If is an invariant probability measure, then
is a faithful normal tracial state on .
Proof. Positivity, faithfulness, normality, and follow from Theorem 1.1. It remains to prove the trace identity.
A finite linear combination of the generators has a bounded kernel supported on finitely many group graphs. The action is
The finite graph bound gives uniformly bounded row and column sums, so these sums define bounded operators. Products and adjoints correspond to matrix products and conjugate transposes. For two such kernels,
Invariance allows inversion in this integral. The result is . Absolute integrability follows from the finite graph bounds and the probability normalization. The algebraic span is ultraweakly dense in . Holding one variable fixed and then the other, separate ultraweak continuity extends the identity to all bounded operators in .
There is a useful sigma-finite version.
Theorem 2.2. If is a sigma-finite invariant measure, then
is a faithful normal semifinite trace.
Proof. Choose with , and set . The corner has an ultraweakly dense algebra of finite orbit-map kernels supported on . Indeed, compressing a monomial restricts its graph to points whose two endpoints lie in . Products are again finite sums of such restricted partial-map kernels, and compression of an ultraweak approximation gives the stated density.
The finite-measure kernel calculation in Theorem 2.1, followed by separate ultraweak continuity, says that (2.2) is a finite trace on this corner, of total mass . This argument does not identify the source-coordinate multiplicity of the represented corner with a new base space. For and indices , the operator lies in a finite corner containing both projections. Its trace identity gives
For every positive , bimodularity gives . Thus This scalar convergence does not assert that increases as an operator. First let increase in the finite-corner identity above. Its left side converges by (2.3) to ; its right side converges by normality, since . Now let increase: , while (2.3) applies to the compressed right side. We obtain
This is the trace identity for the weight. For , the increasing operators converge strongly to , and
They prove semifiniteness. Faithfulness and normality follow from the expectation and integration.
3. Traces force invariant measures
Proposition 3.1. If has a faithful normal tracial state , then the measure
is an invariant probability measure equivalent to .
Proof. Normality gives countable additivity; normalization gives total mass one. Faithfulness gives exactly the same null sets as . For a partial orbit map and ,
The trace identity consequently gives .
Lemma 3.2. If an ergodic relation preserves a sigma-finite measure , then every equivalent sigma-finite invariant measure is a positive scalar multiple of .
Proof. Write with almost everywhere. Invariance of both measures gives almost everywhere for every group element, by changing variables in the integral of each indicator. Countability makes the identities simultaneous on an invariant conull set. The level sets of , or of the bounded injective function , are invariant. Ergodicity makes constant almost everywhere.
This lemma supplies a simple obstruction. An ergodic invariant infinite measure cannot be equivalent to a finite invariant measure.
Lemma 3.3 (trace decreases under diagonal pinching). For any faithful normal semifinite trace on and ,
Proof. First choose finite-trace projections . To justify their existence, take a maximal orthogonal family of nonzero finite-trace projections. If its residual projection were nonzero, ultraweak density of the span of finite-trace positive elements would give such an element with . The trace identity gives . A nonzero spectral projection of then lies below and has finite trace, contradicting maximality. Thus the family sums to one. It is countable because the faithful normal state given by the diagonal vector is positive on every nonzero member. Finite partial sums give . This argument uses the trace identity; the corresponding order property must not be assumed for an arbitrary semifinite weight.
For , the trace identity and normality give Each functional is bounded and normal. Their supremum makes lower semicontinuous in the ultraweak topology on positive operators.
Let be the finite partition generated by the first members of a countable Borel generating family, and let be its diagonal projections. Define Every ultraweak cluster point commutes with all generating diagonal projections and hence belongs to the maximal abelian algebra . Bimodularity gives . Normality of therefore forces every cluster point to be , so ultraweakly.
For positive , the trace identity gives Lower semicontinuity proves (3.2).
Theorem 3.4. The countable relation algebra is semifinite exactly when admits an equivalent sigma-finite invariant measure.
Proof. An invariant measure gives the faithful normal semifinite trace in Theorem 2.2, after the measure-class unitary change.
Conversely, let be a faithful normal semifinite trace, and set . Normality gives countable additivity, and faithfulness gives exactly the same null sets as . The partial-isometry calculation in Proposition 3.1 works with infinite trace values as well, giving invariance.
It remains to prove sigma-finiteness; restriction of a semifinite weight to a subalgebra does not establish this automatically. Take the 's from Lemma 3.3. Write , where almost everywhere by normality. For the order inequality and (3.2) give The countable family covers a conull set. The remaining null set has -measure zero, so is sigma-finite.
Proposition 3.5 (an invariant ergodic subgroup fixes the density). Suppose a subgroup preserves a sigma-finite measure and its action is ergodic on measurable classes. Any sigma-finite measure equivalent to and invariant under the whole acting group is a positive scalar multiple of . In particular, if some element of the whole group fails to preserve , no such invariant measure exists.
Proof. Write the other measure as with almost everywhere. Invariance of both measures under any fixed , tested on indicators and followed by Radon–Nikodym uniqueness, gives almost everywhere. Thus the bounded injective transform is an invariant function class for . Its rational level sets are invariant classes, so ergodicity makes this function, and hence , constant almost everywhere. If the other measure were invariant under the whole group, this scalar identity would force invariant as well.
For a countable subgroup, exact invariant representatives come from countable null saturation. For a locally compact subgroup in the scope of Free actions and the crossed-product diagonal, Proposition 4.7 supplies them. The proof above only needs ergodicity of measurable classes; it does not assume a common pointwise density identity for an arbitrary uncountable subgroup. This is the measure argument behind Takesaki III, Chapter XIII, Lemma 1.8.
4. Atoms, single orbits, and type I
Assume from now on that is ergodic, so that is a factor.
Lemma 4.0 (small cells on a diffuse diagonal). Let for a standard sigma-finite space, and let be a nonzero diffuse projection. If is a finite normal positive functional on , then for every there is a finite partition in with .
Proof. Realize as a Borel subset of . The functional defines a finite measure on , absolutely continuous with respect to : null sets represent the zero projection. Every singleton has zero -measure on , since a positive-measure singleton would be a minimal projection below . It therefore also has zero -measure. Choose a countable Borel family separating points, and let be its increasing finite partitions of . The largest -mass of a cell tends to zero. Otherwise some would occur at arbitrarily large levels. In the finitely branching tree of cells, retain those cells with arbitrarily deep descendants of mass at least . A retained cell has a retained child, so recursively choose nested cells with . Their intersection contains at most one point, by separation. Continuity from above for the finite measure gives , contradicting the zero mass of singletons. A partition at a sufficiently large level gives the required projections.
Theorem 4.1. The factor is type I exactly when is concentrated on one orbit. On an orbit its algebra is .
Proof. If one orbit is conull, each of its points has positive mass: some point must have positive mass because the orbit is countable, and nonsingularity transports that property to all the other points. The explicit matrix-unit calculation from the prerequisite lesson gives , with the source-coordinate space as multiplicity.
Conversely, identify the type I factor abstractly with . The diagonal still has the faithful normal expectation of Theorem 1.1. We show that this diagonal must be atomic.
Suppose it has a nonzero diffuse projection . Choose a unit vector , and let . Apply Lemma 4.0 to the normal finite functional on . For any , it gives finitely many orthogonal summing to , with . Since , bimodularity gives
The vectors are orthogonal. Thus the positive finite-rank operator in parentheses has norm at most . Contractivity of implies . Letting decrease to zero contradicts faithfulness, since .
The diagonal is therefore atomic: otherwise the complement of the sum of its minimal projections would be a nonzero diffuse projection. There are countably many positive-measure atoms, since an equivalent probability assigns positive mass to each disjoint atom. Each atom has a point representative. Indeed sigma-finiteness gives it a finite positive-measure representative; for each member of a countable separating Borel family choose the side containing the atom modulo a null set. Their intersection still contains the atom modulo a countable union of null sets and contains at most one point. Thus a singleton represents that atom. Its saturation is an invariant set of positive measure, and ergodicity makes that orbit conull.
5. Finite and infinite invariant measures
Theorem 5.1. An ergodic countable nonsingular relation has a type algebra exactly when it is not concentrated on one orbit and admits an equivalent finite invariant measure.
Proof. Normalize such a measure to a probability. Theorem 2.1 and change of measure give a faithful normal tracial state. This makes the factor finite: if , then the trace of is zero, so faithfulness gives . Theorem 4.1 excludes type I, and the general factor alternatives give type . Conversely, the tracial state of a type factor gives the finite invariant measure by Proposition 3.1, and Theorem 4.1 excludes a conull single orbit.
Theorem 5.2. An ergodic relation has a type algebra exactly when it is not concentrated on one orbit and admits an equivalent infinite sigma-finite invariant measure.
Proof. Such a measure makes it semifinite by Theorem 2.2, and Theorem 4.1 excludes type I. If it were type , Proposition 3.1 would produce a finite invariant measure equivalent to the given infinite one, contradicting Lemma 3.2. It is consequently type .
Conversely, Theorem 3.4 gives an equivalent sigma-finite invariant measure. It cannot be finite, by Theorem 5.1, and Theorem 4.1 excludes a conull single orbit.
Example 5.3. Let act on a set of five points by a cycle. The presenting group is infinite; every stabilizer is ; the orbit relation is the complete relation on five points. Uniform probability is invariant and the action is ergodic. Its relation algebra is , of type . Thus an infinite presenting group does not replace the “not concentrated on one orbit” hypothesis in Theorem 5.1.
Even a faithful point action can have this measured behavior. Adjoin a disjoint copy of , give that copy measure zero, and let translate it by . The action on the enlarged countable standard Borel space is faithful at the level of points, because no nonzero translation fixes that copy pointwise. Its maps are nonsingular, its probability remains invariant and ergodic, and its relation algebra is still : a null source component contributes no Hilbert-space vectors. Faithfulness of the induced action on is a stronger requirement and fails in this example.
Takesaki III, Chapter XIII, Theorem 2.10(iii) uses “ is infinite” after dropping freeness in this section. Example 5.3 satisfies that hypothesis and its finite invariant-measure hypothesis, yet yields type . The corrected relation criterion is Theorem 5.1: replace the group-size condition by absence of a conull single orbit. Pointwise faithfulness alone does not repair the printed assertion, as the null-orbit variant shows. Under the separate free-action hypothesis of Theorem 1.7(ii), infinite group labels do give infinite orbits; the free-action lesson proves the resulting crossed-product criterion explicitly.
Theorem 5.4. An ergodic countable nonsingular relation has a type algebra exactly when it admits no equivalent sigma-finite invariant measure.
Proof. A factor is type exactly when it has no faithful normal semifinite trace. Apply Theorem 3.4.
The sigma-finite condition on the invariant measure is essential. Without it every nonsingular relation has an equivalent invariant measure taking only the values zero and infinity: assign zero to each -null set and infinity to every other measurable set. Exercise 6.9 proves this and explains why it supplies no semifinite trace. The type criterion uses the sigma-finite measured-space convention throughout.
The resulting classification depends on the measured orbit relation:
| Measured relation, assumed ergodic | Equivalent invariant measure | Factor type |
|---|---|---|
| One conull orbit with points | Equal positive mass at each point | |
| One conull countably infinite orbit | Counting measure, up to scalar | |
| No conull single orbit | Finite invariant measure | |
| No conull single orbit | Infinite sigma-finite invariant measure | |
| Any ergodic relation | No equivalent sigma-finite invariant measure |
These alternatives do not overlap. A conull countable orbit always has an equivalent counting measure, which is finite exactly when the orbit is finite. In the nontransitive invariant cases, Lemma 3.2 prevents both finite and infinite equivalent invariant measures from occurring.
6. Exercises with solutions
Level 1 asks for a computation or a direct application. Level 2 asks for a proof using the lesson’s framework. Level 3 combines results or examines a hypothesis whose failure changes the conclusion.
Exercise 6.1 (diagonal entries). Level 1. For a three-point complete relation with arbitrary positive masses, compute on a matrix .
Solution. It is the diagonal matrix with entries . The source weights change the represented Hilbert-space norm but not this expectation. Integration gives ; it is tracial exactly when the masses are equal. Comparing the products of the matrix units and proves the necessity.
Exercise 6.2 (an invariant infinite measure). Level 1. Let with counting measure and let the action be translation. Identify the algebra and the trace. Explain why infinite invariant measure does not imply type here.
Solution. There is one orbit. The algebra is , and (2.2) is its ordinary operator trace, obtained by summing the diagonal. It is type . Theorem 5.2 includes the essential hypothesis excluding a conull single orbit.
Exercise 6.3 (a nonfree finite factor). Level 2. Let act on the two-sided fair Bernoulli space by the shift of its first factor. Prove that the relation algebra is type .
Solution. Product probability is invariant. The shift is mixing: for cylinder events depending on finitely many coordinates, sufficiently distant translates use disjoint coordinates and hence are independent. Approximate arbitrary events in measure by cylinder events to get mixing for all events. An invariant event then satisfies , proving ergodicity. The measure is nonatomic: each sequence has probability at most from specifying any coordinates. A countable orbit therefore has measure zero. Theorem 5.1 gives type , even though the stabilizer is present everywhere.
Exercise 6.4 (uniqueness of a density). Level 2. Suppose an ergodic relation preserves probability , and is integrable. Show that is invariant exactly when is constant almost everywhere.
Solution. The forward implication is Lemma 3.2. The reverse implication follows by multiplying every measure-preservation identity by that constant.
Exercise 6.5 (semifinite approximation). Level 3. In Theorem 2.2, verify both the order bound and trace estimate for .
Solution. Since , multiplication on both sides by gives . Apply the trace identity to to get equality of its weight with that of . The latter operator is at most , so the weight is at most . Strong convergence follows from .
Exercise 6.6 (a finite presenting group). Level 2. Let a finite group act nonsingularly and ergodically on a nonzero standard sigma-finite measured space. Freeness is not assumed. Prove that one finite orbit is conull and identify the relation factor. Explain how its matrix size depends on a stabilizer.
Solution. Replace the measure by an equivalent probability. All orbit classes are finite, so the finite-class sorting lemma supplies a Borel orbit selector . Every Borel subset of its representative space pulls back to an invariant Borel set. The probability therefore assigns only zero or one to its Borel sets. Choose a countable separating family of those sets; for each choose either the set or its complement with measure one. Their intersection has measure one and at most one point, so is concentrated at one representative. Its orbit is conull. Each point of has positive mass by nonsingularity, and equal masses give an equivalent invariant probability. The relation algebra is , where for any , by the orbit–stabilizer bijection . Thus the matrix size is the index of the stabilizer; it equals precisely when that stabilizer is trivial.
Exercise 6.7 (compression need not increase). Level 2. On , let , , and . Show that but . Explain which two different limit arguments justify Theorem 2.2.
Solution. The difference is , whose determinant is ; its eigenvalues have opposite signs, so it is not positive. In the relation calculation the scalar identity (2.3) handles compression by diagonal , because the integrals over increase. For at fixed , the right-side operators do increase: they are of the form . Normality handles this operator limit. Then normality handles , while (2.3) handles . Neither step assumes an order inequality for .
Exercise 6.8 (no faithful expectation onto a diffuse diagonal). Level 2. Suppose a diffuse standard abelian algebra is a unital subalgebra of . Prove that a normal -bimodular positive unital map cannot be faithful.
Solution. Fix a unit vector and its rank-one projection . The vector functional is normal on , by restriction from . Lemma 4.0 gives a finite partition in with . Since , bimodularity yields . The summands act on orthogonal vectors , so . Positivity and unitality give . As is arbitrary, , although . This violates faithfulness. The argument also proves the conclusion without assuming normality of ; the normal functional needed for the partition is the vector functional itself.
Exercise 6.9 (an invariant measure outside the sigma-finite category). Level 3. On any nonzero sigma-finite nonsingular measured action, define if , and otherwise. Prove countable additivity, equivalence and invariance. Show that is neither sigma-finite nor semifinite. Apply this observation to the affine type example in Measurable actions and compact models, Example 4.3, and explain why it does not contradict Theorem 5.4.
Solution. For a disjoint countable union, either all sets are -null, in which case both the union's value and the sum of values are zero, or one set has positive -measure, in which case both are infinity. Thus is a measure with precisely the -null sets. Nonsingularity preserves this zero-versus-infinity distinction under every partial orbit map, giving invariance. Every set of finite -measure is -null. Countably many such sets cannot cover the nonzero measured space, so is not sigma-finite. A positive-measure set has infinite -measure but has no subset of positive finite -measure; the measure is not semifinite either. Example 4.3 proves that rational translations together with a nontrivial dilation have no equivalent sigma-finite invariant measure, and the resulting ergodic relation has type . The present infinite-valued measure still exists there. It is excluded by Theorem 5.4's explicit sigma-finite hypothesis, and diagonal integration against it is infinite on every nonzero positive operator by faithfulness of the expectation, so it supplies no semifinite trace.
References
- [Anantharaman–Popa] Claire Anantharaman and Sorin Popa, An introduction to factors, author-hosted draft
IIunV15.pdf. Sections 1.4–1.5 and 9.1 provide probability-preserving examples and finite tracial conditional expectations. Read the authors’ draft. This is an accessible scholarly reference; no licence to reproduce or translate its text is assumed. The complete proofs used here are the owned and programme arguments identified above. - [Takesaki] Masamichi Takesaki, Theory of Operator Algebras III, Encyclopaedia of Mathematical Sciences 127, Springer, 2003. Publisher record.