Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Construction 5, Step 2, p. 21 — the sketch entries are the first ttt elementary symmetric polynomials of www, up to sign

Proved
FuzzyExtractors.ImprovedJS.construction_5_step_2

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1polynomialssymmetric-polynomials

Let F\mathcal FF be a field, t≤st\le st≤s natural numbers and w={x1,…,xs}⊆Fw=\{x_1,\dots,x_s\}\subseteq\mathcal Fw={x1​,…,xs​}⊆F with ∣w∣=s|w|=s∣w∣=s. For k=1,…,tk=1,\dots,tk=1,…,t, the coefficient of degree s−ks-ks−k of p′(z)=∏x∈w(z−x)p'(z)=\prod_{x\in w}(z-x)p′(z)=∏x∈w​(z−x), which is the kkk-th entry of the sketch SS(w)\mathsf{SS}(w)SS(w) of Construction 5, equals

(−1)k ek(x1,…,xs),ek(x1,…,xs)=∑S⊆[s], ∣S∣=k ∏i∈Sxi.(-1)^k\, e_k(x_1,\dots,x_s),\qquad e_k(x_1,\dots,x_s)=\sum_{S\subseteq[s],\,|S|=k}\ \prod_{i\in S}x_i .(−1)kek​(x1​,…,xs​),ek​(x1​,…,xs​)=S⊆[s],∣S∣=k∑​ i∈S∏​xi​.

This is the paper's remark that outputting the top ttt coefficients of p′p'p′ is equivalent to outputting the first ttt elementary symmetric polynomials of the points of www.

Formalization Note. The paper says "equivalent"; the precise relation includes the sign (−1)k(-1)^k(−1)k, which is stated here. The paper's display writes the second sum as ∑i≠jxixj\sum_{i\neq j}x_ix_j∑i=j​xi​xj​; we read it as the elementary symmetric polynomial e2=∑i<jxixje_2=\sum_{i<j}x_ix_je2​=∑i<j​xi​xj​, consistent with the general term ∑∣S∣=t∏i∈Sxi\sum_{|S|=t}\prod_{i\in S}x_i∑∣S∣=t​∏i∈S​xi​. In Lean the entry indices are 000-based (kkk here is k + 1 for k : Fin t). The paper leaves t≤st\le st≤s implicit; it is a hypothesis here.

Preamble
import Mathlib
import Definitions.Def_FuzzyExtractors_ImprovedJS_Basic
Formal statement
namespace FuzzyExtractors.ImprovedJS

/-- Construction 5, Step 2 (p. 21): the sketch entries are, up to sign, the first t elementary
symmetric polynomials of the points of w: the coefficient of degree s − (k + 1) of p′ is
(−1)^(k+1) e_{k+1}(w). -/
theorem construction_5_step_2 {𝔽 : Type} [Field 𝔽] [DecidableEq 𝔽] (s t : ℕ) (hts : t ≤ s)
    (w : Finset 𝔽) (hw : w.card = s) (k : Fin t) :
    sketchCoeffs s t w k = (-1) ^ ((k : ℕ) + 1) * w.val.esymm ((k : ℕ) + 1) := by sorry

end FuzzyExtractors.ImprovedJS
Source
Dodis, Ostrovsky, Reyzin & Smith, Fuzzy Extractors, arXiv:cs/0602007v4, Construction 5, SS Step 2, p. 21
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 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