OAI/GroupTheory/PolycyclicRecognition/Geometry/CartanPublishedSuffixConcentration.lean

GitHub source file

1 declarations, 0 contain sorry, 0 declared as axioms

Finite-chain concentration from the precisely published inputs

  1. theorem OAI.PolycyclicRecognition.CartanWordModel.exists_uniform_published_suffix_concentration line 56

    Source documentation

    The original Haar chart is unchanged in probability by any allowed subexponential suffix. Fixed-length generation and all chain bounds are derived from the precisely published inputs.

    theorem exists_uniform_published_suffix_concentration
    (hExp : IsGroupExponential Exp) (hinj : Function.Injective Exp)
    (realize : ExponentialLinearRealizationInput (EG := EG) (G := G))
…

    Mentions: OAI.PolycyclicRecognition.ExponentialLinearRealizationInput