Normalizers, phases, and orbit cocycles

Written by GPT-6.1 Sol (OpenAI), Ultra, September 2026. New original text is public domain (CC0).

Introduction

An operator can move points of a measured space and also multiply vectors by a phase. Its action on multiplication operators reveals the motion, but hides the phase. We will keep both pieces of information.

The prerequisite lesson Orbits, stabilizers, and relation algebras constructs M=M(R,μ)\mathcal M=\mathcal M(R,\mu) on L2(R,νs)L^2(R,\nu_s), with diagonal A={Mf:f∈L∞(X)}\mathcal A=\{M_f:f\in L^\infty(X)\}, partial orbit operators VθV_\theta, and a cyclic separating diagonal vector Ω\Omega. Use an equivalent probability measure throughout. The group presenting RR is countable and acts nonsingularly on a standard Borel space.

The following measure-theoretic lemma supplies the spatial realization of abstract diagonal isomorphisms. Besides normality and bounded Borel functional calculus, it uses the one-to-one image theorem for standard Borel spaces.

Lemma 0.1 (realizing a function-algebra isomorphism). A normal isomorphism α:L∞(X,μ)→L∞(Y,η)\alpha:L^\infty(X,\mu)\to L^\infty(Y,\eta) of standard probability-space algebras is induced by a measure-class preserving Borel isomorphism ρ:Y→X\rho:Y\to X on conull subsets: α(f)=f∘ρ. \alpha(f)=f\circ\rho.

Proof. Choose a Borel injection b:X→[0,1]b:X\to[0,1]. Its image is Borel and its inverse on that image is Borel. Let cc be a Borel representative of the bounded self-adjoint element α(b)\alpha(b). Normality and spectral functional calculus give α(1b−1(B))=1c−1(B) \alpha(\mathbf1_{b^{-1}(B)})=\mathbf1_{c^{-1}(B)} for every Borel B⊂[0,1]B\subset[0,1]. In particular, c∈b(X)c\in b(X) almost everywhere. Define ρ=b−1∘c\rho=b^{-1}\circ c there, with any fixed value on the remaining null set. Bounded Borel functions of bb include every bounded Borel function on XX, so functional calculus gives α(f)=f∘ρ\alpha(f)=f\circ\rho for all such functions, hence for all L∞L^\infty classes.

A null-set indicator maps to zero, proving that ρ\rho is nonsingular. Apply the same construction to α−1\alpha^{-1} and obtain a nonsingular σ:X→Y\sigma:X\to Y. The two composition identities, applied to Borel injections of XX and YY into [0,1][0,1], give ρσ=idX\rho\sigma=\mathrm{id}_X and σρ=idY\sigma\rho=\mathrm{id}_Y almost everywhere. Remove these exceptional sets and their preimages under the two nonsingular maps. The maps are then inverse Borel bijections of conull subsets. Their nonsingularity in both directions proves measure-class preservation. □\square

Basic references are [Anantharaman–Popa] and [Takesaki].

Section 5 also uses the modular coordinates in Relation kernels and modular coordinates, together with the natural-cone implementation prerequisite stated in Section 5 below. Its topology argument keeps ordinary pointwise positivity separate from the natural cone.

1. A unitary has more information than its motion

The full group [R][R] consists of nonsingular Borel automorphisms θ\theta satisfying θx∈[x]R\theta x\in[x]_R, modulo equality almost everywhere. The unitary normalizer is

NM(A)={u∈U(M):uAu∗=A}. \mathcal N_{\mathcal M}(\mathcal A) =\{u\in\mathcal U(\mathcal M):u\mathcal A u^*=\mathcal A\}.

For θ∈[R]\theta\in[R], VθV_\theta is a unitary and normalizes A\mathcal A. So does every MbM_b with ∣b∣=1|b|=1. The latter unitaries act trivially on A\mathcal A.

Theorem 1.1. Every unitary normalizer has a unique expression

u=MbVθ,θ∈[R],∣b∣=1 almost everywhere.(1.1) u=M_bV_\theta,\qquad \theta\in[R],\quad |b|=1\text{ almost everywhere}. \tag{1.1}

Uniqueness of θ\theta is modulo null sets. The multiplication law is

(MbVθ)(McVψ)=Mb(c∘θ−1)Vθψ.(1.2) (M_bV_\theta)(M_cV_\psi) =M_{b(c\circ\theta^{-1})}V_{\theta\psi}. \tag{1.2}

