src_atoms (KFM SA: the cost of the source and inverse lists for `n`)

Proved

NLogN.KFM.src_atoms

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

complexity-theoryinteger-multiplicationkappa-improvement

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

theorem NLogN.KFM.src_atoms {n : ℕ} (hn : IntMul.OpenAI.Glue.n0 ≤ n) :
    let A := 2 ^ (2 * bP n + 2)
    dpN n ≤ A ∧ srcQ (IntMul.OpenAI.Glue.dP n) (IntMul.OpenAI.Glue.rP n) ≤ A ∧ srcM (IntMul.OpenAI.Glue.dP n) (IntMul.OpenAI.Glue.rP n) (IntMul.OpenAI.Glue.rP n / 2) ≤ A ∧
      srcM (IntMul.OpenAI.Glue.dP n) (IntMul.OpenAI.Glue.rP n) (IntMul.OpenAI.Glue.rP n) ≤ A ∧ IntMul.OpenAI.Glue.dP n ≤ A ∧ IntMul.OpenAI.Glue.rP n * IntMul.OpenAI.Glue.rP n ≤ A

Context. The lemma belongs to the part KFM SA: the cost of the source and inverse lists for n.

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.unusedSimpArgs false
open NLogN
open NLogN.KFM
open IntMul IntMul.OpenAI.Glue IntMul.OpenAI.RP RS

Formal statement

theorem NLogN.KFM.src_atoms {n : ℕ} (hn : IntMul.OpenAI.Glue.n0 ≤ n) :
    let A := 2 ^ (2 * bP n + 2)
    dpN n ≤ A ∧ srcQ (IntMul.OpenAI.Glue.dP n) (IntMul.OpenAI.Glue.rP n) ≤ A ∧ srcM (IntMul.OpenAI.Glue.dP n) (IntMul.OpenAI.Glue.rP n) (IntMul.OpenAI.Glue.rP n / 2) ≤ A ∧
      srcM (IntMul.OpenAI.Glue.dP n) (IntMul.OpenAI.Glue.rP n) (IntMul.OpenAI.Glue.rP n) ≤ A ∧ IntMul.OpenAI.Glue.dP n ≤ A ∧ IntMul.OpenAI.Glue.rP n * IntMul.OpenAI.Glue.rP n ≤ A := 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.KFM.src_atoms` of the Lean development Solutions/KFMSA.lean (lines 34–50), integer-multiplication-kappa campaign.

View graph