Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

§2 (external, Connes–Feldman–Weiss) — an amenable relation is μ-amenable in Lodha and Moore's sense

Proved
LodhaMoore.isMuAmenable_of_isAmenableRel

by dbenbenn · Oct 2, 2026 · Mathlib 0df444a (Lean v4.33.1)

amenabilityfinitely-presentedgroup-theorypiecewise-projectivethompsons-group

Let XXX be a Polish space with its Borel σ\sigmaσ-algebra, μ\muμ a σ\sigmaσ-finite measure, and E⊆X×XE \subseteq X \times XE⊆X×X a Borel equivalence relation with countable classes such that the EEE-saturation of every μ\muμ-null set is μ\muμ-null. If EEE has a left invariant mean (Monod.IsAmenableRel), then EEE is μ\muμ-amenable in Lodha and Moore's sense: off a null set NNN it is the orbit relation of a Borel automorphism of X∖NX \setminus NX∖N.

Formalization Note. Lodha and Moore put no condition on μ\muμ. Their reference [7] is Connes, Feldman and Weiss (doi:10.1017/S014338570000136X), whose main theorem is the direction stated here. It is set on a standard Borel space with a measure quasi-invariant for the relation (p. 433: "A measure μ\muμ on XXX is said to be quasi-invariant for RRR if, for every μ\muμ-null Borel set A⊂XA \subset XA⊂X, the saturation of AAA … is μ\muμ-null"), and for "any amenable non-singular countable equivalence relation" it produces "a non-singular transformation TTT" generating the relation off a null set (abstract, p. 431). Connes, Feldman and Weiss do not state σ\sigmaσ-finiteness, but their Radon–Nikodym module (p. 434) presupposes it. Both hypotheses are assumed here. The automorphism TTT of X∖NX \setminus NX∖N in the conclusion has its orbits inside the relation, so under quasi-invariance it is non-singular automatically (p. 434). In the paper's application (§2: Lebesgue measure on the projective line, countable groups of piecewise projective homeomorphisms) both hypotheses hold, since such homeomorphisms map Lebesgue-null sets to null sets.

Preamble
import Mathlib
import Definitions.Def_LodhaMoore
import Definitions.Def_Monod_PiecewiseProjective
Formal statement
namespace LodhaMoore

theorem isMuAmenable_of_isAmenableRel {X : Type*} [TopologicalSpace X] [PolishSpace X]
    [MeasurableSpace X] [BorelSpace X] (μ : MeasureTheory.Measure X) [MeasureTheory.SigmaFinite μ]
    (E : Set (X × X)) (hE : MeasurableSet E) (hequiv : Equivalence fun x y => (x, y) ∈ E)
    (hcount : ∀ x, {y | (x, y) ∈ E}.Countable)
    (hqi : ∀ A : Set X, μ A = 0 → μ {y | ∃ x ∈ A, (x, y) ∈ E} = 0) :
    Monod.IsAmenableRel μ E → IsMuAmenable μ E := by
  sorry

end LodhaMoore
Source
Connes, A., Feldman, J., Weiss, B., An amenable equivalence relation is generated by a single transformation, Ergodic Theory Dynam. Systems 1 (1981) 431–450, https://doi.org/10.1017/S014338570000136X, p. 4, §2
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

The statement is a one-way implication. It holds for every space XXX, measure μ\muμ and relation EEE that satisfy the standing assumptions and hypotheses (H1)–(H4) below: if EEE has the mean property (Am) defined below, then EEE has the single-transformation property (Z) defined below.

Standing assumptions

XXX is a set (a type in any universe). Everything below is quantified over it, and it carries the following structure.

  • A topology making XXX a Polish space. The topology is second countable, and some metric that induces it is complete.
  • A σ\sigmaσ-algebra equal to the Borel σ\sigmaσ-algebra. It is the σ\sigmaσ-algebra generated by the open sets. "Measurable" for subsets of XXX means Borel.
  • A measure μ\muμ on this σ\sigmaσ-algebra. It is countably additive, with values in [0,∞][0,\infty][0,∞].
  • σ\sigmaσ-finiteness of μ\muμ. There are subsets S0,S1,S2,…S_0, S_1, S_2, \dotsS0​,S1​,S2​,… of XXX with μ(Si)<∞\mu(S_i) < \inftyμ(Si​)<∞ for every iii and ⋃iSi=X\bigcup_i S_i = X⋃i​Si​=X. The sets are not required to be measurable. Each set of finite outer measure lies inside a measurable set of the same measure, so this is the usual notion.

