finite exception alphabet
ProvedFreiman.finite_exception_alphabetcontinued-fractionshall-raynumber-theory
A two-sided word whose digits outside a finite central window are at most 3 uses a finite alphabet. The finitely many remaining digit values have a common finite bound.
Preamble
import Definitions.Def_Freiman_wordRealization open Freiman
Formal statement
theorem Freiman.finite_exception_alphabet (a : ℤ → ℕ+) (h : EventuallyThree a) :
HasFiniteAlphabet a := by sorrySource
Freiman's Hall ray: Proof report and corrected English text, 8 September 2026, §1.6, Theorem 1.9 (found:separated-peaks), proof by separated copies.