Proof. Spatial realization of the induced normal automorphism of A\mathcal A gives a nonsingular θ\theta with

uMfu∗=Mf∘θ−1.(1.3) uM_fu^*=M_{f\circ\theta^{-1}}. \tag{1.3}

Initially we do not know that θ\theta preserves RR. Let ξ=uΩ\xi=u\Omega. Right multiplication NfN_f commutes with uu, and MfΩ=NfΩM_f\Omega=N_f\Omega. Consequently

Nfξ=Mf∘θ−1ξ. N_f\xi=M_{f\circ\theta^{-1}}\xi.

Take a countable family of Borel sets separating points. This identity shows that ξ(z,x)\xi(z,x) is supported on z=θxz=\theta x. Write its value there as c(x)c(x), and set c(x)=0c(x)=0 where (θx,x)∉R(\theta x,x)\notin R. For bounded hh, unitarity gives

∫X∣h(x)∣2 dμ(x)=∥uMhΩ∥2=∫X∣h(x)∣2∣c(x)∣2 dμ(x). \int_X|h(x)|^2\,d\mu(x) =\|uM_h\Omega\|^2 =\int_X|h(x)|^2|c(x)|^2\,d\mu(x).

Thus ∣c(x)∣=1|c(x)|=1 almost everywhere. In particular, θx∈[x]R\theta x\in[x]_R almost everywhere. Discard the invariant saturation of the exceptional set and its countably many iterates under θ\theta and θ−1\theta^{-1}; this is null, since the maps involved are nonsingular. The automorphism θ\theta then belongs to the full group on that conull space.

Set b(z)=c(θ−1z)b(z)=c(\theta^{-1}z). The vectors uΩu\Omega and MbVθΩM_bV_\theta\Omega agree. Their difference is in M\mathcal M and kills its separating vector, so (1.1) follows.

Equation (1.3) determines θ\theta almost everywhere by countable separation. The vector on its graph then determines bb. Finally, VθMcVθ∗=Mc∘θ−1V_\theta M_cV_\theta^*=M_{c\circ\theta^{-1}}, giving (1.2). □\square

In the proof, it is enough to remove the saturation of a null set and then close the removed set under θ±1\theta^{\pm1} and the presenting group repeatedly. This uses only countably many nonsingular maps.

Example 1.2. Let X={a,b}X=\{a,b\} with equal masses and R=X×XR=X\times X. In its 2×22\times2 matrix algebra, the diagonal unitary diag⁡(1,i)\operatorname{diag}(1,i) normalizes the diagonal. A full-group operator is either the identity or the permutation matrix exchanging the points. Neither is this diagonal unitary.

More generally, the scalar unitary i1i1 is a normalizer for every nonzero relation algebra. It cannot be VθV_\theta: equality of their actions on the diagonal would force θ\theta to be the identity, while Vid=1V_{\mathrm{id}}=1.

Reference: [Takesaki, Proposition XIII.2.17] omits the phase factor in (1.1); Example 1.2 shows why it is needed.

The last matrix step in the printed proof has the same defect. Intertwining the two diagonal actions forces every entry off the graph of the induced motion to vanish. Unitarity forces the remaining entry in each column to have modulus one; it does not force that entry to equal one. The functions c(x)c(x) and b(z)b(z) in the proof above retain exactly these entries. Thus the correction applies to the full statement and its proposed proof, including finite orbits and actions with stabilizers.

It follows that

1⟶U(A)⟶NM(A)⟶[R]⟶1(1.4) 1\longrightarrow\mathcal U(\mathcal A) \longrightarrow\mathcal N_{\mathcal M}(\mathcal A) \longrightarrow[R]\longrightarrow1 \tag{1.4}

is a split exact sequence. The splitting is θ↦Vθ\theta\mapsto V_\theta. The full group describes the normalizer modulo diagonal phases.

2. Recognizing orbits from a diagonal pair

Suppose (S,η)(S,\eta) is another countable nonsingular orbit relation on a standard space YY. Assume a normal isomorphism

Φ:M(R,μ)⟶M(S,η) \Phi:\mathcal M(R,\mu)\longrightarrow\mathcal M(S,\eta)

takes the diagonal algebra onto the diagonal algebra. Spatial realization of that restriction gives a measure-class preserving Borel map ϕ:X→Y\phi:X\to Y, on conull subsets, with

Φ(Mf)=Mf∘ϕ−1. \Phi(M_f)=M_{f\circ\phi^{-1}}.

Theorem 2.1. The map ϕ\phi is an orbit equivalence.

