Inverse words preserve membership in an invariant set
ProvedBianchiIX.gaussWord_mem_invariantbianchi-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 . If , is a finite positive-digit word, and , then
Preamble
import Definitions.Def_BianchiIX_Statistics_GaussInverse import Definitions.Def_BianchiIX_Statistics_GaussCoding 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 open Set Filter MeasureTheory open scoped Topology ENNReal open BianchiIX
Formal statement
theorem BianchiIX.gaussWord_mem_invariant {E : Set ℝ} (hE : gaussMap ⁻¹' E = E)
(w : List ℕ) (hw : ∀ a ∈ w, 1 ≤ a) {x : ℝ} (hx : x ∈ Ioo (0 : ℝ) 1) :
gaussWord w x ∈ E ↔ x ∈ E := by sorry
Source