Cylinder bounds control preimages of open sets
ProvedBianchiIX.gaussCode_preimage_open_lebianchi-ix-era-statisticsdynamical-systems
Let , and let . For , write . For a finite word , set , with the identity. Define
The limit exists by the uniform contraction of inverse words. Write for and .
For a finite word of nonnegative integers, let
For these maps on all of , the reciprocal uses . Write . For a set , let consist of the nonempty positive-digit words such that and no proper nonempty prefix has .
Let be a measure space, let be a Borel measure on , and let . For a word , put
Suppose for every nonempty positive-digit word . Then for every open set .
Preamble
import Definitions.Def_BianchiIX_Statistics_GaussCoding import Definitions.Def_BianchiIX_Statistics_GaussCylinders 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.MeasureTheory.Group.MeasurableEquiv import Mathlib.MeasureTheory.Measure.Regular open BianchiIX noncomputable section open Filter Set MeasureTheory open scoped Topology ENNReal NNReal
Formal statement
theorem BianchiIX.gaussCode_preimage_open_le {X : Type*} [MeasurableSpace X]
(μ : Measure X) (ν : Measure ℝ) (a : X → ℕ → ℕ+)
(hbound : ∀ w : List ℕ, w ≠ [] → (∀ k ∈ w, 1 ≤ k) →
μ {x | digitPrefix (a x) w.length = w} ≤ ν (gaussCylinder w))
{O : Set ℝ} (hO : IsOpen O) :
μ ((gaussCode ∘ a) ⁻¹' O) ≤ ν O := by sorry
Source