Freiman lower construction: initial period scaled identity
ProvedFreiman.lower_initial_period_scaled_identityfreimanlower-construction
Division by the positive recurrence scalar, preserving actual word matrices.
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_period_scaled_identity (n : ℕ) (hn : 0 < n) (hp : 0 < lowerInitialU n)
(hm : lowerInitialWordMatrix (lowerRepeat lowerPeriod n) =
⟨14*(lowerInitialU n:ℝ)-(lowerInitialU (n-1):ℝ),19*(lowerInitialU n:ℝ),
53*(lowerInitialU n:ℝ),72*(lowerInitialU n:ℝ)-(lowerInitialU (n-1):ℝ)⟩) :
lowerInitialWordMatrix (lowerRepeat lowerPeriod n) =
lowerInitialMatScale (lowerInitialU n:ℝ) (lowerInitialP false (lowerInitialX n)) := 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