The asymptotic cost of a Proposition 18 call, from the numeric side conditions and the logarithmic factor…

Proved

NLogN.KFV.cost18_of

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

complexity-theoryinteger-multiplicationkappa-improvement

The asymptotic cost of a Proposition 18 call, from the numeric side conditions and the logarithmic factor of the Kronecker products.

The following holds (Lean statement, in the scope of module Solutions.KFV61Cost):

theorem NLogN.KFV.cost18_of (HPar : Par18Need) (HL : Log18Need) : Cost18

Context. The lemma belongs to the part KFV §61: the asymptotic cost of a Proposition 18 call (Cost18).

Formalization Note. This lemma belongs to layer 5 of the Lean formalization (integer-multiplication-kappa campaign) of the OpenAI preprint Integer multiplication below $n\log n$ : the uniform item-language machine (register programs over the NLogN multitape framework) assembling the Proposition 14 / Lemma 13 / Proposition 18 pieces, the resampling and chirp stages and the cost recurrences into one fixed machine, culminating in NLogN.KFTop.kappa_bound : IntMul.KappaBound (1 / 2 ^ 182) (the bound of Def_IntMul_MultitapeModel). All names refer to the definition bundles up to IntMul_Kappa_K_Defs33.

Preamble

-- OpenAI-preprint / κ-improvement development (integer-multiplication-kappa), generated by skeleton subtraction.

import Definitions.Def_IntMul_Kappa_K_Defs33

set_option autoImplicit false
set_option relaxedAutoImplicit false
set_option maxHeartbeats 1000000

set_option linter.unusedSectionVars false
set_option linter.unusedSimpArgs false
set_option linter.unusedVariables false
open NLogN
open NLogN.KFV
open IntMul RS KIL KFD KFB KFH KFC KFT Synth AModel AModelL12 GlueLayout GlueP14 GlueError
open IntMul.OpenAI.Glue IntMul.OpenAI.RCost
set_option maxHeartbeats 8000000

Formal statement

theorem NLogN.KFV.cost18_of (HPar : Par18Need) (HL : Log18Need) : Cost18 := by sorry

Source

OpenAI, Integer multiplication below n log n (preprint, 23 Sep 2026), https://github.com/openai/math/tree/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026. Lemma `NLogN.KFV.cost18_of` of the Lean development Solutions/KFV61Cost.lean (lines 154–398), integer-multiplication-kappa campaign.

View graph