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 γ:x→y\gamma:x\to y, with source sγ=xs\gamma=x and range rγ=yr\gamma=y. The product γη\gamma\eta means first η\eta, then γ\gamma. Let GG and its unit space XX be standard Borel spaces, with Borel multiplication, inversion and unit map. The composable-pair space G(2)G^{(2)} is Borel: it is defined by sγ=rηs\gamma=r\eta, the inverse image of the Borel diagonal of XX. Put Gy=r−1{y}G^y=r^{-1}\{y\}.

A transverse kernel κ\kappa consists of positive measures κy\kappa^y on GyG^y, extended by zero to GG, such that y↦κy(B)y\mapsto\kappa^y(B) is Borel for every Borel B⊂GB\subset G, and left multiplication obeys (Lγ)∗κx=κy,Lγ(η)=γη(γ:x→y).(1.1) (L_\gamma)_*\kappa^x=\kappa^y, \qquad L_\gamma(\eta)=\gamma\eta \quad(\gamma:x\to y). \tag{1.1} Faithfulness means κy≠0\kappa^y\ne0 for every yy. Properness means there are increasing Borel An↑GA_n\uparrow G such that γ↦κsγ(γ−1An)\gamma\mapsto\kappa^{s\gamma}(\gamma^{-1}A_n) is bounded for each nn. Here γ−1An\gamma^{-1}A_n means the left translate of An∩GrγA_n\cap G^{r\gamma}. In particular, applying this bound at unit arrows gives finite constants MnM_n with κy(An)≤Mn\kappa^y(A_n)\le M_n for every yy. This also proves sigma-finiteness of each fibre measure.

Let μ\mu be a sigma-finite Borel measure on XX and define m(B)=∫Xκy(B) dμ(y),m−1(B)=m({γ:γ−1∈B}).(1.2) m(B)=\int_X\kappa^y(B)\,d\mu(y),\qquad m^{-1}(B)=m(\{\gamma:\gamma^{-1}\in B\}). \tag{1.2} We assume mm and m−1m^{-1} have the same null sets. The measure mm is sigma-finite: intersect AnA_n with the inverse images under rr of finite-measure sets exhausting XX. The measure on composable pairs is F2(C)=∫G∫Gsγ1C(γ,η) dκsγ(η) dm(γ).(1.3) F_2(C)=\int_G\int_{G^{s\gamma}} 1_C(\gamma,\eta)\,d\kappa^{s\gamma}(\eta)\,dm(\gamma). \tag{1.3} It too is sigma-finite, by bounding the inner measure on AnA_n 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 PP be a Polish group with identity 1P1_P. The map π:G→P\pi:G\to P is an almost homomorphism if it is Borel and π(γη)=π(γ)π(η)for F2-almost every (γ,η).(1.4) \pi(\gamma\eta)=\pi(\gamma)\pi(\eta) \quad\text{for }F_2\text{-almost every }(\gamma,\eta). \tag{1.4} A saturated unit set contains the source of every arrow whose range it contains, and conversely. For such a set YY, its full reduction is GY=r−1(Y)=s−1(Y)G_Y=r^{-1}(Y)=s^{-1}(Y).

Theorem 1.1 (almost-homomorphism repair). Under these hypotheses there are a saturated, μ\mu-conull Borel set Y⊂XY\subset X and a Borel homomorphism π′:GY→P\pi':G_Y\to P, valid on every composable pair in GYG_Y, such that π′=π\pi'=\pi for mm-almost every arrow of GYG_Y.

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 ρy\rho^y on GyG^y equivalent to κy\kappa^y for every unit yy.

Proof. Set A0=∅A_0=\varnothing, Dn=An∖An−1D_n=A_n\setminus A_{n-1}, and put g0(η)=∑n≥12−n1+Mn1Dn(η),h(y)=∫g0 dκy.(2.1) g_0(\eta)=\sum_{n\ge1}\frac{2^{-n}}{1+M_n}1_{D_n}(\eta), \qquad h(y)=\int g_0\,d\kappa^y. \tag{2.1} The sets DnD_n partition GG, so g0g_0 is strictly positive everywhere. The estimate h(y)≤∑n2−n<∞h(y)\le\sum_n2^{-n}<\infty follows from κy(Dn)≤Mn\kappa^y(D_n)\le M_n. Faithfulness gives h(y)>0h(y)>0: otherwise each set where g0≥1/kg_0\ge1/k would have zero measure, and their union is GG. Kernel integration makes hh Borel. Define ρy(B)=h(y)−1∫Bg0 dκy\rho^y(B)=h(y)^{-1}\int_Bg_0\,d\kappa^y. This is a Borel probability kernel with exactly the same null sets as κy\kappa^y. It need not be transverse. We continue to use (1.1) for κ\kappa, transferring only null-set assertions through ρ\rho. □\square

