A common finite alphabet survives padding
ProvedFreiman.upper_padding_alphabetcontinued-fractionshall-raynumber-theory
Padding a word whose digits are bounded by N with the digit 3 gives a family uniformly bounded by max(N,3).
Preamble
import Definitions.Def_Freiman_upperModel
Formal statement
namespace Freiman
theorem upper_padding_alphabet (a : ℤ → ℕ+) (N : ℕ) (hN : ∀ i, (a i : ℕ) ≤ N) :
∀ j i, (upperPad a j i : ℕ) ≤ max N 3 := by
sorry
end FreimanSource
Freiman's Hall ray: Proof report and corrected English text, 8 September 2026, Part IV, active source report/source/staging/parts/m2a.tex. Padded-copy construction, finite-alphabet hypothesis.