Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Approximation of the diagonal resampling map D′\mathcal D'D′ (Lemma 4.8)

Proved
IntMul.HvdH.Dapprox_bound

by xuanji · Oct 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

integer-multiplication

Let p,s,t,αp,s,t,\alphap,s,t,α be integers with s≥1s\ge1s≥1, α≥2\alpha\ge2α≥2 and α2≤p\alpha^2\le pα2≤p. Let Uℓ∈Z[i]U_\ell\in\mathbb Z[i]Uℓ​∈Z[i] with ∣Uℓ∣≤2p|U_\ell|\le2^p∣Uℓ​∣≤2p, so that uℓ=2−pUℓu_\ell=2^{-p}U_\elluℓ​=2−pUℓ​ lies in the unit disc. Put βℓ=tℓ/s−⌊tℓ/s+12⌋\beta_\ell=t\ell/s-\lfloor t\ell/s+\tfrac12\rfloorβℓ​=tℓ/s−⌊tℓ/s+21​⌋ and dℓ′=eπα2βℓ2/22α2−2d'_\ell=e^{\pi\alpha^2\beta_\ell^2}/2^{2\alpha^2-2}dℓ′​=eπα2βℓ2​/22α2−2. Then the output ZℓZ_\ellZℓ​ of Dapprox (see IntMul_HvdH_DiagApprox) satisfies

2p∣2−pZℓ−dℓ′uℓ∣<3,2^p\bigl|2^{-p}Z_\ell-d'_\ell u_\ell\bigr|<3,2p​2−pZℓ​−dℓ′​uℓ​​<3,

i.e. ε(D~′u)<3\varepsilon(\tilde{\mathcal D}'u)<3ε(D~′u)<3. This is Lemma 4.8 of Harvey–van der Hoeven, which has the bound 444.

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.HvdH
Source
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)

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me