Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

HvdH §5.1 — parameter estimates (5.1)–(5.9)

Proved
IntMul.HvdH.parameters_5_1

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

complexity-theoryinteger-multiplication

Let d≥2d\ge2d≥2 and n≥n0:=2d12n\ge n_0:=2^{d^{12}}n≥n0​:=2d12. Define

b:=⌈log⁡2n⌉,p:=6b,α:=⌈(12d2b)1/4⌉,γ:=2dα2,b:=\lceil\log_2n\rceil,\quad p:=6b,\quad\alpha:=\big\lceil(12d^2b)^{1/4}\big\rceil,\quad\gamma:=2d\alpha^2,b:=⌈log2​n⌉,p:=6b,α:=⌈(12d2b)1/4⌉,γ:=2dα2,

let TTT be the power of two with 4n/b≤T<8n/b4n/b\le T<8n/b4n/b≤T<8n/b, and let rrr be the power of two with T1/d≤r<2T1/dT^{1/d}\le r<2T^{1/d}T1/d≤r<2T1/d. Then:

  • (5.1), (5.2): b≥d12≥4096b\ge d^{12}\ge4096b≥d12≥4096 and p≥100p\ge100p≥100;
  • (5.4): 2≤α<2b7/24<p1/22\le\alpha<2b^{7/24}<p^{1/2}2≤α<2b7/24<p1/2;
  • (5.5): γ<8b2/3\gamma<8b^{2/3}γ<8b2/3;
  • (5.8): r≥2d10r\ge2^{d^{10}}r≥2d10;
  • (5.9): T<n≤2bT<n\le2^bT<n≤2b and T<2pT<2^pT<2p;
  • the factorisation: there is 0≤d′<d0\le d'<d0≤d′<d with T=(r/2)d′ rd−d′T=(r/2)^{d'}\,r^{d-d'}T=(r/2)d′rd−d′ (so T=t1⋯tdT=t_1\cdots t_dT=t1​⋯td​ with t1=⋯=td′=r/2t_1=\dots=t_{d'}=r/2t1​=⋯=td′​=r/2 and td′+1=⋯=td=rt_{d'+1}=\dots=t_d=rtd′+1​=⋯=td​=r), and r≥4r\ge4r≥4, so every ti≥2t_i\ge2ti​≥2.

Formalization note: ⌈log⁡2n⌉\lceil\log_2n\rceil⌈log2​n⌉ is Nat.clog 2 n; real powers are Real.rpow; r/2r/2r/2 is natural-number division (exact, since r≥4r\ge4r≥4 is a power of two). TTT and rrr are universally quantified but uniquely determined by the hypotheses.

Preamble
import Mathlib
Formal statement
namespace IntMul.HvdH

theorem parameters_5_1 (d : ℕ) (hd : 2 ≤ d) (n : ℕ) (hn : 2 ^ (d ^ 12) ≤ n)
    (b p α γ T r : ℕ) (hb : b = Nat.clog 2 n) (hp : p = 6 * b)
    (hα : α = ⌈((12 * d ^ 2 * b : ℕ) : ℝ) ^ ((1 : ℝ) / 4)⌉₊) (hγ : γ = 2 * d * α ^ 2)
    (hTpow : ∃ k : ℕ, T = 2 ^ k) (hT1 : 4 * (n : ℝ) / b ≤ T) (hT2 : (T : ℝ) < 8 * (n : ℝ) / b)
    (hrpow : ∃ j : ℕ, r = 2 ^ j) (hr1 : (T : ℝ) ^ ((1 : ℝ) / d) ≤ r)
    (hr2 : (r : ℝ) < 2 * (T : ℝ) ^ ((1 : ℝ) / d)) :
    -- (5.1), (5.2)
    (d ^ 12 ≤ b ∧ 4096 ≤ b ∧ 100 ≤ p) ∧
    -- (5.4)
    (2 ≤ α ∧ (α : ℝ) < 2 * (b : ℝ) ^ ((7 : ℝ) / 24) ∧
      2 * (b : ℝ) ^ ((7 : ℝ) / 24) < Real.sqrt p) ∧
    -- (5.5)
    (γ : ℝ) < 8 * (b : ℝ) ^ ((2 : ℝ) / 3) ∧
    -- (5.8)
    2 ^ (d ^ 10) ≤ r ∧
    -- (5.9)
    (T < n ∧ n ≤ 2 ^ b ∧ T < 2 ^ p) ∧
    -- the factorisation `T = t₁ ⋯ t_d` with `t₁ = ⋯ = t_{d'} = r/2`, `t_{d'+1} = ⋯ = t_d = r`
    (∃ d' : ℕ, d' < d ∧ (r / 2) ^ d' * r ^ (d - d') = T) ∧ 4 ≤ r := 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), §5 preamble and §5.1 Parameter selection, equations (5.1), (5.2), (5.3), (5.4), (5.5), (5.6), (5.7), (5.8), (5.9) and the factorisation T = t1···td, pp. 36–37.

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