At the Burau matrix of has order dividing
ProvedBurauFaithful.burau_three_spec_twist_pow_sixThis is a concrete relation satisfied by the Burau representation of the three-strand braid group after evaluating the indeterminate at ; it is the "easy half" of the first step of Birman's proof of Theorem 3.15 (J. S. Birman, Braids, Links, and Mapping Class Groups, Annals of Mathematics Studies 82, §3.3, pp. 129-130), where the modular group enters.
Let , let be the unreduced Burau representation, and let , be the specialization. The theorem states that the sixth power of the specialized Burau matrix of is the identity:
Equivalently, the image of the square of the full twist, with generating the centre of , lies in the kernel of the specialization — which is why the specialization alone cannot detect faithfulness and a second step is needed.
Formalization Note The specialization is written inline as LaurentPolynomial.eval₂ (Int.castRingHom ℤ) (-1 : ℤˣ) and extended to matrices by Matrix.GeneralLinearGroup.map; the power is a power in the group .
import Definitions.Def_BurauFaithful_UnreducedBurau set_option autoImplicit false
theorem BurauFaithful.burau_three_spec_twist_pow_six :
(Matrix.GeneralLinearGroup.map (LaurentPolynomial.eval₂ (Int.castRingHom ℤ) (-1 : ℤˣ))
(BurauFaithful.burauRep 3 (BraidsLinksMCG.sigma ⟨0, by decide⟩ * BraidsLinksMCG.sigma ⟨1, by decide⟩))) ^ 6 = 1 := by sorry