Hard direction: the kernel of at is generated by the full twist squared
OpenBurauFaithful.burau_three_spec_kernel_hardThis is the hard direction of the description of the kernel of the specialization of the Burau representation at , 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 , let be the unreduced Burau representation and let 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:
Equivalently, the kernel of the specialization is contained in the cyclic subgroup , being the full twist. The reverse inclusion (powers of do die at ) 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 with defining relations and (Moser-Coxeter 1964, p. 85); the extra relation is , 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 .
import Definitions.Def_BurauFaithful_UnreducedBurau set_option autoImplicit false
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