Accumulated logarithmic distortion on an actual branch tree
ProvedBianchiIX.InverseBranchTree.BranchEstimates.log_distortionbianchi-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. For every ,
Preamble
import Definitions.Def_BianchiIX_Statistics_TreeDistortion
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
open scoped NNReal ENNReal
open BianchiIX
open BianchiIX.InverseBranchTree
open BianchiIX.InverseBranchTree.BranchEstimates
variable {T : InverseBranchTree} {d e : ℕ → ℝ} (E : T.BranchEstimates d e)
include E
Formal statement
theorem BianchiIX.InverseBranchTree.BranchEstimates.log_distortion (w : List ℕ+) {x : ℝ} (hx : x ∈ T.terminal w) :
|Real.log (|deriv (T.toRoot w) x| /
|deriv (gaussWord (w.map (fun a : ℕ+ => (a : ℕ)))) x|)| ≤
∑ j ∈ Finset.range w.length, (e j + if j = 0 then 0 else 2 * d j) := by sorry
Source