Round six: normalization of the CrudeAssembly hypotheses to a parameter record
ProvedIntMul.Kappa.R6.r6_normalizeLet be the savings of S. Jain's round-six bit and complex networks, i.e. assume the moment bounds
where is the moment of the child-width histograms Jain.bitR6, Jain.cxR6 (from Def_IntMul_KappaJainData). Assume further the crude-assembly constraints CrudeAssembly of the κ framework, with the rank sum of .
Then there is a parameter record with satisfying all the constraints Prm.Ok (in particular , , natural ), with (the minimum of the five cost margins), with the two moment bounds holding at the exponents and , and with the depth-guard condition
This is the first step of the round-six argument: all later statements are parametrized by such a record , and the reduction to means only one cost regime has to be treated.
In Lean:
theorem IntMul.Kappa.R6.r6_normalize (ab ac ε x C₁ κ : ℝ) (hab : 0 ≤ ab) (hac : 0 ≤ ac)
(hbit : histMoment Jain.bitR6 529 (1 - ab) < 148225616)
(hcx : histMoment Jain.cxR6 576 (1 - ac) < 207387136)
(hasm : CrudeAssembly ab ac (1 / 1000) ε x C₁ κ 576 (histRankSum Jain.cxR6)) :
∃ P : Prm, P.Ok ∧ κ < P.gap ∧ histMoment Jain.bitR6 529 P.τ < 148225616 ∧
histMoment Jain.cxR6 576 P.σ < 207387136 ∧
2 + 576 * Real.log (histRankSum Jain.cxR6) ≤ P.C1
Formalization Note. Part of the Lean formalization of the round-six κ-improvement (integer-multiplication-kappa campaign, target IntMul.Kappa.jain_round6_framework). The statement is copied verbatim from the Lean development; the platform node carries the same declaration name. Definitions it mentions live in the IntMul_Kappa_R6_Defs* bundles (on top of the published κ bundles IntMul_Kappa_K_Defs*).
-- Round-six κ development (integer-multiplication-kappa), generated by skeleton subtraction. import Definitions.Def_IntMul_Kappa_R6_Defs1 import Definitions.Def_IntMul_KappaJainData set_option autoImplicit false set_option relaxedAutoImplicit false set_option maxHeartbeats 1000000 open IntMul IntMul.Kappa IntMul.Kappa.R6 open IntMul.Kappa
theorem IntMul.Kappa.R6.r6_normalize (ab ac ε x C₁ κ : ℝ) (hab : 0 ≤ ab) (hac : 0 ≤ ac)
(hbit : histMoment Jain.bitR6 529 (1 - ab) < 148225616)
(hcx : histMoment Jain.cxR6 576 (1 - ac) < 207387136)
(hasm : CrudeAssembly ab ac (1 / 1000) ε x C₁ κ 576 (histRankSum Jain.cxR6)) :
∃ P : Prm, P.Ok ∧ κ < P.gap ∧ histMoment Jain.bitR6 529 P.τ < 148225616 ∧
histMoment Jain.cxR6 576 P.σ < 207387136 ∧
2 + 576 * Real.log (histRankSum Jain.cxR6) ≤ P.C1 := by sorry