Matrices with fixed determinant

This file defines the type of matrices with fixed determinant m and proves some basic results about them.

We also prove that the subgroup of SL(2,ℤ) generated by S and T is the whole group.

Note: Some of this was done originally in Lean 3 in the kbb (https://github.com/kim-em/kbb/tree/master) repository, so credit to those authors.

def FixedDetMatrix (n : Type u_1) [DecidableEq n] [Fintype n] (R : Type u_2) [CommRing R] (m : R) : Type (max 0 u_1 u_2)

The subtype of matrices with fixed determinant m.

Equations

• FixedDetMatrix n R m = { A : Matrix n n R // A.det = m }

theorem FixedDetMatrices.ext' (n : Type u_1) [DecidableEq n] [Fintype n] (R : Type u_2) [CommRing R] {m : R} {A B : FixedDetMatrix n R m} (h : ↑A = ↑B) : A = B

Extensionality theorem for FixedDetMatrix with respect to the underlying matrix, not entriwise.

theorem FixedDetMatrices.ext (n : Type u_1) [DecidableEq n] [Fintype n] (R : Type u_2) [CommRing R] {m : R} {A B : FixedDetMatrix n R m} (h : ∀ (i j : n), ↑A i j = ↑B i j) : A = B

instance FixedDetMatrices.instSMulSpecialLinearGroupFixedDetMatrix (n : Type u_1) [DecidableEq n] [Fintype n] (R : Type u_2) [CommRing R] (m : R) : SMul (Matrix.SpecialLinearGroup n R) (FixedDetMatrix n R m)

Equations

• FixedDetMatrices.instSMulSpecialLinearGroupFixedDetMatrix n R m = { smul := fun (g : Matrix.SpecialLinearGroup n R) (A : FixedDetMatrix n R m) => ⟨↑g * ↑A, ⋯⟩ }

theorem FixedDetMatrices.smul_def (n : Type u_1) [DecidableEq n] [Fintype n] (R : Type u_2) [CommRing R] (m : R) (g : Matrix.SpecialLinearGroup n R) (A : FixedDetMatrix n R m) : g • A = ⟨↑g * ↑A, ⋯⟩

instance FixedDetMatrices.instMulActionSpecialLinearGroupFixedDetMatrix (n : Type u_1) [DecidableEq n] [Fintype n] (R : Type u_2) [CommRing R] (m : R) : MulAction (Matrix.SpecialLinearGroup n R) (FixedDetMatrix n R m)

Equations

• FixedDetMatrices.instMulActionSpecialLinearGroupFixedDetMatrix n R m = MulAction.mk ⋯ ⋯

theorem FixedDetMatrices.smul_coe (n : Type u_1) [DecidableEq n] [Fintype n] (R : Type u_2) [CommRing R] (m : R) (g : Matrix.SpecialLinearGroup n R) (A : FixedDetMatrix n R m) : ↑(g • A) = ↑g * ↑A

def FixedDetMatrices.reps (m : ℤ) : Set (FixedDetMatrix (Fin 2) ℤ m)

Set of representatives for the orbits under S and T.

Equations

• FixedDetMatrices.reps m = {A : FixedDetMatrix (Fin 2) ℤ m | ↑A 1 0 = 0 ∧ 0 < ↑A 0 0 ∧ 0 ≤ ↑A 0 1 ∧ |↑A 0 1| < |↑A 1 1|}

def FixedDetMatrices.reduceStep {m : ℤ} (A : FixedDetMatrix (Fin 2) ℤ m) : FixedDetMatrix (Fin 2) ℤ m

Reduction step for matrices in Δ m which moves the matrices towards reps.

Equations

• FixedDetMatrices.reduceStep A = ModularGroup.S • ModularGroup.T ^ (-(↑A 0 0 / ↑A 1 0)) • A

@[irreducible]

def FixedDetMatrices.reduce_rec {m : ℤ} {C : FixedDetMatrix (Fin 2) ℤ m → Sort u_3} (base : (A : FixedDetMatrix (Fin 2) ℤ m) → ↑A 1 0 = 0 → C A) (step : (A : FixedDetMatrix (Fin 2) ℤ m) → ↑A 1 0 ≠ 0 → C (FixedDetMatrices.reduceStep A) → C A) (A : FixedDetMatrix (Fin 2) ℤ m) : C A

Reduction lemma for integral FixedDetMatrices.

Equations

• FixedDetMatrices.reduce_rec base step A = if h : ↑A 1 0 = 0 then base A h else step A h (FixedDetMatrices.reduce_rec base step (FixedDetMatrices.reduceStep A))

@[irreducible]

def FixedDetMatrices.reduce {m : ℤ} : FixedDetMatrix (Fin 2) ℤ m → FixedDetMatrix (Fin 2) ℤ m

Map from Δ m → Δ m which reduces a FixedDetMatrix towards a representative element in reps.

Equations

• One or more equations did not get rendered due to their size.

theorem FixedDetMatrices.reduce_of_pos {m : ℤ} {A : FixedDetMatrix (Fin 2) ℤ m} (hc : ↑A 1 0 = 0) (ha : 0 < ↑A 0 0) : FixedDetMatrices.reduce A = ModularGroup.T ^ (-(↑A 0 1 / ↑A 1 1)) • A

theorem FixedDetMatrices.reduce_of_not_pos {m : ℤ} {A : FixedDetMatrix (Fin 2) ℤ m} (hc : ↑A 1 0 = 0) (ha : ¬0 < ↑A 0 0) : FixedDetMatrices.reduce A = ModularGroup.T ^ (-(-↑A 0 1 / -↑A 1 1)) • ModularGroup.S • ModularGroup.S • A

@[simp]

theorem FixedDetMatrices.reduce_reduceStep {m : ℤ} {A : FixedDetMatrix (Fin 2) ℤ m} (hc : ↑A 1 0 ≠ 0) : FixedDetMatrices.reduce (FixedDetMatrices.reduceStep A) = FixedDetMatrices.reduce A

theorem FixedDetMatrices.reps_entries_le_m' {m : ℤ} {A : FixedDetMatrix (Fin 2) ℤ m} (h : A ∈ FixedDetMatrices.reps m) (i j : Fin 2) : ↑A i j ∈ Finset.Icc (-|m|) |m|

An auxiliary result bounding the size of the entries of the representatives in reps.

@[simp]

theorem FixedDetMatrices.reps_zero_empty : FixedDetMatrices.reps 0 = ∅

noncomputable instance FixedDetMatrices.repsFintype (k : ℤ) : Fintype ↑(FixedDetMatrices.reps k)

Equations

• FixedDetMatrices.repsFintype k = Fintype.ofInjective (fun (M : ↑(FixedDetMatrices.reps k)) (i j : Fin 2) => ⟨↑↑M i j, ⋯⟩) ⋯

@[simp]

theorem FixedDetMatrices.S_smul_four {m : ℤ} (A : FixedDetMatrix (Fin 2) ℤ m) : ModularGroup.S • ModularGroup.S • ModularGroup.S • ModularGroup.S • A = A

@[simp]

theorem FixedDetMatrices.T_S_rel_smul {m : ℤ} (A : FixedDetMatrix (Fin 2) ℤ m) : ModularGroup.S • ModularGroup.S • ModularGroup.S • ModularGroup.T • ModularGroup.S • ModularGroup.T • ModularGroup.S • A = ModularGroup.T⁻¹ • A

theorem FixedDetMatrices.reduce_mem_reps {m : ℤ} (hm : m ≠ 0) (A : FixedDetMatrix (Fin 2) ℤ m) : FixedDetMatrices.reduce A ∈ FixedDetMatrices.reps m

theorem FixedDetMatrices.induction_on {m : ℤ} {C : FixedDetMatrix (Fin 2) ℤ m → Prop} {A : FixedDetMatrix (Fin 2) ℤ m} (hm : m ≠ 0) (h0 : ∀ (A : FixedDetMatrix (Fin 2) ℤ m), ↑A 1 0 = 0 → 0 < ↑A 0 0 → 0 ≤ ↑A 0 1 → |↑A 0 1| < |↑A 1 1| → C A) (hS : ∀ (B : FixedDetMatrix (Fin 2) ℤ m), C B → C (ModularGroup.S • B)) (hT : ∀ (B : FixedDetMatrix (Fin 2) ℤ m), C B → C (ModularGroup.T • B)) : C A

theorem FixedDetMatrices.reps_one_id (A : FixedDetMatrix (Fin 2) ℤ 1) (a1 : ↑A 1 0 = 0) (a4 : 0 < ↑A 0 0) (a6 : |↑A 0 1| < |↑A 1 1|) : A = 1

theorem SpecialLinearGroup.SL2Z_generators : Subgroup.closure {ModularGroup.S, ModularGroup.T} = ⊤

SL(2, ℤ) is generated by S and T.