Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The generator computes the Schur products of the basis of DDD

Proved
OPI.Gen.bWcN_eq

by sragavan · Nov 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

lean-formalizationquantum-algorithmstwo-fold-opi-construction

Setting. An instance xxx of the two-fold OPI problem of Theorem 7.4 consists of a finite field F=Fp[X]/(f)F=\mathbb F_p[X]/(f)F=Fp​[X]/(f) (e=deg⁡fe=\deg fe=degf, q=peq=p^eq=pe), a length mmm, an r×mr\times mr×m matrix HHH over FFF with a flag gen\mathrm{gen}gen (the code CCC is the row space of HHH if gen\mathrm{gen}gen holds, and ker⁡H\ker HkerH otherwise), forbidden values β∈Fm\beta\in F^mβ∈Fm and a precision ttt. Let D=C⊥D=C^\perpD=C⊥ with the basis G0,…,Gkd−1G_0,\dots,G_{k_d-1}G0​,…,Gkd​−1​ used by the construction. The Schur (coordinatewise) products Wjkd+j′=Gj∗Gj′W_{jk_d+j'}=G_j\ast G_{j'}Wjkd​+j′​=Gj​∗Gj′​, for 0≤j,j′<kd0\le j,j'<k_d0≤j,j′<kd​, span the Schur square D∗2D^{\ast2}D∗2; the family WWW is denoted bWof(x)\mathrm{bWof}(x)bWof(x). Field elements are stored as coordinate lists E(a)∈{0,…,p−1}eE(a)\in\{0,\dots,p-1\}^eE(a)∈{0,…,p−1}e, and matE\mathrm{matE}matE applies EEE entrywise to a matrix.

The program is produced by a generator working only with natural numbers and lists. From the parsed input and an input length nnn it forms the record u=numsOf(n,parsedOf(x))u=\mathrm{numsOf}(n,\mathrm{parsedOf}(x))u=numsOf(n,parsedOf(x)), which contains the coordinate lists of the entries of HHH, the field size saturated at n+1n+1n+1, and the search budget Nb=8q~ 8N_b=8\tilde q^{\,8}Nb​=8q~​8. The function bWcN(u)\mathrm{bWcN}(u)bWcN(u) computes the products of the generator's basis rows with first-order field multiplication modulo fff.

Statement. If pe≤np^e\le npe≤n, then

bWcN(numsOf(n,parsedOf(x)))=matE(W).\mathrm{bWcN}\big(\mathrm{numsOf}(n,\mathrm{parsedOf}(x))\big)=\mathrm{matE}(W).bWcN(numsOf(n,parsedOf(x)))=matE(W).

The Schur products are the extra columns of the relinearized linear system that the decoder solves (Schur-square relinearization). This lemma identifies the generator's version of them with the mathematical one.

Preamble
import Definitions.Def_TwoFoldOPI_CL_Part05
import Mathlib
import Definitions.Def_QAlgorithms_Defs_Circuit
import Definitions.Def_QAlgorithms_Defs_GradientMethods
import Definitions.Def_QAlgorithms_Defs_OPIOraclePrograms
import Definitions.Def_QAlgorithms_Defs_OPIUniformity
import Definitions.Def_QAlgorithms_Defs_Fourier
import Definitions.Def_TwoFoldOPI_elemBits
import Definitions.Def_TwoFoldOPI_schurSquare
import Definitions.Def_TwoFoldOPI_schurFailureSum
import Definitions.Def_CodingTheory
import Definitions.Def_OAIThreeMachineSched01
import Definitions.Def_CookLevin_Cost
import Definitions.Def_TwoFoldOPI_codeOf
import Definitions.Def_TwoFoldOPI_solves
import Definitions.Def_TwoFoldOPI_Input
import Definitions.Def_TwoFoldOPI_CLSerializableF
open OPI OPI.Gen
open QAlgorithms QAlgorithms.OPI TwoFoldOPI Lay TD RRefC FM SymEnc
local notation "vl" => List.map Fin.val
variable (x : Input) (n : ℕ) (hq : x.F.p ^ x.F.f.natDegree ≤ n)
include hq
local notation "u" => numsOf n (parsedOf x)
local notation "KD" => kdOf x.F x.m x.gen x.H
Formal statement
theorem OPI.Gen.bWcN_eq : bWcN (numsOf n (parsedOf x)) = matE x.F (bWof x.gen x.H) := by sorry
Source
Formalization of Theorem 7.4 (algorithmic part), repository https://github.com/sragavan99/lean-prove2me-fills/blob/f7224a159e790347c1a83c5ac23c63e5094a6a2c/WorkInProgress/QuantumOPIVariants/OPI/IRGenQuant.lean#L54-L55

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