Freiman lower construction: initial matrix bottom
ProvedFreiman.lower_initial_matrix_bottomfreimanlower-construction
The lower row of the actual word matrix is exactly the existing lowerCD recurrence, so no new denominator ratio replaces the old one.
Preamble
import Definitions.Def_Freiman_lowerInitialEntry import Definitions.Def_Freiman_lowerCertificates import Mathlib.Tactic.Linarith import Mathlib.Tactic.Push open Freiman
Formal statement
theorem Freiman.lower_initial_matrix_bottom (w : List ℕ+) : (lowerInitialWordMatrix w).c = ((lowerCD w).1:ℝ) ∧ (lowerInitialWordMatrix w).d = ((lowerCD w).2:ℝ) := by sorry
Source
Freiman's Hall ray: Proof report and corrected English text (8 September 2026), parts/lower_core.tex, prop:lc-H-entry; source H certificate appendix