Freiman repeated-three proof: offered domain
ProvedFreiman.lowerJ_offered_domaincertificatesfreimanlower-construction
Translate exactly the offered H7 and strict N–N width conditions to the original normalized scalar parameter box.
Preamble
import Definitions.Def_Freiman_lowerJData import Mathlib.Tactic.Linarith import Mathlib.Tactic.Push import Mathlib.Tactic.FinCases open Freiman
Formal statement
theorem Freiman.lowerJ_offered_domain (hw : ∀ w : List ℕ+, lowerWidth w = (lowerBeta-lowerAlpha)/((((lowerCD w).1:ℝ)*lowerAlpha+(lowerCD w).2)*(((lowerCD w).1:ℝ)*lowerBeta+(lowerCD w).2))) (t : ℝ) (p : LowerPair) (hs : lowerState t p) (hr : lowerRunOffered p) : lowerJDomain (lowerRatio (lowerNormalize p).1) (lowerRatio (lowerNormalize p).2) (lowerScale (lowerNormalize p)) := by sorry
Source
Freiman report j_family.tex and j_certificates.tex, equal-three-width and lower-j3-uniform; exact source width-criterion route.