This mission formalizes §5 of J. W. Cannon, W. J. Floyd and W. R. Parry, Introductory notes on Richard Thompson's groups, L'Enseignement Mathématique (2) 42 (1996) 215–256, doi:10.5169/seals-87877: the definition of Thompson's group and Thompson's proof that is simple.
Thompson's groups and , introduced in unpublished notes of Richard Thompson in 1965, were the first known examples of infinite, finitely presented, simple groups. Every finitely presented simple group known before them was finite. The notes of Cannon, Floyd and Parry were written in part "to make available Thompson's unpublished proofs … of the simplicity of and " (p. 216), and §5 is that proof for .
is the circle's counterpart of Thompson's group . Earlier missions on this platform formalize and its commutator subgroup (§1 and §4 of the same notes), its tree-diagram normal form (§2), and its two presentations (§3). is not simple: its abelianization is . is simple, it has elements of finite order (the generator below has order ), and it contains as the stabilizer of a point.
The circle is with its endpoints identified, in Lean UnitAddCircle (); denotes the image of . Maps compose right to left, , and , the convention of the notes.
The group (pp. 233–234) consists of the piecewise linear homeomorphisms of that map images of dyadic rationals to images of dyadic rationals, are differentiable except at finitely many images of dyadic rationals, and have slopes that are powers of . In Lean a permutation of the circle satisfies IsThompsonCircle f when it has a lift to the line: an order isomorphism of with and , mapping dyadic rationals to dyadic rationals, and affine with slope a power of between consecutive integer translates of finitely many dyadic breakpoints. T is the subgroup generated by these maps. That they already form a group is the first milestone.
The elements , , (Example 5.1). and are the generators of from the §1 mission (mapA, mapB), carried to the circle by toCircle, which sends an order isomorphism of to . (mapC) is given on by , and on , and . symT sends the formal symbols , , to these three maps.
The presented group (p. 236) is the free group on formal symbols , , modulo six relators:
In , and (XT1); and (CT1) for . An element is positive (IsPositiveT1) when it is a product of nonnegative powers of the .
The goal is the sentence in which the notes state what §5 does, "In §5 we define and give Thompson's proof that is simple" (p. 216):
The route is the section's own. Lemma 5.2 shows that , , generate and satisfy the six relations, so maps onto (Lemma 5.3). Lemmas 5.4–5.6 and a normal form (Theorem 5.7, every is with , positive and ) lead to Theorem 5.8, is simple, and hence to Corollary 5.9, . The goal follows.
The result. The simplicity of is one of the two facts that made Thompson's groups famous: is an infinite, finitely presented, simple group. Corollary 5.9 gives more, an explicit presentation of on three generators and six relators.
Formalizing it. No machine-checked proof that is simple exists on this platform, and Mathlib has nothing on Thompson's groups. The proof in the notes is short and complete. This mission connects the analytic definition of with the combinatorial group , reusing the platform's formalization of : the presentation of (Theorem 3.4), its normal form (Corollary 2.7), and the fact that its proper quotients are Abelian (Theorem 4.3).
The algebra of (Lemmas 5.5 and 5.6) is a chain of explicit inductions. The substance lies at two points.
The first is Theorem 5.7. The notes' proof that the set of elements is closed under multiplication moves past and using the normal form of , transported into through Lemma 5.4, and then re-indexes, all inside the abstract group with no geometry to lean on.
The second is the analytic side of Lemma 5.2. Generation reduces an arbitrary to an element of by composing with and with an element of that moves to . That needs the fact that an element of fixing comes from , which the notes state in one line. The relations are identities between explicit piecewise linear maps of the circle.
Subgroup (Equiv.Perm UnitAddCircle) generated by IsThompsonCircle. The lift makes every element an orientation-preserving homeomorphism, so continuity is not stated separately. Unlike for , the condition that dyadics map to dyadics cannot be dropped: an irrational rotation satisfies every other clause.PresentedGroup on the three-element type FormalABC. Relators are written out as , not with commutator notation.namespace CannonFloydParry theorem isSimpleGroup_T : IsSimpleGroup T := by sorry end CannonFloydParry
Thompson's group , the group of piecewise linear homeomorphisms of the circle with dyadic breakpoints, dyadic values at dyadic points and slopes powers of , is simple: it is nontrivial and its only normal subgroups are and .
No open leaves. Every sub-goal is proved or awaiting decomposition.