Lemma 2.2 (positive-fibre choice). Let A⊂GA\subset G be Borel and let T⊂XT\subset X be Borel. If κy(A)>0\kappa^y(A)>0 for every y∈Ty\in T, then there is a Borel β:T→G\beta:T\to G with rβ(y)=yr\beta(y)=y and β(y)∈A\beta(y)\in A.

Proof, topology. Give GG and XX Polish topologies realizing their specified Borel structures. Take a countable base (Vj)(V_j) of XX. Apply the exact imported clopen refinement theorem separately to AA and all r−1(Vj)r^{-1}(V_j), 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 AA is clopen and rr is continuous in the resulting arrow topology. Fix a complete compatible metric dd for this topology. No groupoid operation is asserted to be continuous.

Proof, support and nested balls. For y∈Ty\in T, restrict ρy\rho^y to AA and divide by the positive number ρy(A)\rho^y(A), obtaining a Borel probability kernel τy\tau^y. It is carried by the closed set A∩r−1{y}A\cap r^{-1}\{y\}. Let KyK_y be its closed support in the refined metric space. The union of all open zero-measure base sets is the complement of KyK_y; it has zero measure because the base is countable. Consequently τy(Ky)=1\tau^y(K_y)=1, Ky≠∅K_y\ne\varnothing, and every open positive-measure ball meets KyK_y. Also Ky⊂A∩r−1{y}K_y\subset A\cap r^{-1}\{y\}: 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 B1(y)B_1(y) of diameter at most 1/21/2 with τy(B1(y))>0\tau^y(B_1(y))>0. Given a chosen ball Bn(y)B_n(y), choose the first enumerated ball Bn+1(y)B_{n+1}(y) of diameter at most 2−n−12^{-n-1}, positive τy\tau^y-measure, and with closure contained in Bn(y)B_n(y). Such balls cover Bn(y)B_n(y): 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 yy, by measurability of τy(Bj)\tau^y(B_j).

The centres form a Cauchy sequence, since all later centres lie in Bn(y)B_n(y) of diameter at most 2−n2^{-n}. Completeness gives a limit β(y)\beta(y). Every chosen ball meets KyK_y, so its centre has distance at most its diameter from KyK_y. Closedness of KyK_y gives β(y)∈Ky\beta(y)\in K_y, hence the asserted range and membership. The limit is Borel: for every closed FF, d(β(y),F)d(\beta(y),F) 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 TT, with no exceptional selector set. □\square

Lemma 2.3 (Borel detection of a point mass). Suppose qtq_t is a Borel probability kernel on a nonempty Polish space PP, with parameter tt in a standard Borel space. The set of tt for which qtq_t 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 (pj)(p_j). The required set is D=⋂n≥1⋃j≥1{t:qt(B(pj,2−n))=1}.(2.2) D=\bigcap_{n\ge1}\bigcup_{j\ge1} \{t:q_t(B(p_j,2^{-n}))=1\}. \tag{2.2} A point mass satisfies this test. Conversely, choose the first admissible centre for each nn. Any two selected balls intersect, because both have probability one. Their centres are thus Cauchy and converge to a point c(t)c(t). The intersection of all selected balls has probability one. Every point in that intersection has distance tending to zero from c(t)c(t), so it equals c(t)c(t). Hence qt=δc(t)q_t=\delta_{c(t)}. 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. □\square

3. A canonical wide subgroupoid

