OAI/NumberTheory/DukePrimeDegree/Dynamics/SmallCentralizer.lean
12 declarations, 0 contain sorry, 0 declared as axioms
Compact balls in a root centralizer
The diagonal with weights 1, -1, and 0 contracts the centralizer of the corresponding root in reverse time. In particular, it preserves each closed matrix ball in that centralizer. These compact sets give measurable sets of small returns in the proof of EKL (2006), Lemma 4.2.
- def
OAI.DukePrimeDegree.matrixClosedBallline 21 - lemma
OAI.DukePrimeDegree.isCompact_matrixClosedBallline 24 - lemma
OAI.DukePrimeDegree.mem_matrixClosedBall_iffline 27 - lemma
OAI.DukePrimeDegree.matrixClosedBall_subset_matrixBallline 33 - lemma
OAI.DukePrimeDegree.entry_bound_of_mem_matrixClosedBallline 38 - def
OAI.DukePrimeDegree.rootContractionWeightsline 50 - lemma
OAI.DukePrimeDegree.rootContractionWeights_sumline 53 - lemma
OAI.DukePrimeDegree.rootContractionWeights_gapline 57 - lemma
OAI.DukePrimeDegree.rootContractionWeights_middleline 61 - lemma
OAI.DukePrimeDegree.rootContractionWeights_entry_nonnegline 67 - lemma
OAI.DukePrimeDegree.rootCentralizer_conjugateline 91 - theorem
OAI.DukePrimeDegree.rootCentralizer_conjugate_mem_closedBallline 111Source documentation
Reverse diagonal time preserves the closed ball in the single-root centralizer, because every allowed off-diagonal entry contracts.
theorem rootCentralizer_conjugate_mem_closedBall {n : ℕ} {i j : Fin n} (hij : i ≠ j) {r : ℝ} (hr : 0 ≤ r) (g : G n) (hgball : g ∈ matrixClosedBall n r) (hg : g * Matrix.SpecialLinearGroup.transvection hij 1 = Matrix.SpecialLinearGroup.transvection hij 1 * g) (t : ℝ) (ht : 0 ≤ t) : diagonalOneParameter (rootContractionWeights i j) (rootContractionWeights_sum i j) (-t) * g * diagonalOneParameter (rootContractionWeights i j) (rootContractionWeights_sum i j) t ∈ matrixClosedBall n r := by …Mentions: OAI.DukePrimeDegree.matrixClosedBall, OAI.DukePrimeDegree.rootContractionWeights, OAI.DukePrimeDegree.rootContractionWeights_sum