Error bound relative to the code of prescribed digits
ProvedBianchiIX.gaussCode_error_boundbianchi-ix-era-statisticsdynamical-systems
Let , and let . For , write . For a finite word , set , with the identity. Define
The limit exists by the uniform contraction of inverse words. Write for and .
For a real sequence , define its local inverse recurrence error by
Suppose for every . Then
The exact comparison sequence is determined by the prescribed digits.
Preamble
import Definitions.Def_BianchiIX_Statistics_GaussCoding 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 import Mathlib.Data.PNat.Basic import Mathlib.MeasureTheory.Constructions.BorelSpace.Metrizable import Mathlib.Data.Rat.Floor import Mathlib.NumberTheory.Real.Irrational import Mathlib.Order.OrderIsoNat open BianchiIX noncomputable section open Filter Set open scoped Topology
Formal statement
theorem BianchiIX.gaussCode_error_bound (a : ℕ → ℕ+) {y : ℕ → ℝ}
(hy : ∀ m, y m ∈ Icc (0 : ℝ) 1) (m : ℕ) :
|y m - gaussCode (shiftDigits a m)| ≤ ∑' j : ℕ, (1 / 4 : ℝ) ^ j *
(inverseError (fun k => (a k : ℕ)) y (m + 2 * j) +
inverseError (fun k => (a k : ℕ)) y (m + 2 * j + 1)) := by sorry
Source