Stopped inverse-branch trees and their actual domains
DefinitionBianchiIX_Statistics_BranchTreebianchi-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 .
Definition code
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
/-! Actual domains of a stopped inverse-branch tree. Only local branch data are assumed. -/
open Set MeasureTheory
namespace BianchiIX
structure InverseBranchTree where
root : Set ℝ
branch : List ℕ+ → ℕ+ → ℝ → ℝ
domain : List ℕ+ → ℕ+ → Set ℝ
root_open : IsOpen root
domain_open : ∀ w a, IsOpen (domain w a)
branch_continuous : ∀ w a, ContinuousOn (branch w a) (domain w a)
branch_injective : ∀ w a, InjOn (branch w a) (domain w a)
branch_disjoint : ∀ w, Pairwise (fun a b =>
Disjoint (branch w a '' domain w a) (branch w b '' domain w b))
namespace InverseBranchTree
variable (T : InverseBranchTree)
def terminal (w : List ℕ+) : Set ℝ :=
w.reverseRecOn T.root (fun v a K => T.domain v a ∩ T.branch v a ⁻¹' K)
def toRoot (w : List ℕ+) : ℝ → ℝ :=
w.reverseRecOn id (fun v a H => H ∘ T.branch v a)
def cell (w : List ℕ+) : Set ℝ := T.toRoot w '' T.terminal w
def stoppedDomain (w : List ℕ+) : Set ℝ :=
T.terminal w \ ⋃ a, T.branch w a '' T.domain w a
def level (n : ℕ) : Set ℝ := ⋃ w : {w : List ℕ+ // w.length = n}, T.cell w.val
end InverseBranchTree
end BianchiIX
Source