Original text: CC0 1.0. Prerequisite proofs and component terms.

Changing reference for a weight cocycle

The ordered chain rule

Theorem. Let α,β,γ\alpha,\beta,\gamma be faithful normal semifinite weights on a von Neumann algebra MM. For every real tt, [Dγ:Dα]t=[Dγ:Dβ]t[Dβ:Dα]t.(CH.1) [D\gamma:D\alpha]_t =[D\gamma:D\beta]_t[D\beta:D\alpha]_t. \tag{CH.1} The factors need not commute.

Proof. Represent MM faithfully and nondegenerately on a Hilbert space HH, and put N=M′N=M'. Choose a faithful normal semifinite weight ω\omega on NN. All three spatial derivatives can then be taken on the same HH: A=dαdω,B=dβdω,C=dγdω. A=\frac{d\alpha}{d\omega},\qquad B=\frac{d\beta}{d\omega},\qquad C=\frac{d\gamma}{d\omega}. They are positive, injective, self-adjoint operators. Their imaginary powers are bounded unitaries on all of HH, even if the derivatives and their inverses are unbounded. The spatial formula for the balanced-weight cocycle gives [Dγ:Dβ]t[Dβ:Dα]t=(CitB−it)(BitA−it)=CitA−it=[Dγ:Dα]t. \begin{aligned} [D\gamma:D\beta]_t[D\beta:D\alpha]_t &=(C^{it}B^{-it})(B^{it}A^{-it})\\ &=C^{it}A^{-it}\\ &=[D\gamma:D\alpha]_t. \end{aligned} Only the adjacent factors involving BB cancel. No unbounded operators are moved across one another, and no common domain for their products is needed. Each cocycle in this computation lies in MM and is independent of the commutant weight and of the faithful representation. Faithfulness of the representation proves the identity in MM. The zero algebra has the same identity in its zero-dimensional representation. □\square

Reversal and paths of reference changes

Taking all three weights equal in the theorem gives the identity cocycle. Taking γ=α\gamma=\alpha then gives the reverse comparison: [Dα:Dα]t=1,[Dα:Dβ]t=[Dβ:Dα]t∗.(CH.2) [D\alpha:D\alpha]_t=1,\qquad [D\alpha:D\beta]_t=[D\beta:D\alpha]_t^*. \tag{CH.2} Indeed, the spatial formula yields AitA−it=1A^{it}A^{-it}=1, and each cocycle is unitary.

For faithful normal semifinite weights φ0,…,φn\varphi_0,\ldots,\varphi_n, apply the chain rule repeatedly: [Dφn:Dφ0]t=[Dφn:Dφn−1]t⋯[Dφ1:Dφ0]t.(CH.3) [D\varphi_n:D\varphi_0]_t =[D\varphi_n:D\varphi_{n-1}]_t \cdots[D\varphi_1:D\varphi_0]_t. \tag{CH.3} Induction gives this product in precisely the displayed order. If n=0n=0, it is the empty product 11. Thus an intermediate reference can be inserted or removed without changing the total comparison.

The same order appears in modular covariance. Set ut=[Dβ:Dα]tu_t=[D\beta:D\alpha]_t and vt=[Dγ:Dβ]tv_t=[D\gamma:D\beta]_t. The spatial construction gives σtβ=Ad⁡(ut)∘σtα\sigma_t^\beta=\operatorname{Ad}(u_t)\circ\sigma_t^\alpha. Using the cocycle laws for uu and vv, vs+tus+t=vsσsβ(vt) usσsα(ut)=vsusσsα(vt)us∗usσsα(ut)=(vsus)σsα(vtut). \begin{aligned} v_{s+t}u_{s+t} &=v_s\sigma_s^\beta(v_t)\,u_s\sigma_s^\alpha(u_t)\\ &=v_su_s\sigma_s^\alpha(v_t)u_s^*u_s\sigma_s^\alpha(u_t)\\ &=(v_su_s)\sigma_s^\alpha(v_tu_t). \end{aligned} Hence vuvu is a σα\sigma^\alpha-cocycle. Both factors are strongly* continuous unitary families, so their product is strongly* continuous as well.

Editable source · Proof dependencies and component terms