Coefficient bound for (nega)cyclic products:
ProvedIntMul.HvdH.coeff_boundinteger-multiplication
Let and let have entries of absolute value at most . For any signs (more generally any weights with ) and any ,
With the negacyclic signs this bounds the coefficients of a product in , as in the remark before Lemma 2.5 of Harvey–van der Hoeven ().
Preamble
import Mathlib
Formal statement
namespace IntMul.HvdH
theorem coeff_bound {r : ℕ} [NeZero r] (a b : ZMod r → ℤ) (M : ℤ) (ha : ∀ k, |a k| ≤ M)
(hb : ∀ k, |b k| ≤ M) (s : ZMod r → ZMod r → ℤ) (hs : ∀ k j, |s k j| ≤ 1) (j : ZMod r) :
|∑ k, a k * b (j - k) * s k j| ≤ r * M ^ 2 := by sorry
end IntMul.HvdHSource
Harvey, van der Hoeven, Integer multiplication in time O(n log n), Annals of Math. 193 (2021), https://hal.science/hal-02070778, Section 2.5, Lemma 2.5 (Kronecker substitution)