Decomposition of all lost root points into stopped node images
ProvedBianchiIX.InverseBranchTree.root_sdiff_survivorsbianchi-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 . One has
Preamble
import Definitions.Def_BianchiIX_Statistics_StoppedMass import Definitions.Def_BianchiIX_Statistics_BranchTree 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 BianchiIX open BianchiIX.InverseBranchTree variable (T : InverseBranchTree)
Formal statement
theorem BianchiIX.InverseBranchTree.root_sdiff_survivors :
T.root \ survivingSet T.level =
⋃ n, ⋃ w : {w : List ℕ+ // w.length = n}, T.toRoot w.val '' T.stoppedDomain w.val := by sorry
Source