Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Round-six assembly at one parameter record with rational ε

Proved
IntMul.Kappa.R6.kappa_final6_at

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

complexity-theoryinteger-multiplicationkappa-improvement

For one round-six parameter record PPP with P.OkP.\mathrm{Ok}P.Ok and rational ε\varepsilonε, and κ<P.gap\kappa<P.\mathrm{gap}κ<P.gap: the interfaces SetupNeed6 P, CrtNeed6 P, FineNeed6 P, LineNeed6 P, P14Need6 P, P18IL6 P, the histogram moment bounds for the bit and complex networks, the bound 2+576log⁡(histRankSum(cxR6))≤P.C12+576\log(\mathrm{histRankSum}(\mathrm{cxR6}))\le P.C_12+576log(histRankSum(cxR6))≤P.C1​, the bit network statement and a complex network interface together give IntMul.KappaBound κ.

In Lean:

theorem IntMul.Kappa.R6.kappa_final6_at (P : Prm) (hP : P.Ok) (hq : ∃ q : ℚ, P.ε = q) (κ : ℝ) (hκ : κ < P.gap)
    (hSet : SetupNeed6 P) (hCrt : CrtNeed6 P) (hFine : FineNeed6 P) (hLine : LineNeed6 P)
    (hP14 : P14Need6 P) (hP18 : P18IL6 P)
    (hJb : histMoment Jain.bitR6 529 P.τ < 148225616)
    (hJc : histMoment Jain.cxR6 576 P.σ < 207387136)
    (hC1 : 2 + 576 * Real.log (histRankSum Jain.cxR6) ≤ P.C1)
    (hBit : Bit.BitNetR6MomStmt)
    (hCx : ∃ T, ∃ J : Cx.Prop8IfaceH 207387136 T 576 Jain.cxR6, ∃ A, IL3H.GClassH J A) :
    IntMul.KappaBound κ

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_Defs16
import Definitions.Def_IntMul_Kappa_R6_Defs21
import Definitions.Def_IntMul_Kappa_R6_Defs2

set_option autoImplicit false
set_option relaxedAutoImplicit false
set_option maxHeartbeats 1000000

open IntMul IntMul.Kappa IntMul.Kappa.R6
open Finset IntMul NLogN NLogN.KIL NLogN.KFB NLogN.KFT NLogN.KFU NLogN.RS IntMul.OpenAI.Glue IntMul.OpenAI.RCost NLogN.KFM
Formal statement
theorem IntMul.Kappa.R6.kappa_final6_at (P : Prm) (hP : P.Ok) (hq : ∃ q : ℚ, P.ε = q) (κ : ℝ) (hκ : κ < P.gap)
    (hSet : SetupNeed6 P) (hCrt : CrtNeed6 P) (hFine : FineNeed6 P) (hLine : LineNeed6 P)
    (hP14 : P14Need6 P) (hP18 : P18IL6 P)
    (hJb : histMoment Jain.bitR6 529 P.τ < 148225616)
    (hJc : histMoment Jain.cxR6 576 P.σ < 207387136)
    (hC1 : 2 + 576 * Real.log (histRankSum Jain.cxR6) ≤ P.C1)
    (hBit : Bit.BitNetR6MomStmt)
    (hCx : ∃ T, ∃ J : Cx.Prop8IfaceH 207387136 T 576 Jain.cxR6, ∃ A, IL3H.GClassH J A) :
    IntMul.KappaBound κ := 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.kappa_final6_at`, Solutions/R6MFinal.lean (lines 28–110) 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