Compatible lifts and cohomology reduction

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

Introduction

On a finite class, choose a root and transport every point from that root. Composing these transports gives a homomorphism on all pairs. On an increasing union of finite classes, the choices must agree with the transports already constructed.

The same compatibility principle has an analytic version. Two cocycles that agree modulo the closure of a normal subgroup can be brought into agreement modulo the subgroup itself. The correcting functions converge; the remaining subgroup-valued errors stabilize exactly. Exact stabilization is essential when the subgroup is not closed.

Read Groupoids and measured orbit relations, Finite orbit classes and matrix blocks, and Normalizers, phases, and orbit cocycles. The groupoid prerequisite proves the unit, inverse, endpoint and equivalence identities used below and separates isotropy arrows from orbit points. Invariant means on measured relations supplies finite exhaustions for amenable actions. We use basic Polish-space topology and a complete compatible metric on a Polish group.

For a general standard Borel target, we use the measurable-section theorem from Polish spaces and standard Borel spaces, Theorem 7.7, together with its Theorem 6.2 on measurable Souslin sets. A Borel map from a standard Borel space into a standard Borel space has an image admitting a section measurable for every completed sigma-finite measure. Such a section need not be Borel everywhere. We explain below why a Borel version on one invariant conull source suffices for the lifting theorem.

Throughout, R=⋃nRnR=\bigcup_nR_n is a nonsingular Borel relation with countable classes on a standard sigma-finite measured space. Theorem 1.3 and Corollary 1.4 of the orbit lesson supply a countable nonsingular action presenting it, including for an arbitrary orbitally countable standard Borel principal groupoid. Each RnR_n has finite classes and the sequence increases. All statements may be made on a common invariant conull set if the measured exhaustion or identities initially hold almost everywhere.

Choose a Borel injection β:X→[0,1]\beta:X\to[0,1]. Let tn(x)t_n(x) be the least point of [x]Rn[x]_{R_n}, and let Sn={x:tn(x)=x}S_n=\{x:t_n(x)=x\}. The finite-class selector proof makes these maps and sets Borel. Moreover, Sn+1⊂Sn.(0.1) S_{n+1}\subset S_n. \tag{0.1}

0. Countable groupoids and full reductions

For a groupoid G\mathcal G, write X=G(0)X=\mathcal G^{(0)}, sγs\gamma for the source and rγr\gamma for the range of an arrow. Multiplication γη\gamma\eta is defined when sγ=rηs\gamma=r\eta; the arrow η\eta is traversed first. Its isotropy group at xx is Gxx={γ:sγ=rγ=x}\mathcal G_x^x=\{\gamma:s\gamma=r\gamma=x\}. A standard Borel groupoid has standard Borel arrow and unit spaces, with Borel unit inclusion, source, range, inversion and multiplication on the Borel set of composable pairs. It is orbitally countable when its range fibres are countable; inversion then makes its source fibres countable as well.

Two homomorphisms p,q:G→Hp,q:\mathcal G\to\mathcal H are equivalent when there is an arrow b(x):p(x)→q(x)b(x):p(x)\to q(x) for each unit, with q(γ)=b(rγ) p(γ) b(sγ)−1.(0.2) q(\gamma)=b(r\gamma)\,p(\gamma)\,b(s\gamma)^{-1}. \tag{0.2} In the Borel setting we require bb to be Borel. Units prove reflexivity, inverse arrows prove symmetry, and the pointwise product of two such fields proves transitivity: the middle inverse factors cancel in (0.2). Two groupoids are similar when homomorphisms in both directions have composites equivalent to the respective identity homomorphisms.

Lemma 0.1 (the derived relation is Borel). For an orbitally countable standard Borel groupoid, the endpoint relation RG={(rγ,sγ):γ∈G}(0.3) R_{\mathcal G}=\{(r\gamma,s\gamma):\gamma\in\mathcal G\} \tag{0.3} is a Borel equivalence relation with countable classes. The endpoint map is a Borel surjective homomorphism onto it, and it has a Borel right section as a map of sets. This section need not be a homomorphism. The endpoint map is a Borel isomorphism precisely when the groupoid is principal.

Proof. The endpoint map has countable fibres, each contained in a source fibre. The exact Lusin–Novikov prerequisite in the orbit lesson makes its image Borel and supplies a Borel section. Units, inverse arrows and composition give reflexivity, symmetry and transitivity of the image. The class of xx is the range of the countable source fibre at xx, so it is countable. Multiplication maps to (z,y)(y,x)=(z,x)(z,y)(y,x)=(z,x). If the groupoid is principal, endpoint injectivity and the Borel inverse were proved in Corollary 1.4 of that lesson. Conversely injectivity makes every isotropy arrow equal to its unit, so the groupoid is principal. No assertion of compatibility of the chosen section has been used. □\square

For Y⊂XY\subset X, the reduction G∣Y\mathcal G|_Y consists of the arrows having both endpoints in YY. The set is full when every orbit meets YY, equivalently s(r−1(Y))=Xs(r^{-1}(Y))=X. This does not mean that YY is invariant.

Theorem 0.2 (similarity to a full reduction). Every groupoid is similar to its reduction to a full subset. For an orbitally countable standard Borel groupoid and a full Borel subset, the homomorphisms and equivalence can be chosen Borel, with the composite on the reduction exactly its identity.

Proof. Choose an arrow fx:x→q(x)∈Yf_x:x\to q(x)\in Y for each xx, taking fyf_y to be the unit at yy when y∈Yy\in Y. This is a set-theoretic choice at the algebraic scope of the first assertion. At the stated Borel scope, apply Lusin–Novikov to the surjective countable-fibre map s:r−1(Y)⟶X. s:r^{-1}(Y)\longrightarrow X. Take its Borel section and replace its values on YY by the unit arrows. Thus both ff and q=r∘fq=r\circ f are Borel, with q∣Y=id⁡Yq|_Y=\operatorname{id}_Y.

