Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6.4, eqs. (29)–(30) — Surviving column relations span at most ρ² dimensions

Proved
GenericGroupWE.Main.eq_29_30

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

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

For a nonzero represented stack A=∑bλbA(b)A=\sum_b\lambda_bA(b)A=∑b​λb​A(b) of rank ρ\rhoρ, fix d≥1d\ge1d≥1 and stack the columns ci=(CiU)∣U∣≤d−1c_i=(C_{iU})_{|U|\le d-1}ci​=(CiU​)∣U∣≤d−1​, where 0U=U0U=U0U=U and iU=U∪{i}iU=U\cup\{i\}iU=U∪{i}. Their span has dimension δ\deltaδ satisfying

1≤δ≤ρ2.1\le\delta\le\rho^2.1≤δ≤ρ2.

For every relation ∑iκici=0\sum_i\kappa_ic_i=0∑i​κi​ci​=0, set K(b)=κ0+∑i=1NκibiK(b)=\kappa_0+\sum_{i=1}^N\kappa_ib_iK(b)=κ0​+∑i=1N​κi​bi​. Then for every listed weight hhh and polynomial fff of degree at most 2d−12d-12d−1,

∑bλbK(b)h(b)f(b)=0.\sum_b\lambda_bK(b)h(b)f(b)=0.b∑​λb​K(b)h(b)f(b)=0.

Both the dimension bound and the surviving relation are retained in this item.

Differences from the source:

  • generalization: the unsatisfiable low-rank prime-field regime of §6.4 → any field and any nonzero represented stack; reason: the two displayed claims use only the assignment-table identities, so they specialize to every stack in the source regime
  • 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
open scoped BigOperators

theorem eq_29_30 (K : Type*) [Field K] (N d : ℕ) (hd : 1 ≤ d)
    (coefficients : BooleanAssignment N → K)
    (hne : representedStack (d := d) coefficients ≠ 0) :
    let A := representedStack (d := d) coefficients
    1 ≤ survivingDimension hd A ∧ survivingDimension hd A ≤ A.rank ^ 2 ∧
    ∀ κ : Option (Fin N) → K,
      (∑ i, κ i • survivingColumn hd A i) = 0 →
      ∀ (h : WeightLabel N d) (f : MvPolynomial (Fin N) K), f.totalDegree + 1 ≤ 2*d →
        ∑ b, coefficients b * affineBit κ b * stackWeight h b *
          MvPolynomial.eval (booleanPoint b) f = 0 := 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, §6.4, eqs. (29)–(30), PDF p. 27 (printed p. 26).
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