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, 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 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 . Let be the least point of , and let . The finite-class selector proof makes these maps and sets Borel. Moreover,
0. Countable groupoids and full reductions
For a groupoid , write , for the source and for the range of an arrow. Multiplication is defined when ; the arrow is traversed first. Its isotropy group at is . 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 are equivalent when there is an arrow for each unit, with In the Borel setting we require 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 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 is the range of the countable source fibre at , so it is countable. Multiplication maps to . 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.
For , the reduction consists of the arrows having both endpoints in . The set is full when every orbit meets , equivalently . This does not mean that 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 for each , taking to be the unit at when . 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 Take its Borel section and replace its values on by the unit arrows. Thus both and are Borel, with .
Let be inclusion, and define Its endpoints are and , so it lies in the reduction. If , then 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 . Equation (0.4) is also exactly (0.2), with , and . Hence is equivalent to the identity. This proves similarity, including empty unit spaces.
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 . For every positive Borel , its saturation is invariant, Borel and conull, and is Borel-similar to . After replacing by an equivalent probability on , the unit retraction in the proof pushes it forward to a probability equivalent to .
Proof. The saturation is Borel by Lemma 0.1 and Lusin–Novikov for the source projection of . It is invariant and contains , so ergodicity makes it conull. Theorem 0.2 applies on .
Quasi-invariance implies null saturation even when isotropy is nontrivial. For an arrow set , source and range counting measures vanish exactly when the measures of and vanish; these projections are Borel by Lusin–Novikov. Apply this to for a Borel null . Its source is , hence null. Let be a probability equivalent to on . For Borel , The first inclusion uses , and the second uses the arrows . Thus if and only if . The pushforward is a probability because is defined on all of .
Proposition 0.4 (isotropy survives reduction). For every choice in Theorem 0.2, is a group isomorphism. At Borel scope it is a Borel map on the isotropy field. If another choice has the same endpoint , its transport differs by the inner automorphism given by .
Proof. All products have the displayed endpoints. Cancelling proves multiplication preservation, and conjugation by gives the inverse. The isotropy field is Borel since is a Borel equality test in the standard unit space; Borel multiplication gives the field map. Finally , so its transported value is .
Example 0.5 (a reduction retains the group labels). Take and a countable group . Give arrows , with The singleton is full. Choose . Then (0.4) sends to , so the reduction is the one-unit group . 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 -labels. If 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.
Figure 1. The exact transport in (0.4) for Example 0.5, sampled at . The arrow becomes under , so the loop label 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 be a Borel groupoid and a Borel map. Suppose we have a Borel choice The choice need not respect composition.
Theorem 1.1. There is a Borel homomorphism with the endpoints in (1.1).
Proof. On define The two roots agree on an -pair, so the product is composable. Products telescope, and units map to units.
Suppose is defined on . The relation restricted to has finite classes, one point for each old class inside a new class. Its root is . For its pairs put It is a homomorphism on this finite quotient relation. Extend by
When , their old roots coincide, so the middle factor is a unit and (1.3) equals . For a composable pair in , the two adjacent old transports at the middle point cancel, and the two 's compose. Thus is a homomorphism.
The maps are Borel and agree exactly on their earlier domains. Define 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 .
For a countable transformation groupoid, (1.1) is obtained by taking the first group element carrying to . 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 . 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.
Theorem 1.3 (general measured lifting). Let be a hyperfinite relation presented by a countable nonsingular action on a standard sigma-finite measured space. No ergodicity assumption is needed. Let be any standard Borel groupoid, with unit space , and let be Borel. Suppose that for every there is an arrow of from to . Then on an invariant conull Borel there is a Borel homomorphism The target fibres and isotropy groups may be uncountable.
Proof. If the source measure is zero, take . Otherwise normalize an equivalent measure on to a probability. Source counting measure on is sigma-finite, since its countable presenting graphs cover and each has measure at most one. Choose a probability on equivalent to . Explicitly, disjointify that cover into and put on a positive constant multiple of ; the resulting finite nonzero measure can be normalized.
The map is Borel. Its image is the derived principal relation, which is a Souslin subset of the standard Borel product; it need not be a Borel subset. Define and let on . It is a probability concentrated on in its completion, by the hypothesis.
The measurable-section prerequisite gives with , measurable for the completion of . Therefore is measurable for the completion of : pull a Borel representative and its -null exceptional set back under the pushforward map . Lemma 1.2 supplies a Borel version . The Borel bad-arrow set is -null, hence -null.
Its source projection is Borel here for an explicit reason. If enumerate the presenting action, then The counting integral makes . Its saturation is Borel and null by countability and nonsingularity. Remove that saturation. Every arrow in the remaining now has the correct endpoints under . Thus (1.1) holds everywhere on this reduction. Apply Theorem 1.1 to obtain (1.4).
If is a Borel homomorphism into the derived principal groupoid of , its object map is , and . Theorem 1.3 therefore gives on the invariant conull reduction. This is the measured lifting assertion, including targets with arbitrary standard Borel isotropy. The entire analytic set was never asserted to be Borel; the completed pushforward measure is what makes its section usable.
Figure 2. Theorems 1.1 and 1.3. A measurable section first chooses individual arrows above . On a finite class, transports from one root give ; the reverse root transport is used first. The coherent maps satisfy . 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 , with standard Borel and 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 and the same equivalent probability on . Replace its measurable section by a Borel version. The bad set is a null Borel arrow set. Remove its source saturation by (1.7). The resulting choice has the correct endpoints because fixes units. Theorem 1.1 then makes it coherent, and the products (1.2)–(1.3), after applying , telescope to . Hence .
2. Splitting an extension over the relation
Suppose is a Borel groupoid homomorphism, is the identity on units, and admits a Borel arrow choice as in (1.1) with . The construction in Theorem 1.1 then satisfies .
In the standard Borel measured setting with 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 , the kernel group at . Each arrow has the unique form Conjugation by gives an isomorphism The homomorphism identity for gives . In the coordinates , composition is 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 , its stabilizer is almost everywhere the action's kernel . If its principal relation is hyperfinite, the transformation groupoid is isomorphic to the direct product .
Proof. For each , its fixed-point set is invariant under every element of , by commutativity. Ergodicity makes each fixed-point set null or conull. It is conull exactly when 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 .
The first presenting group element carrying to supplies the arrow choice. Theorem 1.1 splits the transformation groupoid over . Since is abelian, conjugation in (2.2) is the identity on , so (2.3) is direct-product multiplication.
Example 2.2. Let act by a three-cycle on . The kernel is . A splitting of its transformation groupoid is where the integer arrow goes from to . The labels telescope: . This groupoid splitting does not split the group extension . The latter has no homomorphic section, since has no nonzero element of order three.
3. Removing a two-cocycle
Let be a Polish group and a normal Borel subgroup; closedness is unnecessary. Suppose a Borel map , with , has defects This means that is a homomorphism modulo . The associative group law forces the usual twisted two-cocycle identity for .
Theorem 3.1. There is a Borel homomorphism with . Setting , the defect is
Proof. Form the Borel groupoid with composition , inverses , and units . Normality of and (3.1) make composition and inversion stay in . It is a standard Borel space because is Borel and (3.3) is a Borel subset of . Projection to has the explicit arrow choice .
Theorem 1.1 gives a homomorphic section. Its -coordinate is the required . The map is Borel and -valued. Substitute into and multiply in order to obtain (3.2).
The order in (3.2) matters when 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 , a closed normal subgroup of . Let be Borel homomorphisms with Let be a complete metric giving the topology of .
Lemma 4.1. On a finite-class Borel subrelation , for every positive Borel function , there are Borel maps and such that and on a Borel transversal of .
Proof. Let be the least-point selector of . Put Choose a countable dense subset of in . Such a set exists because is second countable and is dense. Take the first with and call it . At a root set . The first-choice rule is Borel; a qualifying element exists by density and continuity. Set . Then .
On a pair of the same finite class, Hence belongs to , by normality. It is Borel and gives (4.2). At a root , so .
The map in this lemma need not be an ordinary homomorphism. Its multiplication law is twisted by the cocycle .
5. Preserving an earlier correction
Lemma 5.1. Suppose satisfy (4.2) on , with on . For every , they extend to on such that
Proof. For , choose a Borel radius so small that implies Continuity and finiteness of the class give such a radius. To make the choice Borel, fix a countable dense set , and test the radii . Require that for every in the finite class and every in that open ball, the displayed distance is at most . 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 , to restricted there, and to these radii. Obtain , with on , such that Define It is -valued, since is normal. Equation (5.2) gives the distance bound.
For an old pair , the inserted 's occur at the same root and cancel in . Therefore The defect agrees exactly with there.
For a new pair, split it into the old transport from to , the quotient arrow from to , and the old transport to . On the two old transports the discrepancy belongs to , by the hypothesis; on the quotient arrow it belongs to , by the chosen . Normality of keeps the discrepancy of their product in . Thus is -valued on all of .
Finally, if , both the old value and the inserted are one, so (5.3) is one.
A four-point correction with a nonclosed subgroup
Example 5.2 (small movement, fixed rational errors). Take the additive Polish group , its normal Borel subgroup , and , with . Let , giving each point positive measure. The old relation has classes and ; the new relation has one class. Put Both are homomorphisms. The closure-coset condition (4.1) holds because .
Write On the old relation choose Within either old class is or , so is rational-valued. Direct subtraction gives The roots have . Squaring the positive rationals and gives , hence . Thus this is a correction of size less than as in Lemma 4.1.
Now extend to the new class by setting The identity holds on all sixteen arrows. The potential has rational coordinates, so is rational-valued and is itself a homomorphism. Its value on each old forward arrow and is exactly ; the reverse values are and the diagonal values are zero. Therefore exactly.
The two points of the second old class receive the same added amount , while the first old class does not move. This common addition cancels on every old arrow. Moreover, Consequently , so at every point. The new root still has . This checks all extension conclusions of Lemma 5.1 with , including its exact preservation condition.
The correcting function cannot in general be required to take values in . If both a correcting function and its discrepancy satisfied (5.6)'s correction identity, the arrow would give , a contradiction. The closure-valued cochain and the subgroup-valued discrepancy are different requirements.
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 , with range indexing rows and source indexing columns. Shaded blocks are precisely the eight old -arrows, including their diagonal arrows; their errors are unchanged. Both rows of the second old class receive the same addition . 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 and such that
Proof. Start with Lemma 4.1 on . Apply Lemma 5.1 successively with distance bounds . For each , the sequence is Cauchy in the complete metric ; let be its limit. It belongs to the closed group and is Borel as a pointwise limit of Borel maps.
For an arrow in , the values , , are exactly equal. Define by this stabilized value, using the first stage containing the arrow. This is a Borel -valued map. Letting in the finite-stage identity gives (6.1), by continuity of multiplication and inversion.
The limit is asserted to lie in , while lies in itself. Replacing exact stabilization of by convergence would only place its limit in , losing the theorem's content.
Corollary 6.2. If is dense in , every Borel -valued cocycle on is cohomologous to an -valued cocycle.
Proof. Take and to be the given cocycle. Equation (6.1) gives using normality. The left side is a homomorphism, being a gauge transform of .
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 .
Solution. A new finite class contains finitely many old classes. Choosing their old least points gives exactly its quotient class in . The least of these points is the least point of the whole new class, namely . 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 to as a kernel element followed by the section, and compute its kernel coordinate.
Solution. If its integer label is , then . It equals . The first label belongs to 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 and in the additive group , with . For , explicitly achieve a correction of size less than .
Solution. Choose rational with , and take . Set and . Then , the correcting function is small and vanishes at the root, and is rational-valued.
Exercise 7.4 (a closed subgroup). Level 2. If is closed and , show that Theorem 6.1 needs no limiting construction.
Solution. Set and . Equality of cosets and normality put in , and (6.1) holds directly. The approximation construction is needed to replace membership in by membership in a possibly smaller nonclosed subgroup.
Exercise 7.5 (checking the order). Level 3. Starting with , derive (3.2) without commuting any factors.
Solution. The homomorphism identity gives Multiplying on the left first by , then by the inverse of the conjugated factor , yields Comparison with (3.1) is exactly (3.2).
Exercise 7.6 (removing bad arrows). Level 2. If a Borel has , 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 . 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 as a groupoid with one unit. The derived principal groupoid has only its unit arrow. For a Borel real function on , give two lifts of the constant homomorphism from to this derived groupoid, and check their composition laws.
Solution. Take and . They both have the unique prescribed source and range. The second satisfies , 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 satisfy on related quadruples. Form the extension with arrows and multiplication Show that on an invariant conull reduction there is Borel with .
Solution. The displayed cocycle identity is exactly associativity of the multiplication. Normalization means , giving units ; the arrows form the additive isotropy group at . Inversion is ; the identity on the quadruple gives , so it is an inverse on both sides. This is a standard Borel groupoid, and projection to is a surjective Borel homomorphism fixing units. Corollary 1.4 supplies a homomorphic section . Its homomorphism identity reads , which is the asserted formula. The -coordinate is Borel and . 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 counting unit measure and reduce it to . Compute the pushforward under the constant retraction of that counting measure, and of the equivalent probability . 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 , so no finite-measure sets can cover ; this pushforward is not sigma-finite. Since , the stated is a probability with strictly positive point masses, hence equivalent to counting measure. Its pushforward is the unit point mass at , equivalent to counting measure restricted to . 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 . At , compare with , using unit arrows at for both choices. Transport the isotropy element .
Solution. The first choice transports it to . The second gives . The intervening loop is , 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 by , where . Compute the new discrepancy on , and show that it can leave even though the change is smaller than . Explain why the extension proof inserts one common correction at the root of each old class.
Solution. Define . On the arrow this gives The number is nonzero and irrational, so this error is not rational. Its change from has magnitude , because . On the reverse arrow the error is . Thus small changes of an -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 on ; the unequal additions defining 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.