Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

One child of width `Fd V U` (round six, `edgeStepsH_widths`)

Proved
IntMul.Kappa.R6.Cx.edgeStepsH_widths

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

complexity-theoryinteger-multiplicationkappa-improvement

One child of width Fd V U (none if the edge has no residual).

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

theorem IntMul.Kappa.R6.Cx.edgeStepsH_widths (w : R) {V U : Submodule (ZMod 2) (Vc h)} (hE : EdgeP V U) :
    (edgeStepsH w V U).filterMap HStep.width = if Fd V U = 0 then [] else [Fd V U]

Context. NC3: the PR #15 whole-residual merge

For a linearly independent family v₁, …, v_ρ in 𝔽₂^m (e.g. an orthonormal residual basis of a Proposition 8 edge) and signs ε_k = ±1, the edge operator ∏_k (aI + bX_{v_k})^{ε_k} (on every column: colT (∏ Tk ε_k v_k)) is conjugate, by a word of binary row additions P (an element of GL_m(𝔽₂) sending v_k ↦ e_{h_k}), to (-i)^{|N||κ|} Z_N C^{⊗(S × κ)} Z_N with S = {h_k} (|S| = ρ) and N = {h_k : ε_k = -1}: one forward child call of width ρ.

  • conj_rowAdds: conjugation of a kernel product by row additions (15).
  • kernels_single: kernels on distinct unit vectors e_{h_k} = the slot family (they live on distinct slots and commute).
  • exists_rowAdds: every independent family is sent to distinct unit vectors by a word of row additions (basis extension + gl_f2_row_additions).
  • merge_identity (operator form) and merge_chunk (step form: row additions, one child child w S neg, row additions reversed).
  • mergedChunk, mergedChunk_den, mergedChunk_widths: the chosen chunk for a kernel list L (in P8Lift.frameSteps form) with independent vectors; mergedChunk_den_frameSteps: same denotation as the single-slot chunks frameSteps w L, but child widths [|L|] instead of |L| ones. Orthonormal version lin_indep_of_orthonormal.
  • edgeStepsH: the merged frame change of a Proposition 8 edge (EdgeP): denotation wireOp w (PhiK (qL V - qL U)) as P8Lift.edgeSteps, one child 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 IntMul IntMul.Kappa IntMul.Kappa.R6 IntMul.Kappa.R6.Cx
open Matrix Finset Complex Butterfly P8Lift
variable {m : ℕ} {κ : Type} [Fintype κ] [DecidableEq κ]
open NetComplexP8 NetComplexLabels
variable {h : ℕ} {R : Type} [Fintype R] [DecidableEq R]
Formal statement
theorem IntMul.Kappa.R6.Cx.edgeStepsH_widths (w : R) {V U : Submodule (ZMod 2) (Vc h)} (hE : EdgeP V U) :
    (edgeStepsH w V U).filterMap HStep.width = if Fd V U = 0 then [] else [Fd V U] := 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 `IntMul.Kappa.R6.Cx.edgeStepsH_widths`, Solutions/R6CxMerge.lean (lines 445–451) 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