Freiman lower construction: entry domain normalizes
ProvedFreiman.lower_entry_domain_normalizesfreimanlower-construction
The printed strict q,r,s bounds imply that the first full alpha,beta width is larger. This elementary rational width comparison establishes actual normalization without assuming any cover swap invariance.
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_entry_domain_normalizes
(hfrac : ∀ (w : List ℕ+) (t : ℝ), 0 < t →
prefixEval w t = lowerInitialMatEval (lowerInitialWordMatrix w) t ∧
0 < lowerInitialMatDen (lowerInitialWordMatrix w) t ∧
(lowerInitialWordMatrix w).a*(lowerInitialWordMatrix w).d -
(lowerInitialWordMatrix w).b*(lowerInitialWordMatrix w).c = (-1:ℝ)^w.length)
(hcd : ∀ w : List ℕ+, (lowerInitialWordMatrix w).c = ((lowerCD w).1:ℝ) ∧ (lowerInitialWordMatrix w).d = ((lowerCD w).2:ℝ))
(p : LowerPair) (hd : lowerEntryDomain p) : lowerNormalize p = p := by
sorrySource
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