Proof. For each element gg of the group presenting RR, Φ(Vg)\Phi(V_g) normalizes the second diagonal. Theorem 1.1 makes its induced motion a member of [S][S]. Its action on multiplication functions is also conjugation of gg by ϕ\phi, so

ϕ(gx)Sϕ(x) \phi(gx)\mathrel S\phi(x)

almost everywhere. Remove the countable union of exceptional sets and its saturation. Every RR-pair then becomes an SS-pair. Apply the same argument to Φ−1\Phi^{-1} and the countable group presenting SS to get the reverse implication. □\square

Together with the forward transport theorem in the prerequisite lesson, this recovers the measured relation from the algebra with its distinguished diagonal. The diagonal is part of the data.

3. Phases on journeys

A circle-valued cocycle is a measurable function c:R→Tc:R\to\mathbb T satisfying

c(w,x)=c(w,z)c(z,x)(3.1) c(w,x)=c(w,z)c(z,x) \tag{3.1}

on composable arrows, outside one invariant null set. In particular c(x,x)=1c(x,x)=1 and c(x,z)=c(z,x)‾c(x,z)=\overline{c(z,x)}. Because the presenting group is countable, identities given almost everywhere for each pair of group elements can be put on such a common conull set.

Define the unitary

(Ucξ)(z,x)=c(z,x)ξ(z,x). (U_c\xi)(z,x)=c(z,x)\xi(z,x).

It commutes with every MfM_f, and

UcVgUc∗=MbgVg,bg(z)=c(z,g−1z).(3.2) U_cV_gU_c^*=M_{b_g}V_g,\qquad b_g(z)=c(z,g^{-1}z). \tag{3.2}

Indeed the multiplier obtained by conjugation is c(z,x)c(g−1z,x)‾=c(z,g−1z)c(z,x)\overline{c(g^{-1}z,x)}=c(z,g^{-1}z). Thus αc=Ad⁡(Uc)∣M\alpha_c=\operatorname{Ad}(U_c)|_{\mathcal M} is an automorphism fixing A\mathcal A pointwise.

This also gives the exact convolution formula in [Takesaki, Theorem XIII.2.21(ii)]. For a bounded left convolution kernel ff, write (Tfξ)(y,x)=∑z∈[x]Rf(y,z)ξ(z,x). (T_f\xi)(y,x)=\sum_{z\in[x]_R}f(y,z)\xi(z,x). On one invariant conull set the cocycle identity holds for all composable arrows. Consequently (UcTfUc∗ξ)(y,x)=∑z∈[x]Rc(y,x)f(y,z)c(z,x)‾ξ(z,x)=∑z∈[x]Rc(y,z)f(y,z)ξ(z,x)=(Tcfξ)(y,x).(3.2a) \begin{aligned} (U_cT_fU_c^*\xi)(y,x) &=\sum_{z\in[x]_R}c(y,x)f(y,z)\overline{c(z,x)}\xi(z,x)\\ &=\sum_{z\in[x]_R}c(y,z)f(y,z)\xi(z,x) =(T_{cf}\xi)(y,x). \end{aligned} \tag{3.2a} These sums converge by Cauchy–Schwarz: the row of a bounded fibre matrix belongs to ℓ2([x]R)\ell^2([x]_R), and the vector on that fibre belongs to the same space. Conjugation makes TcfT_{cf} bounded with the same norm as TfT_f; multiplication by cc preserves every absolute row or column bound in the kernel algebra. Applying the inverse cocycle gives the reverse inclusion. Hence the formula covers the full bounded kernel algebra, rather than only the individual group generators.

Theorem 3.1. The correspondence c↦αcc\mapsto\alpha_c is a group isomorphism from measurable circle-valued relation cocycles onto normal automorphisms of M\mathcal M fixing A\mathcal A pointwise.

Proof. Products of cocycles give products of their multiplication unitaries, so the map is a homomorphism. Formula (3.2) also shows injectivity: the graphs of the gg's cover RR.

Let α\alpha fix A\mathcal A pointwise. Both VgV_g and α(Vg)\alpha(V_g) implement the same motion gg on the diagonal. Theorem 1.1, or maximal abelianness applied to α(Vg)Vg∗\alpha(V_g)V_g^*, gives unique functions bg∈L∞(X,T)b_g\in L^\infty(X,\mathbb T) such that

α(Vg)=MbgVg.(3.3) \alpha(V_g)=M_{b_g}V_g. \tag{3.3}

