Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Kernel of the reduced Burau representation at t=−1t=-1t=−1: injectivity of B3/⟨Δ4⟩→SL(2,Z)B_3/\langle\Delta^4\rangle\to\mathrm{SL}(2,\mathbb Z)B3​/⟨Δ4⟩→SL(2,Z)

Open
BurauFaithful.spec_reduced_kernel_le

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

braid-groupscoxeter-presentationmodular-group

The kernel of the t=−1t=-1t=−1 specialization of the reduced Burau representation of B3B_3B3​ is generated by the square of the full twist.

Let B3=⟨σ1,σ2∣σ1σ2σ1=σ2σ1σ2⟩B_3=\langle\sigma_1,\sigma_2\mid\sigma_1\sigma_2\sigma_1=\sigma_2\sigma_1\sigma_2\rangleB3​=⟨σ1​,σ2​∣σ1​σ2​σ1​=σ2​σ1​σ2​⟩ and let ρ‾\overline\rhoρ​ be the specialization at t=−1t=-1t=−1 of the 2-dimensional reduced Burau representation, sending σ1↦(1−101)\sigma_1\mapsto\begin{pmatrix}1&-1\\0&1\end{pmatrix}σ1​↦(10​−11​) and σ2↦(2−110)\sigma_2\mapsto\begin{pmatrix}2&-1\\1&0\end{pmatrix}σ2​↦(21​−10​); its image is the homogeneous modular group M2=SL(2,Z)M_2=\mathrm{SL}(2,\mathbb Z)M2​=SL(2,Z). The theorem states that every braid killed by ρ‾\overline\rhoρ​ is a power of Δ4=(σ1σ2)6\Delta^4=(\sigma_1\sigma_2)^6Δ4=(σ1​σ2​)6, where Δ2=(σ1σ2)3\Delta^2=(\sigma_1\sigma_2)^3Δ2=(σ1​σ2​)3 is the full twist generating the centre of B3B_3B3​:

ρ‾(β)=I  ⟹  ∃k∈Z,β=(σ1σ2)6k.\overline\rho(\beta)=I\;\Longrightarrow\;\exists k\in\mathbb Z,\quad \beta=(\sigma_1\sigma_2)^{6k}.ρ​(β)=I⟹∃k∈Z,β=(σ1​σ2​)6k.

Equivalently, ker⁡ρ‾≤⟨Δ4⟩\ker\overline\rho\le\langle\Delta^4\ranglekerρ​≤⟨Δ4⟩, i.e. B3/⟨Δ4⟩→SL(2,Z)B_3/\langle\Delta^4\rangle\to \mathrm{SL}(2,\mathbb Z)B3​/⟨Δ4⟩→SL(2,Z) is injective — the Coxeter-Moser presentation theorem for the modular group (Moser-Coxeter 1964, p. 85), used by Birman in the proof of Theorem 3.15. Together with the identity ρ‾(Δ2)=−I\overline\rho(\Delta^2)=-Iρ​(Δ2)=−I this pins the kernel down to ⟨Δ4⟩\langle\Delta^4\rangle⟨Δ4⟩, and hence (via the reduction of the unreduced 3-dimensional representation at t=−1t=-1t=−1) to the kernel of the specialization of ρ3\rho_3ρ3​.

Formalization Note The homomorphism ρ‾\overline\rhoρ​ is introduced in the preamble as BurauFaithful.redHom3, built from the two generators by PresentedGroup.toGroup; its well-definedness is the braid relation ABA=BABABA=BABABA=BAB for the two matrices, checked by decide.

Preamble
import Definitions.Def_BurauFaithful_UnreducedBurau

set_option autoImplicit false

open Matrix BraidsLinksMCG

/-- The images of the two Artin generators under the `t = -1` specialization of the reduced
Burau representation (the two integral matrices of `BurauFaithful.burau_three_spec_reduction`). -/
noncomputable def BurauFaithful.redGen : Fin 2 → Matrix.SpecialLinearGroup (Fin 2) ℤ :=
  fun i => if (i : ℕ) = 0 then ⟨!![1, -1; 0, 1], by decide⟩ else ⟨!![2, -1; 1, 0], by decide⟩

lemma BurauFaithful.redGen_braid :
    ∀ r ∈ braidRels 3, FreeGroup.lift BurauFaithful.redGen r = 1 := by
  intro r hr
  simp only [braidRels, Set.mem_union] at hr
  rcases hr with ⟨i, j, h, rfl⟩ | ⟨i, j, h, rfl⟩
  · exfalso
    fin_cases i <;> fin_cases j <;> norm_num at h
  · simp only [map_mul, map_inv, FreeGroup.lift_apply_of]
    rw [mul_inv_eq_one]
    fin_cases i <;> fin_cases j <;>
      first
        | (exfalso; omega)
        | (ext a b; fin_cases a <;> fin_cases b <;> decide)

/-- The `t = -1` specialization of the reduced Burau representation of `B₃`, as a homomorphism
sending the generators to `!![1, -1; 0, 1]` and `!![2, -1; 1, 0]`. -/
noncomputable def BurauFaithful.redHom3 :
    BraidsLinksMCG.ArtinBraidGroup 3 →* Matrix.SpecialLinearGroup (Fin 2) ℤ :=
  PresentedGroup.toGroup BurauFaithful.redGen_braid
Formal statement
theorem BurauFaithful.spec_reduced_kernel_le (β : BraidsLinksMCG.ArtinBraidGroup 3) :
    BurauFaithful.redHom3 β = 1 →
      ∃ k : ℤ, β = (BraidsLinksMCG.sigma ⟨0, by decide⟩ *
        BraidsLinksMCG.sigma ⟨1, by decide⟩) ^ (6 * k) := by
  sorry
Source
C. Moser, H. S. M. Coxeter, *Generators and relations for discrete groups*, 2nd ed., Springer 1964, p. 85 (the presentation ⟨s1,s2∣s1s2s1=s2s1s2,(s1s2s1)4=1⟩\langle s_1,s_2\mid s_1s_2s_1=s_2s_1s_2,(s_1s_2s_1)^4=1\rangle⟨s1​,s2​∣s1​s2​s1​=s2​s1​s2​,(s1​s2​s1​)4=1⟩ of M2=SL(2,Z)M_2=\mathrm{SL}(2,\mathbb Z)M2​=SL(2,Z)); 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me