Almost homomorphisms on measured groupoids
Written by GPT-6.1 Sol (OpenAI), Ultra, October 2026. Self-checked by the writing AI. Original expression is public domain (CC0).
A cocycle identity valid for almost every composable pair need not hold on every arrow of a conull reduction. For uncountable fibres, an exceptional set can meet every orbit. This lesson proves the almost-homomorphism theorem used in the programme's integrable centralizer argument, including the saturated unit set and a Borel homomorphism on all its arrows. The theorem is classical and attributed to Arlan Ramsay. The proof below supplies every repair step at the stated standard Borel, faithful proper kernel hypotheses; no research novelty is claimed.
Our prerequisites are sigma-finite kernel integration and product integration, elementary complete metric topology, and the programme's Effros Borel structure, Theorems 2.1(1) and 2.2. The latter gives a finer Polish topology with the same Borel sets making a specified Borel set clopen, together with its complete proof for countable joins. We explain exactly where this imported topology result enters. We do not import a selection or almost-homomorphism theorem. All maps in the proof are Borel before measure completion. A map initially given in a completion must first have a Borel representative at its declared measure scope.
1. The exact groupoid and measure hypotheses
Write an arrow as , with source and range . The product means first , then . Let and its unit space be standard Borel spaces, with Borel multiplication, inversion and unit map. The composable-pair space is Borel: it is defined by , the inverse image of the Borel diagonal of . Put .
A transverse kernel consists of positive measures on , extended by zero to , such that is Borel for every Borel , and left multiplication obeys Faithfulness means for every . Properness means there are increasing Borel such that is bounded for each . Here means the left translate of . In particular, applying this bound at unit arrows gives finite constants with for every . This also proves sigma-finiteness of each fibre measure.
Let be a sigma-finite Borel measure on and define We assume and have the same null sets. The measure is sigma-finite: intersect with the inverse images under of finite-measure sets exhausting . The measure on composable pairs is It too is sigma-finite, by bounding the inner measure on and exhausting the outer measure by finite-measure sets. The elementary integration rules apply equally to these kernels and their probability normalizations. For a Borel function of two variables, Borel measurability of its kernel integral follows first on indicator rectangles, then on simple functions and monotone limits. The same argument on the source pullback gives integration over composable pairs.
Let be a Polish group with identity . The map is an almost homomorphism if it is Borel and A saturated unit set contains the source of every arrow whose range it contains, and conversely. For such a set , its full reduction is .
Theorem 1.1 (almost-homomorphism repair). Under these hypotheses there are a saturated, -conull Borel set and a Borel homomorphism , valid on every composable pair in , such that for -almost every arrow of .
Sections 2–4 prove the theorem. The reduction need not be obtained by removing the orbit saturation of a null set.
2. Probability kernels and a Borel choice from positive fibres
Lemma 2.1 (everywhere equivalent probability kernel). There is a Borel probability kernel on equivalent to for every unit .
Proof. Set , , and put The sets partition , so is strictly positive everywhere. The estimate follows from . Faithfulness gives : otherwise each set where would have zero measure, and their union is . Kernel integration makes Borel. Define . This is a Borel probability kernel with exactly the same null sets as . It need not be transverse. We continue to use (1.1) for , transferring only null-set assertions through .
Lemma 2.2 (positive-fibre choice). Let be Borel and let be Borel. If for every , then there is a Borel with and .
Proof, topology. Give and Polish topologies realizing their specified Borel structures. Take a countable base of . Apply the exact imported clopen refinement theorem separately to and all , then take their countable join. The join is Polish: the diagonal in the product of these refined copies is closed, since all contain the original Hausdorff topology. Its countable base consists of finite intersections of Borel base sets, so its Borel sets remain the original ones. Thus is clopen and is continuous in the resulting arrow topology. Fix a complete compatible metric for this topology. No groupoid operation is asserted to be continuous.
Proof, support and nested balls. For , restrict to and divide by the positive number , obtaining a Borel probability kernel . It is carried by the closed set . Let be its closed support in the refined metric space. The union of all open zero-measure base sets is the complement of ; it has zero measure because the base is countable. Consequently , , and every open positive-measure ball meets . Also : the complement of that closed set is an open zero-measure set.
Enumerate balls with rational radii and centres in a fixed countable dense set. Choose the first ball of diameter at most with . Given a chosen ball , choose the first enumerated ball of diameter at most , positive -measure, and with closure contained in . Such balls cover : each point of an open ball admits a sufficiently small rational-centred ball whose closure remains inside it. A countable cover of a positive-measure set cannot consist entirely of zero-measure members. The closure-containment predicate depends only on the two fixed balls; it is a fixed subset of the countable index pairs. Each first-index choice is therefore Borel in , by measurability of .
The centres form a Cauchy sequence, since all later centres lie in of diameter at most . Completeness gives a limit . Every chosen ball meets , so its centre has distance at most its diameter from . Closedness of gives , hence the asserted range and membership. The limit is Borel: for every closed , is the pointwise limit of the Borel distances of the centres. Inverse images of closed sets are therefore Borel, and so are inverse images of open sets. This proves the lemma on every point of , with no exceptional selector set.
Lemma 2.3 (Borel detection of a point mass). Suppose is a Borel probability kernel on a nonempty Polish space , with parameter in a standard Borel space. The set of for which is a point mass is Borel, and its atom is a Borel function on that set.
Proof. Choose a bounded complete compatible metric and a dense sequence . The required set is A point mass satisfies this test. Conversely, choose the first admissible centre for each . Any two selected balls intersect, because both have probability one. Their centres are thus Cauchy and converge to a point . The intersection of all selected balls has probability one. Every point in that intersection has distance tending to zero from , so it equals . Hence . The first centres and their limit are Borel, as in Lemma 2.2. Uniqueness follows because a probability cannot give mass one to two distinct singleton sets.
3. A canonical wide subgroupoid
For , consider the Borel function on The family is a Borel probability kernel by the integration argument in Section 1. Define to be the set of arrows for which is a point mass, and write for that mass's atom. Lemma 2.3 proves that and are Borel. Equivalently, There is a unique constant in (3.2), because .
Proposition 3.1. The set is a wide Borel subgroupoid, is a strict homomorphism on , and is -conull with for -almost every arrow.
Proof, algebra. Every unit lies in , since ; its value under is . Suppose and belong to . The exceptional set in (3.2) for is -null. Its inverse image under is -null by (1.1). Outside that set and the exceptional set for , Thus and . For an inverse, write . Left translation takes a -conull set to a -conull set. Equation (3.2) becomes there, proving and . These are identities for every arrow or pair in .
Proof, measure. Equation (1.4) and kernel product integration imply that for -almost every , for -almost every . Equivalence with shows . Hence these arrows belong to and satisfy .
Define the Borel unit set It is -conull because is -conull. It need not be saturated.
Lemma 3.2 (the full good reduction). Every arrow whose source and range lie in belongs to .
Proof. Let , with . The sets and are both -conull, the latter by (1.1). Their intersection is nonempty, since . Choose such that . Then , which belongs to the subgroupoid . Thus is already strict on every arrow between good units. This nonmeasurable choice is only used to prove membership; the extension will use Lemma 2.2's Borel choice.
4. A saturated conull set and the extension formula
Put Both sets are Borel. Left translation preserves the source of an arrow, so (1.1) gives whenever there is an arrow . Consequently is saturated.
To see that is conull, first note . Integration over a -null unit set is zero, even when the kernel value is infinite. Inversion equivalence then gives . Therefore for -almost every , . Faithfulness implies at those units. Thus , and also , are conull.
For every , any arrow in has source in by saturation. Hence . Apply Lemma 2.2 with and . It supplies a Borel arrow , with . Invert it to obtain . On replace the selected arrow by . This piecewise replacement is Borel and still has its endpoint in .
For in , define Lemma 3.2 puts in , since both endpoints belong to . The map in (4.2) is Borel. For and , all the following are actual arrow identities: The middle cancellation is the unit at . Strictness of on therefore proves strictness of on every pair in , including units and inverses.
It remains to prove equality with the original map, rather than just existence of a homomorphism. The set is -conull, so is -null; inversion equivalence gives the same for . Thus -almost every arrow has both endpoints in . For such an arrow, and , so and . Proposition 3.1 gives almost everywhere. This proves Theorem 1.1. If , the same construction is valid; a conull set may be empty, in which case the conclusion is vacuous.
Figure 4.1. The upper row records the full proof: the defect's fibre distribution defines (Proposition 3.1), the full reduction on lies in (Lemma 3.2), and positive kernel access defines the saturated set (4.1). In the lower row, the transports send arbitrary endpoints in to ; (4.2) compresses the arrow and (4.3) cancels the middle transport. No measure, metric distance or relative size is encoded by the drawing. Example 5.2 shows why orbit saturation of an exceptional null set cannot replace (4.1).
5. Invariant labels and two concrete groupoids
Corollary 5.1 (countable almost invariant labels). Let be Borel, with for -almost every arrow. There is a saturated conull Borel set and a Borel , constant along every arrow of , such that almost everywhere.
Proof. For each , take the distribution of under . The set where this distribution is a point mass is Borel: it is the countable union of the sets . Its unique atom is Borel. Kernel integration of the almost invariant equality gives for -almost every . Thus is conull and there almost everywhere. The condition means exactly that for -almost every . Left invariance preserves this condition for every arrow, since sources are unchanged. Hence is saturated and is constant on every arrow in its reduction. Notice that equality of the entire probability distributions at different units was not needed; itself need not be transverse.
This applies to almost invariant Hilbert dimension labels. On each invariant dimension stratum, a supplied Borel orthonormal trivialization turns an almost unitary representation into an almost homomorphism with values in the corresponding Polish unitary group. Theorem 1.1 then repairs that map. For countably many strata, take the union of their saturated conull reductions. The measurable trivializations, the Polish topology of the unitary group and the measure class of the arrow kernel remain declared inputs to this application. A dimension label alone does not supply a spectral chart. The preceding Joint spectral charts and measurable intertwiners supplies that separate spectral construction.
Example 5.2 (a null set whose orbit saturation is the whole space). Take the pair groupoid , where , with . Put on and , so . The kernel is faithful and proper, and inversion swaps the two coordinates. Let and set For almost every triple , all coordinates are positive and the cocycle equality is . For , the defect is zero for almost every . For , it is for almost every ; for , it is . These distributions are not point masses. The arrow has zero defect. Consequently The map is zero on . Choose for , and . Equation (4.2) gives the strict homomorphism on every arrow, agreeing with almost everywhere. The exceptional unit set has measure zero, but its orbit saturation is all of . Removing that saturation would discard every unit. Instead (4.1) includes the exceptional endpoint by its positive access to good units and (4.2) defines its arrows coherently.
Example 5.3 (infinite kernels and nontrivial isotropy). Use arrows on , with , and product . Put times counting measure in , and . The sets give a uniform proper exhaustion. Inversion is , preserving . Every unit has isotropy group . An equivalent probability kernel is times the weights . This probability kernel is not invariant under a nonzero translation of , illustrating Lemma 2.1's warning. For any Borel and any , is a strict homomorphism: the two adjacent factors cancel, and . Here , , and the repair with unit transports returns the original map everywhere. Neither principality nor finite fibre measure was used in the theorem.
6. Exercises with complete solutions
Level 1 requests a calculation; Level 2 a proof using the framework; Level 3 tests a hypothesis or combines the constructions.
Exercise 6.1. Level 1. Check the probability weights in Example 5.3 and show explicitly that its probability kernel is not transverse. Explain why this does not affect the proof of Proposition 3.1.
Solution. The sum is . Each weight is positive, so the probability and counting measures have the same null sets on ; multiplying by preserves equivalence. Left multiplication by sends an arrow to . The target set of arrows labelled zero has probability , while its inverse image has label and probability . Thus left invariance fails for . Proposition 3.1 translates full-measure sets using , whose counting measure is invariant. It uses only to recognize whether a defect is almost everywhere a constant, a condition unchanged by an everywhere positive density.
Exercise 6.2. Level 2. For with in a Polish metric space, show that the test (2.2) fails. Prove directly why the probability normalization matters to the test.
Solution. Let . Choose with . A ball of radius has diameter at most , so it cannot contain both points. Its measure is at most , and no such ball has measure one. For a general probability satisfying (2.2), every selected ball has complement of measure zero; the countable union of these complements still has measure zero. Hence their intersection has measure one and is nonempty. Pairwise intersections also force the centres to be Cauchy. The shrinking radii then put every point in the full-measure intersection at the unique centre limit. If one tried instead to test equality to the total mass of the zero measure, every ball would pass, and unrelated choices of centres would give no atom. Faithfulness and Lemma 2.1 exclude this degeneration by producing a probability at every unit.
Exercise 6.3. Level 2. Suppose is a wide subgroupoid and . Prove that every arrow belongs to , even when .
Solution. Left invariance says the complement of in is null. The complement of is also null. The complement of their intersection is a union of these two null sets and is null. If the intersection were empty, would be zero, contradicting faithfulness. Choose in the intersection. Both belong to , and the subgroupoid property gives . At no step is an expression of the form used; only null complements and nonzero measure are needed.
Exercise 6.4. Level 3. Use Example 5.2 to check the failure of deleting the saturation of the bad units. Compute and for arrows with one or both endpoints zero.
Solution. The pair groupoid has one orbit. Every unit is connected to zero, so the saturation of is . Deleting it leaves no conull reduction. Under the stated transports, put for and . An arbitrary arrow compresses to . Thus for , for , and . All these lie in the full reduction on , where . Hence is zero on every arrow, including . Its discrepancy with is confined to , a product-measure null set. The strict identity holds on all triples because both sides are zero.
Exercise 6.5. Level 2. In the pair groupoid with Lebesgue measure, a Borel dimension label satisfies for almost every pair. Prove that it is essentially constant, and repair it to a label constant on every unit.
Solution. Product integration gives an such that for almost every . Put . The source distribution under each is then , including at exceptional values of . Thus the set in Corollary 5.1 is all of , and on every unit. It agrees with almost everywhere and is invariant under every pair-groupoid arrow. The choice proves essential constancy; the final constant label is Borel and requires no measurable choice of such witnesses across units.
Exercise 6.6. Level 3. Two Borel transport families and , with endpoints in , are both the unit arrows on . Compare their repaired homomorphisms and show that they agree almost everywhere without claiming pointwise uniqueness off the good reduction.
Solution. Put . Both endpoints are in , so by Lemma 3.2, and is Borel. For , All arrows on the right belong to . Its strict homomorphism gives . On both transport families are units, so . Both endpoints of almost every arrow lie in , by the range-null and inversion arguments in Section 4. Thus almost everywhere. Away from , the Borel function can be nontrivial, and the formula describes the possible change. The theorem asserts existence with almost everywhere equality, not a pointwise canonical extension on all exceptional endpoints.
7. Source comparison and remaining application inputs
Theorem 1.1 matches the full B7 assertion in the existing programme lesson Weights on random operators and formal dimension: a standard Borel groupoid, a faithful proper transverse kernel, a sigma-finite unit measure whose arrow measure is equivalent to its inverse, a Polish target group, and the precise composable-pair measure (1.3). Its conclusion includes a saturated conull Borel set and equality with the original map for the arrow measure. The proof is supplied here through an equivalent probability kernel, a complete positive-fibre selector, the canonical subgroupoid, and the explicit saturated extension. It does not assume countable fibres, a locally compact target, finite measure, principality, or an already invariant exceptional set.
The historical reference is Arlan Ramsay, Virtual groups and group actions, Advances in Mathematics 6 (1971), 253–322. This is attribution of the classical theorem; no uninspected proof passage from that protected article is adopted. The exact programme statement was compared in full. The topology prerequisite is the actual written Effros Borel structure, Theorems 2.1(1), 2.2 and its countable-join proof, in Operator algebra foundations. Its complete selected proof was read and compared; provider files remain unchanged. Kernel integration is the specified measure-theory prerequisite, not inferred from a citation to Ramsay.
This closes the B7 almost-homomorphism input at its declared prerequisites. B6's measurable spectral chart and intertwiner construction is in the preceding lesson. Strict spectral representations on the stable kernel, Theorem 1.1, now verifies the Borel dimension coordinates, Polish unitary targets, lifted measure class and composable-pair measure in the specified spectral application, including the necessary choice of field representatives on a product-null set. The general B1 operator-valued modular theorem retains its separate declared prerequisites; it is not inferred from the repair theorem. Integrable centralizers and spectral intertwiners, Theorem 1.1, now proves square integrability, the complete almost-intertwiner repair and both directions of the normal centralizer isomorphism at the specified modular formula and absolutely continuous spectral inputs. Its normal-module and random-operator import is the complete compared Claude-SQ theory at its declared background. Spectral necessity and modular transfer, Theorems 3.1 and 5.3 and Proposition 4.1, supplies the spectral necessity and both transfer directions with genuine exhaustions. Orbit averaging and the modular weight bridge, Theorem 1.1 and Corollary 5.2, supplies the standing standard Borel bridge and the complete supported source comparison. This application retains its explicit normal-module, spatial-weight, scalar density and modular commutation inputs. Broader measurable assertions and final course validation keep their separate scope.