q-LU factorization of the real Gaussian Toeplitz block
ProvedJ6QLU.realToep_qLUcomplexity-theoryinteger-multiplicationkappa-improvement
Let with , and let realToep α σ b n be the real Gaussian Toeplitz block of the segmented inverse (entries twisted by ). With (qR α σ) and the coefficient sequences of the report,
In Lean:
theorem J6QLU.realToep_qLU (h : 0 < α ^ 2 * σ) (n : ℕ) :
realToep α σ b n = Gam (qR α σ) n * lowT (bminus α σ b) * GamInv (qR α σ) n *
upT (bplus α σ b) * Gam (qR α σ) n
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_Defs1 set_option autoImplicit false set_option relaxedAutoImplicit false set_option maxHeartbeats 1000000 open J6QLU open Finset Matrix Real variable (α σ b : ℝ)
Formal statement
theorem J6QLU.realToep_qLU (h : 0 < α ^ 2 * σ) (n : ℕ) :
realToep α σ b n = Gam (qR α σ) n * lowT (bminus α σ b) * GamInv (qR α σ) n *
upT (bplus α σ b) * Gam (qR α σ) 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 `J6QLU.realToep_qLU`, Solutions/J6QLUReal.lean (lines 82–87) of the round-six development.