Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Hard direction: the kernel of ρ3\rho_3ρ3​ at t=−1t=-1t=−1 is generated by the full twist squared Δ4\Delta^4Δ4

Open
BurauFaithful.burau_three_spec_kernel_hard

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

braid-groupsmodular-grouprepresentation-theory

This is the hard direction of the description of the kernel of the specialization of the Burau representation at t=−1t=-1t=−1, i.e. the step of Birman's proof of Theorem 3.15 that uses the presentation of the modular group (J. S. Birman, Braids, Links, and Mapping Class Groups, Annals of Mathematics Studies 82, §3.3, pp. 129-130).

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​⟩, let ρ3\rho_3ρ3​ be the unreduced Burau representation and let t↦−1t\mapsto-1t↦−1 be the specialization. The theorem states that every braid whose specialized Burau matrix is the identity is a power of the square of the full twist:

ρ3(β)∣t=−1=I3  ⟹  ∃k∈Z,β=(σ1σ2)6k.\rho_3(\beta)\big|_{t=-1} = I_3 \;\Longrightarrow\; \exists k\in\mathbb Z,\quad \beta = (\sigma_1\sigma_2)^{6k}.ρ3​(β)​t=−1​=I3​⟹∃k∈Z,β=(σ1​σ2​)6k.

Equivalently, the kernel of the specialization is contained in the cyclic subgroup ⟨Δ4⟩\langle\Delta^4\rangle⟨Δ4⟩, Δ2=(σ1σ2)3\Delta^2=(\sigma_1\sigma_2)^3Δ2=(σ1​σ2​)3 being the full twist. The reverse inclusion (powers of Δ4\Delta^4Δ4 do die at t=−1t=-1t=−1) is the separate statement BurauFaithful.burau_three_spec_twist_zpow.

The proof is the classical input that the specialized matrices present the homogeneous modular group M2=SL(2,Z)M_2=\mathrm{SL}(2,\mathbb Z)M2​=SL(2,Z) with defining relations s1s2s1=s2s1s2s_1s_2s_1=s_2s_1s_2s1​s2​s1​=s2​s1​s2​ and (s1s2s1)4=1(s_1s_2s_1)^4=1(s1​s2​s1​)4=1 (Moser-Coxeter 1964, p. 85); the extra relation is Δ4=(σ1σ2)6=(σ1σ2σ1)4\Delta^4=(\sigma_1\sigma_2)^6=(\sigma_1\sigma_2\sigma_1)^4Δ4=(σ1​σ2​)6=(σ1​σ2​σ1​)4, so the kernel is generated by it.

Formalization Note The specialization is written inline as LaurentPolynomial.eval₂ (Int.castRingHom ℤ) (-1 : ℤˣ) and extended to matrices by Matrix.GeneralLinearGroup.map; the exponent is an integer power in the group B3B_3B3​.

Preamble
import Definitions.Def_BurauFaithful_UnreducedBurau

set_option autoImplicit false
Formal statement
theorem BurauFaithful.burau_three_spec_kernel_hard (β : BraidsLinksMCG.ArtinBraidGroup 3) :
    Matrix.GeneralLinearGroup.map (LaurentPolynomial.eval₂ (Int.castRingHom ℤ) (-1 : ℤˣ))
      (BurauFaithful.burauRep 3 β) = 1 →
      ∃ k : ℤ, β = (BraidsLinksMCG.sigma ⟨0, by decide⟩ *
        BraidsLinksMCG.sigma ⟨1, by decide⟩) ^ (6 * k) := by sorry
Source
J. S. Birman, *Braids, Links, and Mapping Class Groups*, Ann. of Math. Studies 82, Princeton Univ. Press, 1974, Chapter 3, §3.3, Theorem 3.15, pp. 129-130 (the modular group and its presentation, citing Moser-Coxeter 1964, p. 85); cf. V. Bharathram, J. S. Birman, T. E. Brendle, arXiv:2607.05283v2, Theorem 4.1 (Section 4).

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