Local Gauss recurrence error of the actual phases
ProvedBianchiIX.InverseBranchTree.BranchEstimates.phase_error_lebianchi-ix-era-statisticsdynamical-systems
Let be an inverse-branch tree with open root . For every finite positive-digit word and digit , let be open and let be continuous and injective on . For fixed , assume the images are pairwise disjoint. Define
Here denotes appending the digit to .
Let be the surviving set. For , denote its unique length- cell word by and define by . Let and , with the empty composition the identity. The code is
For a Borel measure on , write for its pullback to the measurable subtype by the inclusion into .
Assume and that every branch is differentiable with nonzero derivative on its domain. Let real sequences satisfy, for every ,
Put , with empty sums zero, and write for Lebesgue measure. Let be the phase in that maps to . Then
Preamble
import Definitions.Def_BianchiIX_Statistics_TreeDistortion
import Definitions.Def_BianchiIX_Statistics_TreeOrbits
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
import Mathlib.Analysis.SpecialFunctions.Log.Deriv
import Mathlib.MeasureTheory.Group.MeasurableEquiv
import Mathlib.MeasureTheory.Measure.Regular
import Mathlib.MeasureTheory.Function.JacobianOneDim
open Set MeasureTheory Filter
open scoped Topology
open BianchiIX
open BianchiIX.InverseBranchTree
variable (T : InverseBranchTree)
open BianchiIX.InverseBranchTree.BranchEstimates
variable {T : InverseBranchTree} {d e : ℕ → ℝ} (E : T.BranchEstimates d e)
include E
Formal statement
theorem BianchiIX.InverseBranchTree.BranchEstimates.phase_error_le (x : T.survivors) (n : ℕ) :
inverseError (fun k => (T.digits x k : ℕ)) (T.phase x) n ≤ d n := by sorry
Source