Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

HvdH Proposition 5.4, step (3) — final error estimate ∥H′′−22bSw~∥<14\|H''-2^{2b}S\tilde w\|<\frac14∥H′′−22bSw~∥<41​

Proved
IntMul.HvdH.proposition_5_4_step3

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

complexity-theoryinteger-multiplication

Let n,b,p,γ,T,Sn,b,p,\gamma,T,Sn,b,p,γ,T,S be natural numbers with

b≥4096,p=6b,γ<8b2/3,1≤T<n≤2b,Tb<8n,S≤T,b\ge4096,\quad p=6b,\quad\gamma<8b^{2/3},\quad1\le T<n\le2^b,\quad Tb<8n,\quad S\le T,b≥4096,p=6b,γ<8b2/3,1≤T<n≤2b,Tb<8n,S≤T,

and let w,w~w,\tilde ww,w~ be vectors in a finite-dimensional space Cι\mathbb C^\iotaCι (supremum norm) with

2p ∥w~−w∥  <  2γ+8 T2log⁡2T.2^p\,\|\tilde w-w\| \;<\; 2^{\gamma+8}\,T^2\log_2T .2p∥w~−w∥<2γ+8T2log2​T.

Then, with H′′:=22bS wH'':=2^{2b}S\,wH′′:=22bSw,

∥H′′−22bS w~∥  <  14.\big\|H''-2^{2b}S\,\tilde w\big\|\;<\;\tfrac14 .​H′′−22bSw~​<41​.

This is the numerical heart of step (3) of the proof of Proposition 5.4: the bound ε(w~)<2γ+8T2log⁡2T\varepsilon(\tilde w)<2^{\gamma+8}T^2\log_2Tε(w~)<2γ+8T2log2​T is the error guarantee of Proposition 5.3, and the conclusion lets one recover the integer array H′′H''H′′ exactly by rounding 22bSw~2^{2b}S\tilde w22bSw~. (The paper's chain: 22bS∥w−w~∥≤22bT2−pε(w~)<22b+γ+8−pT3log⁡2T<2−b+γ+11<142^{2b}S\|w-\tilde w\|\le2^{2b}T2^{-p}\varepsilon(\tilde w)<2^{2b+\gamma+8-p}T^3\log_2T<2^{-b+\gamma+11}<\frac1422bS∥w−w~∥≤22bT2−pε(w~)<22b+γ+8−pT3log2​T<2−b+γ+11<41​, using T<n≤2bT<n\le2^bT<n≤2b, Tlog⁡2T≤Tb<8n≤2b+3T\log_2T\le Tb<8n\le2^{b+3}Tlog2​T≤Tb<8n≤2b+3 and γ<b−13\gamma<b-13γ<b−13.)

Preamble
import Mathlib
Formal statement
namespace IntMul.HvdH

theorem proposition_5_4_step3 (n b p γ T S : ℕ) (hb : 4096 ≤ b) (hp : p = 6 * b)
    (hγ : (γ : ℝ) < 8 * (b : ℝ) ^ ((2 : ℝ) / 3)) (hT1 : 1 ≤ T) (hTn : T < n) (hn : n ≤ 2 ^ b)
    (hTb : T * b < 8 * n) (hS : S ≤ T) {ι : Type*} [Fintype ι] (w w' : ι → ℂ)
    (herr : (2 : ℝ) ^ p * ‖w' - w‖ < (2 : ℝ) ^ (γ + 8) * (T : ℝ) ^ 2 * Real.logb 2 T) :
    ‖((2 : ℂ) ^ (2 * b) * S) • w - ((2 : ℂ) ^ (2 * b) * S) • w'‖ < 1 / 4 := by sorry

end IntMul.HvdH
Source
D. Harvey, J. van der Hoeven, Integer multiplication in time O(n log n), Ann. of Math. 193 (2021), https://doi.org/10.4007/annals.2021.193.2.4 (preprint https://hal.science/hal-02070778v2), proof of Proposition 5.4, step (3), p. 41 (the displayed estimates leading to ‖H'' − 2^{2b} S w̃‖ < 1/4), with (5.5), (5.6), (5.9).

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me