Reconstruction of the code from a finite prefix and its tail
ProvedBianchiIX.gaussCode_prefixbianchi-ix-era-statisticsdynamical-systems
Let , and let . For , write . For a finite word , set , with the identity. Define
The limit exists by the uniform contraction of inverse words. Write for and .
For every and ,
The identity separates any finite prefix from the remaining digits.
Preamble
import Definitions.Def_BianchiIX_Statistics_GaussCoding 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 open BianchiIX noncomputable section open Filter Set open scoped Topology
Formal statement
theorem BianchiIX.gaussCode_prefix (a : ℕ → ℕ+) (n : ℕ) :
gaussCode a = gaussWord (digitPrefix a n) (gaussCode (shiftDigits a n)) := by sorry
Source