Let i:G∣Y→Gi:\mathcal G|_Y\to\mathcal G be inclusion, and define ρ(γ)=frγ γ fsγ−1.(0.4) \rho(\gamma)=f_{r\gamma}\,\gamma\,f_{s\gamma}^{-1}. \tag{0.4} Its endpoints are q(sγ)q(s\gamma) and q(rγ)q(r\gamma), so it lies in the reduction. If sγ=rηs\gamma=r\eta, then ρ(γ)ρ(η)=frγγfsγ−1frη⏟unit at sγηfsη−1=ρ(γη). \rho(\gamma)\rho(\eta) =f_{r\gamma}\gamma \underbrace{f_{s\gamma}^{-1}f_{r\eta}}_{\text{unit at }s\gamma} \eta f_{s\eta}^{-1} =\rho(\gamma\eta). It maps unit arrows to unit arrows and therefore is a homomorphism. The maps are Borel when the choices are Borel, since every displayed product is composable and multiplication is Borel. For arrows in the reduction both outside factors in (0.4) are units, giving ρi=id⁡G∣Y\rho i=\operatorname{id}_{\mathcal G|_Y}. Equation (0.4) is also exactly (0.2), with p=id⁡Gp=\operatorname{id}_{\mathcal G}, q=iρq=i\rho and b(x)=fxb(x)=f_x. Hence iρi\rho is equivalent to the identity. This proves similarity, including empty unit spaces. □\square

The algebraic assertion is Takesaki XIII.3.6. The Borel enhancement uses the precisely stated countability hypothesis. It is not inferred from an arbitrary measurable-section theorem for uncountable fibres.

Corollary 0.3 (positive measured reductions). Let an orbitally countable standard Borel groupoid have a nonzero sigma-finite quasi-invariant ergodic unit measure μ\mu. For every positive Borel Y⊂XY\subset X, its saturation X0=[Y]RGX_0=[Y]_{R_{\mathcal G}} is invariant, Borel and conull, and G∣X0\mathcal G|_{X_0} is Borel-similar to G∣Y\mathcal G|_Y. After replacing μ\mu by an equivalent probability on X0X_0, the unit retraction qq in the proof pushes it forward to a probability equivalent to μ∣Y\mu|_Y.

Proof. The saturation is Borel by Lemma 0.1 and Lusin–Novikov for the source projection of r−1(Y)r^{-1}(Y). It is invariant and contains YY, so ergodicity makes it conull. Theorem 0.2 applies on X0X_0.

Quasi-invariance implies null saturation even when isotropy is nontrivial. For an arrow set CC, source and range counting measures vanish exactly when the measures of s(C)s(C) and r(C)r(C) vanish; these projections are Borel by Lusin–Novikov. Apply this to C=r−1(N)C=r^{-1}(N) for a Borel null NN. Its source is [N]RG[N]_{R_{\mathcal G}}, hence null. Let pp be a probability equivalent to μ\mu on X0X_0. For Borel N⊂YN\subset Y, N⊂q−1(N)⊂[N]RG.(0.5) N\subset q^{-1}(N)\subset[N]_{R_{\mathcal G}}. \tag{0.5} The first inclusion uses q∣Y=id⁡Yq|_Y=\operatorname{id}_Y, and the second uses the arrows fxf_x. Thus q∗p(N)=0q_*p(N)=0 if and only if μ∣Y(N)=0\mu|_Y(N)=0. The pushforward is a probability because qq is defined on all of X0X_0. □\square

Proposition 0.4 (isotropy survives reduction). For every choice in Theorem 0.2, Gxx⟶Gq(x)q(x),h⟼fxhfx−1(0.6) \mathcal G_x^x\longrightarrow\mathcal G_{q(x)}^{q(x)}, \qquad h\longmapsto f_x h f_x^{-1} \tag{0.6} is a group isomorphism. At Borel scope it is a Borel map on the isotropy field. If another choice fx′f'_x has the same endpoint q(x)q(x), its transport differs by the inner automorphism given by kx=fx′fx−1k_x=f'_x f_x^{-1}.

Proof. All products have the displayed endpoints. Cancelling fx−1fxf_x^{-1}f_x proves multiplication preservation, and conjugation by fx−1f_x^{-1} gives the inverse. The isotropy field is Borel since r=sr=s is a Borel equality test in the standard unit space; Borel multiplication gives the field map. Finally fx′=kxfxf'_x=k_xf_x, so its transported value is kx(fxhfx−1)kx−1k_x(f_xhf_x^{-1})k_x^{-1}. □\square

Example 0.5 (a reduction retains the group labels). Take X={0,1}X=\{0,1\} and a countable group KK. Give X×K×XX\times K\times X arrows (y,k,x):x→y(y,k,x):x\to y, with (z,l,y)(y,k,x)=(z,lk,x). (z,l,y)(y,k,x)=(z,lk,x). The singleton Y={0}Y=\{0\} is full. Choose fx=(0,e,x)f_x=(0,e,x). Then (0.4) sends (y,k,x)(y,k,x) to (0,k,0)(0,k,0), so the reduction is the one-unit group KK. Its isotropy survives unchanged. In contrast, the derived relation is the full two-point relation, whose singleton reduction has only an identity arrow. It has forgotten all KK-labels. If KK is nontrivial, the original groupoid cannot be similar to that one-unit trivial group: for hypothetical homomorphisms with composites equivalent to identities, their induced isotropy homomorphisms would have inverse composites up to conjugation by (0.2), whereas the composite through the trivial group annihilates every nonidentity isotropy element.

Transport to a full reduction preserves isotropy labels
Open diagram at full size

Figure 1. The exact transport in (0.4) for Example 0.5, sampled at x=1,y=0x=1,y=0. The arrow (0,k,1)(0,k,1) becomes (0,k,0)(0,k,0) under f0γf1−1f_0\gamma f_1^{-1}, so the loop label kk remains. The endpoint quotient of Lemma 0.1 instead remembers only the endpoints. This is an algebraic illustration of Theorem 0.2 and Proposition 0.4, not an isotropy-disintegration theorem. Source: Takesaki III, XIII.3.3–3.6.

1. Lifting a choice of arrows

Let H\mathcal H be a Borel groupoid and u:X→H(0)u:X\to\mathcal H^{(0)} a Borel map. Suppose we have a Borel choice a(y,x):u(x)⟶u(y),(y,x)∈R.(1.1) a(y,x):u(x)\longrightarrow u(y),\qquad (y,x)\in R. \tag{1.1} The choice need not respect composition.

