Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Twisting by ζj\zeta^jζj with ζr=−1\zeta^r=-1ζr=−1 turns cyclic into negacyclic convolution

Proved
IntMul.HvdH.twist_negacyclic

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

integer-multiplication

Let AAA be a commutative ring, r≥1r\ge1r≥1, and ζ∈A\zeta\in Aζ∈A with ζr=−1\zeta^r=-1ζr=−1. For u,v:Z/r→Au,v:\mathbb Z/r\to Au,v:Z/r→A put ak=ζkˉuka_k=\zeta^{\bar k}u_kak​=ζkˉuk​ and bk=ζkˉvkb_k=\zeta^{\bar k}v_kbk​=ζkˉvk​. Then the negacyclic convolution of a,ba,ba,b is the twist of the cyclic convolution of u,vu,vu,v: for every jjj,

∑kak bj−k sk,j=ζjˉ∑kukvj−k,sk,j={1kˉ≤jˉ−1kˉ>jˉ.\sum_k a_k\,b_{j-k}\,s_{k,j}=\zeta^{\bar j}\sum_k u_kv_{j-k},\qquad s_{k,j}=\begin{cases}1&\bar k\le\bar j\\-1&\bar k>\bar j.\end{cases}k∑​ak​bj−k​sk,j​=ζjˉ​k∑​uk​vj−k​,sk,j​={1−1​kˉ≤jˉ​kˉ>jˉ​.​

This is the coefficientwise form of the ring isomorphism S:(Cr,∗)→C[y]/(yr+1)S:(\mathbb C^r,*)\to\mathbb C[y]/(y^r+1)S:(Cr,∗)→C[y]/(yr+1), x↦ζyx\mapsto\zeta yx↦ζy, in Proposition 3.5 of Harvey–van der Hoeven.

Preamble
import Mathlib
Formal statement
namespace IntMul.HvdH
theorem twist_negacyclic {A : Type*} [CommRing A] (r : ℕ) [NeZero r] (ζ : A) (hζ : ζ ^ r = -1)
    (u v : ZMod r → A) (j : ZMod r) :
    ∑ k, (ζ ^ k.val * u k) * (ζ ^ (j - k).val * v (j - k)) * (if k.val ≤ j.val then 1 else -1) =
      ζ ^ j.val * ∑ k, u k * v (j - 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.3 and 3.2 (Proposition 3.5, map S)

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