Parity input of the assembly: -1^m=1$ forces $ even in
ProvedBurauFaithful.sl2_neg_one_zpow_evenThe parity input of the assembly. In the element
is the unique nontrivial central element and has order . Consequently, for every integer ,
This is the elementary group-theoretic input of the assembly in the proof of faithfulness of the Burau representation for three strands: the specialization at of the reduced Burau representation sends the full twist to (the separate Proved statement BurauFaithful.spec_reduced_fullTwist_sq), so once a braid in the kernel is known to be a power of the full twist, the present lemma forces to be even, i.e. the braid to be a power of (Birman, Braids, Links, and Mapping Class Groups, Ann. of Math. Studies 82, §3.3, pp. 129–130).
Formalization Note The order of is computed as by orderOf_eq_prime (from and , the latter by comparing the -entry), and the divisibility is read off from orderOf_dvd_iff_zpow_eq_one.
/-
`BurauFaithful.sl2_neg_one_zpow_even`: the parity input of the assembly.
In the final assembly of NOTES_BURAU.md (SESSION 14) one gets `β = Δ^{2m}` from the injectivity of
the descent section, and then uses `φ(Δ²) = -I` (Proved on the platform as
`BurauFaithful.spec_reduced_fullTwist_sq`) to deduce that `m` is even: `1 = φ(β) = (-I)^m`.
This file records the group-theoretic input: in `SL(2,ℤ)` the element `-1` has order `2`, so
`(-1)^m = 1` forces `m` to be even.
-/
import Definitions.Def_BurauFaithful_UnreducedBurau
set_option autoImplicit false
open Matrix
theorem BurauFaithful.sl2_neg_one_zpow_even (m : ℤ) (h : (-1 : Matrix.SpecialLinearGroup (Fin 2) ℤ) ^ m = 1) :
∃ k : ℤ, m = 2 * k := by sorry