The specialization of : kernel generated by the full twist squared
OpenBurauFaithful.burau_three_spec_kernelThis is the first step of Birman's proof that the Burau representation of the three-strand braid group is faithful (J. S. Birman, Braids, Links, and Mapping Class Groups, Annals of Mathematics Studies 82, Princeton University Press, 1974, Chapter 3, §3.3, Theorem 3.15, pp. 129-130).
Let be Artin's braid group on three strands and let
be the unreduced Burau representation. Substituting (the ring homomorphism with ) turns into a representation of by integral matrices. The theorem says that this specialised representation has kernel exactly the infinite cyclic subgroup generated by the square of the full twist:
Equivalently, for every braid the specialised matrix is the identity if and only if for some integer .
The image of the specialised representation is the homogeneous modular group ; the statement is therefore the classical description of the quotient of by the cyclic subgroup generated by . It is the step of Birman's proof in which the Coxeter-Moser presentation of the modular group is used: setting the Burau matrices of become the standard generators of with defining relations and , so that the only relators available in this specialised quotient come from the braid relation together with the power relation. It is the reusable input for any argument that pins down the kernel of through the modular group.
Formalization Note The evaluation is LaurentPolynomial.eval₂ (Int.castRingHom ℤ) (-1 : ℤˣ), extended entrywise to matrices by Matrix.GeneralLinearGroup.map; (6 * k) is a power in the group . The relation of the modular group corresponds to in , which is why the cyclic subgroup is written as . BraidsLinksMCG.sigma ⟨0, _⟩ is and BraidsLinksMCG.sigma ⟨1, _⟩ is .
import Definitions.Def_BurauFaithful_UnreducedBurau set_option autoImplicit false
theorem BurauFaithful.burau_three_spec_kernel (β : 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