A digit fiber is a countable union of child-cell preimages
ProvedBianchiIX.InverseBranchTree.digit_fiberbianchi-ix-era-statisticsdynamical-systems
Let 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 . For and a positive digit ,
Preamble
import Definitions.Def_BianchiIX_Statistics_TreeCoding 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 Set MeasureTheory open scoped NNReal ENNReal open BianchiIX open BianchiIX.InverseBranchTree variable (T : InverseBranchTree)
Formal statement
theorem BianchiIX.InverseBranchTree.digit_fiber (n : ℕ) (a : ℕ+) :
{x : T.survivors | T.digits x n = a} =
⋃ w : {w : List ℕ+ // w.length = n},
(Subtype.val : T.survivors → ℝ) ⁻¹' T.cell (w.val ++ [a]) := by sorry
Source