OAI/GroupTheory/PolycyclicRecognition/Analysis/SequenceMetricFactorBounds.lean

GitHub source file

1 declarations, 0 contain sorry, 0 declared as axioms

Uniform short-bridge bounds along the profile scales

  1. theorem OAI.PolycyclicRecognition.CartanWordModel.exists_sequence_metric_factor_bounds line 38

    Source documentation

    The same subexponential radii work for every small δ and every bridge of length at most δ times the scale. Fixed right thickening is included.

    theorem exists_sequence_metric_factor_bounds
        (b₀ : Basis (Fin (finrank ℝ (cartanRootIdeal H))) ℝ (cartanRootIdeal H))
        (γ₀ : M.Bases) {J : Type*} [Fintype J]
        (b : Basis J ℝ (cartanRootIdeal H)) {U : Set (F.N.carrier × F.D.carrier)} (hU : IsCompact U)
        (hφ : ∀ d, F.action d = M.adjointGroupAutomorphism T F.N.equiv F.ExpN F.isExpN
          (by rw [← show chartN = F.ExpN from funext hchartN]; exact chartN.bijective) dynkinN
          (cartanLog H F.D.equiv F.ExpD
            (by rw [← show chartD = F.ExpD from funext hchartD]; exact chartD.bijective) d))
        (hpath : ∀ g : G, ∃ γ : ℝ → G, γ 0 = 1 ∧ γ 1 = g ∧
          ∀ t ∈ Icc (0 : ℝ) 1, ∀ u ∈ Icc (0 : ℝ) 1,
            dist (γ t) (γ u) ≤ dist 1 g * |t - u|)
        {K : ℝ} (hK : 0 ≤ K)
    …

    Mentions: OAI.PolycyclicRecognition.cartanRootIdeal, OAI.PolycyclicRecognition.cartanLog