Freiman lower construction: cylinder nonempty
ProvedFreiman.lower_cylinder_nonemptyfreimanlower-construction
Complete both outward words by periodic 2; digit 2 resets every proper forbidden-word suffix and all core digits are at most 4.
Preamble
import Definitions.Def_Freiman_lowerCertificates import Mathlib.Tactic.Linarith import Mathlib.Tactic.Push open Freiman
Formal statement
theorem Freiman.lower_cylinder_nonempty (p : LowerPair) (hp : lowerAdmissible p) :
∃ a : ℤ → ℕ+, LowerModel a ∧ lowerCylinder p a ∧ (∀ i : ℤ, (a i : ℕ) ≤ 4) := by
sorrySource
Freiman's Hall ray: Proof report and corrected English text (8 September 2026), parts/lower_core.tex, lem:lc-cylinders