OAI/GroupTheory/PolycyclicRecognition/Geometry/CartanSubexponentialSuffixSequence.lean

GitHub source file

1 declarations, 0 contain sorry, 0 declared as axioms

Bounded root chains for subexponentially large suffixes

  1. theorem OAI.PolycyclicRecognition.CartanWordModel.exists_cartan_subexponential_suffix_sequence line 28

    Source documentation

    A vanishing relative enlargement of the scale absorbs the entire subexponential radius. The resulting word has fixed length, and its prefixes and coefficients obey the original-scale bounds.

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

    Mentions: OAI.PolycyclicRecognition.ExponentialLinearRealizationInput