The identity VgVh=VghV_gV_h=V_{gh} implies

bgh(z)=bg(z)bh(g−1z).(3.4) b_{gh}(z)=b_g(z)b_h(g^{-1}z). \tag{3.4}

There is an additional compatibility imposed by stabilizers. On the Borel set D={x:gx=hx}D=\{x:gx=hx\}, we have VgM1D=VhM1DV_gM_{1_D}=V_hM_{1_D}. Apply α\alpha, which fixes this projection. Evaluation of the resulting graph vectors gives

bg(gx)=bh(hx)almost everywhere on D.(3.5) b_g(gx)=b_h(hx)\quad\text{almost everywhere on }D. \tag{3.5}

All the identities (3.4) and (3.5) involve countably many choices. Remove their null sets and their saturation. Now define

c(z,x)=bg(z)when z=gx.(3.6) c(z,x)=b_g(z)\quad\text{when }z=gx. \tag{3.6}

Equation (3.5) makes the definition independent of the chosen gg. Choosing the first representative in an enumeration makes it measurable. If z=hxz=hx and w=gzw=gz, then (3.4) gives

c(w,x)=bgh(w)=bg(w)bh(z)=c(w,z)c(z,x). c(w,x)=b_{gh}(w)=b_g(w)b_h(z)=c(w,z)c(z,x).

Thus it is a relation cocycle. Equations (3.2) and (3.3) show that α\alpha and αc\alpha_c agree on all generators. Normality makes them agree on M\mathcal M. □\square

The stabilizer compatibility (3.5) distinguishes a cocycle on the relation from an arbitrary cocycle on the transformation groupoid.

4. Which phases are inner?

A cocycle is a coboundary if there is a measurable b:X→Tb:X\to\mathbb T with

c(z,x)=b(z)b(x)‾.(4.1) c(z,x)=b(z)\overline{b(x)}. \tag{4.1}

Theorem 4.1. The automorphism αc\alpha_c is inner exactly when cc is a coboundary.

Proof. If (4.1) holds, then (3.2) identifies αc\alpha_c with Ad⁡(Mb)\operatorname{Ad}(M_b) on every generator. Conversely, suppose αc=Ad⁡(u)\alpha_c=\operatorname{Ad}(u) for u∈U(M)u\in\mathcal U(\mathcal M). Since it fixes A\mathcal A pointwise, uu commutes with A\mathcal A. Its maximal abelianness implies u=Mbu=M_b. Compare the conjugations of VgV_g to get (4.1) on every graph, hence on RR. □\square

Consequently, quotienting these diagonal-fixing automorphisms by their inner ones gives the first measurable cohomology group H1(R,T)H^1(R,\mathbb T). This concerns automorphisms that fix this diagonal pointwise; it does not classify all outer automorphisms of M\mathcal M.

5. Closed geometric symmetries

Let Aut⁡(R)\operatorname{Aut}(R) consist of measure-class Borel automorphisms ϕ\phi of XX carrying RR onto itself, modulo equality almost everywhere. Equivalently, these are the automorphisms normalizing [R][R]: conjugation carries full-group maps to full-group maps, and the countable presenting group reconstructs every relation arrow. This group is larger than [R][R].

Here is the full equivalence with [Takesaki, Definition XIII.2.18]. If ϕ\phi carries RR onto itself, then ϕθϕ−1\phi\theta\phi^{-1} and its inverse have graphs in RR for every θ∈[R]\theta\in[R], so they belong to [R][R]. Conversely, if ϕ\phi normalizes [R][R], apply that condition to each element gg of the countable presenting group. Outside a countable union of null sets, ϕ(gx)Rϕ(x)\phi(gx)\mathrel R\phi(x) for every gg. Apply the same argument to ϕ−1\phi^{-1} to obtain the reverse implication. Close the removed null sets under the presenting group and ϕ±1\phi^{\pm1}, repeating countably many times. All these maps are nonsingular, so their union is null. On the remaining conull domain the two implications hold simultaneously and ϕ\phi carries each orbit onto the corresponding orbit.

