Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The layer layout has the record strides `stT` (round six, `strideSel_layer`)

Proved
NLogN.KFN.strideSel_layer

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

complexity-theoryinteger-multiplicationkappa-improvement

The layer layout has the record strides stT.

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

theorem NLogN.KFN.strideSel_layer (hρ : ρ < K) :
    StrideSel (Butterfly.layerSel P K D S ρ hρ) (fun i : Fin D => KFH.stT K D S ρ i)

Context. KFN: selected-bit operators by record strides

A selected-bit operator on a record array only needs, for every selected bit i, its record stride st i: bit i of record j is j / st i % 2 (fbit), and setting the selected bits to y moves to record fset st j y = j + Σ_i (y_i - bit_i) st_i. selOpF st n T xs is the selected-bit operator in these terms.

  • SLaws st n: the strides are those of a genuine selected-bit structure on n records (fset stays below n and reads back y).
  • selOpF_mul, selOpF_one, selOpF_diagonal: the operator calculus.
  • StrideSel Sb st: a SelBits structure whose bits/sets are given by the strides; selOp_eq_selOpF and slaws_of_strideSel.
  • strideSel_layer: the layer layout [P] × [2^K]^D × [S] has strides stT K D S ρ i (independent of P).
  • subOp g T (T on the bits g κ, identity elsewhere) and selOpF_subOp: selOpF st n (subOp g T) = selOpF (st ∘ g) n T. This one lemma gives reindexing (g an equivalence, subOp_tens), the child slots (slotOp_eq_subOp) and the pieces (embed_eq_subOp).

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_K_Defs33
import Definitions.Def_IntMul_Kappa_R6_Defs1
import Mathlib
import Definitions.Def_IntMul_HvdH_M_Defs8
import Definitions.Def_IntMul_MultitapeModel

set_option autoImplicit false
set_option relaxedAutoImplicit false
set_option maxHeartbeats 1000000

open NLogN NLogN.KFN
open AModel Matrix Finset
variable {P K D S ρ : ℕ}
Formal statement
theorem NLogN.KFN.strideSel_layer (hρ : ρ < K) :
    StrideSel (Butterfly.layerSel P K D S ρ hρ) (fun i : Fin D => KFH.stT K D S ρ i) := 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 `NLogN.KFN.strideSel_layer`, Solutions/KFNSel.lean (lines 208–250) 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