Theorem 1.1. There is a Borel homomorphism σ:R→H\sigma:R\to\mathcal H with the endpoints in (1.1).

Proof. On R1R_1 define σ1(y,x)=a(y,t1x) a(x,t1x)−1.(1.2) \sigma_1(y,x)=a(y,t_1x)\,a(x,t_1x)^{-1}. \tag{1.2} The two roots agree on an R1R_1-pair, so the product is composable. Products telescope, and units map to units.

Suppose σn\sigma_n is defined on RnR_n. The relation Rn+1R_{n+1} restricted to SnS_n has finite classes, one point for each old class inside a new class. Its root is tn+1t_{n+1}. For its pairs put vn(p,q)=a(p,tn+1q) a(q,tn+1q)−1. v_n(p,q)=a(p,t_{n+1}q)\,a(q,t_{n+1}q)^{-1}. It is a homomorphism on this finite quotient relation. Extend by σn+1(y,x)=σn(y,tny) vn(tny,tnx) σn(tnx,x).(1.3) \sigma_{n+1}(y,x) =\sigma_n(y,t_ny)\, v_n(t_ny,t_nx)\, \sigma_n(t_nx,x). \tag{1.3}

When y Rn xy\,R_n\,x, their old roots coincide, so the middle factor is a unit and (1.3) equals σn(y,x)\sigma_n(y,x). For a composable pair in Rn+1R_{n+1}, the two adjacent old transports at the middle point cancel, and the two vnv_n's compose. Thus σn+1\sigma_{n+1} is a homomorphism.

The maps are Borel and agree exactly on their earlier domains. Define σ(y,x)=σn(y,x)\sigma(y,x)=\sigma_n(y,x) at any stage containing the pair. This is Borel by choosing the first such stage. Every composable finite collection lies in one stage, proving the homomorphism identity for σ\sigma. □\square

For a countable transformation groupoid, (1.1) is obtained by taking the first group element carrying xx to yy. For an arbitrary standard target, the following argument supplies the choice in the measured setting without requiring countably many target arrows.

Lemma 1.2 (Borel versions). A map from a standard Borel space with a sigma-finite measure into another standard Borel space, measurable for the completed source measure, agrees almost everywhere with a Borel map.

Proof. An empty source is immediate, and an empty target admits no map from a nonempty source. If the source measure is zero, any constant map into the nonempty target is a Borel version. Otherwise replace the source measure by an equivalent probability. Embed the target Borel-isomorphically in [0,1][0,1]. A completed-measurable real function has a Borel version: approximate it pointwise by simple functions, replace each of their countably many completed-measurable level sets by a Borel set differing by a null set, and take the limit on the Borel set where the resulting sequence converges. It agrees with the original function off one null set. Its values lie in the Borel image of the target almost everywhere. On that Borel preimage apply the inverse embedding, and on its complement choose any fixed target value. This constructs the asserted version. □\square

Theorem 1.3 (general measured lifting). Let R=⋃nRnR=\bigcup_nR_n be a hyperfinite relation presented by a countable nonsingular action on a standard sigma-finite measured space. No ergodicity assumption is needed. Let H\mathcal H be any standard Borel groupoid, with unit space VV, and let u:X→Vu:X\to V be Borel. Suppose that for every (y,x)∈R(y,x)\in R there is an arrow of H\mathcal H from u(x)u(x) to u(y)u(y). Then on an invariant conull Borel X0⊂XX_0\subset X there is a Borel homomorphism σ:R∣X0⟶H,s(σ(y,x))=u(x),r(σ(y,x))=u(y).(1.4) \sigma:R|_{X_0}\longrightarrow\mathcal H, \qquad s(\sigma(y,x))=u(x),\quad r(\sigma(y,x))=u(y). \tag{1.4} The target fibres and isotropy groups may be uncountable.

Proof. If the source measure is zero, take X0=∅X_0=\varnothing. Otherwise normalize an equivalent measure on XX to a probability. Source counting measure νs\nu_s on RR is sigma-finite, since its countable presenting graphs cover RR and each has measure at most one. Choose a probability ρ\rho on RR equivalent to νs\nu_s. Explicitly, disjointify that cover into EjE_j and put on EjE_j a positive constant multiple 2−j/(1+νs(Ej))2^{-j}/(1+\nu_s(E_j)) of νs\nu_s; the resulting finite nonzero measure can be normalized.

The map Q:H→V×V,Q(γ)=(rγ,sγ)(1.5) Q:\mathcal H\to V\times V,\qquad Q(\gamma)=(r\gamma,s\gamma) \tag{1.5} is Borel. Its image DD is the derived principal relation, which is a Souslin subset of the standard Borel product; it need not be a Borel subset. Define p(y,x)=(u(y),u(x))p(y,x)=(u(y),u(x)) and let η=p∗ρ\eta=p_*\rho on V×VV\times V. It is a probability concentrated on DD in its completion, by the hypothesis.

The measurable-section prerequisite gives τ:D→H\tau:D\to\mathcal H with Qτ=idDQ\tau=\mathrm{id}_D, measurable for the completion of η\eta. Therefore a=τ∘p:R→Ha=\tau\circ p:R\to\mathcal H is measurable for the completion of ρ\rho: pull a Borel representative and its η\eta-null exceptional set back under the pushforward map pp. Lemma 1.2 supplies a Borel version a0a_0. The Borel bad-arrow set B={(y,x)∈R:Q(a0(y,x))≠(u(y),u(x))}(1.6) B=\{(y,x)\in R:Q(a_0(y,x))\ne (u(y),u(x))\} \tag{1.6} is ρ\rho-null, hence νs\nu_s-null.

Its source projection is Borel here for an explicit reason. If gjg_j enumerate the presenting action, then A={x:some (y,x)∈B}=⋃j{x:(gjx,x)∈B}.(1.7) A=\{x:\text{some }(y,x)\in B\} =\bigcup_j\{x:(g_jx,x)\in B\}. \tag{1.7} The counting integral νs(B)=0\nu_s(B)=0 makes μ(A)=0\mu(A)=0. Its saturation ⋃jgjA\bigcup_jg_jA is Borel and null by countability and nonsingularity. Remove that saturation. Every arrow in the remaining R∣X0R|_{X_0} now has the correct endpoints under a0a_0. Thus (1.1) holds everywhere on this reduction. Apply Theorem 1.1 to obtain (1.4). □\square