Each such ϕ\phi has a geometric implementation. Put hϕ=d(ϕ∗μ)dμ,(Wϕξ)(y,x)=hϕ(x)1/2ξ(ϕ−1y,ϕ−1x).(5.1) h_\phi=\frac{d(\phi_*\mu)}{d\mu},\qquad (W_\phi\xi)(y,x)=h_\phi(x)^{1/2} \xi(\phi^{-1}y,\phi^{-1}x). \tag{5.1} The Radon–Nikodym derivative here is defined for every measure-class symmetry. The expression δ(ϕ−1x,x)\delta(\phi^{-1}x,x) in [Takesaki, equation (36′), p. 27] can replace it when ϕ∈[R]\phi\in[R], by the partial-map change-of-variables formula. It is not defined for a general ϕ∈Aut⁡(R)\phi\in\operatorname{Aut}(R): the modulus δ\delta has domain RR, whereas ϕ−1x\phi^{-1}x need not be related to xx. For instance, the global complement of binary sequences in Exercise 6.7 preserves the fair measure and the tail relation, but the pair (ϕ−1x,x)(\phi^{-1}x,x) lies outside that relation for every xx. Its derivative in (5.1) is one. Thus (5.1) supplies the implementer at the entire scope of the geometric subgroup.

The source-coordinate factor is essential. Change of variables gives a unitary; it conjugates MfM_f to Mf∘ϕ−1M_{f\circ\phi^{-1}} and VθV_\theta to Vϕθϕ−1V_{\phi\theta\phi^{-1}}. Thus βϕ=Ad⁡(Wϕ)∣M\beta_\phi=\operatorname{Ad}(W_\phi)|_{\mathcal M} is an automorphism. Radon–Nikodym composition gives WϕWψ=WϕψW_\phi W_\psi=W_{\phi\psi}.

Corollary 5.0 (exact extension criterion). A normal automorphism of A\mathcal A extends to a normal automorphism of M\mathcal M if and only if its measure-class point map lies in Aut⁡(R)\operatorname{Aut}(R).

Proof. An extension carries the diagonal onto itself, so Theorem 2.1 makes its point map an orbit equivalence. Conversely, for every such point map, the unitary WϕW_\phi in (5.1) gives the required extension βϕ\beta_\phi. This proves both directions of [Takesaki, Corollary XIII.2.19]. □\square

Proposition 5.1 (the algebraic splitting). Every automorphism carrying A\mathcal A onto itself has a unique expression α=αcβϕ,c∈Z1(R,T),ϕ∈Aut⁡(R).(5.2) \alpha=\alpha_c\beta_\phi, \qquad c\in Z^1(R,\mathbb T),\quad \phi\in\operatorname{Aut}(R). \tag{5.2} Conjugation by βϕ\beta_\phi sends cc to (y,x)↦c(ϕ−1y,ϕ−1x)(y,x)\mapsto c(\phi^{-1}y,\phi^{-1}x). Consequently the diagonal-preserving automorphism group is algebraically the corresponding semidirect product.

Proof. Lemma 0.1 realizes the restriction of α\alpha as a measure-class map ϕ\phi. Theorem 2.1 proves that it preserves RR. Therefore αβϕ−1\alpha\beta_\phi^{-1} fixes A\mathcal A pointwise and is αc\alpha_c for a unique cocycle by Theorem 3.1. The restriction determines ϕ\phi, and then determines cc. Conjugate its kernel multiplier by (5.1) to obtain the asserted action on cocycles. □\square

We use one precise general prerequisite for the topology: in the standard GNS form (M,H,J,P)(\mathcal M,H,J,P), each normal automorphism α\alpha has a unique unitary UαU_\alpha normalizing M\mathcal M and preserving the natural cone PP. These unitaries form a representation, commute with JJ, and their strong topology equals the topology of pointwise norm convergence on the predual, also called the uu-topology. The prerequisite The positive cone of a standard representation, in Modular theory and weights, proves the cone construction and this implementation theorem. We use those results here; their general modular proof is not repeated.

For our faithful diagonal state the natural cone has the useful description P={aJaJΩ:a∈M}‾,aJaJ P⊂P.(5.3) P=\overline{\{aJaJ\Omega:a\in\mathcal M\}}, \qquad aJaJ\,P\subset P. \tag{5.3} Indeed the analytic kernel square q(aΩ)=aJaJΩq(a\Omega)=aJaJ\Omega generates the cone, and bounded strong-star approximation extends from the analytic algebra to M\mathcal M. This is the state case of the imported cone descriptions and standard-form axioms.

Lemma 5.2 (which implementer is geometric). In (5.2), the canonical standard implementer is Uα=UcWϕ.(5.4) U_\alpha=U_cW_\phi. \tag{5.4} It preserves the cone C={ξ∈L2(R,νs):ξ(y,x)≥0 almost everywhere}(5.5) C=\{\xi\in L^2(R,\nu_s):\xi(y,x)\geq0\text{ almost everywhere}\} \tag{5.5} onto itself exactly when c=1c=1.

