Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.2 — Rectangular Boolean tables

Proved
GenericGroupWE.Main.lemma_6_2

by mikedeng1 · Nov 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

complexity-theorycryptographygeneric-groupsp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1

Let qsq_sqs​ be quadratic polynomials in NNN variables with no common Boolean zero. Let a,b≥0a,b\ge0a,b≥0 and let LLL be a linear functional on polynomials through degree a+ba+ba+b. If a,b>0a,b>0a,b>0, assume L((xi2−xi)f)=L(qsf)=0L((x_i^2-x_i)f)=L(q_sf)=0L((xi2​−xi​)f)=L(qs​f)=0 whenever deg⁡f+2≤a+b\deg f+2\le a+bdegf+2≤a+b. With rows and columns indexed by all ordinary monomials of degrees at most aaa and bbb, including 111, respectively,

Ha,b(L)≠0⟹rank⁡Ha,b(L)≥(a+ba).H_{a,b}(L)\ne0\Longrightarrow \operatorname{rank}H_{a,b}(L)\ge\binom{a+b}{a}.Ha,b​(L)=0⟹rankHa,b​(L)≥(aa+b​).

Neither family of identities is required when a=0a=0a=0 or b=0b=0b=0. The rank is algebraic; no positive-functional or probability assumption occurs.

Differences from the source:

  • generalization: the prime field used throughout the paper → any field; reason: the selector and rank arguments use field operations only and specialize to every prime field
  • encoding: a functional on the degree-truncated polynomial space → a total linear functional whose values above degree a+b are unused; reason: every truncated functional extends to the polynomial space by assigning arbitrary values to the other monomials
  • encoding: finite indexed families and field residues → Fin-indexed families and ZMod prime fields; reason: zero-based indices and explicit finite carriers change no mathematical instance
Preamble
import Definitions.Def_GenericGroupWE_Main_Tables
Formal statement
namespace GenericGroupWE.Main

theorem lemma_6_2 (K : Type*) [Field K] (N k a b : ℕ)
    (q : Fin k → MvPolynomial (Fin N) K) (hq : ∀ s, (q s).totalDegree ≤ 2)
    (hunsat : NoBooleanZero q) (L : MvPolynomial (Fin N) K →ₗ[K] K)
    (hidentities : a ≠ 0 → b ≠ 0 → AnnihilatesEquations q L (a+b))
    (hne : rectangularTable a b L ≠ 0) :
    Nat.choose (a+b) a ≤ (rectangularTable a b L).rank := by sorry

end GenericGroupWE.Main
Source
Hair and Sahai, Witness Encryption via Prime-Order Generic Groups, STOC 2027 submission #47 (PDF built 2026-11-02; SHA-256 0b7f14e2db9bb3e199883ab907f854b7b5884c7c9f3d1e4c306bb71e89b659cb), https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/47.pdf, Lemma 6.2, PDF p. 25 (printed p. 24).
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 8, 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