Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Every proper quotient of FFF is Abelian

Proved
CannonFloydParry.mul_comm_quotient_of_ne_bot

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

dynamical-systemsgroup-theorypiecewise-linearthompsons-group

Let NNN be a normal subgroup of Thompson's group FFF other than the trivial subgroup. Then the quotient group F/NF/NF/N is Abelian.

Equivalently, every nontrivial normal subgroup of FFF contains the commutator subgroup. The case N=FN = FN=F is included and gives the one-element quotient. The source's proof uses the unique normal form of Corollary-Definition 2.7, which this mission does not formalize.

Formal statement
import Definitions.Def_CannonFloydParry
import Mathlib

namespace CannonFloydParry

theorem mul_comm_quotient_of_ne_bot (N : Subgroup F) [N.Normal] (hN : N ≠ ⊥)
    (x y : F ⧸ N) : x * y = y * x := by
  sorry

end CannonFloydParry
Source
Cannon, J. W., Floyd, W. J., Parry, W. R., Introductory notes on Richard Thompson's groups, L'Enseignement Mathematique (2) 42 (1996) 215-256, https://doi.org/10.5169/seals-87877, Theorem 4.3, p. 229
Read-back

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

Read-back: mul_comm_quotient_of_ne_bot

Summary of the assertion

The declaration asserts: for every normal subgroup NNN of the group FFF defined below, if NNN is not the trivial subgroup, then any two elements of the quotient group F/NF/NF/N commute.

Everything in that sentence — what FFF is, what its group law is, what "normal", "trivial" and "quotient" mean here — is spelled out below, because FFF is built from definitions supplied with the statement rather than taken from a standard library.

The ambient group

Let

I=[0,1]={t∈R:0≤t≤1},I = [0,1] = \{t \in \mathbb{R} : 0 \le t \le 1\},I=[0,1]={t∈R:0≤t≤1},

regarded as an ordered set with the order it inherits from R\mathbb{R}R (one element of III is ≤\le≤ another exactly when the corresponding real numbers are).

Let Aut⁡(I)\operatorname{Aut}(I)Aut(I) denote the set of order isomorphisms of III onto itself: each such object is a bijection f:I→If : I \to If:I→I together with the property that for all a,b∈Ia,b \in Ia,b∈I,

a≤b  ⟺  f(a)≤f(b).a \le b \iff f(a) \le f(b).a≤b⟺f(a)≤f(b).

(Formally it is an equivalence of III with itself carrying that order-reflecting property; no continuity, differentiability or topological condition is imposed, and none is available for free from this data.)

Aut⁡(I)\operatorname{Aut}(I)Aut(I) is a group under composition of maps, with

(g⋅h)(t)=g(h(t))(g \cdot h)(t) = g\bigl(h(t)\bigr)(g⋅h)(t)=g(h(t))

for all t∈It \in It∈I, identity element the identity map of III, and inverse the inverse order isomorphism. So the product is read right-to-left in the usual functional way: in g⋅hg \cdot hg⋅h, the map hhh acts first.

Dyadic rationals

A real number xxx is called dyadic here if there exist an integer m∈Zm \in \mathbb{Z}m∈Z and a natural number k∈Nk \in \mathbb{N}k∈N (with 000 allowed) such that

x=m2k.x = \frac{m}{2^{k}}.x=2km​.

Note that this admits negative and arbitrarily large dyadics, and every integer (k=0k = 0k=0); it is not restricted to [0,1][0,1][0,1].

The generating condition

Call f∈Aut⁡(I)f \in \operatorname{Aut}(I)f∈Aut(I) Thompson-like if there exists a finite set B⊆RB \subseteq \mathbb{R}B⊆R of real numbers such that

  1. every b∈Bb \in Bb∈B is dyadic in the sense above, and
  2. for all x,y∈Ix, y \in Ix,y∈I with x<yx < yx<y (as real numbers) such that the open real interval (x,y)(x,y)(x,y) contains no element of BBB, there exist an integer n∈Zn \in \mathbb{Z}n∈Z and a real number c∈Rc \in \mathbb{R}c∈R such that
f(z)=2nz+cfor every z∈I with x≤z≤y.f(z) = 2^{n} z + c \qquad \text{for every } z \in I \text{ with } x \le z \le y .f(z)=2nz+cfor every z∈I with x≤z≤y.

Several features of this condition are worth making explicit, since they are what the statement actually carries:

  • The finite set BBB is chosen once, before the pair x,yx,yx,y: a single finite breakpoint set must work for all admissible pairs. The exponent nnn and the intercept ccc, by contrast, are chosen after x,yx,yx,y and may vary with the pair.
  • BBB is an arbitrary finite set of dyadic reals. It is not required to be contained in [0,1][0,1][0,1], not required to consist of actual points of non-differentiability, and it may be empty — in which case condition 2 applies to every pair x<yx < yx<y in III and forces a single affine formula on all of III.
  • The slope is 2n2^{n}2n with nnn ranging over all integers, so slopes are the positive integer powers of 222 and their reciprocals; 2n2^{n}2n is in particular always strictly positive, and never 000.
  • The intercept ccc is an unconstrained real number: it is not required to be dyadic.
  • The affine identity is required on the closed interval x≤z≤yx \le z \le yx≤z≤y, so it pins the formula down at the two endpoints as well as strictly between them.
  • Condition 2 is a condition on fff only; nothing is said about f−1f^{-1}f−1, and nothing beyond order-isomorphy is asserted about fff at the endpoints 000 and 111.

