Vanishing recurrence error implies asymptotic agreement
ProvedBianchiIX.gauss_shadowing_of_error_tendsto_zerobianchi-ix-era-statisticsdynamical-systems
Let be natural numbers with and write . For real sequences , define
The exact comparison sequence satisfies for every .
Suppose for all and . Then
Approximate inverse recurrences with vanishing local error therefore approach the specified exact comparison sequence.
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.gauss_shadowing_of_error_tendsto_zero {digits : ℕ → ℕ} {y z : ℕ → ℝ}
(hdigits : ∀ m, 1 ≤ digits m)
(hy : ∀ m, y m ∈ Set.Icc (0 : ℝ) 1) (hz : ∀ m, z m ∈ Set.Icc (0 : ℝ) 1)
(hrec : ∀ m, z m = gaussInv (digits m) (z (m + 1)))
(herror : Tendsto (inverseError digits y) atTop (𝓝 0)) :
Tendsto (fun m => y m - z m) atTop (𝓝 0) := by sorry
Source