For γ:x→y\gamma:x\to y, consider the Borel function on GxG^x Dγ(η)=π(γη)π(η)−1,qγ=(Dγ)∗ρx.(3.1) D_\gamma(\eta)=\pi(\gamma\eta)\pi(\eta)^{-1}, \qquad q_\gamma=(D_\gamma)_*\rho^x. \tag{3.1} The family qγq_\gamma is a Borel probability kernel by the integration argument in Section 1. Define HH to be the set of arrows for which qγq_\gamma is a point mass, and write c(γ)c(\gamma) for that mass's atom. Lemma 2.3 proves that HH and c:H→Pc:H\to P are Borel. Equivalently, γ∈H⟺π(γη)=c(γ)π(η) for κsγ-almost every η.(3.2) \gamma\in H\quad\Longleftrightarrow\quad \pi(\gamma\eta)=c(\gamma)\pi(\eta) \text{ for }\kappa^{s\gamma}\text{-almost every }\eta. \tag{3.2} There is a unique constant in (3.2), because κsγ≠0\kappa^{s\gamma}\ne0.

Proposition 3.1. The set HH is a wide Borel subgroupoid, cc is a strict homomorphism on HH, and HH is mm-conull with c=πc=\pi for mm-almost every arrow.

Proof, algebra. Every unit exe_x lies in HH, since Dex(η)=1PD_{e_x}(\eta)=1_P; its value under cc is 1P1_P. Suppose γ:x→y\gamma:x\to y and η:w→x\eta:w\to x belong to HH. The exceptional set in (3.2) for γ\gamma is κx\kappa^x-null. Its inverse image under LηL_\eta is κw\kappa^w-null by (1.1). Outside that set and the exceptional set for η\eta, π(γηζ)=c(γ)π(ηζ)=c(γ)c(η)π(ζ).(3.3) \pi(\gamma\eta\zeta) =c(\gamma)\pi(\eta\zeta) =c(\gamma)c(\eta)\pi(\zeta). \tag{3.3} Thus γη∈H\gamma\eta\in H and c(γη)=c(γ)c(η)c(\gamma\eta)=c(\gamma)c(\eta). For an inverse, write u=γζu=\gamma\zeta. Left translation takes a κx\kappa^x-conull set to a κy\kappa^y-conull set. Equation (3.2) becomes π(γ−1u)=c(γ)−1π(u)\pi(\gamma^{-1}u)=c(\gamma)^{-1}\pi(u) there, proving γ−1∈H\gamma^{-1}\in H and c(γ−1)=c(γ)−1c(\gamma^{-1})=c(\gamma)^{-1}. These are identities for every arrow or pair in HH.

Proof, measure. Equation (1.4) and kernel product integration imply that for mm-almost every γ\gamma, Dγ(η)=π(γ)D_\gamma(\eta)=\pi(\gamma) for κsγ\kappa^{s\gamma}-almost every η\eta. Equivalence with ρsγ\rho^{s\gamma} shows qγ=δπ(γ)q_\gamma=\delta_{\pi(\gamma)}. Hence these arrows belong to HH and satisfy c(γ)=π(γ)c(\gamma)=\pi(\gamma). □\square

Define the Borel unit set X0={x:κx(G∖H)=0}.(3.4) X_0=\{x:\kappa^x(G\setminus H)=0\}. \tag{3.4} It is μ\mu-conull because HH is mm-conull. It need not be saturated.

Lemma 3.2 (the full good reduction). Every arrow whose source and range lie in X0X_0 belongs to HH.

Proof. Let γ:x→y\gamma:x\to y, with x,y∈X0x,y\in X_0. The sets H∩GyH\cap G^y and γ(H∩Gx)\gamma(H\cap G^x) are both κy\kappa^y-conull, the latter by (1.1). Their intersection is nonempty, since κy≠0\kappa^y\ne0. Choose h∈H∩Gxh\in H\cap G^x such that h′=γh∈H∩Gyh'=\gamma h\in H\cap G^y. Then γ=h′h−1\gamma=h'h^{-1}, which belongs to the subgroupoid HH. Thus cc 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. □\square

4. A saturated conull set and the extension formula

Put Y={y:κy(s−1(X0))>0},Z=X0∩Y.(4.1) Y=\{y:\kappa^y(s^{-1}(X_0))>0\}, \qquad Z=X_0\cap Y. \tag{4.1} Both sets are Borel. Left translation preserves the source of an arrow, so (1.1) gives κy(s−1X0)=κx(s−1X0)\kappa^y(s^{-1}X_0)=\kappa^x(s^{-1}X_0) whenever there is an arrow x→yx\to y. Consequently YY is saturated.