If p:R→H′p:R\to\mathcal H' is a Borel homomorphism into the derived principal groupoid of H\mathcal H, its object map is uu, and p(y,x)=(u(y),u(x))p(y,x)=(u(y),u(x)). Theorem 1.3 therefore gives Q∘σ=p(1.8) Q\circ\sigma=p \tag{1.8} on the invariant conull reduction. This is the measured lifting assertion, including targets with arbitrary standard Borel isotropy. The entire analytic set DD was never asserted to be Borel; the completed pushforward measure is what makes its section usable.

A compatible lift of a relation map into a groupoid
Open diagram at full size

Figure 2. Theorems 1.1 and 1.3. A measurable section first chooses individual arrows above pp. On a finite class, transports from one root give σ(y,x)=ayax−1\sigma(y,x)=a_y a_x^{-1}; the reverse root transport is used first. The coherent maps satisfy Qσ=pQ\sigma=p. Later finite stages preserve these earlier products exactly. This realizes the lifting mechanism of Takesaki, Chapter XIII, Corollary 3.25.

Corollary 1.4 (extensions). A surjective Borel groupoid homomorphism π:E→R\pi:\mathcal E\to R, with E\mathcal E standard Borel and π\pi the identity on units, has a Borel homomorphic section on an invariant conull reduction of the measured hyperfinite relation.

Proof. Apply the measurable-section theorem to π\pi and the same equivalent probability ρ\rho on RR. Replace its measurable section by a Borel version. The bad set {(y,x):π(a0(y,x))≠(y,x)}\{(y,x):\pi(a_0(y,x))\ne(y,x)\} is a null Borel arrow set. Remove its source saturation by (1.7). The resulting choice has the correct endpoints because π\pi fixes units. Theorem 1.1 then makes it coherent, and the products (1.2)–(1.3), after applying π\pi, telescope to (y,x)(y,x). Hence πσ=id\pi\sigma=\mathrm{id}. □\square

2. Splitting an extension over the relation

Suppose π:E→R\pi:\mathcal E\to R is a Borel groupoid homomorphism, is the identity on units, and admits a Borel arrow choice as in (1.1) with π(a(y,x))=(y,x)\pi(a(y,x))=(y,x). The construction in Theorem 1.1 then satisfies πσ=idR\pi\sigma=\mathrm{id}_R.

In the standard Borel measured setting with π\pi surjective, Corollary 1.4 provides this section on one invariant conull reduction, even when the extension fibres are uncountable. The coordinates below apply to the entire extension over that reduction.

Let Kx=π−1(x,x)K_x=\pi^{-1}(x,x), the kernel group at xx. Each arrow γ:x→y\gamma:x\to y has the unique form γ=k σ(y,x),k=γσ(y,x)−1∈Ky.(2.1) \gamma=k\,\sigma(y,x),\qquad k=\gamma\sigma(y,x)^{-1}\in K_y. \tag{2.1} Conjugation by σ(y,x)\sigma(y,x) gives an isomorphism cy,x:Kx→Ky,cy,x(l)=σ(y,x)lσ(y,x)−1.(2.2) c_{y,x}:K_x\to K_y,\qquad c_{y,x}(l)=\sigma(y,x)l\sigma(y,x)^{-1}. \tag{2.2} The homomorphism identity for σ\sigma gives cz,ycy,x=cz,xc_{z,y}c_{y,x}=c_{z,x}. In the coordinates (k,y,x)(k,y,x), composition is (k,z,y)(l,y,x)=(k cz,y(l),z,x).(2.3) (k,z,y)(l,y,x)=(k\,c_{z,y}(l),z,x). \tag{2.3} This is the semidirect product of the kernel group field with the principal relation. All these coordinates are Borel because the maps and their inverses in (2.1) are explicit.

Proposition 2.1. For a nonsingular ergodic action of a countable abelian group Γ\Gamma, its stabilizer is almost everywhere the action's kernel HH. If its principal relation is hyperfinite, the transformation groupoid is isomorphic to the direct product H×RH\times R.

Proof. For each g∈Γg\in\Gamma, its fixed-point set is invariant under every element of Γ\Gamma, by commutativity. Ergodicity makes each fixed-point set null or conull. It is conull exactly when gg acts trivially modulo null sets. Remove the union of the zero-measure fixed-point sets and all exceptional sets for the kernel elements; countability permits one common invariant conull space. Its stabilizers are exactly HH.

The first presenting group element carrying xx to yy supplies the arrow choice. Theorem 1.1 splits the transformation groupoid over RR. Since Γ\Gamma is abelian, conjugation in (2.2) is the identity on HH, so (2.3) is direct-product multiplication. □\square

Example 2.2. Let Z\mathbb Z act by a three-cycle on {0,1,2}\{0,1,2\}. The kernel is 3Z3\mathbb Z. A splitting of its transformation groupoid is σ(i,j)=(i−j,j), \sigma(i,j)=(i-j,j), where the integer arrow (n,j)(n,j) goes from jj to j+n(mod3)j+n\pmod3. The labels telescope: (i−j)+(j−k)=i−k(i-j)+(j-k)=i-k. This groupoid splitting does not split the group extension 3Z→Z→Z/3Z3\mathbb Z\to\mathbb Z\to\mathbb Z/3\mathbb Z. The latter has no homomorphic section, since Z\mathbb Z has no nonzero element of order three.

3. Removing a two-cocycle

Let GG be a Polish group and HH a normal Borel subgroup; closedness is unnecessary. Suppose a Borel map a:R→Ga:R\to G, with a(x,x)=1a(x,x)=1, has defects a(z,y)a(y,x)=u(z,y,x)a(z,x),u(z,y,x)∈H.(3.1) a(z,y)a(y,x)=u(z,y,x)a(z,x),\qquad u(z,y,x)\in H. \tag{3.1} This means that aa is a homomorphism modulo HH. The associative group law forces the usual twisted two-cocycle identity for uu.

