Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Sparsity of the local steps (round six, `den_row_card_le`)

Proved
P8Lift.RStep.den_row_card_le

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

complexity-theoryinteger-multiplicationkappa-improvement

Sparsity of the local steps. Every local step has at most |R| nonzero entries per row (gates), and the other local steps at most one (monomial matrices).

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

theorem P8Lift.RStep.den_row_card_le (T : Op κ) (st : RStep R m) (hst : st.isChild = false)
    (p : R × Addr m κ) : (rowSupp (st.den T) p).card ≤ Fintype.card R

Context. A restricted Proposition 8 interface (only the paper's cheap local operations)

Butterfly.Prop8Iface allows an arbitrary matrix as a non-recursive step, which makes it vacuous. Here the non-recursive steps are restricted to the operations of §3.5/§5.1, each of which touches every state entry a bounded number of times:

  • gate G — a pointwise scalar gate across roles at equal addresses (G on the roles, identity on the addresses);
  • rowAdd w i j — a binary row addition x(j,c) += x(i,c) (all columns c) on the address bits of role w, i.e. an address permutation;
  • phase w k₀ k₁ a — the diagonal phase i^{k₀ + k₁|κ| + Σ_{(r,c)} a_r x(r,c)} on role w (covers Z_u with a = 2u, S on selected bits, scalars i^{27|κ|});
  • perm σ — a permutation of the roles;
  • child w h fwd — a recursive call on slot h of role w (forward or the (17) inverse).

The step list is independent of the column type κ (the same program for every κ).

  • Prop8IfaceR.toIface: the forgetful map to Butterfly.Prop8Iface (so recOp_eq, recCost_le, prop14_output apply).
  • den_row_card_le: every local step's matrix has at most |R| nonzero entries per row (≤ 1 except for gates), so one local step costs ≤ W · V entry operations.
  • recCostR_le: the §5.3 bound for the recursion whose local work is the actual work ≤ nloc · W · V of the local steps (nloc = number of local steps, independent of κ).

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_Defs2

set_option autoImplicit false
set_option relaxedAutoImplicit false
set_option maxHeartbeats 1000000

open P8Lift P8Lift.RStep
open Matrix Finset Complex Butterfly
variable {R : Type} [Fintype R] [DecidableEq R] {m : ℕ} {κ : Type} [Fintype κ] [DecidableEq κ]
Formal statement
theorem P8Lift.RStep.den_row_card_le (T : Op κ) (st : RStep R m) (hst : st.isChild = false)
    (p : R × Addr m κ) : (rowSupp (st.den T) p).card ≤ Fintype.card R := 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 `P8Lift.RStep.den_row_card_le`, Solutions/P8LiftIface.lean (lines 101–154) 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