Successive phases lie in the corresponding branch domains
ProvedBianchiIX.InverseBranchTree.phase_mem_domainbianchi-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 , let be the unique point of with . For every and ,
Preamble
import Definitions.Def_BianchiIX_Statistics_TreeOrbits 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 Filter open scoped Topology open BianchiIX open BianchiIX.InverseBranchTree variable (T : InverseBranchTree)
Formal statement
theorem BianchiIX.InverseBranchTree.phase_mem_domain (x : T.survivors) (n : ℕ) :
T.phase x (n + 1) ∈ T.domain (T.word x n) (T.digits x n) := by sorry
Source