Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Normal subgroups of the braid group are central or contain the commutator subgroup

Disproved
BurauFaithful.normal_subgroup_dichotomy

by junyihjy · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-topologybraid-groupsgroup-theory

Normal-subgroup dichotomy for braid groups (Long's theorem). Let nnn be a natural number and KKK a normal subgroup of the braid group BnB_nBn​. Then either KKK is contained in the centre Z(Bn)Z(B_n)Z(Bn​), or KKK contains the commutator subgroup [Bn,Bn][B_n, B_n][Bn​,Bn​]. For n≤2n \le 2n≤2 the group BnB_nBn​ is abelian, so the first alternative always holds and the statement is vacuous; the content is for n≥3n \ge 3n≥3. This is the structural input behind Long's criterion: applied to K=ker⁡ρnK = \ker \rho_nK=kerρn​ and to the noncentral normal subgroup NNN, it forces either ker⁡ρn≤Z(Bn)\ker\rho_n \le Z(B_n)kerρn​≤Z(Bn​) or [Bn,Bn]≤ker⁡ρn∩N[B_n,B_n] \le \ker\rho_n \cap N[Bn​,Bn​]≤kerρn​∩N. References: D. D. Long, A note on the normal subgroups of mapping class groups, Math. Proc. Cambridge Philos. Soc. 99 (1986), Theorem 2.2; E. A. Gorin and V. Ya. Lin, Algebraic equations with continuous coefficients and some problems of the algebraic theory of braids, Math. USSR-Sb. 7 (1969) (the n≥5n \ge 5n≥5 case; n=3,4n = 3, 4n=3,4 by the same method).

Preamble
import Definitions.Def_BurauFaithful_UnreducedBurau
set_option autoImplicit false
Formal statement
namespace BurauFaithful

theorem normal_subgroup_dichotomy (n : ℕ) (K : Subgroup (BraidsLinksMCG.ArtinBraidGroup n))
    [K.Normal] :
    K ≤ Subgroup.center (BraidsLinksMCG.ArtinBraidGroup n) ∨
      commutator (BraidsLinksMCG.ArtinBraidGroup n) ≤ K := by sorry

end BurauFaithful
Source
D. D. Long, A note on the normal subgroups of mapping class groups, Math. Proc. Cambridge Philos. Soc. 99 (1986), Theorem 2.2; Gorin-Lin, Math. USSR-Sb. 7 (1969). Structural input for Long's criterion (BurauFaithful.burau_faithful_of_faithful_on_normal, node 906aaa4a-93c6-4fbf-862e-71e93ea21242), quoted in the introduction of arXiv:2607.05283v2.

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me