To see that YY is conull, first note m(r−1(X∖X0))=0m(r^{-1}(X\setminus X_0))=0. Integration over a μ\mu-null unit set is zero, even when the kernel value is infinite. Inversion equivalence then gives m(s−1(X∖X0))=0m(s^{-1}(X\setminus X_0))=0. Therefore for μ\mu-almost every yy, κy(s−1(X∖X0))=0\kappa^y(s^{-1}(X\setminus X_0))=0. Faithfulness implies κy(s−1X0)>0\kappa^y(s^{-1}X_0)>0 at those units. Thus YY, and also ZZ, are conull.

For every y∈Yy\in Y, any arrow in GyG^y has source in YY by saturation. Hence κy(s−1Z)=κy(s−1X0)>0\kappa^y(s^{-1}Z)=\kappa^y(s^{-1}X_0)>0. Apply Lemma 2.2 with A=s−1ZA=s^{-1}Z and T=YT=Y. It supplies a Borel arrow βy:zy→y\beta_y:z_y\to y, with zy∈Zz_y\in Z. Invert it to obtain ay:y→zya_y:y\to z_y. On ZZ replace the selected arrow by az=eza_z=e_z. This piecewise replacement is Borel and still has its endpoint in ZZ.

For γ:x→y\gamma:x\to y in GYG_Y, define θ(γ)=ayγax−1:zx→zy,π′(γ)=c(θ(γ)).(4.2) \theta(\gamma)=a_y\gamma a_x^{-1}:z_x\to z_y, \qquad \pi'(\gamma)=c(\theta(\gamma)). \tag{4.2} Lemma 3.2 puts θ(γ)\theta(\gamma) in HH, since both endpoints belong to Z⊂X0Z\subset X_0. The map in (4.2) is Borel. For η:w→x\eta:w\to x and γ:x→y\gamma:x\to y, all the following are actual arrow identities: θ(γ)θ(η)=ayγax−1axηaw−1=ayγηaw−1=θ(γη).(4.3) \begin{aligned} \theta(\gamma)\theta(\eta) &=a_y\gamma a_x^{-1}a_x\eta a_w^{-1}\\ &=a_y\gamma\eta a_w^{-1} =\theta(\gamma\eta). \end{aligned} \tag{4.3} The middle cancellation is the unit at xx. Strictness of cc on HH therefore proves strictness of π′\pi' on every pair in GYG_Y, including units and inverses.

It remains to prove equality with the original map, rather than just existence of a homomorphism. The set ZZ is μ\mu-conull, so r−1(X∖Z)r^{-1}(X\setminus Z) is mm-null; inversion equivalence gives the same for s−1(X∖Z)s^{-1}(X\setminus Z). Thus mm-almost every arrow has both endpoints in ZZ. For such an arrow, ax=exa_x=e_x and ay=eya_y=e_y, so θ(γ)=γ\theta(\gamma)=\gamma and π′(γ)=c(γ)\pi'(\gamma)=c(\gamma). Proposition 3.1 gives c(γ)=π(γ)c(\gamma)=\pi(\gamma) almost everywhere. This proves Theorem 1.1. If μ=0\mu=0, the same construction is valid; a conull set may be empty, in which case the conclusion is vacuous. □\square

From the canonical subgroupoid through a full good reduction to a saturated extension
Open diagram at full size

Figure 4.1. The upper row records the full proof: the defect's fibre distribution defines H,cH,c (Proposition 3.1), the full reduction on X0X_0 lies in HH (Lemma 3.2), and positive kernel access defines the saturated set YY (4.1). In the lower row, the transports ax,aya_x,a_y send arbitrary endpoints in YY to ZZ; (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 d:X→N0∪{∞}d:X\to\mathbb N_0\cup\{\infty\} be Borel, with d(rγ)=d(sγ)d(r\gamma)=d(s\gamma) for mm-almost every arrow. There is a saturated conull Borel set TT and a Borel d′:T→N0∪{∞}d':T\to\mathbb N_0\cup\{\infty\}, constant along every arrow of GTG_T, such that d′=dd'=d almost everywhere.

