Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Amenability, invariant means, and the invariant extension property

Definition
Garrido_Amenability

by dbenbenn · Sep 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

amenabilityfunctional-analysisgroup-theory

Eight notions: the first two for a function on the subsets of a set, the other six for a discrete group GGG.

IsFinitelyAdditiveMeasure mmm. A function m:P(X)→[0,∞]m : \mathcal{P}(X) \to [0,\infty]m:P(X)→[0,∞] on every subset of a type XXX with m(∅)=0m(\emptyset) = 0m(∅)=0 and m(s∪t)=m(s)+m(t)m(s \cup t) = m(s) + m(t)m(s∪t)=m(s)+m(t) whenever s∩t=∅s \cap t = \emptysets∩t=∅. This is the “finitely additive measure” the source speaks of throughout; the source never defines the term, and m(∅)=0m(\emptyset) = 0m(∅)=0 is the standard axiom of a measure. Once some set has finite nonzero measure it follows from additivity anyway, so it matters only in degenerate cases.

IsInvariant GGG mmm. The source uses “GGG-invariant” without a defining sentence (p. 4: “a finitely additive GGG-invariant measure on P(X)\mathcal{P}(X)P(X)”), and spells out “left-invariant” only inside Definition 1.12, quoted under IsAmenable. For GGG acting on XXX and m:P(X)→[0,∞]m : \mathcal{P}(X) \to [0,\infty]m:P(X)→[0,∞]: m(gs)=m(s)m(gs) = m(s)m(gs)=m(s) for every g∈Gg \in Gg∈G and every s⊆Xs \subseteq Xs⊆X. This is the source's “GGG-invariant”; for GGG acting on itself by left multiplication it is “left-invariant”.

IsAmenable GGG. p. 4 (Definition 1.12): “Let GGG be a discrete (resp. locally compact) group. A measure on GGG is a finitely additive measure μ\muμ on P(G)\mathcal{P}(G)P(G) (respectively, B(G)\mathcal{B}(G)B(G), the Borel sets of GGG), with μ(G)=1\mu(G) = 1μ(G)=1 and which is left-invariant; that is, μ(gA)=μ(A)\mu(gA) = \mu(A)μ(gA)=μ(A) for every g∈Gg \in Gg∈G and A⊆GA \subseteq GA⊆G. We say that GGG is amenable (or ‘mittelbar’ in the original German) if it has such a measure.” The bundle takes the discrete clause: there is a finitely additive measure mmm on P(G)\mathcal{P}(G)P(G) with m(G)=1m(G) = 1m(G)=1 and left-invariant (m(gs)=m(s)m(gs) = m(s)m(gs)=m(s) for all g∈Gg \in Gg∈G). Only finite additivity is required, and mmm is defined on every subset. The codomain is the extended nonnegative reals rather than the source's [0,1][0,1][0,1]; this is equivalent, since finite additivity with m(G)=1m(G)=1m(G)=1 forces m(s)≤1m(s) \le 1m(s)≤1 for every sss, and it matches the conclusion of Mathlib's IsFoelner.amenable, which writes the additivity out rather than naming it; that theorem supplies m(∅)=0m(\emptyset) = 0m(∅)=0 through m(G)=1m(G) = 1m(G)=1.

lshift. p. 4 (Definition 1.13, item 3): “∫gf dμ=∫f dμ\int {}_gf \,\mathrm{d}\mu = \int f \,\mathrm{d}\mu∫g​fdμ=∫fdμ for every g∈Gg \in Gg∈G and f∈L∞(G)f \in L^\infty(G)f∈L∞(G) where gf(h):=f(g−1h){}_gf(h) := f(g^{-1}h)g​f(h):=f(g−1h).” Left translation on ℓ∞(G)\ell^\infty(G)ℓ∞(G): (gf)(h)=f(g−1h)({}_g f)(h) = f(g^{-1}h)(g​f)(h)=f(g−1h). Well-defined because h↦g−1hh \mapsto g^{-1}hh↦g−1h is a bijection, so the range of ∣f∣|f|∣f∣ is unchanged.

