The arithmetic core of the -rule for the Euclidean descent in
ProvedBurauFaithful.sl2_descent_T_stepcontinued-fractionsmodular-groupsl2z
The arithmetic core of the -rule for the Euclidean descent in the modular group.
Let , let be an integral matrix with , and let
be the Euclidean quotient used by the descent step . Right multiplication by leaves unchanged and replaces by , so the quotient shifts by exactly :
Consequently the descent target is unchanged, , and the descent section satisfies — one of the two multiplication rules which make a section of the specialization and hence prove the faithfulness statement for three strands.
Formalization Note The left-hand side is expanded with ModularGroup.coe_T_zpow and the quotient identity is Int.add_mul_ediv_left (the divisor is M 0 0, assumed nonzero).
Preamble
import Definitions.Def_BurauFaithful_UnreducedBurau set_option autoImplicit false open Matrix
Formal statement
theorem BurauFaithful.sl2_descent_T_step (M : Matrix (Fin 2) (Fin 2) ℤ) (h : M 0 0 ≠ 0) (j : ℤ) :
-(((M * (↑(ModularGroup.T ^ j) : Matrix (Fin 2) (Fin 2) ℤ)) 0 1) /
((M * (↑(ModularGroup.T ^ j) : Matrix (Fin 2) (Fin 2) ℤ)) 0 0)) =
-(M 0 1 / M 0 0) - j := by sorrySource
J. S. Birman, *Braids, Links, and Mapping Class Groups*, Ann. of Math. Studies 82, Princeton Univ. Press, 1974, §3.3, pp. 129-130 (the Euclidean algorithm in the modular group).