The `B₀` pass of the machine in the round-six regime (round six, `r6_passB`)
ProvedJ6Seg.r6_passBcomplexity-theoryinteger-multiplicationkappa-improvement
The B₀ pass of the machine in the round-six regime.
The following holds (Lean statement, in the scope of module Solutions.J6SegLn12):
theorem J6Seg.r6_passB (P : Prm) (hP : P.Ok) : ∃ n₁ : ℕ, ∀ n, n₁ ≤ n → ∀ src : ℕ → ℕ,
SrcOK6 P n src → ∀ D : ℕ, dP6 P n = D + 1 →
∀ [∀ i, NeZero (sD6 src D i)] [∀ i, NeZero (tD6 P n D i)],
∀ M : AxisMaps6 (αN6 P n) (sD6 src D) (tD6 P n D), FitSpec6 P n src D M →
∀ (ys : List GI) (y : ((i : Fin (D + 1)) → ZMod (tD6 P n D i)) → ℂ),
RepFull (pP6 P n) (tD6 P n D) ys y → ‖y‖ ≤ 1 →
RepPad (pP6 P n) (sD6 src D) (tD6 P n D)
(tensorGo (mapsLine6 P n src D) (List.ofFn (tD6 P n D)) ys)
(vOf (pP6 P n) (sD6 src D) (tD6 P n D)
(tensorGo (mapsLine6 P n src D) (List.ofFn (tD6 P n D)) ys)) ∧
NLogN.KFB.GB (pP6 P n + 2) (tensorGo (mapsLine6 P n src D) (List.ofFn (tD6 P n D)) ys) ∧
‖vOf (pP6 P n) (sD6 src D) (tD6 P n D)
(tensorGo (mapsLine6 P n src D) (List.ofFn (tD6 P n D)) ys) -
tensCLM (kerB M.B) y‖ ≤ errW6 P n * hp (pP6 P n)
Context. Segmented inverse (S2), machine side 12: the B₀ pass in the round-six regime
LJ_length_ge: the near-boundary line has at least2w + 1positions ([0,w),[s-w,s)and the cutλ), so the cyclic coupling windowK = wfits;FitSpec6 M: the per-axis properties ofr6_axisMaps_fit(‖B_i‖ ≤ 1/2, theS̃andB̃₀bounds,B̃₀ 0 = 0);r6_fitSpec: suchMexist forn ≥ n₁;mapsLine6: the machine's line maps (lineBwithλ = lamP d,w = K = wF d,n_c = t_i/λ,R = ⌊p/7⌋,P = segPF p d s_i);r6_passB: forn ≥ n₁, every source list, everyMwithFitSpec6 Mand everyRepFull ys y,‖y‖ ≤ 1: thetensorGoof the machine's line maps isRepPadof avwithGB (p+2)and‖v − tensCLM (kerB M.B) y‖ ≤ errW6 · 2^{-p}— the representation and error part of theeBclause ofLineBody6.
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*).
Preamble
-- Round-six κ development (integer-multiplication-kappa), generated by skeleton subtraction. import Definitions.Def_IntMul_Kappa_R6_Defs62 set_option autoImplicit false set_option relaxedAutoImplicit false set_option maxHeartbeats 1000000 open J6Seg open Complex open IntMul IntMul.HvdH IntMul.HvdH.Ref IntMul.HvdH.RefPf NLogN.KFM NLogN.KFY IntMul.OpenAI.RT open IntMul.Kappa.R6 open NLogN.KFB (GI gflat)
Formal statement
theorem J6Seg.r6_passB (P : Prm) (hP : P.Ok) : ∃ n₁ : ℕ, ∀ n, n₁ ≤ n → ∀ src : ℕ → ℕ,
SrcOK6 P n src → ∀ D : ℕ, dP6 P n = D + 1 →
∀ [∀ i, NeZero (sD6 src D i)] [∀ i, NeZero (tD6 P n D i)],
∀ M : AxisMaps6 (αN6 P n) (sD6 src D) (tD6 P n D), FitSpec6 P n src D M →
∀ (ys : List GI) (y : ((i : Fin (D + 1)) → ZMod (tD6 P n D i)) → ℂ),
RepFull (pP6 P n) (tD6 P n D) ys y → ‖y‖ ≤ 1 →
RepPad (pP6 P n) (sD6 src D) (tD6 P n D)
(tensorGo (mapsLine6 P n src D) (List.ofFn (tD6 P n D)) ys)
(vOf (pP6 P n) (sD6 src D) (tD6 P n D)
(tensorGo (mapsLine6 P n src D) (List.ofFn (tD6 P n D)) ys)) ∧
NLogN.KFB.GB (pP6 P n + 2) (tensorGo (mapsLine6 P n src D) (List.ofFn (tD6 P n D)) ys) ∧
‖vOf (pP6 P n) (sD6 src D) (tD6 P n D)
(tensorGo (mapsLine6 P n src D) (List.ofFn (tD6 P n D)) ys) -
tensCLM (kerB M.B) y‖ ≤ errW6 P n * hp (pP6 P n) := by sorrySource
S. Jain, round-six networks for the integer-multiplication κ-improvement campaign (https://github.com/Swapnil-jain/integer-mult-kappa, commit 5868dc7) and D. Colkitt, integer-mult-bounds (https://github.com/CrocSwap/integer-mult-bounds); target `IntMul.Kappa.jain_round6_framework`. Lean declaration `J6Seg.r6_passB`, Solutions/J6SegLn12.lean (lines 113–225) of the round-six development.