Domination of the coded length measure by uniform distortion
ProvedBianchiIX.InverseBranchTree.code_volume_map_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 .
Suppose every and every is differentiable at each point of . Fix and assume
Write for Lebesgue measure. Then .
Preamble
import Definitions.Def_BianchiIX_Statistics_GaussInverse import Definitions.Def_BianchiIX_Statistics_BranchTree import Definitions.Def_BianchiIX_Statistics_TreeCoding import Definitions.Def_BianchiIX_Statistics_TreeMeasure 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 variable (T : InverseBranchTree)
Formal statement
theorem BianchiIX.InverseBranchTree.code_volume_map_le (L : ℝ)
(hK : ∀ w, T.terminal w ⊆ Ioo (0 : ℝ) 1)
(hF : ∀ w, ∀ x ∈ T.terminal w, DifferentiableAt ℝ (T.toRoot w) x)
(hbound : ∀ w, ∀ x ∈ T.terminal w, |deriv (T.toRoot w) x| ≤
Real.exp L * |deriv (gaussWord (w.map (fun a : ℕ+ => (a : ℕ)))) x|) :
Measure.map T.code (volume.comap (Subtype.val : T.survivors → ℝ)) ≤
Real.toNNReal (Real.exp L) • volume := by sorry
Source