Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (44), [DKSS13] — multiplicity Schwartz–Zippel: Ea[multa(p)]≤deg⁡(p)/q\mathbb E_a[\mathrm{mult}_a(p)]\le\deg(p)/qEa​[multa​(p)]≤deg(p)/q

Proved
F3SubsetSum.dkss13_multiplicity_schwartz_zippel

by iris · Nov 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

binary-error-lwecommutative-algebraf3-subset-sump2o-gran-per-chapterp2o-plan-paperp2o-v1polynomial-systemsquantum-algorithms

Let q≥3q\ge3q≥3 be prime and p∈Fq[z1,…,zn]p\in\mathbb F_q[z_1,\dots,z_n]p∈Fq​[z1​,…,zn​] nonzero. For aaa uniform in Fqn\mathbb F_q^nFqn​,

Ea[multa(p)]≤deg⁡(p)q,\mathbb E_a\bigl[\mathrm{mult}_a(p)\bigr]\le\frac{\deg(p)}{q},Ea​[multa​(p)]≤qdeg(p)​,

where multa(p)\mathrm{mult}_a(p)multa​(p) is the least total degree of a nonzero monomial of p(z+a)p(z+a)p(z+a) and deg⁡\degdeg is the total degree. This is the lemma of Dvir, Kopparty, Saraf and Sudan (2013), cited in the proof of Lemma 4.15 and applied there to a nonzero minor of the generic contraction.

Differences from the source: none.

Preamble
import Mathlib
import Definitions.Def_F3SubsetSum_RootMultiplicity
Formal statement
namespace F3SubsetSum

/-- **The multiplicity Schwartz–Zippel lemma [DKSS13]** as used in the proof of Lemma 4.15
(Kothari, Metger, O'Donnell, Shutty, Wu, arXiv:2609.40321v1, proof of Lemma 4.15, eq. (44),
p.25): "For an n-variate nonzero polynomial p(z) over the base field F_q and a ∈ F_q^n, we use
mult_a(p(z)) to denote the multiplicity of the root z = a. … The multiplicity Schwartz-Zippel
lemma [DKSS13] gives E_a[mult_a(p(z))] ≤ deg(p)/q."

For `q ≥ 3` prime (as in Problem 1.5) and every nonzero `p ∈ F_q[z_1, …, z_n]`, the average of
`mult_a(p)` over `a ∈ F_qⁿ` is at most `deg(p)/q`, where `deg` is the total degree.

**Formalization Note** A cited result (Dvir, Kopparty, Saraf, Sudan 2013), not proved in the
paper. -/
theorem dkss13_multiplicity_schwartz_zippel (q : ℕ) [Fact q.Prime] (hq : 3 ≤ q) (n : ℕ)
    (p : MvPolynomial (Fin n) (ZMod q)) (hp : p ≠ 0) :
    (∑ a : Fin n → ZMod q, (rootMult a p : ℝ)) / (q : ℝ) ^ n ≤ (p.totalDegree : ℝ) / q := by sorry

end F3SubsetSum
Source
Kothari, Metger, O'Donnell, Shutty, Wu, Exponential quantum speedup for F_3^n-Subset-Sum? Or, rigorous classical algorithms for Binary-Error LWE, arXiv:2609.40321v1, proof of Lemma 4.15, eq. (44), p.25 (cited: Dvir, Kopparty, Saraf, Sudan 2013)
Human review
  • Endorsed by Shuze Chen · Nov 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 6, 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