Disjoint cylinders for distinct prefixes of equal length
ProvedBianchiIX.gaussCylinder_prefixes_disjointbianchi-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 any family of positive-digit sequences. If their prefixes of length are distinct, the cylinders are pairwise disjoint.
Preamble
import Definitions.Def_BianchiIX_Statistics_GaussCoding import Definitions.Def_BianchiIX_Statistics_GaussCylinders import Definitions.Def_BianchiIX_Statistics_StoppedMass 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 BianchiIX noncomputable section open Set MeasureTheory open scoped ENNReal
Formal statement
theorem BianchiIX.gaussCylinder_prefixes_disjoint {ι : Type*} (a : ι → ℕ → ℕ+) (n : ℕ)
(hunique : Function.Injective (fun i => digitPrefix (a i) n)) :
Pairwise (fun i j => Disjoint (gaussCylinder (digitPrefix (a i) n))
(gaussCylinder (digitPrefix (a j) n))) := by sorry
Source