Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Round six: normalization of the CrudeAssembly hypotheses to a parameter record

Proved
IntMul.Kappa.R6.r6_normalize

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

complexity-theoryinteger-multiplicationkappa-improvement

Let ab,ac≥0a_b, a_c \ge 0ab​,ac​≥0 be the savings of S. Jain's round-six bit and complex networks, i.e. assume the moment bounds

μ1−ab(hbit;529)<148225616,μ1−ac(hC;576)<207387136,\mu_{1-a_b}(h_{\mathrm{bit}}; 529) < 148225616, \qquad \mu_{1-a_c}(h_{\mathbb C}; 576) < 207387136,μ1−ab​​(hbit​;529)<148225616,μ1−ac​​(hC​;576)<207387136,

where μτ(h;m)=∑(w,nw)∈hnw (w/m)τ\mu_\tau(h; m) = \sum_{(w,n_w) \in h} n_w\,(w/m)^{\tau}μτ​(h;m)=∑(w,nw​)∈h​nw​(w/m)τ is the moment of the child-width histograms hbit=h_{\mathrm{bit}} = hbit​= Jain.bitR6, hC=h_{\mathbb C} = hC​= Jain.cxR6 (from Def_IntMul_KappaJainData). Assume further the crude-assembly constraints CrudeAssembly (ab,ac,β=1/1000,ε,x,C1,κ,576,sc)(a_b, a_c, \beta = 1/1000, \varepsilon, x, C_1, \kappa, 576, s_c)(ab​,ac​,β=1/1000,ε,x,C1​,κ,576,sc​) of the κ framework, with scs_csc​ the rank sum of hCh_{\mathbb C}hC​.

Then there is a parameter record P=(τ,σ,ε′,λ′,x′,C1′)P = (\tau, \sigma, \varepsilon', \lambda', x', C_1')P=(τ,σ,ε′,λ′,x′,C1′​) with PPP satisfying all the constraints Prm.Ok (in particular 1/2≤ε′<11/2 \le \varepsilon' < 11/2≤ε′<1, 0<τ,σ≤10 < \tau, \sigma \le 10<τ,σ≤1, natural x′≥1x' \ge 1x′≥1), with κ<gap(P)\kappa < \mathrm{gap}(P)κ<gap(P) (the minimum of the five cost margins), with the two moment bounds holding at the exponents τ=P.τ\tau = P.\tauτ=P.τ and σ=P.σ\sigma = P.\sigmaσ=P.σ, and with the depth-guard condition

2+576log⁡sc≤C1′.2 + 576 \log s_c \le C_1'.2+576logsc​≤C1′​.

This is the first step of the round-six argument: all later statements are parametrized by such a record PPP, and the reduction to ε≥1/2\varepsilon \ge 1/2ε≥1/2 means only one cost regime has to be treated.

In Lean:

theorem IntMul.Kappa.R6.r6_normalize (ab ac ε x C₁ κ : ℝ) (hab : 0 ≤ ab) (hac : 0 ≤ ac)
    (hbit : histMoment Jain.bitR6 529 (1 - ab) < 148225616)
    (hcx : histMoment Jain.cxR6 576 (1 - ac) < 207387136)
    (hasm : CrudeAssembly ab ac (1 / 1000) ε x C₁ κ 576 (histRankSum Jain.cxR6)) :
    ∃ P : Prm, P.Ok ∧ κ < P.gap ∧ histMoment Jain.bitR6 529 P.τ < 148225616 ∧
      histMoment Jain.cxR6 576 P.σ < 207387136 ∧
      2 + 576 * Real.log (histRankSum Jain.cxR6) ≤ P.C1

Formalization Note. Part of the Lean formalization of the round-six κ-improvement (integer-multiplication-kappa campaign, target IntMul.Kappa.jain_round6_framework). The statement is copied verbatim from the Lean development; the platform node carries the same declaration name. Definitions it mentions live in the IntMul_Kappa_R6_Defs* bundles (on top of the published κ bundles IntMul_Kappa_K_Defs*).

Preamble
-- Round-six κ development (integer-multiplication-kappa), generated by skeleton subtraction.

import Definitions.Def_IntMul_Kappa_R6_Defs1
import Definitions.Def_IntMul_KappaJainData

set_option autoImplicit false
set_option relaxedAutoImplicit false
set_option maxHeartbeats 1000000

open IntMul IntMul.Kappa IntMul.Kappa.R6
open IntMul.Kappa
Formal statement
theorem IntMul.Kappa.R6.r6_normalize (ab ac ε x C₁ κ : ℝ) (hab : 0 ≤ ab) (hac : 0 ≤ ac)
    (hbit : histMoment Jain.bitR6 529 (1 - ab) < 148225616)
    (hcx : histMoment Jain.cxR6 576 (1 - ac) < 207387136)
    (hasm : CrudeAssembly ab ac (1 / 1000) ε x C₁ κ 576 (histRankSum Jain.cxR6)) :
    ∃ P : Prm, P.Ok ∧ κ < P.gap ∧ histMoment Jain.bitR6 529 P.τ < 148225616 ∧
      histMoment Jain.cxR6 576 P.σ < 207387136 ∧
      2 + 576 * Real.log (histRankSum Jain.cxR6) ≤ P.C1 := by sorry
Source
S. Jain, round-six networks for the integer-multiplication κ-improvement campaign (https://github.com/Swapnil-jain/integer-mult-kappa, commit 5868dc7) and D. Colkitt, integer-mult-bounds (https://github.com/CrocSwap/integer-mult-bounds); target `IntMul.Kappa.jain_round6_framework`. Lean declaration `IntMul.Kappa.R6.r6_normalize`, Solutions/R6Norm.lean (lines 70–171) of the round-six development.

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