Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Round-six lemma `monoSrc_G`

Proved
J6A.monoSrc_G

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

complexity-theoryinteger-multiplicationkappa-improvement

An auxiliary lemma of the round-six development, published as a separate node because its proof is long or shared.

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

theorem J6A.monoSrc_G (hH : 1 ≤ H) (hM : 0 < M) (hwin : 0 < win) (ht : t = M * 8 * (2 * H))
    (hWs : W ≤ s) (hst : s ≤ t) (hsep : 2 * W * t ≤ 16 * H * s) (hWw : 2 * W ≤ win) :
    MonoSrc (32 * t) (8 * (M * win)) (srcG s t H W M win)

Context. A lines, IL side 6: the per-axis pipeline at the list level

On a (pre, t, post) array the A line map of an axis is computed by six list passes, each of which has an IL counterpart:

  1. cpy 32 t post pre: the lines X become dupL 32 X (32 copies);
  2. the gather slab pass slabPass (32 t) (8 (M win)) post (srcG …): output slab l = (r M + j) win + e (r < 8, j < M, e < win) is, for e < 2W, the input X[(jc_b - W + e) mod s] of block b = 8 j + r, read from copy 4 r + c (c ∈ {0,1,2} handles the wrap-around, posE), and 0 otherwise; inside a class r the windows of the blocks r, r + 8, … are disjoint and increasing, so the source is monotone;
  3. rgp 8 M win: the windows become rows; row b' holds the window of block b' % (8M);
  4. the kernel pass kerPass win post (pre·8M) (fun b => gK (b % 8M)) (gK q the per-block kernel aKerL with the tables of block q);
  5. the compress slab pass slabPass (8M win) t post srcC: output k is entry k % 2H of row k / 2H.

pipeAL_rep: the result represents the lines (range t).map (chirpC p s t α H U_X); pipeAL_eq: the pipeline is axisL t post of that line map. monoSrc_G, monoSrc_C: the two sources are monotone (the IL slab passes need this).

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_Defs62

set_option autoImplicit false
set_option relaxedAutoImplicit false
set_option maxHeartbeats 1000000

open J6A
open IntMul.HvdH J6Seg
variable {s t H W M win : ℕ}
Formal statement
theorem J6A.monoSrc_G (hH : 1 ≤ H) (hM : 0 < M) (hwin : 0 < win) (ht : t = M * 8 * (2 * H))
    (hWs : W ≤ s) (hst : s ≤ t) (hsep : 2 * W * t ≤ 16 * H * s) (hWw : 2 * W ≤ win) :
    MonoSrc (32 * t) (8 * (M * win)) (srcG s t H W M win) := 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 `J6A.monoSrc_G`, Solutions/J6AIL6.lean (lines 146–208) 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