How μ\muμ is applied to arbitrary sets. For any subset A⊆XA \subseteq XA⊆X, measurable or not, μ(A)\mu(A)μ(A) means the outer measure:

μ(A)  =  inf⁡{μ(B):B⊇A, B measurable}.\mu(A) \;=\; \inf\{\mu(B) : B \supseteq A,\ B \text{ measurable}\}.μ(A)=inf{μ(B):B⊇A, B measurable}.

This convention applies to every occurrence of μ\muμ below. "μ\muμ-almost everywhere" (a.e.) means: the set of points where the property fails has μ\muμ-measure 000 in this sense. In particular, F=GF = GF=G a.e. means μ({x:F(x)≠G(x)})=0\mu(\{x : F(x) \neq G(x)\}) = 0μ({x:F(x)=G(x)})=0.

Other σ\sigmaσ-algebras.

  • X×XX \times XX×X: the product σ\sigmaσ-algebra, generated by the sets B×XB \times XB×X and X×BX \times BX×B with B⊆XB \subseteq XB⊆X measurable. Since XXX is second countable, this is also the Borel σ\sigmaσ-algebra of the product topology.
  • R\mathbb{R}R: the Borel σ\sigmaσ-algebra.
  • A subset D⊆XD \subseteq XD⊆X, viewed as a space in its own right: it carries the subspace σ\sigmaσ-algebra {B∩D:B⊆X measurable}\{B \cap D : B \subseteq X \text{ measurable}\}{B∩D:B⊆X measurable}.

The relation and the hypotheses

E⊆X×XE \subseteq X \times XE⊆X×X is a set of pairs. The following hypotheses are assumed.

  • (H1) EEE is a measurable subset of X×XX \times XX×X, for the product σ\sigmaσ-algebra.
  • (H2) The relation x∼y  ⟺  (x,y)∈Ex \sim y \iff (x,y) \in Ex∼y⟺(x,y)∈E is an equivalence relation on XXX:
    • it is reflexive: (x,x)∈E(x,x) \in E(x,x)∈E for all xxx;
    • it is symmetric: (x,y)∈E⇒(y,x)∈E(x,y) \in E \Rightarrow (y,x) \in E(x,y)∈E⇒(y,x)∈E;
    • it is transitive: (x,y),(y,z)∈E⇒(x,z)∈E(x,y),(y,z) \in E \Rightarrow (x,z) \in E(x,y),(y,z)∈E⇒(x,z)∈E.
  • (H3) For every x∈Xx \in Xx∈X, the set {y∈X:(x,y)∈E}\{y \in X : (x,y) \in E\}{y∈X:(x,y)∈E} is countable, meaning finite or countably infinite.
  • (H4) Let A⊆XA \subseteq XA⊆X be any subset, not necessarily measurable, with μ(A)=0\mu(A) = 0μ(A)=0 (outer measure). Then
μ({ y∈X:there is x∈A with (x,y)∈E })=0.\mu\bigl(\{\, y \in X : \text{there is } x \in A \text{ with } (x,y) \in E \,\}\bigr) = 0 .μ({y∈X:there is x∈A with (x,y)∈E})=0.

By (H2), the set inside is the union of all ∼\sim∼-classes that meet AAA.

None of these hypotheses is impossible to satisfy. For example, the diagonal E={(x,x):x∈X}E = \{(x,x) : x \in X\}E={(x,x):x∈X} satisfies (H1)–(H4) for every σ\sigmaσ-finite μ\muμ.

The mean property (Am)

Several auxiliary notions come first. Throughout, EEE is the relation above.