Proof. The multiplier UcU_c fixes Ω\Omega and commutes with JJ, since c(y,x)=c(x,y)‾c(y,x)=\overline{c(x,y)}. It normalizes M\mathcal M. Equation (5.3), applied also to Uc∗U_c^*, proves that it preserves PP onto itself, so it is the canonical implementer of αc\alpha_c.

For WϕW_\phi, the modulus from the kernel lesson obeys δ(ϕ−1y,ϕ−1x)=hϕ(y)hϕ(x)δ(y,x).(5.6) \delta(\phi^{-1}y,\phi^{-1}x) =\frac{h_\phi(y)}{h_\phi(x)}\delta(y,x). \tag{5.6} This follows either by taking the ratio of the two pushed-forward counting measures, or by the partial-map change-of-variables formula. Substitution into Jξ(y,x)=δ(y,x)1/2ξ(x,y)‾J\xi(y,x)=\delta(y,x)^{1/2}\overline{\xi(x,y)} gives WϕJ=JWϕW_\phi J=JW_\phi.

Also WϕΩ=hϕ Ω∈PW_\phi\Omega=\sqrt{h_\phi}\,\Omega\in P: truncate hϕh_\phi and write the truncated vector as aJaJΩaJaJ\Omega with a=M(hϕ∧n)1/4a=M_{(h_\phi\wedge n)^{1/4}}. It converges in HH, since ∫hϕ dμ=1\int h_\phi\,d\mu=1. Therefore Wϕ(aJaJΩ)=βϕ(a)Jβϕ(a)J WϕΩ∈P. W_\phi(aJaJ\Omega) =\beta_\phi(a)J\beta_\phi(a)J\,W_\phi\Omega\in P. Apply the same argument to ϕ−1\phi^{-1}. Hence WϕP=PW_\phi P=P, and uniqueness makes it the standard implementer of βϕ\beta_\phi. The representation property proves (5.4).

The geometric unitary WϕW_\phi takes CC onto itself by its positive density factor. Thus (5.4) preserves CC precisely when multiplication by cc does. Test that multiplier on the nonnegative indicators of a countable finite-measure cover of RR. It follows that cc is nonnegative real almost everywhere. As ∣c∣=1|c|=1, this is equivalent to c=1c=1. □\square

The cones in (5.3) and (5.5) have different roles. For the full relation on two points with equal masses, HH identifies with 2×22\times2 matrices. The natural cone consists of positive semidefinite matrices; CC consists of matrices with nonnegative real entries. With b(a)=1b(a)=1, b(b)=ib(b)=i, the coboundary multiplier sends the positive-entry matrix of all ones to (1−ii1).(5.7) \begin{pmatrix}1&-i\\i&1\end{pmatrix}. \tag{5.7} This is still positive semidefinite, but is outside CC. Its eigenvalues are zero and two. A cocycle phase respects the natural cone while failing the geometric test.

A phase preserves the natural cone and fails pointwise positivity
Open diagram at full size

Figure 1. Lemma 5.2 and equation (5.7). Rows and columns are ordered a,ba,b, with equal base masses. The coboundary c(y,x)=b(y)b(x)‾c(y,x)=b(y)\overline{b(x)}, b(a)=1,b(b)=ib(a)=1,b(b)=i, multiplies the two off-diagonal entries by −i,i-i,i. Both displayed matrices lie in the natural cone PP; only the left one lies in the pointwise cone CC. The geometric test in Takesaki, Chapter XIII, Proposition 2.22 uses CC.

Theorem 5.3. Suppose RR is ergodic. The geometric subgroup G={βϕ:ϕ∈Aut⁡(R)}\mathcal G=\{\beta_\phi:\phi\in\operatorname{Aut}(R)\} is closed in Aut⁡(M)\operatorname{Aut}(\mathcal M) for the uu-topology, and is Polish. Moreover G∩Int⁡(M)={βθ:θ∈[R]},(5.8) \mathcal G\cap\operatorname{Int}(\mathcal M) =\{\beta_\theta:\theta\in[R]\}, \tag{5.8} and this full-group image is a Borel subgroup of G\mathcal G.

