Neumann-series approximation of (Lemma 4.12)
ProvedIntMul.HvdH.Japprox_boundinteger-multiplication
Let be integers with and , where , i.e. . Let = eWidth p α be the width of Lemma 4.11, and assume . Let with , and put . Let be a bounded solution of with , so that . Then the output of Japprox (see IntMul_HvdH_JApprox) satisfies, for every ,
This is Lemma 4.12 of Harvey–van der Hoeven, where the bound is . The proof uses (Lemma 4.6). Lemma 4.11 then shows inductively that each is within of . The tail is at most .
Preamble
import Definitions.Def_IntMul_HvdH_JApprox import Theorems.Thm_IntMul_HvdH_Eapprox_bound
Formal statement
namespace IntMul.HvdH
theorem Japprox_bound (p s t α : ℕ) (hs : 0 < s) (hx : s ≤ α ^ 2 * (t - s))
(hpB : 2 * (10 * eWidth p α + 12) ≤ 2 ^ p)
(U : ℕ → ℤ × ℤ) (hU : ∀ i, ‖((U i).1 : ℂ) + ((U i).2 : ℂ) * Complex.I‖ ≤ 2 ^ p)
(w : ℕ → ℂ) (hw : ∀ l, ‖w l‖ ≤ 1)
(hJ : ∀ l, w l + Eexact s t α w l = (((U l).1 : ℂ) + ((U l).2 : ℂ) * Complex.I) / 2 ^ p / 2)
(l : ℕ) :
‖(((Japprox p s t α U l).1 : ℂ) + ((Japprox p s t α U l).2 : ℂ) * Complex.I) - 2 ^ p * w l‖
≤ jIter p s t α * (10 * eWidth p α + 12) + 1 := 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.12