Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

p1L_runs (KFUU §2c: phase 1 of the uniform reversal)

Proved
NLogN.KFUU.p1L_runs

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.KFUURev3):

theorem NLogN.KFUU.p1L_runs {pM : Fin P} (hM : MulOK I iprog pM NLogN.KFUU.MS) {pS : Fin HS} (hpS : LS pS)
    (u cz : ℕ) (bs : List Bool) (hcz : 1 ≤ cz) (w : ℕ) (xs0 : List ℤ) (hx : Bnd w xs0) (Z : ℕ)
    (hVZ : zsz ((vol (shP u bs) * cz : ℕ) : ℤ) ≤ Z) (hZ2 : 2 ≤ Z) (t : IState HS) (R : List Item)
    (h0 : t.G 0 = ints (Dl (mzB u bs.length cz) (bgB bs) (List.range bs.length ++ [bs.length])
      (lay1 (bgB bs) bs.length bs.length) xs0 0) ++ R)
    {RV RB RtS RS LZ LU LN : List Item}
    (hV : t.G pV = ints (sufV (shP u bs).reverse 1) ++ RV)
    (htS : t.G tS = ints (NLogN.KFUU.zl (shP u bs).reverse) ++ RtS) (hpS0 : t.G pS = RS)
    (hB : t.G NLogN.KFUU.qB = .int 1 :: RB)
    (hZ : t.G NLogN.KFUU.qZ = .int (cz : ℤ) :: LZ) (hU : t.G rU2 = .int ((2 ^ u : ℕ) : ℤ) :: LU)
    (hN : t.G nR = .int (bs.length : ℤ) :: LN) :
    IRuns I iprog (p1L pM pS) t
      ((((t.upd 0 (ints (Dl (mzB u bs.length cz) (bgB bs) (List.range bs.length ++ [bs.length])
        (lay1 (bgB bs) bs.length 0) xs0 0) ++ R)).upd pV RV).upd NLogN.KFUU.qB
        (.int (vol (shP u bs) : ℤ) :: RB)).upd tS RtS |>.upd pS (ints (NLogN.KFUU.zl (shP u bs)) ++ RS))
      ((bs.length + 1) * (KFU.cMv (vol (shP u bs) * cz) w + 40 * cU Z + 76 * Z + 3000))

Context. The lemma belongs to the part KFUU §2c: phase 1 of the uniform reversal: p1U pM pS (sizes S = shP u bs on pS in order, n = |bs| on nR, 2^u on rU2, cz on rCZ) moves every extra bit behind the main atoms: Dl (lay1 n) ↦ Dl (lay1 0).

Formalization Note. This lemma belongs to layer 5 of the Lean formalization (integer-multiplication-kappa campaign) of the OpenAI preprint Integer multiplication below nlog⁡nn\log nnlogn: 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
set_option linter.unusedVariables false
set_option linter.unusedSectionVars false
set_option linter.unnecessarySeqFocus false
set_option maxRecDepth 20000
open NLogN
open NLogN.KFUU
open IntMul KIL KFC KFT KFU AModel AModelL12
variable {P : ℕ} {I : List Sym} {iprog : Fin P → IStmt HS P}
set_option maxHeartbeats 4000000
Formal statement
theorem NLogN.KFUU.p1L_runs {pM : Fin P} (hM : MulOK I iprog pM NLogN.KFUU.MS) {pS : Fin HS} (hpS : LS pS)
    (u cz : ℕ) (bs : List Bool) (hcz : 1 ≤ cz) (w : ℕ) (xs0 : List ℤ) (hx : Bnd w xs0) (Z : ℕ)
    (hVZ : zsz ((vol (shP u bs) * cz : ℕ) : ℤ) ≤ Z) (hZ2 : 2 ≤ Z) (t : IState HS) (R : List Item)
    (h0 : t.G 0 = ints (Dl (mzB u bs.length cz) (bgB bs) (List.range bs.length ++ [bs.length])
      (lay1 (bgB bs) bs.length bs.length) xs0 0) ++ R)
    {RV RB RtS RS LZ LU LN : List Item}
    (hV : t.G pV = ints (sufV (shP u bs).reverse 1) ++ RV)
    (htS : t.G tS = ints (NLogN.KFUU.zl (shP u bs).reverse) ++ RtS) (hpS0 : t.G pS = RS)
    (hB : t.G NLogN.KFUU.qB = .int 1 :: RB)
    (hZ : t.G NLogN.KFUU.qZ = .int (cz : ℤ) :: LZ) (hU : t.G rU2 = .int ((2 ^ u : ℕ) : ℤ) :: LU)
    (hN : t.G nR = .int (bs.length : ℤ) :: LN) :
    IRuns I iprog (p1L pM pS) t
      ((((t.upd 0 (ints (Dl (mzB u bs.length cz) (bgB bs) (List.range bs.length ++ [bs.length])
        (lay1 (bgB bs) bs.length 0) xs0 0) ++ R)).upd pV RV).upd NLogN.KFUU.qB
        (.int (vol (shP u bs) : ℤ) :: RB)).upd tS RtS |>.upd pS (ints (NLogN.KFUU.zl (shP u bs)) ++ RS))
      ((bs.length + 1) * (KFU.cMv (vol (shP u bs) * cz) w + 40 * cU Z + 76 * Z + 3000)) := 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.KFUU.p1L_runs` of the Lean development Solutions/KFUURev3.lean (lines 51–134), integer-multiplication-kappa campaign.

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