Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proposition 18 (error) on the paper's layout (paperLayout, selected bits paperSel)

Proved
GlueProp18.prop18_error_paper

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

complexity-theoryinteger-multiplicationkappa-improvement

Proposition 18 (error) on the paper's layout (paperLayout, selected bits paperSel).

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

theorem GlueProp18.prop18_error_paper (D ℓ K : ℕ) [NeZero D] (long : Fin D → Bool) {r : ℕ}
    (C : CoeffModel y r) (p : ℕ) (hK : 0 < K) (hℓ : 1 ≤ ℓ) (hy : y ^ (2 ^ ℓ) = -1)
    {f g : List R} (hf : f.length = vol (binSh (tgtL D ℓ K long).length))
    (hg : g.length = vol (binSh (tgtL D ℓ K long).length))
    (hfd : ∀ k, ‖C.co (f.getD k 0)‖ ≤ 1) (hgd : ∀ k, ‖C.co (g.getD k 0)‖ ≤ 1)
    {v : List ℕ} (hv : Valid (binSh (tgtL D ℓ K long).length) v) :
    ‖C.co ((Mv (al D ℓ long) : ℂ) • (procQI y (paperLayout D ℓ K long hK hℓ) C p ℓ
        (partAxes (al D ℓ long)) (paperSel D ℓ K long hK hℓ) ℓ
        (ofA (QQ y C p (PP y C
          (toA C (vol (binSh (tgtL D ℓ K long).length)) (procQ C p (paperLayout D ℓ K long hK hℓ) ℓ (partAxes (al D ℓ long))
            (paperSel D ℓ K long hK hℓ) ℓ f))
          (toA C (vol (binSh (tgtL D ℓ K long).length)) (procQ C p (paperLayout D ℓ K long hK hℓ) ℓ (partAxes (al D ℓ long))
            (paperSel D ℓ K long hK hℓ) ℓ g)))))).getD
          (encode (binSh (tgtL D ℓ K long).length) v) 0 -
        Mr r (al D ℓ long) (fn (paperLayout D ℓ K long hK hℓ) f)
          (fn (paperLayout D ℓ K long hK hℓ) g) ((paperLayout D ℓ K long hK hℓ).coord v))‖ <
      Real.sqrt 2 * (Mv (al D ℓ long)) * (3 * ℓ + 1) * 2⁻¹ ^ p

Context. The lemma belongs to the part Glue 2c: the opposite procedure on the tape and Proposition 18's error, unconditionally.

Formalization Note. This lemma belongs to the Lean formalization (integer-multiplication-kappa campaign) of the OpenAI preprint Integer multiplication below nlog⁡nn\log nnlogn: the array model of tape data (mixed-radix arrays and pull maps), the interchange networks of §3–4 (Propositions 7, 8, 11, Lemmas 9–12), the butterfly layers of §5 (Lemma 13, Proposition 14), the synthesis of §6–7 (Lemma 16, Proposition 18), the resampling and parameter choices of §8–9, and the final glue IntMul.OpenAI.Glue.kappaBound_of_machine, which derives the platform bound KappaBound (1/2^182) (from Def_IntMul_MultitapeModel) for any correct multitape machine meeting the paper's time recurrence. All names refer to the definition bundles IntMul_Kappa_K_Defs1–IntMul_Kappa_K_Defs9.

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

import Definitions.Def_IntMul_Kappa_K_Defs9

set_option autoImplicit false
set_option relaxedAutoImplicit false
set_option maxHeartbeats 1000000

set_option linter.unusedSectionVars false
set_option linter.unusedSimpArgs false
open GlueProp18
open Finset Butterfly AModel Synth GlueLayout GlueP14 GlueError
variable {R : Type*} [CommRing R] [Algebra ℂ R] (y : Rˣ) {D : ℕ}
variable {sh : Shape} {a : Fin D → ℕ} (L : CoordLayout sh a)
variable {r : ℕ} {C : CoeffModel y r}
Formal statement
theorem GlueProp18.prop18_error_paper (D ℓ K : ℕ) [NeZero D] (long : Fin D → Bool) {r : ℕ}
    (C : CoeffModel y r) (p : ℕ) (hK : 0 < K) (hℓ : 1 ≤ ℓ) (hy : y ^ (2 ^ ℓ) = -1)
    {f g : List R} (hf : f.length = vol (binSh (tgtL D ℓ K long).length))
    (hg : g.length = vol (binSh (tgtL D ℓ K long).length))
    (hfd : ∀ k, ‖C.co (f.getD k 0)‖ ≤ 1) (hgd : ∀ k, ‖C.co (g.getD k 0)‖ ≤ 1)
    {v : List ℕ} (hv : Valid (binSh (tgtL D ℓ K long).length) v) :
    ‖C.co ((Mv (al D ℓ long) : ℂ) • (procQI y (paperLayout D ℓ K long hK hℓ) C p ℓ
        (partAxes (al D ℓ long)) (paperSel D ℓ K long hK hℓ) ℓ
        (ofA (QQ y C p (PP y C
          (toA C (vol (binSh (tgtL D ℓ K long).length)) (procQ C p (paperLayout D ℓ K long hK hℓ) ℓ (partAxes (al D ℓ long))
            (paperSel D ℓ K long hK hℓ) ℓ f))
          (toA C (vol (binSh (tgtL D ℓ K long).length)) (procQ C p (paperLayout D ℓ K long hK hℓ) ℓ (partAxes (al D ℓ long))
            (paperSel D ℓ K long hK hℓ) ℓ g)))))).getD
          (encode (binSh (tgtL D ℓ K long).length) v) 0 -
        Mr r (al D ℓ long) (fn (paperLayout D ℓ K long hK hℓ) f)
          (fn (paperLayout D ℓ K long hK hℓ) g) ((paperLayout D ℓ K long hK hℓ).coord v))‖ <
      Real.sqrt 2 * (Mv (al D ℓ long)) * (3 * ℓ + 1) * 2⁻¹ ^ p := 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 `GlueProp18.prop18_error_paper` of the Lean development Solutions/GlueProp18.lean (lines 521–540), 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