Theorem 3.1. There is a Borel homomorphism b:R→Gb:R\to G with b(y,x)H=a(y,x)Hb(y,x)H=a(y,x)H. Setting v(y,x)=b(y,x)a(y,x)−1∈Hv(y,x)=b(y,x)a(y,x)^{-1}\in H, the defect is u(z,y,x)=a(z,y)v(y,x)−1a(z,y)−1 v(z,y)−1v(z,x).(3.2) u(z,y,x) =a(z,y)v(y,x)^{-1}a(z,y)^{-1} \,v(z,y)^{-1}v(z,x). \tag{3.2}

Proof. Form the Borel groupoid E={(g,y,x):(y,x)∈R,  ga(y,x)−1∈H}(3.3) \mathcal E=\{(g,y,x): (y,x)\in R,\;ga(y,x)^{-1}\in H\} \tag{3.3} with composition (g,z,y)(h,y,x)=(gh,z,x)(g,z,y)(h,y,x)=(gh,z,x), inverses (g,y,x)−1=(g−1,x,y)(g,y,x)^{-1}=(g^{-1},x,y), and units (1,x,x)(1,x,x). Normality of HH and (3.1) make composition and inversion stay in E\mathcal E. It is a standard Borel space because HH is Borel and (3.3) is a Borel subset of G×RG\times R. Projection to RR has the explicit arrow choice (a(y,x),y,x)(a(y,x),y,x).

Theorem 1.1 gives a homomorphic section. Its GG-coordinate is the required bb. The map vv is Borel and HH-valued. Substitute b=vab=va into b(z,y)b(y,x)=b(z,x)b(z,y)b(y,x)=b(z,x) and multiply in order to obtain (3.2). □\square

The order in (3.2) matters when GG is noncommutative. This argument also explains the splitting mechanism of Section 2: a compatible finite-class lift removes the composition defect.

4. A small correction on a finite class

Now put K=H‾K=\overline H, a closed normal subgroup of GG. Let p,q:R→Gp,q:R\to G be Borel homomorphisms with q(y,x)K=p(y,x)K.(4.1) q(y,x)K=p(y,x)K. \tag{4.1} Let dd be a complete metric giving the topology of GG.

Lemma 4.1. On a finite-class Borel subrelation FF, for every positive Borel function ε:X→(0,∞)\varepsilon:X\to(0,\infty), there are Borel maps f:X→Kf:X\to K and h:F→Hh:F\to H such that q(y,x)=h(y,x)f(y)p(y,x)f(x)−1,d(f(x),1)<ε(x),(4.2) q(y,x)=h(y,x)f(y)p(y,x)f(x)^{-1},\qquad d(f(x),1)<\varepsilon(x), \tag{4.2} and f=1f=1 on a Borel transversal of FF.

Proof. Let t(x)t(x) be the least-point selector of FF. Put px=p(x,t(x)),qx=q(x,t(x)),dx=qxpx−1∈K. p_x=p(x,t(x)),\quad q_x=q(x,t(x)),\quad d_x=q_xp_x^{-1}\in K. Choose a countable dense subset {kj}\{k_j\} of HH in KK. Such a set exists because KK is second countable and HH is dense. Take the first kjk_j with d(kj−1dx,1)<ε(x), d(k_j^{-1}d_x,1)<\varepsilon(x), and call it kxk_x. At a root set kx=1k_x=1. The first-choice rule is Borel; a qualifying element exists by density and continuity. Set f(x)=kx−1dxf(x)=k_x^{-1}d_x. Then qx=kxf(x)pxq_x=k_xf(x)p_x.

On a pair of the same finite class, q(y,x)=ky pf(y,x) kx−1,pf(y,x)=f(y)p(y,x)f(x)−1. q(y,x)=k_y\,p^f(y,x)\,k_x^{-1}, \qquad p^f(y,x)=f(y)p(y,x)f(x)^{-1}. Hence h(y,x)=q(y,x)pf(y,x)−1h(y,x)=q(y,x)p^f(y,x)^{-1} belongs to HH, by normality. It is Borel and gives (4.2). At a root dx=1d_x=1, so f=1f=1. □\square

The map hh in this lemma need not be an ordinary homomorphism. Its multiplication law is twisted by the cocycle pfp^f.

5. Preserving an earlier correction

Lemma 5.1. Suppose fn,hnf_n,h_n satisfy (4.2) on RnR_n, with fn=1f_n=1 on SnS_n. For every η>0\eta>0, they extend to fn+1,hn+1f_{n+1},h_{n+1} on Rn+1R_{n+1} such that hn+1∣Rn=hn,fn+1∣Sn+1=1,d(fn+1(x),fn(x))<η.(5.1) h_{n+1}|_{R_n}=h_n,\qquad f_{n+1}|_{S_{n+1}}=1,\qquad d(f_{n+1}(x),f_n(x))<\eta. \tag{5.1}

Proof. For t∈Snt\in S_n, choose a Borel radius ε(t)>0\varepsilon(t)>0 so small that d(w,1)<ε(t)d(w,1)<\varepsilon(t) implies d(fn(x)p(x,t)wp(t,x),fn(x))<ηfor every x Rn t.(5.2) d\bigl(f_n(x)p(x,t)wp(t,x),f_n(x)\bigr)<\eta \quad\text{for every }x\,R_n\,t. \tag{5.2} Continuity and finiteness of the class give such a radius. To make the choice Borel, fix a countable dense set {gj}⊂G\{g_j\}\subset G, and test the radii 2−k2^{-k}. Require that for every xx in the finite class and every gjg_j in that open ball, the displayed distance is at most η/2\eta/2. A sufficiently small radius passes by continuity. These are countably many Borel tests, using finite-class selectors. Their first passing radius is Borel. Density and continuity extend the test to the entire open ball, giving (5.2).

