§2 (external, Connes–Feldman–Weiss) — a μ-amenable relation in Lodha and Moore's sense is amenable
ProvedLodhaMoore.isAmenableRel_of_isMuAmenableLet 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 is -amenable in Lodha and Moore's sense (IsMuAmenable), then is amenable in the sense of Connes, Feldman and Weiss: it has a left invariant mean (Monod.IsAmenableRel).
Formalization Note. The -finiteness and quasi-invariance hypotheses are the setting of Connes, Feldman and Weiss; see the note on the converse, isMuAmenable_of_isAmenableRel.
import Mathlib import Definitions.Def_LodhaMoore import Definitions.Def_Monod_PiecewiseProjective
namespace LodhaMoore
theorem isAmenableRel_of_isMuAmenable {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) :
IsMuAmenable μ E → Monod.IsAmenableRel μ E := by
sorry
end LodhaMooreRead-back
What the Lean code literally says, in plain math · claude-opus-5-5
What the statement asserts
The setting
Let be a set (of any size, possibly empty) equipped with
- a topology making a Polish space: the topology is second countable, and it is induced by some metric on that is complete;
- a σ-algebra equal to the Borel σ-algebra of that topology, that is, the σ-algebra generated by the open sets.
Throughout, "measurable" means: Borel for subsets of ; for subsets of , measurable for the product σ-algebra (generated by the rectangles with Borel), which for this coincides with the Borel σ-algebra of ; for real-valued functions, measurable into with its Borel σ-algebra. On a measurable subset , "measurable" refers to the trace σ-algebra , which consists of the Borel subsets of contained in .
Let be a σ-finite measure on : is a union of countably many sets each of finite -measure. Nothing else is assumed about : it may be infinite, it may have atoms, and it may be the zero measure.
Null sets and "almost everywhere". The measure is applied below to arbitrary subsets of , measurable or not. For a subset that is not measurable, means the outer measure
so exactly when is contained in some measurable set of measure . " holds for -almost every " means in this sense, and " -a.e." for functions means .
Let be a set of pairs, and write for . The following four hypotheses are assumed.
- (H1) is a measurable subset of .
- (H2) is an equivalence relation on the whole of : for every ; implies ; and imply .
- (H3) For every , the set is countable (finite or countably infinite).
- (H4) For every subset , measurable or not, with ,
In words: the set of points related to at least one point of a -null set is itself -null.
None of (H1)–(H4) is vacuous: for instance the diagonal satisfies all four for every .
The claim. Under these hypotheses, if condition (A) below holds, then condition (B) below holds. This is a one-way implication; nothing is asserted in the converse direction, and nothing is asserted about whether (A) holds.
Condition (A)
There exist
- a measurable set with , and
- a bijection such that and are both measurable (for the trace σ-algebra on ),
such that for all ,
Here is the identity, for is the -fold composite , and for is the -fold composite of .
Points to note about (A):
- It constrains only on pairs with both coordinates outside . Whether when or is not addressed by (A).
- is not required to be a union of -classes: a point of may be related to points outside .
- is not required to preserve , or to send null sets to null sets.
- may have fixed points and finite orbits; may be the identity, in which case (A) says that, off , only when .
- If is the zero measure (in particular, if is empty), (A) holds by taking , so that is the empty map.
Condition (B)
Some vocabulary first, relative to and .
Admissible functions. Call admissible if
- is measurable, and
- there is a real number with for every .
The bound is required only on ; off , may be unbounded.
-negligible sets. Call a set -negligible if
The projection need not be measurable; of it is the outer measure described above.
Partial transformations of . A partial transformation of consists of
- two measurable sets (its domain and codomain), and
- a bijection such that and are both measurable (for the trace σ-algebras on and ),
such that for every . The empty case is included.
A partial transformation acts on functions by moving the first coordinate only:
and on functions by
Condition (B) asserts: there exists a map that assigns to every function (admissible or not) a function , such that all seven of the following hold.
- Measurability. For every admissible , the function agrees -a.e. with some measurable function .
- Insensitivity to negligible changes. For all admissible : if the set is -negligible, that is, if
then -a.e. 3. Additivity. For all admissible : -a.e. (sums taken pointwise). 4. Homogeneity. For every real number and every admissible : -a.e. (scalar multiples taken pointwise). 5. Positivity. For every admissible with for all : for -almost every . 6. Normalization. -a.e., where on the left is the constant function on and on the right it is the constant function on . 7. Invariance. For every partial transformation of (with domain , codomain , bijection ) and every admissible : -a.e. Spelled out: for -almost every ,
Points to note about (B):
- Each "-a.e." in items 1–7 is asserted separately for each choice of , , and . The exceptional null set may depend on those choices; no single null set is required to serve for all of them at once.
- The conditions constrain only through its values at admissible functions (the constant function of item 6 is one) and, in item 7, at the transformed functions . Item 7 applies to whatever is; it does not itself require to be admissible. On other functions is unconstrained.
- Linearity, positivity and invariance are required only up to -null sets, never pointwise everywhere.
- Positivity in item 5 needs only on , not on all of .
- If is the zero measure, every requirement in items 1–7 is an "almost everywhere" requirement for a measure under which every set is null, and any map meets it.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.