Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The simultaneous phase and digit statistics of an era sequence

Definition
BianchiIX_Statistics_EraStatistics

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

bianchi-ix-era-statisticsdynamical-systems

Let λ\lambdaλ be Lebesgue measure on R\mathbb RR, and let λ0\lambda_0λ0​ be its restriction to (0,1)(0,1)(0,1). The Gauss measure is

dμG(x)=1log⁡2 (1+x) dλ0(x).d\mu_G(x)=\frac{1}{\log2\,(1+x)}\,d\lambda_0(x).dμG​(x)=log2(1+x)1​dλ0​(x).

Write w(x)=1/(log⁡2 (1+x))w(x)=1/(\log2\,(1+x))w(x)=1/(log2(1+x)) and P(x)=log⁡(1+x)/log⁡2P(x)=\log(1+x)/\log2P(x)=log(1+x)/log2 for x≥0x\geq0x≥0.

Let G(x)=1/x−⌊1/x⌋G(x)=1/x-\lfloor1/x\rfloorG(x)=1/x−⌊1/x⌋ for x≠0x\ne0x=0, with G(0)=0G(0)=0G(0)=0. For a finite word w=(a0,…,ak−1)w=(a_0,\ldots,a_{k-1})w=(a0​,…,ak−1​) of natural numbers, set

Cw=(ga0∘⋯∘gak−1)((0,1)),ga(t)=1/(a+t),C_w=(g_{a_0}\circ\cdots\circ g_{a_{k-1}})((0,1)),\qquad g_a(t)=1/(a+t),Cw​=(ga0​​∘⋯∘gak−1​​)((0,1)),ga​(t)=1/(a+t),

where the empty composition is the identity and 0−1=00^{-1}=00−1=0. Define

fw=1Cw,mw=μG(Cw),BG={x∈R: ∀w, 1n∑j=0n−1fw(Gjx)⟶mw}.f_w=\mathbf1_{C_w},\qquad m_w=\mu_G(C_w),\qquad \mathcal B_G=\left\{x\in\mathbb R:\ \forall w,\ \frac1n\sum_{j=0}^{n-1}f_w(G^jx)\longrightarrow m_w\right\}.fw​=1Cw​​,mw​=μG​(Cw​),BG​={x∈R: ∀w, n1​j=0∑n−1​fw​(Gjx)⟶mw​}.

For a positive-digit sequence aaa, write π(a)\pi(a)π(a) for its continued-fraction code, σja\sigma^j aσja for its tail beginning at jjj, and a∣ka|_ka∣k​ for its first kkk digits.

Define the natural-valued digit, tail observables, and truncations by

D(x)=⌊1/x⌋N,Hk(x)=1(0,1/k)(x)(k≥1),DR(x)=min⁡(D(x),R)(R∈N).D(x)=\lfloor1/x\rfloor_{\mathbb N},\qquad H_k(x)=\mathbf1_{(0,1/k)}(x)\quad(k\geq1),\qquad D_R(x)=\min(D(x),R)\quad(R\in\mathbb N).D(x)=⌊1/x⌋N​,Hk​(x)=1(0,1/k)​(x)(k≥1),DR​(x)=min(D(x),R)(R∈N).

Here the natural floor is zero for negative arguments, and 0−1=00^{-1}=00−1=0. Write

pk=log⁡((k+1)2/(k(k+2)))log⁡2,qk=log⁡(1+1/k)log⁡2,tR=log⁡(R+1)log⁡2.p_k=\frac{\log((k+1)^2/(k(k+2)))}{\log2},\qquad q_k=\frac{\log(1+1/k)}{\log2},\qquad t_R=\frac{\log(R+1)}{\log2}.pk​=log2log((k+1)2/(k(k+2)))​,qk​=log2log(1+1/k)​,tR​=log2log(R+1)​.

For a real sequence uuu, define

An(u)=1n∑j=0n−1uj(n≥1),A0(u)=0.A_n(u)=\frac1n\sum_{j=0}^{n-1}u_j\quad(n\geq1),\qquad A_0(u)=0.An​(u)=n1​j=0∑n−1​uj​(n≥1),A0​(u)=0.

For a positive-digit sequence aaa and a real sequence yyy, let E(a,y)\mathcal E(a,y)E(a,y) mean all of the following statements:

AN(f∘y)→∫f dμGfor every f:R→R continuous on [0,1],A_N(f\circ y)\to\int f\,d\mu_G \quad\text{for every }f:\mathbb R\to\mathbb R \text{ continuous on }[0,1],AN​(f∘y)→∫fdμG​for every f:R→R continuous on [0,1], AN(j↦1{(σja)∣∣w∣=w})→mwfor every finite positive-digit word w,A_N(j\mapsto\mathbf1_{\{(\sigma^ja)|_{|w|}=w\}})\to m_w \quad\text{for every finite positive-digit word }w,AN​(j↦1{(σja)∣∣w∣​=w}​)→mw​for every finite positive-digit word w, AN(j↦1{aj=k})→pk,AN(j↦1{k≤aj})→qk(k≥1),A_N(j\mapsto\mathbf1_{\{a_j=k\}})\to p_k,\qquad A_N(j\mapsto\mathbf1_{\{k\leq a_j\}})\to q_k\quad(k\geq1),AN​(j↦1{aj​=k}​)→pk​,AN​(j↦1{k≤aj​}​)→qk​(k≥1), AN(j↦min⁡(aj,R))→tR(R∈N),AN(j↦aj)→+∞.A_N(j\mapsto\min(a_j,R))\to t_R\quad(R\in\mathbb N),\qquad A_N(j\mapsto a_j)\to+\infty.AN​(j↦min(aj​,R))→tR​(R∈N),AN​(j↦aj​)→+∞.
Definition code
import Definitions.Def_BianchiIX_Statistics_GaussCoding
import Definitions.Def_BianchiIX_Statistics_GaussCylinders
import Definitions.Def_BianchiIX_Statistics_GaussMeasure
import Definitions.Def_BianchiIX_Statistics_ObservableTransfer
import Mathlib.Dynamics.Ergodic.Ergodic
import Mathlib.Dynamics.BirkhoffSum.Average
import Mathlib.MeasureTheory.Integral.Bochner.Basic
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
import Mathlib.MeasureTheory.Measure.WithDensity
import Mathlib.MeasureTheory.Function.Floor
import Mathlib.Dynamics.Ergodic.MeasurePreserving
import Mathlib.Analysis.Asymptotics.SpecificAsymptotics
import Mathlib.Topology.UniformSpace.HeineCantor
import Mathlib.Dynamics.BirkhoffSum.NormedSpace
import Mathlib.MeasureTheory.Integral.Bochner.Set
import Mathlib.Analysis.Normed.Group.Tannery
import Mathlib.Tactic.Positivity
import Mathlib.MeasureTheory.Function.LocallyIntegrable

/-! The complete statistical reduction for asymptotic Gauss recurrences. -/

open Set Filter MeasureTheory
open scoped Topology

namespace BianchiIX

/-- All phase and digit statistics asserted by the era-statistics reduction. -/
structure EraStatistics (a : ℕ → ℕ+) (y : ℕ → ℝ) : Prop where
  continuous_average : ∀ f : ℝ → ℝ, ContinuousOn f (Icc (0 : ℝ) 1) →
    Tendsto (timeAverage (fun j => f (y j))) atTop (𝓝 (∫ x, f x ∂gaussMeasure))
  block_frequency : ∀ w : List ℕ, (∀ k ∈ w, 1 ≤ k) →
    Tendsto (timeAverage (fun j => if digitPrefix (shiftDigits a j) w.length = w then 1 else 0))
      atTop (𝓝 (gaussMeasure (gaussCylinder w)).toReal)
  digit_frequency : ∀ k : ℕ+,
    Tendsto (timeAverage (fun j => if (a j : ℕ) = (k : ℕ) then 1 else 0)) atTop
      (𝓝 (Real.log (((k : ℝ) + 1) ^ 2 / ((k : ℝ) * ((k : ℝ) + 2))) / Real.log 2))
  tail_frequency : ∀ k : ℕ+,
    Tendsto (timeAverage (fun j => if (k : ℕ) ≤ (a j : ℕ) then 1 else 0)) atTop
      (𝓝 (Real.log (1 + 1 / (k : ℝ)) / Real.log 2))
  truncated_average : ∀ R : ℕ,
    Tendsto (timeAverage (fun j => min (a j : ℝ) (R : ℝ))) atTop
      (𝓝 (Real.log ((R : ℝ) + 1) / Real.log 2))
  divergent_average : Tendsto (timeAverage (fun j => (a j : ℝ))) atTop atTop





namespace InverseBranchTree.BranchEstimates



end InverseBranchTree.BranchEstimates
end BianchiIX
Source
https://github.com/l46430640-del/ERA-STATISTICS-FORMAL/blob/d74c241819f896ab8d050b21ace80c8e90eabd9e/BianchiIX/Statistics/EraStatistics.lean

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