IsInvariantMean GGG mmm. p. 4 (Definition 1.13): “Let GGG be a locally compact group equipped with the Haar measure μ\muμ. Recall that L∞(G)L^\infty(G)L∞(G) is the set of (equivalence classes of) essentially bounded measurable functions f:G→Rf : G \to \mathbb{R}f:G→R where a function is essentially bounded if it is bounded outside a set of zero measure. If GGG is discrete, μ\muμ is just the counting measure and L∞(G)L^\infty(G)L∞(G) becomes ℓ∞(G)\ell^\infty(G)ℓ∞(G). Construct an integral on (G,B(G),μ)(G, \mathcal{B}(G), \mu)(G,B(G),μ), so ∫f dμ\int f \,\mathrm{d}\mu∫fdμ defines a linear functional on L∞(G)L^\infty(G)L∞(G) such that 1. ∫f dμ≥0\int f \,\mathrm{d}\mu \ge 0∫fdμ≥0 if f(g)≥0f(g) \ge 0f(g)≥0 for all g∈Gg \in Gg∈G; 2. ∫1G dμ=1\int \mathbf{1}_G \,\mathrm{d}\mu = 1∫1G​dμ=1 where 1G\mathbf{1}_G1G​ denotes the indicator function on GGG; 3. ∫gf dμ=∫f dμ\int {}_gf \,\mathrm{d}\mu = \int f \,\mathrm{d}\mu∫g​fdμ=∫fdμ for every g∈Gg \in Gg∈G and f∈L∞(G)f \in L^\infty(G)f∈L∞(G) where gf(h):=f(g−1h){}_gf(h) := f(g^{-1}h)g​f(h):=f(g−1h). Such a linear functional is a left-invariant mean on GGG.” For a linear functional mmm on ℓ∞(G)\ell^\infty(G)ℓ∞(G): mmm is positive (if f≥0f \ge 0f≥0 pointwise then m(f)≥0m(f) \ge 0m(f)≥0), normalised (if fff is constantly 111 then m(f)=1m(f) = 1m(f)=1), and left-invariant (m(gf)=m(f)m({}_g f) = m(f)m(g​f)=m(f)). Means are taken on ℓ∞(G)\ell^\infty(G)ℓ∞(G) — the bounded functions — not on all of G→RG \to \mathbb{R}G→R; normalisation is phrased via constantly-111 functions rather than a multiplicative unit.

HasInvariantMean GGG. There is a linear functional mmm on ℓ∞(G)\ell^\infty(G)ℓ∞(G) that is a left-invariant mean in the sense just defined — the source's “there is a left-invariant mean on GGG” (p. 7, Theorem 2.7, item 2).

HasInvariantExtensionProperty GGG. p. 7 (Theorem 2.6, Invariant Extension Theorem): “Recall Carathéodory’s Extension Theorem: If R\mathcal{R}R is a subring of the boolean algebra A\mathcal{A}A and μ\muμ is a measure on R\mathcal{R}R, then μ\muμ can be extended to a measure μˉ\bar\muμˉ​ on A\mathcal{A}A. If GGG is an amenable group of automorphisms of A\mathcal{A}A and R\mathcal{R}R, μ\muμ are GGG-invariant, then μˉ\bar\muμˉ​ can be chosen to be GGG-invariant.” The property itself has no defining sentence: p. 7 (Theorem 2.7, item 4) says only “GGG satisfies the Invariant Extension Theorem.” This definition stands in for that phrase. For every GGG-set XXX in any universe at or above GGG's, every GGG-invariant family RRR of subsets of XXX, every GGG-invariant μ\muμ on RRR, and every finitely additive measure ν\nuν on P(X)\mathcal{P}(X)P(X) extending μ\muμ, there is a finitely additive measure μˉ\bar\muμˉ​ on P(X)\mathcal{P}(X)P(X) that extends μ\muμ and is GGG-invariant.

So the property quantifies over actions of GGG on sets XXX, with the source's boolean algebra A\mathcal{A}A always all subsets of XXX; RRR is an arbitrary family, not assumed to be a ring; and the unrestricted extension ν\nuν is supplied as a hypothesis. The formal Theorem 2.6 and the “(1) implies (4)” direction of Theorem 2.7 therefore cover power-set algebras only. The source recalls Carathéodory's finitely additive extension theorem rather than proving it, and this definition does the same, so the content is that amenability upgrades an arbitrary extension to an invariant one. That recalled step, for a power set (a finitely additive measure on a ring of subsets of XXX extends to a finitely additive measure on all subsets of XXX), is the published theorem FinitelyAdditive.exists_extension_of_isSetRing. The theorems at the generality printed are published on their own, over the boolean-algebra definitions: Theorem 2.6 for every boolean algebra, Garrido.satisfiesInvariantExtensionTheorem_of_isAmenable; Theorem 2.7 with clause 4 at that generality, Garrido.isAmenable_tfae_satisfiesInvariantExtensionTheorem; the recalled extension for a subring of any boolean algebra, Garrido.exists_extension_of_isBooleanSubring; and Theorem 2.6 for power sets with no extension supplied, Garrido.exists_invariant_extension_of_isSetRing.

