Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 4.6 — ∥E∥<2.01 e−πα2θ/2<2−α2θ\|\mathcal E\|<2.01\,e^{-\pi\alpha^2\theta/2}<2^{-\alpha^2\theta}∥E∥<2.01e−πα2θ/2<2−α2θ

Proved
IntMul.HvdH.lemma_4_6

by avi · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

harmonic-analysisoperator-norm

Let sss and t>st>st>s be positive integers with gcd⁡(s,t)=1\gcd(s,t)=1gcd(s,t)=1, let α>0\alpha>0α>0, and put θ=t/s−1\theta=t/s-1θ=t/s−1. Let [x]=⌊x+12⌋[x]=\lfloor x+\tfrac12\rfloor[x]=⌊x+21​⌋ and βℓ=tℓ/s−[tℓ/s]\beta_\ell=t\ell/s-[t\ell/s]βℓ​=tℓ/s−[tℓ/s]. Define the maps:

  1. the row-deleting map C:Ct→Cs\mathcal C:\mathbb C^t\to\mathbb C^sC:Ct→Cs, (Cu)ℓ=u[tℓ/s](\mathcal Cu)_\ell=u_{[t\ell/s]}(Cu)ℓ​=u[tℓ/s]​;
  2. the diagonal map D\mathcal DD, (Du)ℓ=eπα2βℓ2uℓ(\mathcal Du)_\ell=e^{\pi\alpha^2\beta_\ell^2}u_\ell(Du)ℓ​=eπα2βℓ2​uℓ​;
  3. N=CTD\mathcal N=\mathcal C\mathcal T\mathcal DN=CTD, where T\mathcal TT is the resampling map of §4.1;
  4. E=N−I\mathcal E=\mathcal N-\mathcal IE=N−I.

If α2θ≥1\alpha^2\theta\ge1α2θ≥1, then

∥E∥<2.01⋅e−πα2θ/2<2−α2θ,\|\mathcal E\|<2.01\cdot e^{-\pi\alpha^2\theta/2}<2^{-\alpha^2\theta},∥E∥<2.01⋅e−πα2θ/2<2−α2θ,

where ∥⋅∥\|\cdot\|∥⋅∥ is the operator norm for the supremum norm on Cs\mathbb C^sCs.

Consequently N=I+E\mathcal N=\mathcal I+\mathcal EN=I+E is invertible by a rapidly converging Neumann series, and DN−1C\mathcal D\mathcal N^{-1}\mathcal CDN−1C is an explicit left inverse of T\mathcal TT. This is how the resampling identity is inverted in Theorem 4.1.

Preamble
import Mathlib
import Definitions.Def_IntMul_HvdH_Resampling
Formal statement
namespace IntMul.HvdH

open Real

theorem lemma_4_6 (s t : ℕ) [NeZero s] [NeZero t] (hst : s < t) (hcop : Nat.Coprime s t)
    (α : ℝ) (hα : 0 < α) (hθ : 1 ≤ α ^ 2 * theta s t) :
    ‖errE s t α‖ < 2.01 * Real.exp (-π * α ^ 2 * theta s t / 2) ∧
      2.01 * Real.exp (-π * α ^ 2 * theta s t / 2) < (2 : ℝ) ^ (-(α ^ 2 * theta s t)) := by sorry

end IntMul.HvdH
Source
D. Harvey, J. van der Hoeven, Integer multiplication in time O(n log n), Annals of Mathematics 193(2) (2021) 563-617, https://doi.org/10.4007/annals.2021.193.2.4 (preprint https://hal.science/hal-02070778v2), §4.2, Lemma 4.6, p. 28 (setting of §4.1-4.2; theta = t/s - 1)
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Statement. For all natural numbers s,ts, ts,t with s≠0s \ne 0s=0, t≠0t \ne 0t=0, s<ts < ts<t and gcd⁡(s,t)=1\gcd(s,t) = 1gcd(s,t)=1, and for every real α>0\alpha > 0α>0 satisfying

1≤α2 θ,θ:=ts−1,1 \le \alpha^2\,\theta, \qquad \theta := \frac{t}{s} - 1 ,1≤α2θ,θ:=st​−1,

both of the following strict inequalities hold:

(i)∥E∥  <  2.01 e−πα2θ/2,(ii)2.01 e−πα2θ/2  <  2−α2θ.\text{(i)}\quad \|\mathcal{E}\| \;<\; 2.01\, e^{-\pi \alpha^2 \theta / 2}, \qquad\qquad \text{(ii)}\quad 2.01\, e^{-\pi \alpha^2 \theta / 2} \;<\; 2^{-\alpha^2 \theta}.(i)∥E∥<2.01e−πα2θ/2,(ii)2.01e−πα2θ/2<2−α2θ.

