OAI/GroupTheory/PolycyclicRecognition/Algebra/DynkinInput.lean

GitHub source file

2 declarations, 0 contain sorry, 0 declared as axioms

The precise finite BCH input

Published source: F. Baudoin, An Introduction to the Geometry of Stochastic Flows (Imperial College Press, 2004), Appendix B.5, equation (B.2) and the multiple-exponential formula on p.124; Appendix B.6, p.126, makes the formula global for nilpotent groups. Author's copy: https://fabricebaudoin.blog/wp-content/uploads/2019/12/source.pdf

We use only its finite-degree consequence. Grouping the terms of the multiple-exponential formula by their ordered letter word leaves at most 2^(d-1) cuts of a degree-d word. Each coefficient before grouping has absolute value at most one. Thus 2^c bounds each grouped coefficient for all degrees at most c. The actual exponential is characterized by its one-parameter subgroups and their derivatives, not by an arbitrary chart. This is an explicit published-input parameter, never a global axiom.

  1. def OAI.PolycyclicRecognition.NilpotentDynkinExpansionInput line 38

    Source documentation

    The bounded finite Dynkin expansion, specialized to the actual tangent Lie algebra and its intrinsic exponential. No metric growth estimate is part of this published hypothesis.

    def NilpotentDynkinExpansionInput [T2Space G] : Prop :=
    …
  2. theorem OAI.PolycyclicRecognition.exists_product_log_with_polynomial_bound line 52

    Source documentation

    The polynomial product estimate is proved from the finite BCH identity and the actual coordinate bracket bounds. Its constants are independent of the number of factors.

    theorem exists_product_log_with_polynomial_bound
        (dynkin : NilpotentDynkinExpansionInput E G)
        (Exp : GroupLieAlgebra (š“˜(ā„, E)) G → G) (hExp : IsGroupExponential Exp)
        {c n : ā„•} (hc : lowerCentralSeries ā„ (GroupLieAlgebra (š“˜(ā„, E)) G)
          (GroupLieAlgebra (š“˜(ā„, E)) G) c = ⊄)
        {J : Type*} [Fintype J] (b : Basis J ā„ (GroupLieAlgebra (š“˜(ā„, E)) G))
        {C R : ā„} (hC : 0 ≤ C) (hR : 0 ≤ R)
        (hbracket : āˆ€ i j l, |b.repr ⁅b i, b j⁆ l| ≤ C)
        (X : Fin n → GroupLieAlgebra (š“˜(ā„, E)) G)
        (hX : āˆ€ i, ‖b.equivFun (X i)‖ ≤ R) :
        ∃ z : GroupLieAlgebra (š“˜(ā„, E)) G,
          (List.ofFn (fun i => Exp (X i))).prod = Exp z ∧
    …

    Mentions: OAI.PolycyclicRecognition.NilpotentDynkinExpansionInput