OAI/GroupTheory/PolycyclicRecognition/Geometry/CartanGeneratorChain.lean

GitHub source file

1 declarations, 0 contain sorry, 0 declared as axioms

Fixed-length bounded-prefix chains in actual Cartan boxes

  1. theorem OAI.PolycyclicRecognition.CartanWordModel.exists_uniform_cartan_generator_chain line 26

    Source documentation

    Every point in a rescaled box is joined to zero by one fixed number of actual generator steps. Every logarithmic prefix stays in a common enlarged box. This supplies the vertices and edges used by profile concentration.

    theorem exists_uniform_cartan_generator_chain
    [Nonempty (Fin M.letterCount)]
    (hExpG : IsGroupExponential ExpG)
    (realize : ExponentialLinearRealizationInput (EG := EG) (G := G))
…

    Mentions: OAI.PolycyclicRecognition.ExponentialLinearRealizationInput