Gauss-typical codes for almost every surviving tree point
ProvedBianchiIX.InverseBranchTree.BranchEstimates.ae_code_gaussCylinderTypicalLet 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 Lebesgue measure on , and let be its restriction to . The Gauss measure is
Write and for .
Let for , with . For a finite word of natural numbers, set
where the empty composition is the identity and . Define
For a positive-digit sequence , write for its continued-fraction code, for its tail beginning at , and for its first digits. For a measurable space , let be the following proposition: for every probability measure on , every ergodic map , and every integrable ,
This proposition is an explicit hypothesis in the results that use it.
Suppose for every and assume . Then for -almost every .
import Definitions.Def_BianchiIX_Literature import Definitions.Def_BianchiIX_Statistics_BranchTree import Definitions.Def_BianchiIX_Statistics_TreeCoding import Definitions.Def_BianchiIX_Statistics_TreeDistortion import Definitions.Def_BianchiIX_Statistics_GaussTypical import Mathlib.Dynamics.Ergodic.Ergodic import Mathlib.Dynamics.BirkhoffSum.Average import Mathlib.MeasureTheory.Integral.Bochner.Basic 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 import Mathlib.MeasureTheory.Measure.WithDensity import Mathlib.MeasureTheory.Function.Floor import Mathlib.Dynamics.Ergodic.MeasurePreserving import Mathlib.Analysis.Asymptotics.SpecificAsymptotics import Mathlib.Topology.UniformSpace.HeineCantor import Mathlib.Dynamics.BirkhoffSum.NormedSpace import Mathlib.MeasureTheory.Integral.Bochner.Set open Set Filter MeasureTheory open scoped Topology ENNReal open BianchiIX noncomputable section open InverseBranchTree.BranchEstimates
theorem BianchiIX.InverseBranchTree.BranchEstimates.ae_code_gaussCylinderTypical {T : InverseBranchTree} {d e : ℕ → ℝ}
(E : T.BranchEstimates d e) (hB : Literature.BirkhoffErgodicInput ℝ) {L : ℝ}
(hbudget : ∀ n, (∑ j ∈ Finset.range n, (e j + if j = 0 then 0 else 2 * d j)) ≤ L) :
∀ᵐ x ∂(volume.comap (Subtype.val : T.survivors → ℝ)), T.code x ∈ gaussCylinderTypicalSet := by sorry