The t = -1 specialization of the reduced Burau representation as a homomorphism
Definitionburau_red_hombraid-groupsburaurepresentationsl2z
The specialization of the reduced Burau representation. Let be the Artin generators of ; the reduced Burau representation at sends them to the two integral matrices
which satisfy the braid relation, so the assignment descends to a homomorphism
. The definition node records this homomorphism (under
the name redHom) together with its two generators redGen, so that later nodes can state — without
depending on still-unproved nodes — how the specialization of the unreduced Burau representation
compares with it: the bridge that reduces the milestone frontier to the kernel statement for
.
Definition code
import Definitions.Def_BurauFaithful_UnreducedBurau
set_option autoImplicit false
open Matrix BraidsLinksMCG
/-- The two Artin generators under the `t = -1` specialization of the reduced Burau representation. -/
noncomputable def 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⟩
/-- The specialization respects Artin's braid relation. -/
lemma redGen_braid : ∀ r ∈ braidRels 3, FreeGroup.lift 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. -/
noncomputable def redHom : BraidsLinksMCG.ArtinBraidGroup 3 →* Matrix.SpecialLinearGroup (Fin 2) ℤ :=
PresentedGroup.toGroup redGen_braid
Source
Reduced Burau representation at t = -1; J. S. Birman, *Braids, Links, and Mapping Class Groups*, Ann. of Math. Studies 82 (1974), §3.3.