Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Claim 3.15 — quadratic gate equations define the same language as the gates

Proved
LatticePrepro.GateVerifier.language_toQuadratic

by WizardOfMenlo · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

coding-theorycvp-ncp-preprocessinghardness-of-approximationlatticespreprocessing

Let ppp be a prime and WWW a gate verifier with instance length nnn, wires 0,…,S−10, \dots, S-10,…,S−1 (inputs 0,…,n−10, \dots, n-10,…,n−1, output wire nnn) and gates (ob,lb,lb′,fb)(o_b, l_b, l'_b, f_b)(ob​,lb​,lb′​,fb​) imposing zob=fb(zlb,zlb′)z_{o_b} = f_b(z_{l_b}, z_{l'_b})zob​​=fb​(zlb​​,zlb′​​). Let QQQ be its quadratic verifier over Fp\mathbb{F}_pFp​, with coordinates z0,…,zSz_0, \dots, z_Sz0​,…,zS​ (wire iii becomes coordinate i+1i+1i+1) and gate equations

Qb(z)=z0 zob+1−c00 z02−c10 z0 zlb+1−c01 z0 zlb′+1−c11 zlb+1 zlb′+1,Q_b(z) = z_0\, z_{o_b+1} - c_{00}\, z_0^2 - c_{10}\, z_0\, z_{l_b+1} - c_{01}\, z_0\, z_{l'_b+1} - c_{11}\, z_{l_b+1}\, z_{l'_b+1},Qb​(z)=z0​zob​+1​−c00​z02​−c10​z0​zlb​+1​−c01​z0​zlb′​+1​−c11​zlb​+1​zlb′​+1​,

where c00,c10,c01,c11c_{00}, c_{10}, c_{01}, c_{11}c00​,c10​,c01​,c11​ are the coefficients of the multilinear interpolation of fbf_bfb​, reduced mod ppp. Then the two verifiers have the same language:

L(Q)=L(W).L(Q) = L(W).L(Q)=L(W).

That is, for every x∈{0,1}nx \in \{0,1\}^nx∈{0,1}n the following are equivalent:

  1. there is z∈FpS+1z \in \mathbb{F}_p^{S+1}z∈FpS+1​ with z0=1z_0 = 1z0​=1, every zi∈{0,1}z_i \in \{0,1\}zi​∈{0,1}, Qb(z)=0Q_b(z) = 0Qb​(z)=0 for every gate bbb, zi+1=xiz_{i+1} = x_izi+1​=xi​ for i<ni < ni<n and zn+1=1z_{n+1} = 1zn+1​=1 (an accepting assignment of QQQ on xxx);
  2. there is a wire assignment in {0,1}S\{0,1\}^S{0,1}S satisfying every gate constraint of WWW, with input xxx and output wire 111.

The main results of the formalization are stated for quadratic verifiers; this theorem (with BoolCircuit.language_toGateVerifier) makes them apply to any Boolean circuit, in particular to the 3SAT verifier.

Formalization Note: Claim 3.15 is stated per assignment (a Boolean assignment is valid if and only if all gate equations vanish) and includes the polynomial-time computability of the coefficients; the Lean theorem states the resulting equality of languages, for every prime ppp, and computability is not formalized. Boolean values are identified with 0,1∈Fp0, 1 \in \mathbb{F}_p0,1∈Fp​.

Preamble
import Mathlib
import Definitions.Def_LatticePrepro_Verifier_Quadratic
import Definitions.Def_LatticePrepro_Verifier_Gates

open LatticePrepro
open LatticePrepro.GateVerifier
variable (W : GateVerifier)
variable (p : ℕ)
variable [Fact p.Prime]
Formal statement
theorem LatticePrepro.GateVerifier.language_toQuadratic : (W.toQuadratic p).Language = W.Language := by sorry
Source
G. Fenzi, G. Weissenberg, Nearly Optimal Hardness for CVP and NCP with Preprocessing (STOC 2027 submission #847; IACR ePrint 2026/2634, https://eprint.iacr.org/2026/2634), Claim 3.15 (\label{clm:verifier-system}); Lean: LatticePrepro/Verifier/Gates.lean, LatticePrepro.GateVerifier.language_toQuadratic
Human review
  • Endorsed by Shuze Chen · Nov 15, 2026

    Confirmed by the moderator at approval.

  • Endorsed by WizardOfMenlo · Nov 15, 2026

    Confirmed by the mission captain (proposal self-audit).

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