Approximation of the diagonal resampling map (Lemma 4.8)
ProvedIntMul.HvdH.Dapprox_boundinteger-multiplication
Let be integers with , and . Let with , so that lies in the unit disc. Put and . Then the output of Dapprox (see IntMul_HvdH_DiagApprox) satisfies
i.e. . This is Lemma 4.8 of Harvey–van der Hoeven, which has the bound .
Preamble
import Definitions.Def_IntMul_HvdH_DiagApprox
Formal statement
namespace IntMul.HvdH
theorem Dapprox_bound (p s t α : ℕ) (hs : 0 < s) (hα : 2 ≤ α) (hαp : α ^ 2 ≤ p)
(U : ℕ → ℤ × ℤ) (hU : ∀ l, ‖((U l).1 : ℂ) + ((U l).2 : ℂ) * Complex.I‖ ≤ 2 ^ p) (l : ℕ) :
‖(((Dapprox p s t α U l).1 : ℂ) + ((Dapprox p s t α U l).2 : ℂ) * Complex.I) -
((Real.exp (Real.pi * α ^ 2 * ((t * l : ℝ) / s - ⌊(t * l : ℝ) / s + 1 / 2⌋) ^ 2) /
2 ^ (2 * α ^ 2 - 2) : ℝ) : ℂ) * (((U l).1 : ℂ) + ((U l).2 : ℂ) * Complex.I)‖ < 3 := 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.8 and Section 4.2 (definition of D)