Every fixed window eventually enters an eventually bounded right tail
ProvedFreiman.shift_eventually_digit_boundcontinued-fractionslagrange-spectrummarkov-spectrumnumber-theory
If all digits far enough to the right are at most M, then along strictly increasing nonnegative centres every fixed translated coordinate is eventually at most M. No bound on the entire negative half of the original word is assumed.
Preamble
import Definitions.Def_Freiman_symbolicMarkovSpectrum import Mathlib.Topology.Instances.Real.Lemmas
Formal statement
namespace Freiman
theorem shift_eventually_digit_bound (a : ℤ → ℕ+) (M N : ℕ)
(hbound : ∀ n : ℕ, N ≤ n → (a (n : ℤ) : ℕ) ≤ M)
(u : ℕ → ℕ) (hu : StrictMono u) :
∀ i : ℤ, ∀ᶠ n in Filter.atTop, (a ((u n : ℤ) + i) : ℕ) ≤ M := by
sorry
end FreimanSource
Freiman's Hall ray: Proof report and corrected English text, 8 September 2026, §1.2, Theorem 1.3, passage from late bounded digits to centred words, printed p. 8.