Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

EOKO package on corrected OneRun2Rec carrier (QHNetRec)

Definition
IntMul_Kappa_R8_Data_BitOppbankEOKOPack2Rec

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

bitnbeokoeokopack2recintmulkappaonerun2recoppbankqhnetrecr8

Densified EOKO package on OneRun2Rec

This is a QHNetRec fork of the published package IntMul_Kappa_R8_Data_BitOppbankEOKOPack2. The edge-OK hypotheses are unchanged: for a channel chchch and a field size NNN, the structure EOKO(ch,N)\mathrm{EOKO}(ch,N)EOKO(ch,N) asserts invertibility and coprimality of the flag bases together with the six densified edge-matrix identities

edgeMatN(ch.e∗)=redMN(pswQ(K(ch.S,ch.Si,…)))\mathrm{edgeMat}_N(ch.e_\ast)=\mathrm{redM}_N\bigl(\mathrm{pswQ}(K(ch.S,ch.Si,\ldots))\bigr)edgeMatN​(ch.e∗​)=redMN​(pswQ(K(ch.S,ch.Si,…)))

at codeBound=64251\mathrm{codeBound}=64251codeBound=64251, on the corrected one-run carrier (oneRun is a single width-rrr child, with no pads).

The packaged statements

EOKOLargeStmt,FormalOKOfEOKOStmt\mathrm{EOKOLargeStmt},\qquad \mathrm{FormalOKOfEOKOStmt}EOKOLargeStmt,FormalOKOfEOKOStmt

are likewise unchanged, now taking ch0NB=toNB(ch0O)\mathrm{ch0NB}=\mathrm{toNB}(\mathrm{ch0O})ch0NB=toNB(ch0O) and net0O\mathrm{net0O}net0O from IntMul_Kappa_R8_Data_BitOppbankOneRun2Rec. That carrier imports the total-decoder network QHNetRec, so later densify lemmas may use this package together with QHNetRec without mixing the parent OneRun2 / QHNet modules.

Formalization Note. The Lean namespace remains IntMul.Kappa.R8.Bit.Oppbank.EOKO2. Do not import both BitOppbankEOKOPack2 and BitOppbankEOKOPack2Rec in one file, and do not import both BitOppbankQHNet and BitOppbankQHNetRec. This definition does not close or replace 3f441284-58c5-4be2-8c94-1dcf8ce8f717.

Definition code
import Mathlib
import Definitions.Def_IntMul_Kappa_R6_Defs4
import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankOneRun2Rec
import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankPnd
import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankSupG

set_option autoImplicit false
set_option relaxedAutoImplicit false
set_option maxHeartbeats 4000000
set_option linter.dupNamespace false

/-!
# Densified EOKO2 for corrected OneRun2Rec carrier (QHNetRec)

Same EOKO package on OneRun2Rec (`oneRun` = single width-r child, no pads).
This is the QHNetRec fork of `BitOppbankEOKOPack2`: the `EOKO` hypotheses,
`ch0NB`, and statement abbreviations are unchanged, but the carrier import is
`BitOppbankOneRun2Rec` (which imports `BitOppbankQHNetRec`) rather than
`BitOppbankOneRun2`. Do not import both EOKOPack2 and EOKOPack2Rec (same
`EOKO2` namespace), and do not import both QHNet and QHNetRec, in one file.
-/

namespace IntMul.Kappa.R8.Bit.Oppbank.EOKO2

open IntMul.Kappa.R6.Bit
open IntMul.Kappa.R6.Bit.NB
open IntMul.Kappa.R6.Bit.QHNet (FormalOK)
open IntMul.Kappa.R8.Bit.Oppbank
open IntMul.Kappa.R8.Bit.Oppbank.Pnd
open IntMul.Kappa.R8.Bit.Oppbank.OneRunNet2
open Matrix

/-- Local copy of R6 Defs51 `GoodM` (avoid heavy Defs51 import). -/
def GoodM (N : ℕ) {l p : Type*} [Fintype l] [Fintype p]
    (A : Matrix l p ℚ) : Prop :=
  ∀ i j, Nat.Coprime (A i j).den N

/-- Densified edge-OK hypotheses at field size `N` (`SupG.codeBound = 64251`). -/
structure EOKO (ch : NB.Ch) (N : ℕ) : Prop where
  hS : ch.S * ch.Si = 1
  hSi : ch.Si * ch.S = 1
  gS : GoodM N ch.S
  gSi : GoodM N ch.Si
  gPc : ∀ c < SupG.codeBound, GoodM N (Pc c)
  gPl : ∀ b < 1771, GoodM N (Pl b)
  m1 : ∀ b < 1771, ∀ o < SupG.codeBound, ∀ c < SupG.codeBound, nestOK o c = true →
    edgeMat N (ch.e1 b o c) = redM N (pswQ (K ch.S ch.Si (Dm o c) (Pl b)))
  m2 : ∀ a < 1771, ∀ o < SupG.codeBound, ∀ c < SupG.codeBound, nestOK o c = true →
    edgeMat N (ch.e2 a o c) = redM N (pswQ (K ch.S ch.Si (Pl a) (Dm o c)))
  mx : ∀ b < 1771, edgeMat N (ch.ex b) = redM N (pswQ (K ch.S ch.Si 1 (1 - Pl b)))
  mn : ∀ a < 1771, ∀ t < 1771, edgeMat N (ch.en a t) =
    redM N (pswQ (K ch.S ch.Si (1 - Pl a) (1 - Pl t)))
  mi : ∀ a < 1771, edgeMat N (ch.ei a) = redM N (pswQ (K ch.S ch.Si (1 - Pl a) 1))
  mc : ∀ a < 1771, ∀ s < 1771, edgeMat N (ch.ec a s) =
    redM N (pswQ (K ch.S ch.Si (Pl a) (Pl s)))

theorem codeBound_eq : SupG.codeBound = 64251 := rfl

noncomputable def ch0NB : NB.Ch := toNB ch0O

def EOKOLargeStmt : Prop :=
  ∃ q₀ : ℕ, ∀ q, q.Prime → q₀ < q → ∀ f, EOKO ch0NB (q ^ f)

def FormalOKOfEOKOStmt : Prop :=
  ∀ N, EOKO ch0NB N → FormalOK (m := 529) net0O N

end IntMul.Kappa.R8.Bit.Oppbank.EOKO2
Source
Fork of published definition IntMul_Kappa_R8_Data_BitOppbankEOKOPack2 (definition_id 3f441284-58c5-4be2-8c94-1dcf8ce8f717, created 2026-10-28): same densified EOKO hypotheses and FormalOK/EOKOLarge statement abbreviations on the corrected OneRun2 carrier (single width-r child, no pads), retargeted to import IntMul_Kappa_R8_Data_BitOppbankOneRun2Rec (definition_id a4df37e2-2ae8-4bb8-816e-808fb4f5e6f8, created 2026-11-15) instead of IntMul_Kappa_R8_Data_BitOppbankOneRun2 (definition_id e0d447f6-cd60-4e42-86c4-534cc0c33db5). Parent source: OneRun2 e0d447f6; EOKOPack 76603340 retarget; Jain bit_hist.onerun_hist. Local source: Definitions/Def_IntMul_Kappa_R8_Data_BitOppbankEOKOPack2Rec.lean (0-sorry).

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