Freiman lower construction: initial n base aux
ProvedFreiman.lower_initial_n_base_auxfreimanlower-construction
Direct exact n=0 source-word evaluation; it is separate from the normalized n>0 matrix.
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_n_base_aux : certFieldVal (lowerInitialNBase .aux) =
(let w := lowerInitialNWords .aux
prefixEval ((w 0).1++(w 0).2) lowerTau + prefixEval ((w 1).1++(w 1).2) lowerTau -
prefixEval ((w 2).1++(w 2).2) lowerTau - prefixEval ((w 3).1++(w 3).2) lowerTau) := 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