XXX ranges over the universe max u v, for GGG in universe u and v arbitrary, deliberately. The source's property is about every GGG-set, and every GGG-set can be lifted into such a universe. Theorem 2.7's “(4) implies (1)” direction instantiates the property at a copy of GGG itself, which a universe below GGG's would not contain. A universe independent of GGG's would make that direction false: a sufficiently large simple group containing a free subgroup acts trivially on every set of a smaller universe, and so satisfies the property there, without being amenable.

Two degenerate cases are worth naming. The conclusion imposes no normalisation on μˉ\bar\muμˉ​ and ties it to ν\nuν only through RRR, so instances with R=∅R = \emptysetR=∅, or with μ\muμ identically zero on RRR, are satisfied by the zero function. The property is nonetheless not vacuous, and is exactly what Theorem 2.7 needs: taken at X=GX = GX=G with R={∅,G}R = \{\emptyset, G\}R={∅,G}, μ(∅)=0\mu(\emptyset) = 0μ(∅)=0 and μ(G)=1\mu(G) = 1μ(G)=1 — hypotheses a Dirac measure satisfies — any μˉ\bar\muμˉ​ it returns has μˉ(G)=1\bar\mu(G) = 1μˉ​(G)=1 and so witnesses amenability.

Throughout this bundle “invariant” means left-invariant; no name says so.

IsSupramenable GGG. p. 11 (Definition 3.9): “A group GGG is supramenable if for every ∅≠A⊆G\varnothing \neq A \subseteq G∅=A⊆G there is a finitely additive left-invariant measure μ:P(G)→[0,1]\mu : \mathcal{P}(G) \to [0, 1]μ:P(G)→[0,1] such that μ(A)=1\mu(A) = 1μ(A)=1.” For every nonempty A⊆GA \subseteq GA⊆G there is a finitely additive left-invariant measure mmm on P(G)\mathcal{P}(G)P(G) with m(A)=1m(A) = 1m(A)=1. Note this does not require m(G)=1m(G) = 1m(G)=1. Its values lie in [0,∞][0, \infty][0,∞], not the printed [0,1][0, 1][0,1]: with the printed codomain only the trivial group qualifies (take A={1}A = \{1\}A={1}; invariance gives every singleton measure 111, so two distinct elements would give a set of measure 222; published and proved as GarridoPrinted.supramenable_iff_subsingleton), and the proof of Theorem 3.10 obtains mmm from Tarski's theorem, whose measures take values in [0,∞][0, \infty][0,∞].

Definition code
import Mathlib

namespace Garrido

open scoped ENNReal Pointwise

universe u v

def IsFinitelyAdditiveMeasure {X : Type*} (m : Set X → ℝ≥0∞) : Prop :=
  m ∅ = 0 ∧ ∀ s t : Set X, Disjoint s t → m (s ∪ t) = m s + m t

def IsInvariant (G : Type*) {X : Type*} [SMul G X] (m : Set X → ℝ≥0∞) : Prop :=
  ∀ (g : G) (s : Set X), m (g • s) = m s

def IsAmenable (G : Type*) [Group G] : Prop :=
  ∃ m : Set G → ℝ≥0∞,
    IsFinitelyAdditiveMeasure m ∧
    m Set.univ = 1 ∧
    IsInvariant G m

