OAI/GroupTheory/PolycyclicRecognition/Geometry/CartanPivotWordPath.lean
5 declarations, 0 contain sorry, 0 declared as axioms
Explicit word paths based at the actual Cartan pivot
- def
OAI.PolycyclicRecognition.CartanWordModel.pivotSupportFlowline 25 - def
OAI.PolycyclicRecognition.CartanWordModel.rootFlowline 29 - def
OAI.PolycyclicRecognition.CartanWordModel.pivotWordPathline 32 - theorem
OAI.PolycyclicRecognition.CartanWordModel.continuous_pivotWordPath_sampleline 42 - theorem
OAI.PolycyclicRecognition.CartanWordModel.exists_pivotWordPath_boundline 55Source documentation
One constant bounds every explicitly prescribed word through the support positions. The word and its amplitudes may be chosen independently of the initial sheet.
theorem exists_pivotWordPath_bound [IsIsometricSMul G G] (F : CartanFactorModel H Exp) (haarD : NilpotentExponentialHaarInput F.D.modelSpace F.D.carrier) (dynkinD : NilpotentDynkinExpansionInput F.D.modelSpace F.D.carrier) (π : G →* Multiplicative W) (hπ : ∀ x, (π (Exp x)).toAdd = eW (heightProjection T.character x)) {E : Set W} (hE : Convex ℝ E) {w₀ : W} (hw₀ : w₀ ∈ E) (w : Fin M.letterCount → W) (hw : ∀ i, w i ∈ E) (s : Fin M.letterCount → ℝ) (hs : ∀ i, cartanHeightWeight T H (M.weight i) (eW.symm (w i)) = s i) {A B : ℝ} (hA : 0 ≤ A) (hB : 0 ≤ B) (p N : ℕ) : ∃ C : ℝ, 0 ≤ C ∧ ∀ r : ℝ, 0 ≤ r → ∀ h₀ : H, …Mentions: OAI.PolycyclicRecognition.CartanFactorModel, OAI.PolycyclicRecognition.NilpotentExponentialHaarInput, OAI.PolycyclicRecognition.NilpotentDynkinExpansionInput, OAI.PolycyclicRecognition.heightProjection, OAI.PolycyclicRecognition.cartanHeightWeight