Truncated approximation of the off-diagonal map (Lemma 4.11)
ProvedIntMul.HvdH.Eapprox_boundinteger-multiplication
Let be integers with and . Let with , so that lies in the unit disc. Let . Then the output of Eapprox (see IntMul_HvdH_EApprox) satisfies
that is, .
This is Lemma 4.11 of Harvey–van der Hoeven, where the bound is . The proof uses for to bound the tail by , and Lemma 2.13 with rounding for each of the remaining terms.
Preamble
import Definitions.Def_IntMul_HvdH_EApprox import Theorems.Thm_IntMul_HvdH_expNeg_bound
Formal statement
namespace IntMul.HvdH
theorem Eapprox_bound (p s t α l : ℕ) (hs : 0 < s) (hst : s ≤ t) (hα : 1 ≤ α)
(U : ℕ → ℤ × ℤ) (hU : ∀ i, ‖((U i).1 : ℂ) + ((U i).2 : ℂ) * Complex.I‖ ≤ 2 ^ p) :
‖(((Eapprox p s t α U l).1 : ℂ) + ((Eapprox p s t α U l).2 : ℂ) * Complex.I) -
2 ^ p * Eexact s t α (fun i => (((U i).1 : ℂ) + ((U i).2 : ℂ) * Complex.I) / 2 ^ p) l‖
≤ 5 * eWidth p α + 5 := 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, Lemma 4.11