noncomputable def lshift {G : Type*} [Group G] (g : G) (f : lp (fun _ : G => ℝ) ∞) :
    lp (fun _ : G => ℝ) ∞ :=
  ⟨fun h => (f : G → ℝ) (g⁻¹ * h), by
    have hf : BddAbove (Set.range fun i => ‖(f : G → ℝ) i‖) := memℓp_infty_iff.1 f.2
    refine memℓp_infty_iff.2 ?_
    have hrange : (Set.range fun h => ‖(f : G → ℝ) (g⁻¹ * h)‖)
        = Set.range fun h => ‖(f : G → ℝ) h‖ :=
      (Equiv.mulLeft g⁻¹).surjective.range_comp (fun h => ‖(f : G → ℝ) h‖)
    rw [hrange]
    exact hf⟩

def IsInvariantMean (G : Type*) [Group G] (m : lp (fun _ : G => ℝ) ∞ →ₗ[ℝ] ℝ) : Prop :=
  (∀ f : lp (fun _ : G => ℝ) ∞, (∀ g : G, 0 ≤ (f : G → ℝ) g) → 0 ≤ m f) ∧
  (∀ f : lp (fun _ : G => ℝ) ∞, (∀ g : G, (f : G → ℝ) g = 1) → m f = 1) ∧
  (∀ (g : G) (f : lp (fun _ : G => ℝ) ∞), m (lshift g f) = m f)

def HasInvariantMean (G : Type*) [Group G] : Prop :=
  ∃ m : lp (fun _ : G => ℝ) ∞ →ₗ[ℝ] ℝ, IsInvariantMean G m

def HasInvariantExtensionProperty (G : Type u) [Group G] : Prop :=
  ∀ (X : Type (max u v)) [MulAction G X] (R : Set (Set X)) (μ ν : Set X → ℝ≥0∞),
    (∀ (g : G) (s : Set X), s ∈ R → g • s ∈ R) →
    (∀ (g : G) (s : Set X), s ∈ R → μ (g • s) = μ s) →
    (∀ s ∈ R, ν s = μ s) →
    IsFinitelyAdditiveMeasure ν →
    ∃ μbar : Set X → ℝ≥0∞,
      IsFinitelyAdditiveMeasure μbar ∧
      (∀ s ∈ R, μbar s = μ s) ∧
      IsInvariant G μbar

def IsSupramenable (G : Type*) [Group G] : Prop :=
  ∀ A : Set G, A.Nonempty →
    ∃ m : Set G → ℝ≥0∞,
      IsFinitelyAdditiveMeasure m ∧
      m A = 1 ∧
      IsInvariant G m

end Garrido
Source
A. Garrido, "An introduction to amenable groups", lecture notes, Oxford Advanced Class in Algebra, Michaelmas 2013 (PDF, Feb 2015), p. 4, 7, 11, Definitions 1.12 and 1.13, Theorem 2.6, Definition 3.9; https://web.archive.org/web/20260805000803/https://www.math.uni-duesseldorf.de/~garrido/amenable.pdf. Definition 3.9's supramenability is attributed in the source to Rosenblatt without a reference. It is defined, for an action on an arbitrary set, in J. M. Rosenblatt, "Invariant measures and growth conditions", Trans. Amer. Math. Soc. 193 (1974), 33–53, p. 33; https://doi.org/10.1090/S0002-9947-1974-0342955-9
Read-back

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

Read-back: amenability definitions

This item is a bundle of definitions. They share the vocabulary below; each account says exactly what its definition unfolds to. Throughout, [0,∞][0,\infty][0,∞] denotes the extended non-negative reals (with ∞\infty∞ a genuine value, and a+∞=∞a + \infty = \inftya+∞=∞). "Group" means an abstract group GGG with no topology, measurability or cardinality assumption; GGG may be finite, including trivial.

Translates of sets. When a group GGG acts on a set XXX and S⊆XS \subseteq XS⊆X, the set gSgSgS means the image { g⋅x:x∈S }\{\, g\cdot x : x \in S \,\}{g⋅x:x∈S}. When X=GX = GX=G acting on itself, the action is left multiplication, so gS={ gx:x∈S }gS = \{\, gx : x \in S \,\}gS={gx:x∈S}.


1. Finitely additive measure

For any set XXX and any function mmm assigning to every subset of XXX a value in [0,∞][0,\infty][0,∞], "mmm is a finitely additive measure" means both:

m(∅)=0,andm(S∪T)=m(S)+m(T)  for all S,T⊆X with S∩T=∅.m(\varnothing) = 0, \qquad\text{and}\qquad m(S \cup T) = m(S) + m(T)\ \text{ for all } S, T \subseteq X \text{ with } S \cap T = \varnothing .m(∅)=0,andm(S∪T)=m(S)+m(T)  for all S,T⊆X with S∩T=∅.

