Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Coxeter-Moser relations for the specialized reduced Burau generators A,B∈SL(2,Z)A,B\in\mathrm{SL}(2,\mathbb Z)A,B∈SL(2,Z)

Proved
BurauFaithful.spec_reduced_coxeter

by lt9 · Sep 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

braid-groupsmodular-grouprepresentation-theory

The specialization at t=−1t=-1t=−1 of the 2-dimensional reduced Burau representation sends the two generators σ1,σ2\sigma_1,\sigma_2σ1​,σ2​ of B3B_3B3​ to the integral matrices

A=(1−101),B=(2−110),A=\begin{pmatrix}1&-1\\0&1\end{pmatrix},\qquad B=\begin{pmatrix}2&-1\\1&0\end{pmatrix},A=(10​−11​),B=(21​−10​),

of determinant 111, i.e. to elements of the homogeneous modular group M2=SL(2,Z)M_2=\mathrm{SL}(2,\mathbb Z)M2​=SL(2,Z). This theorem records that these two matrices satisfy the defining relations of the Coxeter-Moser presentation of M2M_2M2​ (Moser-Coxeter 1964, p. 85; Birman, Braids, Links, and Mapping Class Groups, Ann. of Math. Studies 82, §3.3, pp. 129-130):

ABA=BAB,(ABA)4=1,det⁡A=det⁡B=1,ABA=BAB,\qquad (ABA)^4=1,\qquad \det A=\det B=1,ABA=BAB,(ABA)4=1,detA=detB=1,

so that the assignment s1↦As_1\mapsto As1​↦A, s2↦Bs_2\mapsto Bs2​↦B is a well-defined homomorphism ⟨s1,s2∣s1s2s1=s2s1s2, (s1s2s1)4=1⟩→M2\langle s_1,s_2\mid s_1s_2s_1=s_2s_1s_2,\ (s_1s_2s_1)^4=1\rangle\to M_2⟨s1​,s2​∣s1​s2​s1​=s2​s1​s2​, (s1​s2​s1​)4=1⟩→M2​. It also records (AB)6=1(AB)^6=1(AB)6=1, the image of Δ4=(σ1σ2)6\Delta^4=(\sigma_1\sigma_2)^6Δ4=(σ1​σ2​)6, the generator of the kernel of the specialization.

All five statements are finite computations over the integers.

Formalization Note The matrices are written as matrix literals !![...; ...] over ℤ, and the conjunction is decided by computation.

Preamble
import Definitions.Def_BurauFaithful_UnreducedBurau

set_option autoImplicit false
Formal statement
theorem BurauFaithful.spec_reduced_coxeter :
    ((!![1, -1; 0, 1] : Matrix (Fin 2) (Fin 2) ℤ) * !![2, -1; 1, 0] * !![1, -1; 0, 1] =
        !![2, -1; 1, 0] * !![1, -1; 0, 1] * !![2, -1; 1, 0]) ∧
      ((!![1, -1; 0, 1] : Matrix (Fin 2) (Fin 2) ℤ) * !![2, -1; 1, 0] * !![1, -1; 0, 1]) ^ 4 = 1 ∧
      ((!![1, -1; 0, 1] : Matrix (Fin 2) (Fin 2) ℤ)).det = 1 ∧
      (!![2, -1; 1, 0] : Matrix (Fin 2) (Fin 2) ℤ).det = 1 ∧
      ((!![1, -1; 0, 1] : Matrix (Fin 2) (Fin 2) ℤ) * !![2, -1; 1, 0]) ^ 6 = 1 := by sorry
Source
C. Moser, H. S. M. Coxeter, *Generators and relations for discrete groups*, 2nd ed., Springer 1964, p. 85 (presentation of the homogeneous modular group); J. S. Birman, *Braids, Links, and Mapping Class Groups*, Ann. of Math. Studies 82, Princeton Univ. Press, 1974, §3.3, Theorem 3.15, pp. 129-130.

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