Admissible functions. A function f:X×X→Rf : X \times X \to \mathbb{R}f:X×X→R is admissible if both of the following hold:

  • fff is measurable, from the product σ\sigmaσ-algebra to the Borel sets of R\mathbb{R}R;
  • some real constant CCC satisfies ∣f(x,y)∣≤C|f(x,y)| \le C∣f(x,y)∣≤C for all (x,y)∈E(x,y) \in E(x,y)∈E.

Boundedness is required only on EEE. Off EEE, fff is only required to be measurable.

EEE-negligible sets of pairs. A set S⊆X×XS \subseteq X \times XS⊆X×X is EEE-negligible if

μ(π1(S∩E))=0,π1(x,y)=x.\mu\bigl(\pi_1(S \cap E)\bigr) = 0, \qquad \pi_1(x,y) = x .μ(π1​(S∩E))=0,π1​(x,y)=x.

In words, the set of xxx for which some yyy has (x,y)∈S∩E(x,y) \in S \cap E(x,y)∈S∩E has outer measure 000.

Partial transformations of EEE. A partial transformation φ\varphiφ of EEE consists of the following data:

  • measurable sets D,C⊆XD, C \subseteq XD,C⊆X;
  • a bijection e:D→Ce : D \to Ce:D→C such that eee and e−1e^{-1}e−1 are both measurable for the subspace σ\sigmaσ-algebras on DDD and CCC;
  • the graph condition: (a,e(a))∈E(a, e(a)) \in E(a,e(a))∈E for every a∈Da \in Da∈D.

DDD and CCC may be empty. For such a φ\varphiφ and functions f:X×X→Rf : X \times X \to \mathbb{R}f:X×X→R and F:X→RF : X \to \mathbb{R}F:X→R, define

