Contraction of finite Gauss inverse compositions
ProvedBianchiIX.gaussWord_lipschitzbianchi-ix-era-statisticsdynamical-systems
Write . For a finite word of natural numbers, let
If every digit in is at least , then for all ,
This yields contraction uniformly over positive digit words of a given length.
Preamble
import Definitions.Def_BianchiIX_Statistics_GaussInverse import Mathlib.Analysis.Calculus.Deriv.Inv import Mathlib.Analysis.Calculus.Deriv.Add import Mathlib.Analysis.SpecificLimits.Basic import Mathlib.Data.List.Induction import Mathlib.Tactic.FieldSimp import Mathlib.Tactic.Linarith import Mathlib.Tactic.Ring open BianchiIX noncomputable section open Filter open scoped Topology
Formal statement
theorem BianchiIX.gaussWord_lipschitz (w : List ℕ) (hw : ∀ a ∈ w, 1 ≤ a)
{x y : ℝ} (hx : 0 ≤ x) (hy : 0 ≤ y) :
|gaussWord w x - gaussWord w y| ≤ (1 / 4 : ℝ) ^ (w.length / 2) * |x - y| := by sorry
Source