§2 (external, Connes–Feldman–Weiss) — an amenable relation is μ-amenable in Lodha and Moore's sense
ProvedLodhaMoore.isMuAmenable_of_isAmenableRelLet be a Polish space with its Borel -algebra, a -finite measure, and a Borel equivalence relation with countable classes such that the -saturation of every -null set is -null. If has a left invariant mean (Monod.IsAmenableRel), then is -amenable in Lodha and Moore's sense: off a null set it is the orbit relation of a Borel automorphism of .
Formalization Note. Lodha and Moore put no condition on . 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 on is said to be quasi-invariant for if, for every -null Borel set , the saturation of … is -null"), and for "any amenable non-singular countable equivalence relation" it produces "a non-singular transformation " generating the relation off a null set (abstract, p. 431). Connes, Feldman and Weiss do not state -finiteness, but their Radon–Nikodym module (p. 434) presupposes it. Both hypotheses are assumed here. The automorphism of 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.
import Mathlib import Definitions.Def_LodhaMoore import Definitions.Def_Monod_PiecewiseProjective
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 LodhaMooreRead-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 , measure and relation that satisfy the standing assumptions and hypotheses (H1)–(H4) below: if has the mean property (Am) defined below, then has the single-transformation property (Z) defined below.
Standing assumptions
is a set (a type in any universe). Everything below is quantified over it, and it carries the following structure.
- A topology making a Polish space. The topology is second countable, and some metric that induces it is complete.
- A -algebra equal to the Borel -algebra. It is the -algebra generated by the open sets. "Measurable" for subsets of means Borel.
- A measure on this -algebra. It is countably additive, with values in .
- -finiteness of . There are subsets of with for every and . 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 is applied to arbitrary sets. For any subset , measurable or not, means the outer measure:
This convention applies to every occurrence of below. "-almost everywhere" (a.e.) means: the set of points where the property fails has -measure in this sense. In particular, a.e. means .
Other -algebras.
- : the product -algebra, generated by the sets and with measurable. Since is second countable, this is also the Borel -algebra of the product topology.
- : the Borel -algebra.
- A subset , viewed as a space in its own right: it carries the subspace -algebra .
The relation and the hypotheses
is a set of pairs. The following hypotheses are assumed.
- (H1) is a measurable subset of , for the product -algebra.
- (H2) The relation is an equivalence relation on :
- it is reflexive: for all ;
- it is symmetric: ;
- it is transitive: .
- (H3) For every , the set is countable, meaning finite or countably infinite.
- (H4) Let be any subset, not necessarily measurable, with (outer measure). Then
By (H2), the set inside is the union of all -classes that meet .
None of these hypotheses is impossible to satisfy. For example, the diagonal satisfies (H1)–(H4) for every -finite .
The mean property (Am)
Several auxiliary notions come first. Throughout, is the relation above.
Admissible functions. A function is admissible if both of the following hold:
- is measurable, from the product -algebra to the Borel sets of ;
- some real constant satisfies for all .
Boundedness is required only on . Off , is only required to be measurable.
-negligible sets of pairs. A set is -negligible if
In words, the set of for which some has has outer measure .
Partial transformations of . A partial transformation of consists of the following data:
- measurable sets ;
- a bijection such that and are both measurable for the subspace -algebras on and ;
- the graph condition: for every .
and may be empty. For such a and functions and , define
Only the first coordinate is moved. In the second coordinate is left unchanged.
Definition of (Am). has property (Am) with respect to if there is an operator that sends every function , admissible or not, to a function , and that satisfies all seven of the following conditions.
- (M1) Almost-everywhere measurability. For every admissible there is a Borel-measurable with -a.e.
- (M2) Dependence only on , up to negligible sets. Let and be admissible, and suppose the set is -negligible. Then -a.e.
- (M3) Additivity. For all admissible : -a.e. The sums are pointwise.
- (M4) Homogeneity. For every and admissible : -a.e. Here .
- (M5) Positivity. Let be admissible with for every ; no sign condition is imposed off . Then for -a.e. .
- (M6) Normalisation. Let denote the constant function on . Then -a.e., where the right side is the constant function on .
- (M7) Invariance. For every partial transformation of and every admissible :
No admissibility of is assumed; 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 and on . No single null set is required to work for all of them simultaneously.
- itself need not be measurable. Only (M1) is required.
- Apart from being the input in (M7), non-admissible functions are unconstrained: may send them anywhere.
The single-transformation property (Z)
has property (Z) with respect to if there exist:
- a measurable set with ;
- a bijection such that and are both measurable for the subspace -algebra on . Because is measurable, this -algebra consists of the measurable subsets of contained in .
These must satisfy, for all ,
Here the powers are taken in the group of bijections of under composition:
- is the identity;
- ( factors) for ;
- .
In other words, restricted to pairs of points both lying outside the null set , the relation coincides exactly with the orbit relation of the single map . Both directions are required:
- every -related pair outside is joined by some power of ;
- every -orbit pair is -related.
Fine print about (Z).
- Nothing is required of beyond being measurable and null. In particular it is not required to be a union of -classes. Points outside may be -related to points inside , and (Z) says nothing about such pairs.
- Nothing is required of regarding . is not asked to preserve , nor to map null sets to null sets.
- is allowed, which covers the pairs .
Degenerate cases included by the quantifiers
- , or more generally , is permitted. Such a is -finite. Then every "-a.e." condition in (M1)–(M7) holds trivially, so any witnesses (Am). In (Z), the choice is then available, and it leaves empty and the empty map.
- is permitted.
- -classes may be finite, including singletons, because (H3) allows finite sets.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.