fφ(x,y)={f(e−1(x), y)x∈C,0x∉C,Fφ(x)={F(e−1(x))x∈C,0x∉C.f^{\varphi}(x,y) = \begin{cases} f\bigl(e^{-1}(x),\, y\bigr) & x \in C,\\ 0 & x \notin C,\end{cases} \qquad F^{\varphi}(x) = \begin{cases} F\bigl(e^{-1}(x)\bigr) & x \in C,\\ 0 & x \notin C.\end{cases}fφ(x,y)={f(e−1(x),y)0​x∈C,x∈/C,​Fφ(x)={F(e−1(x))0​x∈C,x∈/C.​

Only the first coordinate is moved. In fφf^\varphifφ the second coordinate yyy is left unchanged.

Definition of (Am). EEE has property (Am) with respect to μ\muμ if there is an operator PPP that sends every function f:X×X→Rf : X \times X \to \mathbb{R}f:X×X→R, admissible or not, to a function Pf:X→RP f : X \to \mathbb{R}Pf:X→R, and that satisfies all seven of the following conditions.

  • (M1) Almost-everywhere measurability. For every admissible fff there is a Borel-measurable g:X→Rg : X \to \mathbb{R}g:X→R with Pf=gP f = gPf=g μ\muμ-a.e.
  • (M2) Dependence only on EEE, up to negligible sets. Let fff and ggg be admissible, and suppose the set {p∈X×X:f(p)≠g(p)}\{p \in X \times X : f(p) \neq g(p)\}{p∈X×X:f(p)=g(p)} is EEE-negligible. Then Pf=PgP f = P gPf=Pg μ\muμ-a.e.
  • (M3) Additivity. For all admissible f,gf, gf,g: P(f+g)=Pf+PgP(f + g) = P f + P gP(f+g)=Pf+Pg μ\muμ-a.e. The sums are pointwise.
  • (M4) Homogeneity. For every c∈Rc \in \mathbb{R}c∈R and admissible fff: P(cf)=c⋅PfP(c f) = c \cdot P fP(cf)=c⋅Pf μ\muμ-a.e. Here (cf)(p)=c f(p)(cf)(p) = c\,f(p)(cf)(p)=cf(p).
  • (M5) Positivity. Let fff be admissible with f(p)≥0f(p) \ge 0f(p)≥0 for every p∈Ep \in Ep∈E; no sign condition is imposed off EEE. Then Pf(x)≥0P f(x) \ge 0Pf(x)≥0 for μ\muμ-a.e. xxx.
  • (M6) Normalisation. Let 1\mathbf 11 denote the constant function 111 on X×XX \times XX×X. Then P1=1P \mathbf 1 = 1P1=1 μ\muμ-a.e., where the right side is the constant function 111 on XXX.
  • (M7) Invariance. For every partial transformation φ\varphiφ of EEE and every admissible fff:
P(fφ)  =  (Pf)φμ-a.e.P\bigl(f^{\varphi}\bigr) \;=\; (P f)^{\varphi} \quad \mu\text{-a.e.}P(fφ)=(Pf)φμ-a.e.

No admissibility of fφf^\varphifφ is assumed; PPP is simply applied to it.

Fine print about (Am).

  • In each of (M1)–(M7), the exceptional null set may depend on the functions involved, on the scalar ccc and on φ\varphiφ. No single null set is required to work for all of them simultaneously.
  • PfP fPf itself need not be measurable. Only (M1) is required.
  • Apart from being the input in (M7), non-admissible functions are unconstrained: PPP may send them anywhere.

The single-transformation property (Z)

EEE has property (Z) with respect to μ\muμ if there exist:

  • a measurable set N⊆XN \subseteq XN⊆X with μ(N)=0\mu(N) = 0μ(N)=0;
  • a bijection T:X∖N→X∖NT : X \setminus N \to X \setminus NT:X∖N→X∖N such that TTT and T−1T^{-1}T−1 are both measurable for the subspace σ\sigmaσ-algebra on X∖NX \setminus NX∖N. Because NNN is measurable, this σ\sigmaσ-algebra consists of the measurable subsets of XXX contained in X∖NX \setminus NX∖N.

These must satisfy, for all x,y∈X∖Nx, y \in X \setminus Nx,y∈X∖N,

(x,y)∈E  ⟺  there is n∈Z with Tn(x)=y.(x,y) \in E \iff \text{there is } n \in \mathbb{Z} \text{ with } T^{n}(x) = y .(x,y)∈E⟺there is n∈Z with Tn(x)=y.

Here the powers are taken in the group of bijections of X∖NX \setminus NX∖N under composition:

  • T0T^0T0 is the identity;
  • Tn=T∘⋯∘TT^{n} = T \circ \dots \circ TTn=T∘⋯∘T (nnn factors) for n>0n > 0n>0;
  • T−n=(T−1)nT^{-n} = (T^{-1})^{n}T−n=(T−1)n.

In other words, restricted to pairs of points both lying outside the null set NNN, the relation EEE coincides exactly with the orbit relation of the single map TTT. Both directions are required:

  • every EEE-related pair outside NNN is joined by some power of TTT;
  • every TTT-orbit pair is EEE-related.

Fine print about (Z).

  • Nothing is required of NNN beyond being measurable and null. In particular it is not required to be a union of ∼\sim∼-classes. Points outside NNN may be EEE-related to points inside NNN, and (Z) says nothing about such pairs.
  • Nothing is required of TTT regarding μ\muμ. TTT is not asked to preserve μ\muμ, nor to map null sets to null sets.
  • n=0n = 0n=0 is allowed, which covers the pairs (x,x)(x,x)(x,x).

Degenerate cases included by the quantifiers

  • μ=0\mu = 0μ=0, or more generally μ(X)=0\mu(X) = 0μ(X)=0, is permitted. Such a μ\muμ is σ\sigmaσ-finite. Then every "μ\muμ-a.e." condition in (M1)–(M7) holds trivially, so any PPP witnesses (Am). In (Z), the choice N=XN = XN=X is then available, and it leaves X∖NX \setminus NX∖N empty and TTT the empty map.
  • X=∅X = \varnothingX=∅ is permitted.
  • ∼\sim∼-classes may be finite, including singletons, because (H3) allows finite sets.
Human review
  • Endorsed by Shuze Chen · Oct 3, 2026

    Confirmed by the moderator at approval.

  • Endorsed by dbenbenn · Oct 3, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me