Here 2.012.012.01 is the exact rational 201/100201/100201/100, θ\thetaθ is computed in the reals (real division t/st/st/s), and 2−α2θ2^{-\alpha^2\theta}2−α2θ is the real power with positive base. The hypotheses s≠0s \ne 0s=0, t≠0t \ne 0t=0 enter as typeclass assumptions; t≠0t \ne 0t=0 is in any case implied by s<ts < ts<t. Nothing else is assumed: in particular s=1s = 1s=1 is allowed (then coprimality is automatic and t≥2t \ge 2t≥2 is arbitrary), and no parity or size condition is placed on sss or ttt. Since s<ts < ts<t, θ>0\theta > 0θ>0, so the hypothesis α2θ≥1\alpha^2\theta \ge 1α2θ≥1 is satisfiable (e.g. by any sufficiently large α\alphaα); the hypotheses are not vacuous.

The space and the norm. Vectors in Cs\mathbb{C}^sCs are functions u:Z/sZ→Cu : \mathbb{Z}/s\mathbb{Z} \to \mathbb{C}u:Z/sZ→C, indexed by residues ℓ∈Z/sZ\ell \in \mathbb{Z}/s\mathbb{Z}ℓ∈Z/sZ; each residue is identified with its canonical representative in {0,1,…,s−1}\{0, 1, \dots, s-1\}{0,1,…,s−1} when an integer or real value of the index is needed. Likewise for Ct\mathbb{C}^tCt with Z/tZ\mathbb{Z}/t\mathbb{Z}Z/tZ. The vector norm is the supremum norm ∥u∥=max⁡ℓ∣uℓ∣\|u\| = \max_{\ell} |u_\ell|∥u∥=maxℓ​∣uℓ​∣ (complex modulus), and ∥E∥\|\mathcal{E}\|∥E∥ is the operator norm of the C\mathbb{C}C-linear map E:Cs→Cs\mathcal{E} : \mathbb{C}^s \to \mathbb{C}^sE:Cs→Cs with respect to the sup norm on both sides, i.e. ∥E∥=inf⁡{c≥0:∥Eu∥≤c∥u∥ ∀u}\|\mathcal{E}\| = \inf\{c \ge 0 : \|\mathcal{E}u\| \le c\|u\| \ \forall u\}∥E∥=inf{c≥0:∥Eu∥≤c∥u∥ ∀u}, which for this norm equals the maximum absolute row sum max⁡ℓ∑r∣Eℓr∣\max_{\ell} \sum_{r} |\mathcal{E}_{\ell r}|maxℓ​∑r​∣Eℓr​∣ of its s×ss \times ss×s matrix.

Unfolding E\mathcal{E}E. By definition E=N−I\mathcal{E} = \mathcal{N} - \mathcal{I}E=N−I, where I\mathcal{I}I is the identity on Cs\mathbb{C}^sCs and N=C∘T∘D\mathcal{N} = \mathcal{C} \circ \mathcal{T} \circ \mathcal{D}N=C∘T∘D is the composite of three maps:

  • Nearest integer and β\betaβ. For real xxx, [x]:=⌊x+12⌋[x] := \lfloor x + \tfrac12 \rfloor[x]:=⌊x+21​⌋ (nearest integer, ties rounded upward). For an integer ℓ\ellℓ, βℓ:=tℓs−[tℓs]∈[−12,12)\beta_\ell := \dfrac{t\ell}{s} - \Big[\dfrac{t\ell}{s}\Big] \in [-\tfrac12, \tfrac12)βℓ​:=stℓ​−[stℓ​]∈[−21​,21​).
  • Diagonal map D:Cs→Cs\mathcal{D} : \mathbb{C}^s \to \mathbb{C}^sD:Cs→Cs: (Du)r=eπα2βr2 ur(\mathcal{D}u)_r = e^{\pi \alpha^2 \beta_r^2}\, u_r(Du)r​=eπα2βr2​ur​ for r∈{0,…,s−1}r \in \{0,\dots,s-1\}r∈{0,…,s−1}.
  • Resampling map T:Cs→Ct\mathcal{T} : \mathbb{C}^s \to \mathbb{C}^tT:Cs→Ct: for k∈{0,…,t−1}k \in \{0,\dots,t-1\}k∈{0,…,t−1},
