Agarwal–Cooley: CRT turns cyclic convolution on into 2-D cyclic convolution
ProvedIntMul.HvdH.crt_convfourier-analysisinteger-multiplication
Let be coprime, a commutative ring, and the Chinese remainder ring isomorphism. For and every ,
In words, reindexing by turns a one-dimensional cyclic convolution of length into a two-dimensional cyclic convolution of size .
This is the Agarwal–Cooley step used in §5.3 (proof of Proposition 5.4) of Harvey–van der Hoeven to turn a length convolution into a -dimensional one.
Preamble
import Mathlib
Formal statement
namespace IntMul.HvdH
theorem crt_conv {R : Type*} [CommRing R] {a b : ℕ} [NeZero a] [NeZero b]
(h : Nat.Coprime a b) (u v : ZMod (a * b) → R) (x : ZMod a × ZMod b) :
∑ j : ZMod (a * b), u j * v ((ZMod.chineseRemainder h).symm x - j) =
∑ y : ZMod a × ZMod b, u ((ZMod.chineseRemainder h).symm y) *
v ((ZMod.chineseRemainder h).symm (x - y)) := 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, Sections 2.4 and 5.3