Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

p. 2 (Carrière–Ghys) — the orbit relation of PSL₂(A) on P¹ is non-amenable

Proved
Monod.not_isAmenableRel_mob

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

amenabilitygroup-theorypiecewise-projective

Let AAA be a countable dense subring of R\mathbf{R}R. The equivalence relation on P1\mathbf{P}^1P1 induced by PSL2(A)\mathrm{PSL}_2(A)PSL2​(A), x∼yx \sim yx∼y iff gx=yg x = ygx=y for some g∈SL2(A)g \in \mathrm{SL}_2(A)g∈SL2​(A) acting by Möbius transformations, is not amenable (IsAmenableRel) for the Lebesgue measure class on P1\mathbf{P}^1P1 (volP1).

Source. Monod obtains this from Carrière–Ghys (C. R. Acad. Sci. Paris 1985, Théorème 3: the relation induced on PSL2(R)\mathrm{PSL}_2(\mathbf{R})PSL2​(R) by a countable dense subgroup is non-amenable), passed to P1\mathbf{P}^1P1 through Zimmer's amenable actions (Zimmer 1978, 1984; Adams–Elliott–Giordano 1994). SL2(A)\mathrm{SL}_2(A)SL2​(A) and PSL2(A)\mathrm{PSL}_2(A)PSL2​(A) have the same orbits, since −1-1−1 acts trivially.

Preamble
import Mathlib
import Definitions.Def_Monod_PiecewiseProjective
Formal statement
namespace Monod

theorem not_isAmenableRel_mob (A : Subring ℝ) [Countable A] (hA : Dense (A : Set ℝ)) :
    ¬ IsAmenableRel volP1
      {p : OnePoint ℝ × OnePoint ℝ | ∃ g : Matrix.SpecialLinearGroup (Fin 2) A, mob g p.1 = p.2} := by
  sorry

end Monod
Source
Monod, N., Groups of piecewise projective homeomorphisms, Proc. Natl. Acad. Sci. USA 110 (2013) 4524–4527, https://doi.org/10.1073/pnas.1218426110 (arXiv:1209.5229v2, whose page numbers are used), p. 2, proof of Theorem 1
Read-back

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

Read-back

The statement

Let AAA be a subring of R\mathbb{R}R (a subset containing 000 and 111 and closed under addition, negation and multiplication). Assume

  • (countability) AAA is a countable set, and
  • (density) AAA is dense in R\mathbb{R}R with its usual topology.

These are the only hypotheses; there are no other variables. (They can be met: for instance A=QA=\mathbb{Q}A=Q.)

Conclusion. The orbit relation RAR_ARA​ of SL2(A)\mathrm{SL}_2(A)SL2​(A) acting on the projective line R∪{∞}\mathbb{R}\cup\{\infty\}R∪{∞} by Möbius transformations is not amenable with respect to the measure λ∞\lambda_\inftyλ∞​, in the precise sense of "amenable relation" spelled out below. That is: there is no map PPP satisfying the seven conditions (a)–(g) of the definition below for X=R∪{∞}X=\mathbb{R}\cup\{\infty\}X=R∪{∞}, μ=λ∞\mu=\lambda_\inftyμ=λ∞​, R=RAR=R_AR=RA​.

The rest of this account defines every object in that sentence.

The space, its σ-algebra and its measure

The space. X=R∪{∞}X=\mathbb{R}\cup\{\infty\}X=R∪{∞} is the one-point compactification of R\mathbb{R}R (a single point ∞\infty∞ is adjoined; neighbourhoods of ∞\infty∞ are complements of compact subsets of R\mathbb{R}R, together with ∞\infty∞). As a topological space it is a circle.

The σ-algebra. XXX carries its Borel σ-algebra (generated by the open sets of the one-point compactification topology). A subset E⊆XE\subseteq XE⊆X is Borel exactly when E∩RE\cap\mathbb{R}E∩R is a Borel subset of R\mathbb{R}R; the point ∞\infty∞ may or may not belong to EEE. The product X×XX\times XX×X carries the product σ-algebra (generated by rectangles E1×E2E_1\times E_2E1​×E2​ of Borel sets), and R\mathbb{R}R carries its Borel σ-algebra.

