Membership in a tree level
ProvedBianchiIX.InverseBranchTree.mem_levelbianchi-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 . For every and ,
Preamble
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.mem_level {n : ℕ} {x : ℝ} :
x ∈ T.level n ↔ ∃ w : List ℕ+, w.length = n ∧ x ∈ T.cell w := by sorry
Source