No countable additivity, no finiteness, and no normalisation are required; the value ∞\infty∞ is allowed on any set. The domain is the full power set of XXX (no σ\sigmaσ-algebra). XXX may be empty.

2. Invariance

Let GGG be any type equipped with some scalar operation (g,x)↦g⋅x(g, x) \mapsto g\cdot x(g,x)↦g⋅x on a set XXX (only the operation itself is assumed; it need not be a group action), and let mmm assign to every subset of XXX a value in [0,∞][0,\infty][0,∞]. "mmm is GGG-invariant" means

m(gS)=m(S)for every g∈G and every S⊆X,m(gS) = m(S) \quad\text{for every } g \in G \text{ and every } S \subseteq X,m(gS)=m(S)for every g∈G and every S⊆X,

where gS={g⋅x:x∈S}gS = \{g\cdot x : x\in S\}gS={g⋅x:x∈S}. Nothing is assumed about mmm beyond this (in particular not finite additivity).

3. Amenable group

A group GGG is amenable (in the sense of this definition) iff there exists a function mmm from all subsets of GGG to [0,∞][0,\infty][0,∞] such that

  1. mmm is a finitely additive measure (§1): m(∅)=0m(\varnothing)=0m(∅)=0 and m(S∪T)=m(S)+m(T)m(S\cup T)=m(S)+m(T)m(S∪T)=m(S)+m(T) for disjoint S,T⊆GS,T\subseteq GS,T⊆G;
  2. m(G)=1m(G) = 1m(G)=1;
  3. m(gS)=m(S)m(gS) = m(S)m(gS)=m(S) for all g∈Gg\in Gg∈G and all S⊆GS\subseteq GS⊆G, where gS={gx:x∈S}gS=\{gx : x\in S\}gS={gx:x∈S} is the left translate.

(Invariance is required only under left translation; nothing is said about right translates.)

4. The left shift on bounded functions

Let GGG be a group and let ℓ∞(G)\ell^\infty(G)ℓ∞(G) denote the real vector space of all bounded functions f:G→Rf : G \to \mathbb{R}f:G→R (no other condition), with pointwise addition and scalar multiplication. For g∈Gg \in Gg∈G and f∈ℓ∞(G)f \in \ell^\infty(G)f∈ℓ∞(G), the shifted function g⋅fg\cdot fg⋅f is defined by

(g⋅f)(h)=f(g−1h)(h∈G),(g\cdot f)(h) = f(g^{-1}h) \qquad (h \in G),(g⋅f)(h)=f(g−1h)(h∈G),

which is again bounded (with the same set of absolute values), so g⋅f∈ℓ∞(G)g \cdot f \in \ell^\infty(G)g⋅f∈ℓ∞(G). Note the inverse and its position: g−1g^{-1}g−1 multiplies hhh on the left.

5. Invariant mean

Let GGG be a group and let m:ℓ∞(G)→Rm : \ell^\infty(G) \to \mathbb{R}m:ℓ∞(G)→R be an R\mathbb{R}R-linear map (only linearity is assumed; no continuity or boundedness is imposed separately). "mmm is an invariant mean" means all three of:

  1. Positivity: for every f∈ℓ∞(G)f \in \ell^\infty(G)f∈ℓ∞(G) with f(g)≥0f(g) \ge 0f(g)≥0 for all g∈Gg\in Gg∈G, one has m(f)≥0m(f) \ge 0m(f)≥0;
  2. Normalisation: for every f∈ℓ∞(G)f\in\ell^\infty(G)f∈ℓ∞(G) with f(g)=1f(g) = 1f(g)=1 for all ggg (that is, fff is the constant function 111), m(f)=1m(f) = 1m(f)=1;
  3. Left invariance: m(g⋅f)=m(f)m(g\cdot f) = m(f)m(g⋅f)=m(f) for all g∈Gg \in Gg∈G and f∈ℓ∞(G)f\in\ell^\infty(G)f∈ℓ∞(G), where (g⋅f)(h)=f(g−1h)(g\cdot f)(h) = f(g^{-1}h)(g⋅f)(h)=f(g−1h) as in §4.

6. Having an invariant mean