The measure. λ∞\lambda_\inftyλ∞​ is the push-forward of Lebesgue measure λ\lambdaλ on R\mathbb{R}R along the inclusion R↪X\mathbb{R}\hookrightarrow XR↪X. For a Borel set E⊆XE\subseteq XE⊆X,

λ∞(E)=λ(E∩R),\lambda_\infty(E)=\lambda(E\cap\mathbb{R}),λ∞​(E)=λ(E∩R),

so λ∞({∞})=0\lambda_\infty(\{\infty\})=0λ∞​({∞})=0 and λ∞(X)=∞\lambda_\infty(X)=\inftyλ∞​(X)=∞ (the measure is σ-finite, not finite). For an arbitrary, possibly non-Borel, set S⊆XS\subseteq XS⊆X, "λ∞(S)\lambda_\infty(S)λ∞​(S)" means the outer measure

λ∞(S)=inf⁡{λ∞(E):E⊇S, E Borel}.\lambda_\infty(S)=\inf\{\lambda_\infty(E) : E\supseteq S,\ E \text{ Borel}\}.λ∞​(S)=inf{λ∞​(E):E⊇S, E Borel}.

"λ∞\lambda_\inftyλ∞​-almost every xxx" means: for all xxx outside some set of λ∞\lambda_\inftyλ∞​-measure 000.

The group and its action

SL2(A)\mathrm{SL}_2(A)SL2​(A) is the set of 2×22\times 22×2 matrices

g=(abcd),a,b,c,d∈A,ad−bc=1.g=\begin{pmatrix} a & b\\ c & d\end{pmatrix},\qquad a,b,c,d\in A,\qquad ad-bc=1 .g=(ac​bd​),a,b,c,d∈A,ad−bc=1.

Each such ggg is viewed as a real invertible matrix and acts on XXX by the Möbius transformation x↦g⋅xx\mapsto g\cdot xx↦g⋅x, given explicitly by

