Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Surviving phases stay in the closed unit interval

Proved
BianchiIX.InverseBranchTree.BranchEstimates.phase_mem_unit

by trppppp · Nov 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

bianchi-ix-era-statisticsdynamical-systems

Let TTT be an inverse-branch tree with open root R⊂RR\subset\mathbb RR⊂R. For every finite positive-digit word vvv and digit aaa, let Uv,a⊂RU_{v,a}\subset\mathbb RUv,a​⊂R be open and let hv,a:R→Rh_{v,a}:\mathbb R\to\mathbb Rhv,a​:R→R be continuous and injective on Uv,aU_{v,a}Uv,a​. For fixed vvv, assume the images hv,a(Uv,a)h_{v,a}(U_{v,a})hv,a​(Uv,a​) are pairwise disjoint. Define

K∅=R,Kva=Uv,a∩hv,a−1(Kv),K_\varnothing=R,\qquad K_{va}=U_{v,a}\cap h_{v,a}^{-1}(K_v),K∅​=R,Kva​=Uv,a​∩hv,a−1​(Kv​), H∅=id,Hva=Hv∘hv,a,Cv=Hv(Kv),H_\varnothing=\mathrm{id},\qquad H_{va}=H_v\circ h_{v,a},\qquad C_v=H_v(K_v),H∅​=id,Hva​=Hv​∘hv,a​,Cv​=Hv​(Kv​), Dv=Kv∖⋃ahv,a(Uv,a),Sn=⋃∣v∣=nCv.D_v=K_v\setminus\bigcup_a h_{v,a}(U_{v,a}),\qquad S_n=\bigcup_{|v|=n}C_v.Dv​=Kv​∖a⋃​hv,a​(Uv,a​),Sn​=∣v∣=n⋃​Cv​.

Here vavava denotes appending the digit aaa to vvv.

Let S=⋂nSnS=\bigcap_nS_nS=⋂n​Sn​ be the surviving set. For x∈Sx\in Sx∈S, denote its unique length-nnn cell word by vn(x)v_n(x)vn​(x) and define an(x)a_n(x)an​(x) by vn+1(x)=vn(x)an(x)v_{n+1}(x)=v_n(x)a_n(x)vn+1​(x)=vn​(x)an​(x). Let gb(t)=1/(b+t)g_b(t)=1/(b+t)gb​(t)=1/(b+t) and Gv=gv0∘⋯∘gv∣v∣−1G_v=g_{v_0}\circ\cdots\circ g_{v_{|v|-1}}Gv​=gv0​​∘⋯∘gv∣v∣−1​​, with the empty composition the identity. The code is

κ(x)=lim⁡n→∞Gvn(x)(0).\kappa(x)=\lim_{n\to\infty}G_{v_n(x)}(0).κ(x)=n→∞lim​Gvn​(x)​(0).

For a Borel measure μ\muμ on R\mathbb RR, write μS\mu_SμS​ for its pullback to the measurable subtype SSS by the inclusion into R\mathbb RR.

Assume R,Uv,a⊂(0,1)R,U_{v,a}\subset(0,1)R,Uv,a​⊂(0,1) and that every branch is differentiable with nonzero derivative on its domain. Let real sequences d,ed,ed,e satisfy, for every t∈Uv,at\in U_{v,a}t∈Uv,a​,

∣hv,a(t)−ga(t)∣≤d∣v∣,∣log⁡∣hv,a′(t)∣∣ga′(t)∣∣≤e∣v∣.|h_{v,a}(t)-g_a(t)|\leq d_{|v|},\qquad \left|\log\frac{|h_{v,a}'(t)|}{|g_a'(t)|}\right|\leq e_{|v|}.∣hv,a​(t)−ga​(t)∣≤d∣v∣​,​log∣ga′​(t)∣∣hv,a′​(t)∣​​≤e∣v∣​.

Put Bn=∑j=0n−1ej+2∑j=1n−1djB_n=\sum_{j=0}^{n-1}e_j+2\sum_{j=1}^{n-1}d_jBn​=∑j=0n−1​ej​+2∑j=1n−1​dj​, with empty sums zero, and write λ\lambdaλ for Lebesgue measure. Let ϕn(x)∈Kvn(x)\phi_n(x)\in K_{v_n(x)}ϕn​(x)∈Kvn​(x)​ be the phase with Hvn(x)(ϕn(x))=xH_{v_n(x)}(\phi_n(x))=xHvn​(x)​(ϕn​(x))=x. For every x∈Sx\in Sx∈S and nnn, ϕn(x)∈[0,1]\phi_n(x)\in[0,1]ϕn​(x)∈[0,1].

Preamble
import Definitions.Def_BianchiIX_Statistics_TreeDistortion
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)
open BianchiIX.InverseBranchTree.BranchEstimates
variable {T : InverseBranchTree} {d e : ℕ → ℝ} (E : T.BranchEstimates d e)
include E

Formal statement
theorem BianchiIX.InverseBranchTree.BranchEstimates.phase_mem_unit (x : T.survivors) (n : ℕ) : T.phase x n ∈ Icc (0 : ℝ) 1 := by sorry
Source
https://github.com/l46430640-del/ERA-STATISTICS-FORMAL/blob/d74c241819f896ab8d050b21ace80c8e90eabd9e/BianchiIX/Statistics/TreeOrbits.lean#L50-L52

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me