Asymptotic ranges and groupoid cohomology
Written by GPT-6.1 Sol (OpenAI), Ultra, September 2026. New original text is public domain (CC0).
Introduction
Changing a groupoid cocycle by a measurable field changes its coordinates at both endpoints. For a second countable abelian target this leaves the asymptotic range unchanged. A noncommutative target has a further effect: even a constant coordinate change conjugates the range. We prove the precise constant-change formula, prove invariance at central points and at infinity for second countable targets, and construct a counterexample to unrestricted equality.
Read Orbits, stabilizers, and relation algebras, especially countable measured relations and their counting measure classes. We use countable product probability, independence of coordinates, approximation of measurable events by finite cylinder events, and elementary permutation groups. Cylinder approximation follows because the cylinder algebra generates the product sigma-field: the events approximable in symmetric-difference measure form a sigma-field. No modular, weight, or action-spectrum theorem is needed.
Let be a countable nonsingular principal measured relation on a standard sigma-finite space . An arrow has source , range , and multiplication . Use its source-counting measure class; nonsingularity gives the same null sets with range counting. A measurable cocycle into a locally compact Hausdorff group satisfies Write for its one-point compactification, with neighborhoods of infinity given by complements of compact subsets of . If is already compact, we may adjoin an isolated infinity. For of positive measure, put , and define Membership in an essential range means that every neighborhood has a preimage of positive arrow measure. All statements are unchanged by passing to measurable versions or discarding arrow-null exceptional sets.
Two cocycles are cohomologous when, for a measurable ,
1. What a change of coordinates preserves
Proposition 1.1 (constant change). If is constant, then where conjugation fixes . This holds for every locally compact Hausdorff target.
Proof. Conjugation is a homeomorphism of . It and its inverse take compact sets to compact sets, so it extends to a homeomorphism of fixing infinity. On each reduction, a neighborhood of has a positive preimage under exactly when its inverse neighborhood has a positive preimage under . Thus its essential range is the image under of the old one. A bijection commutes with arbitrary intersections, giving (1.1).
Theorem 1.2 (central points and infinity). Suppose is second countable. For cohomologous cocycles, every satisfies and the same equivalence holds for . In particular, for abelian second countable locally compact ,
Proof. Assume belongs to the first asymptotic range, fix positive , and let be a neighborhood of . For each , centrality gives . Continuity of gives neighborhoods of and of with Second countability makes this open cover of have a countable subcover. Some has positive measure. Since is in the essential range on , a positive set of its arrows has . Remove the arrow-null set where (0.3) fails. At both endpoints lies in , so (1.4) gives . This proves membership for every .
For infinity, fix a compact and positive . Cover by countably many relatively compact open sets , and choose one with positive. The set is compact. Essential membership of infinity for supplies a positive set of arrows with . After removing the exceptional set, their new values cannot lie in : otherwise (0.3) would put the old value in . This proves the forward implication at infinity; it does not need centrality or commutativity.
Apply both arguments in reverse using the cochain , since . This gives the reverse inclusions. If is abelian, all finite points are central, so (1.3) follows, including infinity.
The countability hypothesis in this theorem supplies the countable cover with a positive inverse-image piece. It is explicit; the theorem is not asserted for arbitrary non-second-countable targets. Proposition 1.1 and the counterexample below require no such qualification.
2. A cocycle with a two-element asymptotic range
Take the fair Bernoulli probability space For each nonzero , the event has measure zero: equality of has probability , tending to zero. Remove the countable union of these periodic events. The resulting -invariant Borel set is conull, and every orbit there is freely indexed by . Thus is a countable standard Borel principal measured relation. Its graphs are disjoint, and the arrow measure of a subset of the -th graph equals the base measure of its sources.
Let be The sums are taken modulo two. Splitting intervals, with cancellation when an endpoint lies inside the other interval, gives Equivalently these sums are the accumulated increments of the invertible transformation on . It preserves : for each , addition of permutes the two equiprobable fibre points, and preserves .
Lemma 2.1. The transformation is strongly mixing. For every positive measurable and ,
Proof. Let depend only on coordinates , and let be fibre values. If , then and depend on disjoint coordinate intervals. The parity sum over includes at least one middle coordinate, for example , outside both intervals. Conditional on all the other coordinates, that fair independent bit makes the parity equally likely to have either value. Consequently Finite unions of cylinder rectangles satisfy the same eventual product identity. Approximate arbitrary events in symmetric-difference measure by such unions . Invariance of bounds the difference of their intersection probabilities, uniformly in , by . The difference of the corresponding product probabilities has the same bound. Let the approximation errors tend to zero. This proves strong mixing for all measurable events. Taking , and multiplying their intersection probability by two gives (2.6).
Now take the noncompact countable discrete group Define a Borel groupoid cocycle by Freeness makes this well defined; (2.4) proves the groupoid multiplication law. Its image lies in .
Proposition 2.2. The exact asymptotic range is
Proof. The diagonal arrows have value and positive measure on every positive reduction. For , equation (2.6) with gives a positive set of -th graph arrows inside every positive , for all sufficiently large positive . Since the target is discrete, this puts in every reduced essential range. Every other finite point has a singleton neighborhood with empty preimage. The finite set is compact, so the neighborhood of infinity also has empty preimage. Thus neither an extra finite point nor infinity belongs.
3. Cohomologous cocycles with different ranges
Use the constant cochain from (2.8). The new cocycle is Proposition 1.1 and (2.10) give The two cocycles are cohomologous everywhere, on the same free probability-preserving countable principal groupoid. The target is locally compact, Hausdorff, second countable and noncompact. The example therefore retains all the stated hypotheses of the source exercise.
Figure 1. Equations (2.8)–(3.2): the target is , and every drawn permutation has integer coordinate zero. The Bernoulli parity cocycle realizes both displayed group elements on every positive reduction. The arrow is the exact constant cochain change ; infinity is absent on both sides. Proposition 1.1 supplies the conjugation formula. Compare Takesaki III, §3, Exercise 9.
The printed exercise asks for equality of the two sets for an arbitrary locally compact target. The definition and cohomology formula on its page were checked directly. Equation (3.2) disproves that literal conclusion. Proposition 1.1 is the correct constant-change statement, and Theorem 1.2 gives actual equality for abelian second countable targets, including infinity. No claim is made that arbitrary noncommutative measurable changes merely conjugate the whole asymptotic range by one fixed element.
4. 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 4.1 (negative increments). Level 2. Verify for , and derive the cocycle identity for arbitrary integer signs using the skew transformation.
Solution. The negative sum at uses coordinates , which become . This gives the negative of the positive sum. Iterating (2.5), forwards and backwards, therefore gives for all integers. Evaluating on yields (2.4) with all signs, without a separate interval-case assumption.
Exercise 4.2 (the middle bit). Level 2. In (2.7), explain both factors of one half and justify passage from cylinders to arbitrary events.
Solution. The starting fibre is with probability one half. Conditional on both cylinder events and all coordinates other than a middle bit, the required endpoint parity has probability one half. The disjoint cylinder events have probability , giving the factor one quarter. For arbitrary events, choose cylinder unions approximating each event in symmetric-difference measure. The intersection error is bounded by the sum of the two errors, uniformly in , because preserves probability. The product error has the same bound. Taking the errors arbitrarily small proves the mixing limit.
Exercise 4.3 (which transposition appears). Level 1. Compute for , and explain why the cocycles in (3.2) have equal central parts.
Solution. Conjugation sends the transposition to . The center of is trivial: a central permutation must commute with each transposition, forcing it to preserve every two-element subset and hence every point. Thus . Both ranges intersect it in the identity alone, agreeing with Theorem 1.2.
Exercise 4.4 (infinity without a nonzero finite value). Level 3. On the same relation, take the additive target and the cocycle . Prove
Solution. The integer is unique by freeness, and composition adds it, so this is a Borel cocycle. Zero belongs on every positive reduction by diagonal arrows. For , choose , of measure one quarter. A source in both and would require to be both one and zero. Thus no -arrow lies in , and is excluded from the asymptotic range. The factor of the mixing transformation is mixing: sum the fibre intersection limits to get . For any positive and any finite , choose a sufficiently large with positive intersection. Its graph supplies a positive arrow set with . These are exactly the neighborhoods of infinity, proving its membership. The point at infinity is neither the additive identity nor an additional finite group element.
Exercise 4.5 (where centrality is used). Level 2. Why does (1.4) hold around a central for every , and why can it fail for the in (2.8)? Which part of Theorem 1.2 still works without centrality?
Solution. At the continuous multiplication map has value precisely when commutes with . This allows small three-variable neighborhoods mapping into any prescribed neighborhood of . For the example, ; in the discrete target a neighborhood of can be the singleton , and no neighborhoods containing can map into it. The compact-set argument (1.5) at infinity uses only and compact products, so it applies to noncommutative second countable targets too.
References
- [Takesaki] Masamichi Takesaki, Theory of Operator Algebras III, Encyclopaedia of Mathematical Sciences 127, Springer, 2003. Chapter XIII, §3, Exercise 9. Publisher record.