The group FFF

Let S={f∈Aut⁡(I):f is Thompson-like}S = \{ f \in \operatorname{Aut}(I) : f \text{ is Thompson-like} \}S={f∈Aut(I):f is Thompson-like}, and define

F=⟨S⟩,F = \langle S \rangle,F=⟨S⟩,

the subgroup of Aut⁡(I)\operatorname{Aut}(I)Aut(I) generated by SSS: the intersection of all subgroups of Aut⁡(I)\operatorname{Aut}(I)Aut(I) containing SSS, equivalently the set of all finite products of elements of SSS and their inverses.

This is a generated subgroup, not the set SSS itself. The statement does not assert, use, or presuppose that SSS is already closed under composition and inversion; FFF may a priori be strictly larger than SSS.

In the statement, FFF is used as a group in its own right: its elements are the order isomorphisms of III belonging to FFF, its multiplication is composition as above, and its identity is the identity map of III.

The hypotheses

Let NNN be a subgroup of FFF — a subgroup of FFF itself, not of the larger group Aut⁡(I)\operatorname{Aut}(I)Aut(I): a subset of FFF containing the identity map and closed under composition and inversion.

Two hypotheses are imposed on NNN:

  1. NNN is normal in FFF: for every n∈Nn \in Nn∈N and every g∈Fg \in Fg∈F, one has gng−1∈Ng n g^{-1} \in Ngng−1∈N. Normality is relative to FFF alone; nothing is required about conjugation by elements of Aut⁡(I)\operatorname{Aut}(I)Aut(I) outside FFF.
  2. NNN is not the trivial subgroup: N≠{idI}N \ne \{\mathrm{id}_I\}N={idI​}. Equivalently, NNN contains at least one element other than the identity map of III.

Both are genuine hypotheses of the assertion; the first is supplied as a structural (typeclass) assumption and the second as an explicit one, but logically they play the same role.

Note what is not assumed: NNN is not required to be a proper subgroup. The case N=FN = FN=F is included, and in that case F/NF/NF/N is the one-element group.

The conclusion

Under those hypotheses, form the quotient group F/NF/NF/N. Its elements are the left cosets

xN={xn:n∈N},x∈F,xN = \{xn : n \in N\}, \qquad x \in F,xN={xn:n∈N},x∈F,

two elements x,y∈Fx, y \in Fx,y∈F determining the same coset exactly when x−1y∈Nx^{-1}y \in Nx−1y∈N; its group law is the well-defined one induced by that of FFF,

(xN) (yN)=(xy)N,(xN)\,(yN) = (xy)N,(xN)(yN)=(xy)N,

which is where normality of NNN is needed.

The conclusion asserted is:

∀ ξ,η∈F/N:ξη=ηξ.\forall\, \xi, \eta \in F/N : \quad \xi \eta = \eta \xi .∀ξ,η∈F/N:ξη=ηξ.

That is, the quotient group F/NF/NF/N is abelian. The two quotient elements ξ,η\xi,\etaξ,η are universally quantified, so the assertion is exactly the commutativity of F/NF/NF/N, stated element-wise rather than as a structure on the quotient.

Scope and degenerate cases

  • The statement is a single implication, quantified over all normal N≠{idI}N \ne \{\mathrm{id}_I\}N={idI​} and all pairs of elements of F/NF/NF/N. It is not an equivalence: nothing is asserted in the direction "if F/NF/NF/N is abelian then N≠{idI}N \ne \{\mathrm{id}_I\}N={idI​}".
  • Nothing is asserted about F/{idI}≅FF/\{\mathrm{id}_I\} \cong FF/{idI​}≅F itself; the excluded case N={idI}N = \{\mathrm{id}_I\}N={idI​} is precisely the one for which no claim is made.
  • Nothing is asserted about how large F/NF/NF/N is, about the structure of NNN, or about whether any NNN satisfying the hypotheses exists.
  • Possible vacuity. The hypotheses can be satisfied only if FFF contains some element other than the identity map (otherwise every subgroup of FFF is the trivial one and the hypothesis N≠{idI}N \ne \{\mathrm{id}_I\}N={idI​} is unsatisfiable). The definitions supplied alongside the statement construct two candidate maps of III but do not themselves record that either one lies in FFF, nor that FFF is nontrivial. So non-vacuity is not something the accompanying material establishes; it is an external fact about the definition of FFF.
  • The definition of FFF quantifies over all Thompson-like maps as generators, so the group is fixed by the definitions above and carries no further parameters: the statement has no free variables beyond NNN, the normality assumption, and the two quotient elements.
Human review
  • Endorsed by Shuze Chen · Sep 15, 2026

  • Endorsed by dbenbenn · Sep 15, 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, licensed under Apache 2.0.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTermsJoin SlackJoin Zulip© 2026 Prove2Me