Apply Lemma 4.1 to the finite quotient relation Rn+1∣SnR_{n+1}|_{S_n}, to p,qp,q restricted there, and to these radii. Obtain w:Sn→Kw:S_n\to K, with w=1w=1 on Sn+1S_{n+1}, such that q(t′,t)=k(t′,t)w(t′)p(t′,t)w(t)−1,k(t′,t)∈H. q(t',t)=k(t',t)w(t')p(t',t)w(t)^{-1}, \qquad k(t',t)\in H. Define fn+1(x)=fn(x)p(x,tnx)w(tnx)p(tnx,x).(5.3) f_{n+1}(x) =f_n(x)p(x,t_nx)w(t_nx)p(t_nx,x). \tag{5.3} It is KK-valued, since KK is normal. Equation (5.2) gives the distance bound.

For an old pair y Rn xy\,R_n\,x, the inserted ww's occur at the same root and cancel in pfn+1(y,x)p^{f_{n+1}}(y,x). Therefore pfn+1(y,x)=pfn(y,x).(5.4) p^{f_{n+1}}(y,x)=p^{f_n}(y,x). \tag{5.4} The defect hn+1=q(pfn+1)−1h_{n+1}=q(p^{f_{n+1}})^{-1} agrees exactly with hnh_n there.

For a new pair, split it into the old transport from xx to tnxt_nx, the quotient arrow from tnxt_nx to tnyt_ny, and the old transport to yy. On the two old transports the discrepancy belongs to HH, by the hypothesis; on the quotient arrow it belongs to HH, by the chosen ww. Normality of HH keeps the discrepancy of their product in HH. Thus hn+1h_{n+1} is HH-valued on all of Rn+1R_{n+1}.

Finally, if x∈Sn+1⊂Snx\in S_{n+1}\subset S_n, both the old value and the inserted ww are one, so (5.3) is one. □\square

A four-point correction with a nonclosed subgroup

Example 5.2 (small movement, fixed rational errors). Take the additive Polish group G=RG=\mathbb R, its normal Borel subgroup H=QH=\mathbb Q, and K=H‾=RK=\overline H=\mathbb R, with d(s,t)=∣s−t∣d(s,t)=|s-t|. Let X={0,1,2,3}X=\{0,1,2,3\}, giving each point positive measure. The old relation F0F_0 has classes {0,1}\{0,1\} and {2,3}\{2,3\}; the new relation F1=X×XF_1=X\times X has one class. Put a=(0,2,3,3+2),p(y,x)=0,q(y,x)=ay−ax.(5.5) a=(0,\sqrt2,\sqrt3,\sqrt3+\sqrt2),\qquad p(y,x)=0,\qquad q(y,x)=a_y-a_x. \tag{5.5} Both p,qp,q are homomorphisms. The closure-coset condition (4.1) holds because K=RK=\mathbb R.

Write r=75,s=2615,d=2−r,e=3−s. r=\frac75,\qquad s=\frac{26}{15},\qquad d=\sqrt2-r,\qquad e=\sqrt3-s. On the old relation choose f=(0,d,0,d),h0(y,x)=r(y−x)for (y,x)∈F0.(5.6) f=(0,d,0,d),\qquad h_0(y,x)=r(y-x)\quad\text{for }(y,x)\in F_0. \tag{5.6} Within either old class y−xy-x is 00 or ±1\pm1, so h0h_0 is rational-valued. Direct subtraction gives q(y,x)=h0(y,x)+f(y)−f(x)((y,x)∈F0). q(y,x)=h_0(y,x)+f(y)-f(x)\qquad((y,x)\in F_0). The roots 0,20,2 have f=0f=0. Squaring the positive rationals 7/57/5 and 71/5071/50 gives 7/5<2<71/507/5<\sqrt2<71/50, hence 0<d<1/500<d<1/50. Thus this is a correction of size less than 1/501/50 as in Lemma 4.1.

Now extend to the new class by setting g=(0,d,e,d+e),b=a−g=(0,r,s,r+s),h1(y,x)=by−bx.(5.7) g=(0,d,e,d+e),\qquad b=a-g=(0,r,s,r+s),\qquad h_1(y,x)=b_y-b_x. \tag{5.7} The identity q(y,x)=h1(y,x)+g(y)−g(x)q(y,x)=h_1(y,x)+g(y)-g(x) holds on all sixteen arrows. The potential bb has rational coordinates, so h1h_1 is rational-valued and is itself a homomorphism. Its value on each old forward arrow 0→10\to1 and 2→32\to3 is exactly r=7/5r=7/5; the reverse values are −r-r and the diagonal values are zero. Therefore h1∣F0=h0h_1|_{F_0}=h_0 exactly.

The two points of the second old class receive the same added amount ee, while the first old class does not move. This common addition cancels on every old arrow. Moreover, (433250)2<3<(2615)2,2615−433250=1750. \left(\frac{433}{250}\right)^2<3< \left(\frac{26}{15}\right)^2,\qquad \frac{26}{15}-\frac{433}{250}=\frac1{750}. Consequently −1/750<e<0-1/750<e<0, so ∣g(x)−f(x)∣<1/500|g(x)-f(x)|<1/500 at every point. The new root 00 still has g(0)=0g(0)=0. This checks all extension conclusions of Lemma 5.1 with η=1/500\eta=1/500, including its exact preservation condition.

The correcting function cannot in general be required to take values in HH. If both a correcting function v:X→Qv:X\to\mathbb Q and its discrepancy k:F0→Qk:F_0\to\mathbb Q satisfied (5.6)'s correction identity, the arrow 0→10\to1 would give 2=k(1,0)+v(1)−v(0)∈Q\sqrt2=k(1,0)+v(1)-v(0)\in\mathbb Q, a contradiction. The closure-valued cochain and the subgroup-valued discrepancy are different requirements.

A finite correction preserves every old rational error
Open diagram at full size

Figure 3. Example 5.2 and Lemma 5.1. The left table gives the exact old and new cochains and the new rational potential. The right matrix lists h1(y,x)=by−bxh_1(y,x)=b_y-b_x, with range yy indexing rows and source xx indexing columns. Shaded blocks are precisely the eight old F0F_0-arrows, including their diagonal arrows; their errors are unchanged. Both rows of the second old class receive the same addition ee. No geometric distance between the four units is asserted. Human source: Takesaki III, XIII.3.27–3.28 supplied PDF pages 68–71. Reproducible figure source: make_stabilized_rational_correction.py.

6. The limiting correction

Theorem 6.1 (cohomology reduction). Under (4.1), there are Borel maps f:X→Kf:X\to K and h:R→Hh:R\to H such that q(y,x)=h(y,x)f(y)p(y,x)f(x)−1.(6.1) q(y,x)=h(y,x)f(y)p(y,x)f(x)^{-1}. \tag{6.1}

Proof. Start with Lemma 4.1 on R1R_1. Apply Lemma 5.1 successively with distance bounds 2−n2^{-n}. For each xx, the sequence fn(x)f_n(x) is Cauchy in the complete metric dd; let f(x)f(x) be its limit. It belongs to the closed group KK and is Borel as a pointwise limit of Borel maps.

For an arrow in RnR_n, the values hmh_m, m≥nm\geq n, are exactly equal. Define hh by this stabilized value, using the first stage containing the arrow. This is a Borel HH-valued map. Letting m→∞m\to\infty in the finite-stage identity gives (6.1), by continuity of multiplication and inversion. □\square

The limit ff is asserted to lie in H‾\overline H, while hh lies in HH itself. Replacing exact stabilization of hnh_n by convergence would only place its limit in H‾\overline H, losing the theorem's content.

Corollary 6.2. If HH is dense in GG, every Borel GG-valued cocycle on RR is cohomologous to an HH-valued cocycle.

Proof. Take p=1p=1 and qq to be the given cocycle. Equation (6.1) gives f(y)−1q(y,x)f(x)=f(y)−1h(y,x)f(y)∈H, f(y)^{-1}q(y,x)f(x)=f(y)^{-1}h(y,x)f(y)\in H, using normality. The left side is a homomorphism, being a gauge transform of qq. □\square

7. 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 7.1 (a compatible quotient). Level 1. Explain why the quotient relation in Theorem 1.1 has finite classes, and why its least root is tn+1t_{n+1}.

Solution. A new finite class contains finitely many old classes. Choosing their old least points gives exactly its quotient class in SnS_n. The least of these points is the least point of the whole new class, namely tn+1t_{n+1}. This proves both finiteness and the nested-root property used in (1.3).

Exercise 7.2 (multiplication with isotropy). Level 2. In the three-cycle example, write an arrow from jj to ii as a kernel element followed by the section, and compute its kernel coordinate.

Solution. If its integer label is nn, then n≡i−j(mod3)n\equiv i-j\pmod3. It equals (n−(i−j),i) σ(i,j)(n-(i-j),i)\,\sigma(i,j). The first label belongs to 3Z3\mathbb Z and is the unique kernel coordinate. Two such coordinates add under composition because conjugation is trivial.

Exercise 7.3 (a rational finite correction). Level 2. On a three-point complete relation, let p=0p=0 and q(i,j)=ai−ajq(i,j)=a_i-a_j in the additive group R\mathbb R, with a0=0a_0=0. For H=QH=\mathbb Q, explicitly achieve a correction of size less than ε\varepsilon.

Solution. Choose rational rir_i with ∣ai−ri∣<ε|a_i-r_i|<\varepsilon, and take r0=0r_0=0. Set f(i)=ai−rif(i)=a_i-r_i and h(i,j)=ri−rjh(i,j)=r_i-r_j. Then q(i,j)=h(i,j)+f(i)−f(j)q(i,j)=h(i,j)+f(i)-f(j), the correcting function is small and vanishes at the root, and hh is rational-valued.

Exercise 7.4 (a closed subgroup). Level 2. If HH is closed and q(y,x)H=p(y,x)Hq(y,x)H=p(y,x)H, show that Theorem 6.1 needs no limiting construction.

Solution. Set f=1f=1 and h(y,x)=q(y,x)p(y,x)−1h(y,x)=q(y,x)p(y,x)^{-1}. Equality of cosets and normality put hh in HH, and (6.1) holds directly. The approximation construction is needed to replace membership in H‾\overline H by membership in a possibly smaller nonclosed subgroup.

Exercise 7.5 (checking the order). Level 3. Starting with b=vab=va, derive (3.2) without commuting any factors.

Solution. The homomorphism identity gives v(z,y)a(z,y)v(y,x)a(y,x)=v(z,x)a(z,x). v(z,y)a(z,y)v(y,x)a(y,x)=v(z,x)a(z,x). Multiplying on the left first by v(z,y)−1v(z,y)^{-1}, then by the inverse of the conjugated factor a(z,y)v(y,x)a(z,y)−1a(z,y)v(y,x)a(z,y)^{-1}, yields a(z,y)a(y,x)=a(z,y)v(y,x)−1a(z,y)−1v(z,y)−1v(z,x)a(z,x). a(z,y)a(y,x) =a(z,y)v(y,x)^{-1}a(z,y)^{-1} v(z,y)^{-1}v(z,x)a(z,x). Comparison with (3.1) is exactly (3.2).

Exercise 7.6 (removing bad arrows). Level 2. If a Borel B⊂RB\subset R has νs(B)=0\nu_s(B)=0, prove directly from the countable presentation that its source projection and its saturation are Borel and null. Explain why this yields correctness on every arrow of a conull reduction.

Solution. The source projection is the union in (1.7), a countable union of Borel sets. Its indicator is zero almost everywhere because ∫#{y:(y,x)∈B} dμ(x)=0\int\#\{y:(y,x)\in B\}\,d\mu(x)=0. Each presenting transformation takes it to a null Borel set by nonsingularity. Their countable union is its saturation, also null and Borel. Outside that invariant saturation no source has a bad outgoing arrow. Thus the Borel version has the required endpoint identities on all arrows of the restricted relation, rather than only almost every arrow.

Exercise 7.7 (uncountable isotropy). Level 1. Regard (R,+)(\mathbb R,+) as a groupoid with one unit. The derived principal groupoid has only its unit arrow. For a Borel real function ff on XX, give two lifts of the constant homomorphism from RR to this derived groupoid, and check their composition laws.

Solution. Take σ0(y,x)=0\sigma_0(y,x)=0 and σf(y,x)=f(y)−f(x)\sigma_f(y,x)=f(y)-f(x). They both have the unique prescribed source and range. The second satisfies (f(z)−f(y))+(f(y)−f(x))=f(z)−f(x)(f(z)-f(y))+(f(y)-f(x))=f(z)-f(x), and the first is immediate. Inverses change signs and units have value zero. Projection to the derived groupoid forgets both values. Thus lifts need not be unique and uncountable isotropy is compatible with the theorem.

Exercise 7.8 (an additive two-cocycle). Level 3. Let a normalized Borel function w:R(3)→Rw:R^{(3)}\to\mathbb R satisfy w(t,z,y)+w(t,y,x)=w(z,y,x)+w(t,z,x) w(t,z,y)+w(t,y,x)=w(z,y,x)+w(t,z,x) on related quadruples. Form the extension with arrows (a,y,x)∈R×R(a,y,x)\in\mathbb R\times R and multiplication (a,z,y)(b,y,x)=(a+b+w(z,y,x),z,x). (a,z,y)(b,y,x)=(a+b+w(z,y,x),z,x). Show that on an invariant conull reduction there is Borel d:R→Rd:R\to\mathbb R with w(z,y,x)=d(z,x)−d(z,y)−d(y,x)w(z,y,x)=d(z,x)-d(z,y)-d(y,x).

Solution. The displayed cocycle identity is exactly associativity of the multiplication. Normalization means w(z,y,y)=w(y,y,x)=0w(z,y,y)=w(y,y,x)=0, giving units (0,x,x)(0,x,x); the arrows (a,x,x)(a,x,x) form the additive isotropy group at xx. Inversion is (a,y,x)−1=(−a−w(x,y,x),x,y)(a,y,x)^{-1}=(-a-w(x,y,x),x,y); the identity on the quadruple (y,x,y,x)(y,x,y,x) gives w(y,x,y)=w(x,y,x)w(y,x,y)=w(x,y,x), so it is an inverse on both sides. This is a standard Borel groupoid, and projection to RR is a surjective Borel homomorphism fixing units. Corollary 1.4 supplies a homomorphic section σ(y,x)=(d(y,x),y,x)\sigma(y,x)=(d(y,x),y,x). Its homomorphism identity reads d(z,x)=d(z,y)+d(y,x)+w(z,y,x)d(z,x)=d(z,y)+d(y,x)+w(z,y,x), which is the asserted formula. The dd-coordinate is Borel and d(x,x)=0d(x,x)=0. The construction applies without an ergodicity assumption and without a countable extension fibre.

Exercise 7.9 (pushforward can lose sigma-finiteness). Level 2. Give the full relation on Z\mathbb Z counting unit measure and reduce it to Y={0}Y=\{0\}. Compute the pushforward under the constant retraction of that counting measure, and of the equivalent probability p({n})=2−∣n∣/3p(\{n\})=2^{-|n|}/3. Explain the probability replacement in Corollary 0.3.

Solution. The counting measure is invariant, sigma-finite and ergodic for the full relation. Its pushforward assigns infinity to {0}\{0\}, so no finite-measure sets can cover YY; this pushforward is not sigma-finite. Since ∑n∈Z2−∣n∣=3\sum_{n\in\mathbb Z}2^{-|n|}=3, the stated pp is a probability with strictly positive point masses, hence equivalent to counting measure. Its pushforward is the unit point mass at 00, equivalent to counting measure restricted to YY. Equivalence of measure classes does not make the two pushforwards equally finite or sigma-finite. Replacing the original unit measure by an equivalent probability before pushing forward ensures precisely the finite measure needed in (0.5).

Exercise 7.10 (changing the isotropy transport). Level 2. In Example 0.5 let K=S3K=S_3. At x=1x=1, compare f1=(0,e,1)f_1=(0,e,1) with f1′=(0,(1 2),1)f'_1=(0,(1\,2),1), using unit arrows at 00 for both choices. Transport the isotropy element (1,(1 2 3),1)(1,(1\,2\,3),1).

Solution. The first choice transports it to (0,(1 2 3),0)(0,(1\,2\,3),0). The second gives (0,(1 2)(1 2 3)(1 2),0)=(0,(1 3 2),0)(0,(1\,2)(1\,2\,3)(1\,2),0)=(0,(1\,3\,2),0). The intervening loop is k1=f1′f1−1=(0,(1 2),0)k_1=f'_1f_1^{-1}=(0,(1\,2),0), so these two identifications differ exactly by its inner conjugation, as Proposition 0.4 states. Both give isomorphisms of the entire isotropy group; neither forgets the group labels.

Exercise 7.11 (why preservation must be exact). Level 3. In Example 5.2 replace the new cochain gg by g′=g+(0,0,0,ϵ)g'=g+(0,0,0,\epsilon), where ϵ=2/1000\epsilon=\sqrt2/1000. Compute the new discrepancy on 2→32\to3, and show that it can leave H=QH=\mathbb Q even though the change is smaller than 1/5001/500. Explain why the extension proof inserts one common correction at the root of each old class.

Solution. Define h′(y,x)=q(y,x)−g′(y)+g′(x)h'(y,x)=q(y,x)-g'(y)+g'(x). On the arrow 2→32\to3 this gives h′(3,2)=75−ϵ. h'(3,2)=\frac75-\epsilon. The number ϵ\epsilon is nonzero and irrational, so this error is not rational. Its change from h1(3,2)=7/5h_1(3,2)=7/5 has magnitude ϵ<1/500\epsilon<1/500, because 2<2\sqrt2<2. On the reverse arrow the error is −7/5+ϵ-7/5+\epsilon. Thus small changes of an HH-valued error need not stay in a nonclosed subgroup, even at one finite extension step. The common root correction in (5.3) is transported coherently to the whole old class; its inserted factors cancel on each old arrow, yielding (5.4) and exactly the same old discrepancy. Example 5.2 uses a common addition ee on {2,3}\{2,3\}; the unequal additions defining g′g' break precisely that cancellation.

References

[Takesaki] Masamichi Takesaki, Theory of Operator Algebras III, Encyclopaedia of Mathematical Sciences 127, Springer, 2003. Publisher record. The cohomology reduction theorem permits a normal Borel subgroup that need not be closed.