Proof. For each yy, take the distribution vyv_y of d(sη)d(s\eta) under ρy\rho^y. The set TT where this distribution is a point mass is Borel: it is the countable union of the sets {y:vy({j})=1}\{y:v_y(\{j\})=1\}. Its unique atom d′(y)d'(y) is Borel. Kernel integration of the almost invariant equality gives vy=δd(y)v_y=\delta_{d(y)} for μ\mu-almost every yy. Thus TT is conull and d′=dd'=d there almost everywhere. The condition vy=δjv_y=\delta_j means exactly that d(sη)=jd(s\eta)=j for κy\kappa^y-almost every η\eta. Left invariance preserves this condition for every arrow, since sources are unchanged. Hence TT is saturated and d′d' is constant on every arrow in its reduction. Notice that equality of the entire probability distributions at different units was not needed; ρ\rho itself need not be transverse. □\square

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 G=[0,1]×[0,1]G=[0,1]\times[0,1], where (y,x):x→y(y,x):x\to y, with (y,x)(x,z)=(y,z)(y,x)(x,z)=(y,z). Put κy=dx\kappa^y=d x on GyG^y and μ=dy\mu=d y, so m=dy dxm=d y\,d x. The kernel is faithful and proper, and inversion swaps the two coordinates. Let P=(R,+)P=(\mathbb R,+) and set π(y,x)={x,y=0, x>0,0,otherwise.(5.1) \pi(y,x)= \begin{cases}x,&y=0,\ x>0,\\0,&\text{otherwise}.\end{cases} \tag{5.1} For almost every triple (y,x,z)(y,x,z), all coordinates are positive and the cocycle equality is 0=0+00=0+0. For y,x>0y,x>0, the defect π(y,z)−π(x,z)\pi(y,z)-\pi(x,z) is zero for almost every zz. For y=0,x>0y=0,x>0, it is zz for almost every zz; for y>0,x=0y>0,x=0, it is −z-z. These distributions are not point masses. The arrow (0,0)(0,0) has zero defect. Consequently H=((0,1]×(0,1])∪{(0,0)},X0=Z=(0,1],Y=[0,1].(5.2) H=((0,1]\times(0,1])\cup\{(0,0)\}, \quad X_0=Z=(0,1],\quad Y=[0,1]. \tag{5.2} The map cc is zero on HH. Choose az=eza_z=e_z for z>0z>0, and a0=(1,0):0→1a_0=(1,0):0\to1. Equation (4.2) gives the strict homomorphism π′=0\pi'=0 on every arrow, agreeing with π\pi almost everywhere. The exceptional unit set {0}\{0\} has measure zero, but its orbit saturation is all of [0,1][0,1]. 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 (y,n,x):x→y(y,n,x):x\to y on [0,1][0,1], with n∈Zn\in\mathbb Z, and product (y,n,x)(x,k,z)=(y,n+k,z)(y,n,x)(x,k,z)=(y,n+k,z). Put κy=dx\kappa^y=d x times counting measure in nn, and μ=dy\mu=d y. The sets AN={∣n∣≤N}A_N=\{|n|\le N\} give a uniform proper exhaustion. Inversion is (y,n,x)−1=(x,−n,y)(y,n,x)^{-1}=(x,-n,y), preserving mm. Every unit has isotropy group Z\mathbb Z. An equivalent probability kernel is ρy=dx\rho^y=d x times the weights 2−∣n∣/32^{-|n|}/3. This probability kernel is not invariant under a nonzero translation of nn, illustrating Lemma 2.1's warning. For any Borel b:[0,1]→Pb:[0,1]\to P and any u∈Pu\in P, π(y,n,x)=b(y)unb(x)−1(5.3) \pi(y,n,x)=b(y)u^n b(x)^{-1} \tag{5.3} is a strict homomorphism: the two adjacent factors b(x)−1b(x)b(x)^{-1}b(x) cancel, and unuk=un+ku^nu^k=u^{n+k}. Here H=GH=G, X0=Y=Z=XX_0=Y=Z=X, 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 (1+2∑n≥12−n)/3=(1+2)/3=1(1+2\sum_{n\ge1}2^{-n})/3=(1+2)/3=1. Each weight is positive, so the probability and counting measures have the same null sets on Z\mathbb Z; multiplying by dxd x preserves equivalence. Left multiplication by (y,1,x)(y,1,x) sends an arrow (x,n,z)(x,n,z) to (y,n+1,z)(y,n+1,z). The target set of arrows labelled zero has probability 1/31/3, while its inverse image has label −1-1 and probability 1/61/6. Thus left invariance fails for ρ\rho. Proposition 3.1 translates full-measure sets using κ\kappa, whose counting measure is invariant. It uses ρ\rho 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 v=12δp+12δqv=\tfrac12\delta_p+\tfrac12\delta_q with p≠qp\ne q in a Polish metric space, show that the test (2.2) fails. Prove directly why the probability normalization matters to the test.

Solution. Let ε=d(p,q)>0\varepsilon=d(p,q)>0. Choose nn with 21−n<ε2^{1-n}<\varepsilon. A ball of radius 2−n2^{-n} has diameter at most 21−n2^{1-n}, so it cannot contain both points. Its measure is at most 1/21/2, 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 HH is a wide subgroupoid and κx(G∖H)=κy(G∖H)=0\kappa^x(G\setminus H)=\kappa^y(G\setminus H)=0. Prove that every arrow γ:x→y\gamma:x\to y belongs to HH, even when κy(G)=∞\kappa^y(G)=\infty.

Solution. Left invariance says the complement of γ(H∩Gx)\gamma(H\cap G^x) in GyG^y is null. The complement of H∩GyH\cap G^y is also null. The complement of their intersection is a union of these two null sets and is null. If the intersection were empty, κy(Gy)\kappa^y(G^y) would be zero, contradicting faithfulness. Choose γh=h′\gamma h=h' in the intersection. Both h,h′h,h' belong to HH, and the subgroupoid property gives γ=h′h−1∈H\gamma=h'h^{-1}\in H. At no step is an expression of the form ∞−∞\infty-\infty 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 θ(γ)\theta(\gamma) and π′(γ)\pi'(\gamma) 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 {0}\{0\} is [0,1][0,1]. Deleting it leaves no conull reduction. Under the stated transports, put zt=tz_t=t for t>0t>0 and z0=1z_0=1. An arbitrary arrow (y,x)(y,x) compresses to (zy,zx)(z_y,z_x). Thus θ(0,x)=(1,x)\theta(0,x)=(1,x) for x>0x>0, θ(y,0)=(y,1)\theta(y,0)=(y,1) for y>0y>0, and θ(0,0)=(1,1)\theta(0,0)=(1,1). All these lie in the full reduction on (0,1](0,1], where c=0c=0. Hence π′\pi' is zero on every arrow, including (0,0)(0,0). Its discrepancy with π\pi is confined to {0}×(0,1]\{0\}\times(0,1], 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 d:[0,1]→N0∪{∞}d:[0,1]\to\mathbb N_0\cup\{\infty\} satisfies d(y)=d(x)d(y)=d(x) 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 x0x_0 such that d(y)=d(x0)d(y)=d(x_0) for almost every yy. Put j=d(x0)j=d(x_0). The source distribution under each ρy=dx\rho^y=d x is then δj\delta_j, including at exceptional values of yy. Thus the set TT in Corollary 5.1 is all of [0,1][0,1], and d′(y)=jd'(y)=j on every unit. It agrees with dd almost everywhere and is invariant under every pair-groupoid arrow. The choice x0x_0 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 ay:y→zya_y:y\to z_y and a~y:y→z~y\widetilde a_y:y\to\widetilde z_y, with endpoints in ZZ, are both the unit arrows on ZZ. Compare their repaired homomorphisms and show that they agree almost everywhere without claiming pointwise uniqueness off the good reduction.

Solution. Put hy=a~yay−1:zy→z~yh_y=\widetilde a_y a_y^{-1}:z_y\to\widetilde z_y. Both endpoints are in ZZ, so hy∈Hh_y\in H by Lemma 3.2, and b(y)=c(hy)b(y)=c(h_y) is Borel. For γ:x→y\gamma:x\to y, a~yγa~x−1=hy(ayγax−1)hx−1.(6.1) \widetilde a_y\gamma\widetilde a_x^{-1} =h_y(a_y\gamma a_x^{-1})h_x^{-1}. \tag{6.1} All arrows on the right belong to HH. Its strict homomorphism gives π~′(γ)=b(y)π′(γ)b(x)−1\widetilde\pi'(\gamma)=b(y)\pi'(\gamma)b(x)^{-1}. On ZZ both transport families are units, so b=1Pb=1_P. Both endpoints of almost every arrow lie in ZZ, by the range-null and inversion arguments in Section 4. Thus π~′=π′\widetilde\pi'=\pi' almost everywhere. Away from ZZ, the Borel function bb 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.