Proof. First the diagonal-preserving automorphisms form a closed subgroup. If αn\alpha_n converges to α\alpha, their standard implementers and their adjoints converge strongly. For a∈Aa\in\mathcal A, the bounded operators αn(a)\alpha_n(a) then converge strongly to α(a)\alpha(a). Strong closedness of A\mathcal A gives α(A)⊂A\alpha(\mathcal A)\subset\mathcal A; apply the same reasoning to the inverse automorphisms to get equality. The argument works for nets as well as sequences.

By Lemma 5.2, within that subgroup G\mathcal G is characterized by UαC=CU_\alpha C=C. The cone CC is closed: an L2L^2 limit has an almost-everywhere convergent subsequence, so retains pointwise nonnegativity. If both unitaries and their adjoints converge strongly, preservation onto a closed cone passes to the limit in both directions. Thus G\mathcal G is closed.

For completeness of the Polish assertion, HH is separable because the base is standard and the relation has a countable graph cover. On its unitary group choose a dense sequence of unit vectors ζj\zeta_j and the complete metric d(U,V)=∑j≥12−j(∥(U−V)ζj∥+∥(U∗−V∗)ζj∥).(5.9) d(U,V)=\sum_{j\geq1}2^{-j} \bigl(\|(U-V)\zeta_j\|+\|(U^*-V^*)\zeta_j\|\bigr). \tag{5.9} A Cauchy sequence gives limiting isometries for the maps and adjoints; passing to the bounded products gives mutually inverse limits. Thus the limit is unitary. This metric gives the strong topology on the unitary group. Separability follows by embedding the group in the countable product of copies of separable HH, which is second countable. Its subgroup of unitaries normalizing M\mathcal M and preserving PP is closed: strong limits and inverse limits preserve the strongly closed algebra and the closed cone. The imported implementation theorem therefore makes Aut⁡(M)\operatorname{Aut}(\mathcal M) Polish. Its closed subgroup G\mathcal G is Polish as well.

If βϕ=Ad⁡(u)\beta_\phi=\operatorname{Ad}(u), then uu normalizes A\mathcal A. Theorem 1.1 shows that its diagonal motion belongs to [R][R]; that motion is ϕ\phi. Conversely, for θ∈[R]\theta\in[R], Ad⁡(Vθ)\operatorname{Ad}(V_\theta) and βθ\beta_\theta agree on the diagonal and on every partial orbit operator, since both conjugate its motion by θ\theta. They agree on M\mathcal M, proving (5.8).

Finally Int⁡(M)\operatorname{Int}(\mathcal M) is Borel here. The strong unitary group U(M)\mathcal U(\mathcal M) is Polish, as a closed subgroup of U(H)\mathcal U(H). Choose a countable list of continuous matrix coefficients separating its points. For each unitary take the first nonzero coefficient and multiply by the unique scalar phase that makes it positive real. The resulting representatives form a Borel subset SS containing exactly one representative of each scalar coset. The map u↦Ad⁡(u)u\mapsto\operatorname{Ad}(u) is continuous into the uu-topology: its canonical implementer is uJuJuJuJ, which varies strongly with uu. Since ergodicity makes M\mathcal M a factor, two unitaries give the same inner automorphism exactly when they differ by a scalar. The map from SS is therefore Borel and injective. The one-to-one Borel image theorem makes its image Int⁡(M)\operatorname{Int}(\mathcal M) Borel in the Polish automorphism group. Intersecting with closed G\mathcal G proves the final assertion. □\square

Closedness of G\mathcal G does not imply closedness of its full-group subgroup. In the fair binary tail model, that subgroup has a concrete limit outside itself, as Exercise 6.7 shows. The distinguished diagonal and the topology remain part of the statement.

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 (a finite pair). Level 1. Write all normalizers of the diagonal in M2(C)M_2(\mathbb C).

Solution. They are the diagonal unitaries (a00b)\begin{pmatrix}a&0\\0&b\end{pmatrix} and the antidiagonal unitaries (0ab0)\begin{pmatrix}0&a\\b&0\end{pmatrix}, with ∣a∣=∣b∣=1|a|=|b|=1. Theorem 1.1 gives exactly these two motions and their two independent phases.

Exercise 6.2 (one orbit). Level 2. On a finite or countably infinite single orbit, prove that every relation cocycle is a coboundary.

Solution. Fix a point x0x_0. Put b(x)=c(x,x0)b(x)=c(x,x_0). Then (3.1) gives c(z,x)=c(z,x0)c(x,x0)−1c(z,x)=c(z,x_0)c(x,x_0)^{-1}. On a countable orbit every function is measurable. For a general nonsmooth measured relation, choosing a basepoint in every orbit measurably is a separate issue, so this proof does not settle that case.

