Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Multidimensional convolution formula over a ring with principal power-of-two roots (synthetic case of (2.1))

Proved
IntMul.HvdH.synthetic_conv

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

fourier-analysisinteger-multiplication

Let RRR be a commutative ring, d≥0d\ge0d≥0, and for each iii let ni=2ei+1n_i=2^{e_i+1}ni​=2ei​+1 and ωi∈R\omega_i\in Rωi​∈R with ωi2ei=−1\omega_i^{2^{e_i}}=-1ωi2ei​​=−1. Write ωix\omega_i^{x}ωix​ for ωixˉ\omega_i^{\bar x}ωixˉ​ when x∈Z/nix\in\mathbb Z/n_ix∈Z/ni​ (well defined since ωini=1\omega_i^{n_i}=1ωini​​=1). For u,v:∏iZ/ni→Ru,v:\prod_i\mathbb Z/n_i\to Ru,v:∏i​Z/ni​→R and every index jjj,

n1⋯nd (u∗v)j=∑t∏iωitiji(∑k∏iωi−tikiuk)(∑k∏iωi−tikivk),n_1\cdots n_d\,(u*v)_j=\sum_{t}\prod_i\omega_i^{t_ij_i}\Big(\sum_k\prod_i\omega_i^{-t_ik_i}u_k\Big)\Big(\sum_k\prod_i\omega_i^{-t_ik_i}v_k\Big),n1​⋯nd​(u∗v)j​=t∑​i∏​ωiti​ji​​(k∑​i∏​ωi−ti​ki​​uk​)(k∑​i∏​ωi−ti​ki​​vk​),

where (u∗v)j=∑kukvj−k(u*v)_j=\sum_k u_k v_{j-k}(u∗v)j​=∑k​uk​vj−k​ is multidimensional cyclic convolution.

This is the convolution formula (2.1) of Harvey–van der Hoeven in the synthetic case R=C[y]/(yr+1)R=\mathbb C[y]/(y^r+1)R=C[y]/(yr+1), ωi=y2r/ti\omega_i=y^{2r/t_i}ωi​=y2r/ti​. It underlies Proposition 3.4 (convolution over RRR via synthetic FFTs). The ring may have zero divisors; only ωi2ei=−1\omega_i^{2^{e_i}}=-1ωi2ei​​=−1 is used.

Preamble
import Mathlib
Formal statement
namespace IntMul.HvdH
theorem synthetic_conv {R : Type*} [CommRing R] {d : ℕ} (e : Fin d → ℕ) (ω : Fin d → R) (hω : ∀ i, ω i ^ (2 ^ e i) = -1)
    (u v : ((i : Fin d) → ZMod (2 ^ (e i + 1))) → R) (j : (i : Fin d) → ZMod (2 ^ (e i + 1))) :
    (∏ i, ((2 ^ (e i + 1) : ℕ) : R)) * ∑ k, u k * v (j - k) =
      ∑ t : (i : Fin d) → ZMod (2 ^ (e i + 1)), (∏ i, ω i ^ (t i * j i).val) *
        ((∑ k, (∏ i, ω i ^ (-(t i * k i)).val) * u k) *
          (∑ k, (∏ i, ω i ^ (-(t i * k i)).val) * v k)) := 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, Sections 2.4 and 3.1 (Lemma 2.3, (2.1), Lemma 3.2)

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