A group GGG has an invariant mean iff there exists an R\mathbb{R}R-linear map m:ℓ∞(G)→Rm:\ell^\infty(G)\to\mathbb{R}m:ℓ∞(G)→R satisfying conditions 1–3 of §5.

7. Invariant extension property

This definition carries two universe levels: GGG lives in some universe level uuu, and the definition additionally depends on a second level vvv; the sets XXX quantified over below are exactly all types in the universe level max⁡(u,v)\max(u, v)max(u,v). (Informally: "all sets XXX of a given size bound", where the bound is at least as large as the one for GGG; different choices of vvv give, formally, different properties.)

A group GGG has the invariant extension property iff the following holds.

For every set XXX (in the universe described above), every action of GGG on XXX (a genuine group action: 1⋅x=x1\cdot x = x1⋅x=x and (gh)⋅x=g⋅(h⋅x)(gh)\cdot x = g\cdot(h\cdot x)(gh)⋅x=g⋅(h⋅x)), every family R\mathcal{R}R of subsets of XXX, and every two functions μ,ν\mu, \nuμ,ν from all subsets of XXX to [0,∞][0,\infty][0,∞]: if

  1. R\mathcal{R}R is closed under translation: S∈RS \in \mathcal{R}S∈R implies gS∈RgS\in\mathcal{R}gS∈R for every g∈Gg \in Gg∈G;
  2. μ\muμ is invariant on R\mathcal{R}R: μ(gS)=μ(S)\mu(gS) = \mu(S)μ(gS)=μ(S) for every g∈Gg\in Gg∈G and every S∈RS\in\mathcal{R}S∈R;
  3. ν\nuν agrees with μ\muμ on R\mathcal{R}R: ν(S)=μ(S)\nu(S) = \mu(S)ν(S)=μ(S) for every S∈RS\in\mathcal{R}S∈R;
  4. ν\nuν is a finitely additive measure on all subsets of XXX (§1);

then there exists a function μˉ\bar\muμˉ​ from all subsets of XXX to [0,∞][0,\infty][0,∞] such that

  • μˉ\bar\muμˉ​ is a finitely additive measure on all subsets of XXX (§1);
  • μˉ(S)=μ(S)\bar\mu(S) = \mu(S)μˉ​(S)=μ(S) for every S∈RS \in \mathcal{R}S∈R;
  • μˉ\bar\muμˉ​ is GGG-invariant on all subsets: μˉ(gS)=μˉ(S)\bar\mu(gS)=\bar\mu(S)μˉ​(gS)=μˉ​(S) for every g∈Gg\in Gg∈G and every S⊆XS\subseteq XS⊆X.

Points of detail:

  • R\mathcal{R}R is an arbitrary family: it is not assumed to be a ring or algebra of sets, to contain ∅\varnothing∅, or to be non-empty. R\mathcal{R}R may be empty, in which case hypotheses 1–3 hold automatically.
  • The values of μ\muμ outside R\mathcal{R}R play no role anywhere; μ\muμ enters only through its values on R\mathcal{R}R.
  • ν\nuν is not assumed invariant, and μˉ\bar\muμˉ​ is not required to have any relation to ν\nuν (not to equal it, nor to be bounded by it, nor to be finite where ν\nuν is).
  • Values ∞\infty∞ are permitted for μ,ν,μˉ\mu,\nu,\bar\muμ,ν,μˉ​ throughout; XXX may be empty.

8. Supramenable group

A group GGG is supramenable iff for every non-empty subset A⊆GA \subseteq GA⊆G there exists a function mmm from all subsets of GGG to [0,∞][0,\infty][0,∞] such that

  1. mmm is a finitely additive measure (§1);
  2. m(A)=1m(A) = 1m(A)=1;
  3. m(gS)=m(S)m(gS) = m(S)m(gS)=m(S) for all g∈Gg\in Gg∈G and all S⊆GS\subseteq GS⊆G, with gS={gx:x∈S}gS=\{gx: x\in S\}gS={gx:x∈S} the left translate.

The measure mmm may depend on AAA. It is normalised only on AAA: m(G)m(G)m(G), and mmm of other sets, may be ∞\infty∞.

Human review
  • Endorsed by Shuze Chen · Sep 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by dbenbenn · Sep 24, 2026

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

  • Endorsed by Lucas · Sep 30, 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