Kernel of the reduced Burau representation at : injectivity of
OpenBurauFaithful.spec_reduced_kernel_leThe kernel of the specialization of the reduced Burau representation of is generated by the square of the full twist.
Let and let be the specialization at of the 2-dimensional reduced Burau representation, sending and ; its image is the homogeneous modular group . The theorem states that every braid killed by is a power of , where is the full twist generating the centre of :
Equivalently, , i.e. 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 this pins the kernel down to , and hence (via the reduction of the unreduced 3-dimensional representation at ) to the kernel of the specialization of .
Formalization Note The homomorphism is introduced in the preamble as BurauFaithful.redHom3, built from the two generators by PresentedGroup.toGroup; its well-definedness is the braid relation for the two matrices, checked by decide.
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
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