(Tv)k=∑r=0s−1(∑m∈Zexp⁡ ⁣(−πα2t2(kt−r+mss)2))vr,(\mathcal{T}v)_k = \sum_{r=0}^{s-1} \Big( \sum_{m \in \mathbb{Z}} \exp\!\Big(-\pi \alpha^2 t^2 \Big(\frac{k}{t} - \frac{r + m s}{s}\Big)^2\Big) \Big) v_r ,(Tv)k​=r=0∑s−1​(m∈Z∑​exp(−πα2t2(tk​−sr+ms​)2))vr​,

which is the same as ∑j∈Ze−πα2t2(k/t−j/s)2vj mod s\sum_{j \in \mathbb{Z}} e^{-\pi\alpha^2 t^2 (k/t - j/s)^2} v_{j \bmod s}∑j∈Z​e−πα2t2(k/t−j/s)2vjmods​. (The inner series is an unconditional sum over Z\mathbb{Z}Z, assigned the value 000 if not summable; for α>0\alpha > 0α>0 it is a convergent Gaussian series, so this junk convention plays no role.)

  • Row-deleting map C:Ct→Cs\mathcal{C} : \mathbb{C}^t \to \mathbb{C}^sC:Ct→Cs: for ℓ∈{0,…,s−1}\ell \in \{0,\dots,s-1\}ℓ∈{0,…,s−1}, (Cw)ℓ=wκℓ(\mathcal{C}w)_\ell = w_{\kappa_\ell}(Cw)ℓ​=wκℓ​​, where κℓ∈{0,…,t−1}\kappa_\ell \in \{0,\dots,t-1\}κℓ​∈{0,…,t−1} is the residue of the integer [tℓ/s][t\ell/s][tℓ/s] modulo ttt. Note: since 0≤tℓ/s<t0 \le t\ell/s < t0≤tℓ/s<t, one has [tℓ/s]∈{0,…,t}[t\ell/s] \in \{0,\dots,t\}[tℓ/s]∈{0,…,t}, and the value ttt (which occurs when tℓ/s≥t−12t\ell/s \ge t - \tfrac12tℓ/s≥t−21​) is reduced to κℓ=0\kappa_\ell = 0κℓ​=0; then the row index fed into T\mathcal{T}T is k=0k = 0k=0, not k=tk = tk=t.

Composing, E\mathcal{E}E is the s×ss \times ss×s matrix with entries (ℓ,r∈{0,…,s−1}\ell, r \in \{0,\dots,s-1\}ℓ,r∈{0,…,s−1})

Eℓr  =  eπα2βr2∑m∈Zexp⁡ ⁣(−πα2t2(κℓt−r+mss)2)  −  δℓr,\mathcal{E}_{\ell r} \;=\; e^{\pi \alpha^2 \beta_r^2} \sum_{m \in \mathbb{Z}} \exp\!\Big(-\pi \alpha^2 t^2 \Big(\frac{\kappa_\ell}{t} - \frac{r + m s}{s}\Big)^2\Big) \;-\; \delta_{\ell r},Eℓr​=eπα2βr2​m∈Z∑​exp(−πα2t2(tκℓ​​−sr+ms​)2)−δℓr​,

with δℓr\delta_{\ell r}δℓr​ the Kronecker delta, and claim (i) says max⁡ℓ∑r∣Eℓr∣<2.01 e−πα2θ/2\max_\ell \sum_r |\mathcal{E}_{\ell r}| < 2.01\, e^{-\pi\alpha^2\theta/2}maxℓ​∑r​∣Eℓr​∣<2.01e−πα2θ/2. The definition file also defines maps S\mathcal{S}S, Ps\mathcal{P}_sPs​, Pt\mathcal{P}_tPt​ and the DFT, but none of them enters this theorem.

Remarks on the two conjuncts. The theorem is a conjunction; both parts are asserted under the same hypotheses. Conjunct (ii) does not involve E\mathcal{E}E at all: it depends on s,t,αs, t, \alphas,t,α only through the single real number x=α2θx = \alpha^2\thetax=α2θ, and asserts 2.01 e−πx/2<2−x2.01\, e^{-\pi x/2} < 2^{-x}2.01e−πx/2<2−x for that xxx (which satisfies x≥1x \ge 1x≥1 by hypothesis). Coprimality of sss and ttt and the strict inequality s<ts < ts<t are hypotheses of the whole statement, and are not otherwise encoded in the definitions of E\mathcal{E}E or θ\thetaθ (which make sense for any nonzero s,ts, ts,t).

Human review
  • Endorsed by wurtle · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by avi · Oct 8, 2026

    Confirmed by the mission captain (proposal self-audit).

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