Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Uniform Proposition 14 interface P14Need6 at every admissible round-six parameter record

Proved
IntMul.Kappa.R6.IL3H.p14Need6_all

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

complexity-theoryinteger-multiplicationkappa-improvement

For every round-six parameter record PPP with P.OkP.\mathrm{Ok}P.Ok, P14Need6 P holds: for every IL table tab with a canonical Lemma 12 code l12 (IL.L12Canon tab l12 P.τ), every complex network interface JJJ (Cx.Prop8IfaceH 207387136 T 576 Jain.cxR6) whose gates lie in the item-language gate class (IL3H.GClassH J A), if the histogram moment satisfies histMoment(cxR6,576,P.σ)<207387136\mathrm{histMoment}(\mathrm{cxR6},576,P.\sigma)<207387136histMoment(cxR6,576,P.σ)<207387136 and 2+576log⁡(histRankSum(cxR6))≤P.C12+576\log(\mathrm{histRankSum}(\mathrm{cxR6}))\le P.C_12+576log(histRankSum(cxR6))≤P.C1​, then there is a guard EwE_wEw​ with Ew(D)≤C DC1E_w(D)\le C\,D^{C_1}Ew​(D)≤CDC1​ for D≥1D\ge1D≥1 (EwOK6) such that the uniform Proposition 14 IL3.P14UH' tab Ew P.lamp holds.

In Lean:

theorem IntMul.Kappa.R6.IL3H.p14Need6_all (P : Prm) (hP : P.Ok) : P14Need6 P

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_Defs23

set_option autoImplicit false
set_option relaxedAutoImplicit false
set_option maxHeartbeats 1000000

open IntMul IntMul.Kappa IntMul.Kappa.R6 IntMul.Kappa.R6.IL3H
open IntMul AModel NLogN NLogN.KIL NLogN.KFD NLogN.KFB NLogN.KFG NLogN.KFH NLogN.KFN NLogN.KFW Complex P8Lift Butterfly IntMul.Kappa.R6.Cx IntMul.Kappa.R6.IL IntMul.Kappa.R6.IL3
Formal statement
theorem IntMul.Kappa.R6.IL3H.p14Need6_all (P : Prm) (hP : P.Ok) : P14Need6 P := 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.IL3H.p14Need6_all`, Solutions/R6IL3Cfg6.lean (lines 240–244) 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