Freiman lower construction: terminal suffix cases
ProvedFreiman.lower_terminal_suffix_casesfreimanlower-construction
Every reached normalized outward prefix is nonempty and its last digit is 1,2 or 3, even for the cores containing a secondary 4.
Preamble
import Definitions.Def_Freiman_lowerCertificates import Mathlib.Tactic.Linarith import Mathlib.Tactic.Push open Freiman
Formal statement
theorem Freiman.lower_terminal_suffix_cases (t : ℝ) (p : LowerPair) (hs : lowerState t p) :
lowerEnds (lowerNormalize p).1 [1] ∨ lowerEnds (lowerNormalize p).1 [2] ∨ lowerEnds (lowerNormalize p).1 [3] := by
sorrySource
Freiman's Hall ray: Proof report and corrected English text (8 September 2026), parts/lower_section14.tex, six terminal states