g⋅x={ax+bcx+dif x∈R and cx+d≠0,∞if x∈R and cx+d=0,g⋅∞={a/cif c≠0,∞if c=0.g\cdot x=\begin{cases}\dfrac{ax+b}{cx+d} & \text{if } x\in\mathbb{R} \text{ and } cx+d\neq 0,\\[2mm] \infty & \text{if } x\in\mathbb{R} \text{ and } cx+d=0,\end{cases} \qquad g\cdot\infty=\begin{cases}a/c & \text{if } c\neq 0,\\ \infty & \text{if } c=0.\end{cases}g⋅x=⎩⎨⎧​cx+dax+b​∞​if x∈R and cx+d=0,if x∈R and cx+d=0,​g⋅∞={a/c∞​if c=0,if c=0.​

(This is the action on lines in R2\mathbb{R}^2R2, with x∈Rx\in\mathbb{R}x∈R identified with the line through the column vector (x,1)T(x,1)^{T}(x,1)T, ∞\infty∞ with the line through (1,0)T(1,0)^{T}(1,0)T, and ggg acting by matrix–column-vector multiplication.) It is a group action: g⋅(h⋅x)=(gh)⋅xg\cdot(h\cdot x)=(gh)\cdot xg⋅(h⋅x)=(gh)⋅x and I⋅x=xI\cdot x=xI⋅x=x.

The relation.

RA={(x,y)∈X×X  :  there is g∈SL2(A) with g⋅x=y}.R_A=\{(x,y)\in X\times X \;:\; \text{there is } g\in \mathrm{SL}_2(A) \text{ with } g\cdot x=y\}.RA​={(x,y)∈X×X:there is g∈SL2​(A) with g⋅x=y}.

This is the orbit equivalence relation of the action. No measurability of RAR_ARA​ is asserted or assumed by the statement.

"Amenable relation": the definition being negated

Let XXX be a set with a σ-algebra, μ\muμ a measure on it, and R⊆X×XR\subseteq X\times XR⊆X×X any subset. (Here X=R∪{∞}X=\mathbb{R}\cup\{\infty\}X=R∪{∞}, μ=λ∞\mu=\lambda_\inftyμ=λ∞​, R=RAR=R_AR=RA​.)

Bounded measurable on RRR. A function f:X×X→Rf:X\times X\to\mathbb{R}f:X×X→R is called admissible if it is measurable on all of X×XX\times XX×X (product σ-algebra to Borel sets of R\mathbb{R}R) and there is a real CCC with ∣f(p)∣≤C|f(p)|\le C∣f(p)∣≤C for every p∈Rp\in Rp∈R. No bound is required off RRR.

RRR-null. A set S⊆X×XS\subseteq X\times XS⊆X×X is RRR-null if

μ(π1(S∩R))=0,\mu\bigl(\pi_1(S\cap R)\bigr)=0,μ(π1​(S∩R))=0,

where π1(x,y)=x\pi_1(x,y)=xπ1​(x,y)=x and μ\muμ of a possibly non-measurable set is its outer measure.

Partial transformations of RRR. A partial transformation φ\varphiφ consists of two measurable sets D,C⊆XD,C\subseteq XD,C⊆X (either may be empty) and a bijection φ:D→C\varphi:D\to Cφ:D→C such that φ\varphiφ and φ−1\varphi^{-1}φ−1 are both measurable (for the σ-algebras on DDD, CCC consisting of traces E∩DE\cap DE∩D, E∩CE\cap CE∩C of measurable EEE), and such that (a,φ(a))∈R(a,\varphi(a))\in R(a,φ(a))∈R for every a∈Da\in Da∈D. For such φ\varphiφ define, for 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,

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

Only the first coordinate of fff is moved.

Left-invariant mean. A map PPP assigning to every function f:X×X→Rf:X\times X\to\mathbb{R}f:X×X→R a function Pf:X→RP f:X\to\mathbb{R}Pf:X→R (no linearity, measurability or other structure is presupposed beyond what follows) is a left-invariant mean for (μ,R)(\mu,R)(μ,R) if all seven conditions hold:

  • (a) measurability. For every admissible fff, PfPfPf is μ\muμ-almost-everywhere measurable (agrees μ\muμ-a.e. with a measurable function X→RX\to\mathbb{R}X→R).
  • (b) insensitivity to RRR-null changes. For admissible f,gf,gf,g such that 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 RRR-null, Pf=PgPf=PgPf=Pg μ\muμ-a.e.
  • (c) additivity. For admissible f,gf,gf,g: P(f+g)=Pf+PgP(f+g)=Pf+PgP(f+g)=Pf+Pg μ\muμ-a.e. (sums pointwise).
  • (d) homogeneity. For every real ccc and admissible fff: P(cf)=c PfP(cf)=c\,PfP(cf)=cPf μ\muμ-a.e.
  • (e) positivity. For admissible fff with f(p)≥0f(p)\ge 0f(p)≥0 for all p∈Rp\in Rp∈R: Pf(x)≥0Pf(x)\ge 0Pf(x)≥0 for μ\muμ-a.e. xxx.
  • (f) normalisation. P1=1P\mathbf 1=\mathbf 1P1=1 μ\muμ-a.e., where the input 1\mathbf 11 is the constant function 111 on all of X×XX\times XX×X and the output 1\mathbf 11 the constant function 111 on XXX.
  • (g) invariance. For every partial transformation φ\varphiφ of RRR and every admissible fff:
P(φ∗f)=φ∗(Pf)μ-a.e.P(\varphi_* f)=\varphi_*(Pf)\quad \mu\text{-a.e.}P(φ∗​f)=φ∗​(Pf)μ-a.e.

(Here φ∗f\varphi_* fφ∗​f itself is not required to be admissible.)

In each of (a)–(g) the exceptional μ\muμ-null set may depend on all the data of that condition (fff, ggg, ccc, φ\varphiφ).

RRR is amenable with respect to μ\muμ if some left-invariant mean PPP for (μ,R)(\mu,R)(μ,R) exists.

The statement, restated

For every countable dense subring A⊆RA\subseteq\mathbb{R}A⊆R: there does not exist any map PPP from real functions on X×XX\times XX×X to real functions on XXX satisfying (a)–(g) for μ=λ∞\mu=\lambda_\inftyμ=λ∞​ (push-forward of Lebesgue measure to R∪{∞}\mathbb{R}\cup\{\infty\}R∪{∞}) and R=RA={(x,g⋅x):x∈X, g∈SL2(A)}R=R_A=\{(x,g\cdot x): x\in X,\ g\in\mathrm{SL}_2(A)\}R=RA​={(x,g⋅x):x∈X, g∈SL2​(A)} (Möbius action as above).

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

    Confirmed by the moderator at approval.

  • Endorsed by dbenbenn · 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