Freiman lower construction: initial run matrix
ProvedFreiman.lower_initial_run_matrixfreimanlower-construction
Both actual run matrices, including the B-family preceding run k=0. The latter uses [[1-3y,y],[y,1]], not M3+yI.
Preamble
import Definitions.Def_Freiman_lowerInitialSeamData import Definitions.Def_Freiman_lowerInitialNData import Definitions.Def_Freiman_lowerCertificates import Mathlib.Tactic.Linarith import Mathlib.Tactic.Push open Freiman open scoped BigOperators
Formal statement
theorem Freiman.lower_initial_run_matrix (k : ℕ) :
lowerInitialWordMatrix (List.replicate (k+1) (3:ℕ+)) =
lowerInitialMatScale (lowerInitialV (k+1):ℝ) (lowerInitialK (lowerInitialY k)) ∧
lowerInitialWordMatrix (List.replicate k (3:ℕ+)) =
lowerInitialMatScale (lowerInitialV (k+1):ℝ) (lowerInitialKPrev (lowerInitialY k)) := by
sorrySource
Freiman's Hall ray: Proof report and corrected English text (8 September 2026), parts/lower_core.tex, prop:lc-H-contacts; exact initial contact appendix