Exercise 6.3 (descending through stabilizers). Level 2. Let Γ=Z×C2\Gamma=\mathbb Z\times C_2 act by the shift of the first factor on the two-sided Bernoulli space. A transformation-groupoid cocycle is the character a((n,ε),x)=(−1)εa((n,\varepsilon),x)=(-1)^\varepsilon. Does it descend to the principal relation?

Solution. No. The arrows ((0,0),x)((0,0),x) and ((0,1),x)((0,1),x) have the same image (x,x)(x,x), but their values are 11 and −1-1. Relation cocycles take the value 11 on unit arrows, so they must be trivial on every stabilizer when pulled back.

Exercise 6.4 (gauges with the same effect). Level 2. If bb and dd define the same coboundary, determine their ratio.

Solution. Equation (4.1) gives b(z)d(z)‾=b(x)d(x)‾b(z)\overline{d(z)}=b(x)\overline{d(x)} on RR. Their ratio is an invariant circle-valued function. If RR is ergodic, it is constant almost everywhere by the centre computation in the prerequisite lesson.

Exercise 6.5 (transporting a cocycle). Level 3. For an orbit equivalence ϕ:X→Y\phi:X\to Y, define a cocycle on the target relation and show that the transported automorphism has that cocycle.

Solution. Put d(y′,y)=c(ϕ−1y′,ϕ−1y)d(y',y)=c(\phi^{-1}y',\phi^{-1}y). Composition of target arrows becomes composition of source arrows, so (3.1) is preserved. Under the relation-Hilbert-space unitary, multiplication by cc becomes multiplication by dd. The measure-density factor depends only on the source coordinate and commutes with both. Thus the transported αc\alpha_c is αd\alpha_d.

Exercise 6.6 (two positivity tests). Level 2. For 0<θ<2π0<\theta<2\pi, take b(a)=1b(a)=1, b(b)=eiθb(b)=e^{i\theta}. Compute the image of the all-ones matrix under its coboundary multiplier. Determine its eigenvalues, and decide whether it lies in PP and CC.

Solution. The image is (1e−iθeiθ1)=vv∗\begin{pmatrix}1&e^{-i\theta}\\e^{i\theta}&1\end{pmatrix}=vv^* with v=(1,eiθ)tv=(1,e^{i\theta})^t. Hence it is positive semidefinite, with eigenvalues zero and two, and belongs to PP. To lie in CC, both off-diagonal entries would have to be nonnegative real. A complex number of modulus one with this property is one, which would require θ=0\theta=0 modulo 2π2\pi. Thus it is outside CC for the stated range. At θ=π\theta=\pi, its off-diagonal entries are negative real, so that endpoint inside the range also fails the test.

Exercise 6.7 (a Borel subgroup need not be closed). Level 3. On fair binary product space let ϕn\phi_n complement the first nn digits and let ϕ\phi complement every digit. For the tail relation prove βϕn→βϕ\beta_{\phi_n}\to\beta_\phi in the uu-topology, with every βϕn\beta_{\phi_n} inner and βϕ\beta_\phi outer.

Solution. All these maps preserve fair measure and the tail relation. Each ϕn\phi_n is itself a finite-coordinate change, so belongs to [R][R]; (5.8) makes its geometric automorphism inner. The global complement changes infinitely many coordinates of every sequence, so ϕx\phi x is never tail equivalent to xx. It lies outside [R][R]. Equation (5.8) therefore makes its geometric automorphism outer.

To verify convergence, let gg change a fixed finite set of digits and let ff depend on finitely many digits. Both ϕn\phi_n and ϕ\phi commute with gg, and for all sufficiently large nn, f∘ϕn−1=f∘ϕ−1f\circ\phi_n^{-1}=f\circ\phi^{-1}. Since the densities in (5.1) are one and the diagonal vector is fixed, Wϕn(VgMfΩ)=VgMf∘ϕn−1ΩW_{\phi_n}(V_gM_f\Omega)=V_gM_{f\circ\phi_n^{-1}}\Omega agrees eventually with Wϕ(VgMfΩ)W_\phi(V_gM_f\Omega). Finite sums of these vectors are dense: the countable graphs cover the relation and cylinder functions are dense in the base L2L^2. The unitaries therefore converge strongly on all HH, and their adjoints do too. The standard implementation topology gives the claimed uu-convergence. This proves nonclosedness of the full-group image inside the closed geometric group.

References