Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Prefix labels of blk1 stay at 1 on touched wires (QHNetRec)

Proved
IntMul.Kappa.R8.Bit.Oppbank.net0O2_blk1_prefix_labels_eq_one_rec

by Ethan Cheung Wang · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

bitnbeoko2formalokintmulkappaprefix_labelsqhnetrecr8

On the total-decoder network QHNetRec, the stage-one block blk1\mathrm{blk1}blk1 leaves the constant-111 labelling unchanged at every wire it touches, when the labelling is computed only on the preceding banks.

Let NNN be a field size at which the packed edge family EOKO(ch0NB,N)\mathrm{EOKO}(\mathrm{ch0NB},N)EOKO(ch0NB,N) holds, and fix a bank index i<1771i<1771i<1771. Write LiL_iLi​ for the labelling obtained by folding labStepHN\mathrm{labStepH}_NlabStepHN​ along the flattened prefix flatMap(blk1(toNB(ch0O)),[0..i))\mathrm{flatMap}(\mathrm{blk1}(\mathrm{toNB}(\mathrm{ch0O})),[0..i))flatMap(blk1(toNB(ch0O)),[0..i)) starting from the constant map w↦1w\mapsto 1w↦1. If a global wire www is touched by a gate support or an edge of blk1(toNB(ch0O),i)\mathrm{blk1}(\mathrm{toNB}(\mathrm{ch0O}),i)blk1(toNB(ch0O),i), then

Li(w)=1.L_i(w)=1.Li​(w)=1.

The reason is that earlier banks b<ib<ib<i touch only the disjoint fibres ι1(b)(ℓ)\iota_1(b)(\ell)ι1​(b)(ℓ) (injectivity of g1g_1g1​ and of the decoder gwg_wgw​), so no earlier edge can update the label at a wire of bank iii.

Formalization Note. The statement is identical to net0O2_blk1_prefix_labels_eq_one, with preamble importing the Rec packs EOKOPack2Rec, OneRun2Rec, and QHNetRec rather than EOKOPack2, OneRun2, and QHNet. Solutions may import the Rec theorems g1_inj_rec, g1_lt_rec, gw_inj_rec, and net0O2_blk1_touch_iota1_lt_rec. It does not close or replace 7305eada-bd2d-4968-bcc6-24ff3d533141.

Preamble
import Definitions.Def_IntMul_Kappa_R6_Defs4
import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankEOKOPack2Rec
import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankOneRun2Rec
import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankQHNetRec
import Mathlib
set_option autoImplicit false
set_option relaxedAutoImplicit false
set_option maxRecDepth 100000
set_option maxHeartbeats 8000000
Formal statement
namespace IntMul.Kappa.R8.Bit.Oppbank
open IntMul.Kappa.R6.Bit (labStepH FMat Instr)
open IntMul.Kappa.R8.Bit.Oppbank.EOKO2
open IntMul.Kappa.R8.Bit.Oppbank.OneRunNet2
open IntMul.Kappa.R8.Bit.Oppbank.NB (blk1)
theorem net0O2_blk1_prefix_labels_eq_one_rec (N : ℕ) (_h : EOKO ch0NB N)
    (i : ℕ) (_hi : i < 1771) (w : Fin 104719230 ⊕ Fin 3217907)
    (_hw : ∃ instr ∈ blk1 (toNB ch0O) i,
      match instr with
      | .gate _ S => w ∈ S
      | .edge w' _ => w = w') :
    ((List.range i).flatMap (blk1 (toNB ch0O))).foldl (labStepH N) (fun _ => (1 : FMat 529 N)) w = 1 := by sorry
end IntMul.Kappa.R8.Bit.Oppbank
Source
IntMul Kappa R8 Bit Oppbank FormalOK densify: prefix labels of blk1 stay at 1, restated on the Rec packs QHNetRec (d127abea), OneRun2Rec (a4df37e2), EOKOPack2Rec (8ba6deb1). Does not close or replace 7305eada-bd2d-4968-bcc6-24ff3d533141.

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me