math / data /lean /OAI /GroupTheory /PolycyclicRecognition /Analysis /BoxInteriorSlack.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
4.89 kB
import OAI.GroupTheory.PolycyclicRecognition.Algebra.UniformInteriorSlack
import OAI.GroupTheory.PolycyclicRecognition.Analysis.BoxWordExpansion
namespace OAI
/-! # Interior slack directly from membership in rescaled boxes -/
noncomputable section
namespace PolycyclicRecognition
open Module LieModule Filter
open scoped Topology BigOperators
variable {I L G A Z : Type*} [Fintype I] [DecidableEq I]
[LieRing L] [LieAlgebra ℝ L] [FiniteDimensional ℝ L]
[Group G] [NormedRing A] [NormedAlgebra ℝ A] [CompleteSpace A]
attribute [local instance 100] LieRing.ofAssociativeRing
/-- The actual logarithms of an enlarged suffix and an interior family
satisfy the uniform conjugation conclusion. The finite word expansions
needed by interior slack are constructed here from the two box bounds. -/
theorem rescaled_box_conjugation_tendstoUniformly
[Nonempty (Fin (finrank ℝ L))]
(X : I β†’ L) {m kβ‚€ cβ‚€ : β„•}
(hk : lowerCentralSeries ℝ L L kβ‚€ = βŠ₯)
(hnil : lowerCentralSeries ℝ L L (m + 1) = βŠ₯)
(bβ‚€ : Basis (Fin (finrank ℝ L)) ℝ L) (s : I β†’ ℝ)
(Ξ² : ℝ β†’ WordBasisSelections X (boundedBracketWords kβ‚€))
(hΞ² : βˆ€ r, IsMaximizingColumnBasis
(wordListCoordinates X (boundedBracketWords kβ‚€) bβ‚€)
(fun w => bracketWordExponent s w) (Ξ² r).val)
(Exp : L β†’ G) (hinj : Function.Injective Exp)
(hneg : βˆ€ x, Exp (-x) = (Exp x)⁻¹)
(a : DynkinCoefficients cβ‚€ 2)
(hm : βˆ€ x y, Exp (finiteDynkinPolynomial a ![x, y]) = Exp x * Exp y)
(j : L →ₗ⁅ℝ⁆ A) (ρ : G β†’* AΛ£) (hρ : Function.Injective ρ)
(hmatch : βˆ€ x, ρ (Exp x) = algebraExpUnit (j x))
{Ξ΄ c lo hi : ℝ} (hΞ΄ : 0 < Ξ΄) (hc : 0 ≀ c) (hhi : 0 ≀ hi)
(hcost : βˆ€ w : boundedBracketWords (I := I) kβ‚€,
lo ≀ bracketWordExponent s w ∧ bracketWordExponent s w ≀ hi)
(hgap : (m : ℝ) * hi < c * lo)
(Ξ΅ : ℝ β†’ ℝ) (hΞ΅ : Tendsto Ξ΅ atTop (𝓝 0))
(k : ℝ β†’ L) (u : ℝ β†’ Z β†’ L)
(hkbox : βˆ€αΆ  r : ℝ in atTop,
β€–(exponentialRescaleBasis
(WordBasisSelections.basis X (boundedBracketWords kβ‚€) (Ξ² r))
(fun i => (1 + Ξ΄) * bracketWordExponent s ((Ξ² r).val i)) r).equivFun (k r)β€– ≀
Real.exp (r * Ξ΅ r))
(hubox : βˆ€αΆ  r : ℝ in atTop, βˆ€ z,
β€–(exponentialRescaleBasis
(WordBasisSelections.basis X (boundedBracketWords kβ‚€) (Ξ² r))
(fun i => (1 - c * Ξ΄) * bracketWordExponent s ((Ξ² r).val i)) r).equivFun (u r z)β€– ≀
Real.exp (r * Ξ΅ r)) :
let b := fun r => exponentialRescaleBasis
(WordBasisSelections.basis X (boundedBracketWords kβ‚€) (Ξ² r))
(fun i => bracketWordExponent s ((Ξ² r).val i)) r
TendstoUniformly (fun r z => dynkinProduct a (basisBracket (b r))
(dynkinProduct a (basisBracket (b r)) ((b r).equivFun (k r))
((b r).equivFun (u r z))) (-((b r).equivFun (k r)))) (fun _ => 0) atTop := by
classical
let S := boundedBracketWords (I := I) kβ‚€
let cost : S β†’ ℝ := fun w => bracketWordExponent s w
let bk := fun r => exponentialRescaleBasis (WordBasisSelections.basis X S (Ξ² r))
(fun i => (1 + Ξ΄) * cost ((Ξ² r).val i)) r
let bu := fun r => exponentialRescaleBasis (WordBasisSelections.basis X S (Ξ² r))
(fun i => (1 - c * Ξ΄) * cost ((Ξ² r).val i)) r
have hek (r : ℝ) := exists_word_expansion_of_rescaled_norm_le X S (Ξ² r)
(fun w => (1 + Ξ΄) * cost w) r (norm_nonneg ((bk r).equivFun (k r))) (k r) le_rfl
have heu (r : ℝ) (z : Z) := exists_word_expansion_of_rescaled_norm_le X S (Ξ² r)
(fun w => (1 - c * Ξ΄) * cost w) r (norm_nonneg ((bu r).equivFun (u r z))) (u r z) le_rfl
choose ak hak hkeq using hek
choose au hau hueq using heu
have hkcoeff : βˆ€αΆ  r : ℝ in atTop, βˆ€ w,
|ak r w| ≀ (finrank ℝ L : ℝ) * Real.exp (r * ((1 + Ξ΄) * cost w + Ξ΅ r)) := by
filter_upwards [hkbox] with r hr w
apply (hak r w).trans
calc
_ ≀ (finrank ℝ L : ℝ) * Real.exp (r * Ξ΅ r) *
Real.exp (r * ((1 + Ξ΄) * cost w)) := by gcongr
_ = _ := by rw [mul_assoc, ← Real.exp_add]; congr 2; ring
have hucoeff : βˆ€αΆ  r : ℝ in atTop, βˆ€ z w,
|au r z w| ≀ (finrank ℝ L : ℝ) * Real.exp (r * ((1 - c * Ξ΄) * cost w + Ξ΅ r)) := by
filter_upwards [hubox] with r hr z w
apply (hau r z w).trans
calc
_ ≀ (finrank ℝ L : ℝ) * Real.exp (r * Ξ΅ r) *
Real.exp (r * ((1 - c * Ξ΄) * cost w)) := by
gcongr
exact hr z
_ = _ := by rw [mul_assoc, ← Real.exp_add]; congr 2; ring
have h := rescaled_word_conjugation_tendstoUniformly X hk hnil bβ‚€ s Ξ² hΞ²
Exp hinj hneg a hm j ρ hρ hmatch hδ hc hhi (Nat.cast_nonneg _) (Nat.cast_nonneg _)
hcost hgap Ξ΅ hΞ΅ ak au hkcoeff hucoeff
dsimp only [S] at hkeq hueq
simpa only [hkeq, hueq] using h
end PolycyclicRecognition
end
end OAI