Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6.2, p. 21 — p′=phigh+qp' = p_{\mathrm{high}} + qp′=phigh​+q with deg⁡q≤s−t−1\deg q \le s-t-1degq≤s−t−1, and phighp_{\mathrm{high}}phigh​, −q-q−q agree on www

Proved
FuzzyExtractors.ImprovedJS.split_agree

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

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1polynomialssecure-sketch

Let F\mathcal FF be a field, t≤st\le st≤s natural numbers and w⊆Fw\subseteq\mathcal Fw⊆F a set with ∣w∣=s|w|=s∣w∣=s. Let p′(z)=∏x∈w(z−x)p'(z)=\prod_{x\in w}(z-x)p′(z)=∏x∈w​(z−x) and let phigh(z)=zs+∑i=s−ts−1aizip_{\mathrm{high}}(z)=z^s+\sum_{i=s-t}^{s-1}a_iz^iphigh​(z)=zs+∑i=s−ts−1​ai​zi be built from the sketch SS(w)=(as−1,…,as−t)\mathsf{SS}(w)=(a_{s-1},\dots,a_{s-t})SS(w)=(as−1​,…,as−t​) of Construction 5, the coefficients of p′p'p′ of degree s−1s-1s−1 down to s−ts-ts−t. Then there is a polynomial qqq with

p′=phigh+q,deg⁡q≤s−t−1,phigh(x)=−q(x)  for all x∈w.p' = p_{\mathrm{high}} + q,\qquad \deg q\le s-t-1,\qquad p_{\mathrm{high}}(x) = -q(x)\ \text{ for all } x\in w.p′=phigh​+q,degq≤s−t−1,phigh​(x)=−q(x)  for all x∈w.

This is the first step of the paper's correctness argument for Construction 5: the decoder knows phighp_{\mathrm{high}}phigh​, and on the points of www its values are those of the low-degree polynomial −q-q−q.

Formalization Note. "deg⁡q≤s−t−1\deg q\le s-t-1degq≤s−t−1" is q.degree < s - t, which forces q=0q=0q=0 when t=st=st=s. The paper leaves t≤st\le st≤s implicit; it is a hypothesis here.

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

/-- Construction 5 analysis (p. 21): p′ = p_high + q with deg q ≤ s − t − 1, and p_high, −q agree
on every point of w. -/
theorem split_agree {𝔽 : Type} [Field 𝔽] [DecidableEq 𝔽] (s t : ℕ) (hts : t ≤ s)
    (w : Finset 𝔽) (hw : w.card = s) :
    ∃ q : 𝔽[X], charPoly w = pHigh s t (sketchCoeffs s t w) + q ∧
      q.degree < ((s - t : ℕ) : WithBot ℕ) ∧
      ∀ x ∈ w, (pHigh s t (sketchCoeffs s t w)).eval x = -(q.eval x) := by sorry

end FuzzyExtractors.ImprovedJS
Source
Dodis, Ostrovsky, Reyzin & Smith, Fuzzy Extractors, arXiv:cs/0602007v4, §6.2, analysis of Construction 5, p. 21, "We can write p′ as p_high + q … agree at all points in w"
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