A uniform restricted loss bound from amplitude estimates
ProvedBianchiIX.InverseBranchTree.BranchEstimates.restricted_loss_of_amplitude_boundsLet 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 and , define
where the outer power is the real power.
Assume , , , and . Use the error sequences
and put . Assume also and for every word . Then for every set ,
import Definitions.Def_BianchiIX_Analysis_AmplitudeSequence import Definitions.Def_BianchiIX_Statistics_TreeDistortion import Definitions.Def_BianchiIX_Statistics_EraBudget import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.Analysis.SpecificLimits.Basic import Mathlib.Topology.Algebra.InfiniteSum.Order import Mathlib.Tactic.Linarith import Mathlib.Tactic.Ring import Mathlib.MeasureTheory.Integral.IntervalIntegral.FundThmCalculus import Mathlib.Analysis.Calculus.ContDiff.Deriv import Mathlib.Analysis.Calculus.Deriv.Pow import Mathlib.Analysis.Calculus.Deriv.Mul import Mathlib.Analysis.Real.Sqrt import Mathlib.Tactic.FieldSimp import Mathlib.Analysis.SpecialFunctions.Pow.Continuity 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.Data.List.Induction 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 import Mathlib.Analysis.Normed.Group.Tannery import Mathlib.Tactic.Positivity import Mathlib.MeasureTheory.Function.LocallyIntegrable import Mathlib.Data.Fin.VecNotation import Mathlib.Tactic.FinCases noncomputable section open BianchiIX open Set Filter MeasureTheory open scoped Topology ENNReal open BianchiIX.InverseBranchTree open BianchiIX.InverseBranchTree.BranchEstimates
theorem BianchiIX.InverseBranchTree.BranchEstimates.restricted_loss_of_amplitude_bounds {T : InverseBranchTree} {B η Cv Ci : ℝ}
(E : T.BranchEstimates (fun m => Cv * eraAmplitude B m)
(fun m => Ci * Real.sqrt (eraAmplitude B m)))
(hB : 0 < B) (hB1 : B ≤ 1) (hη : 0 ≤ η) (hηhalf : η ≤ 1 / 2)
(hsmall : B ^ η < 1 / 160) (hCv : 0 ≤ Cv) (hCi : 0 ≤ Ci)
(hL : 2 * Ci * Real.sqrt B + 4 * Cv * B ^ (4 / 3 : ℝ) ≤ Real.log 2)
(hsize : ∀ w, volume (T.stoppedDomain w) ≤ ENNReal.ofReal (10 * eraAmplitude B w.length ^ η))
(I : Set ℝ) :
volume ((I ∩ T.root) \ (I ∩ T.survivors)) ≤ min (volume I) (ENNReal.ofReal (80 * B ^ η)) := by sorry