Download data/lean/OAI/GroupTheory/PolycyclicRecognition/Analysis/BoxInteriorSlack.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 4.89 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/GroupTheory/PolycyclicRecognition/Analysis/BoxInteriorSlack.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/GroupTheory/PolycyclicRecognition/Analysis/BoxInteriorSlack.lean
-
curl -L -o BoxInteriorSlack.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/GroupTheory/PolycyclicRecognition/Analysis/BoxInteriorSlack.lean
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 | |