Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6.2, p. 21 — ∣w∩w′∣≥s−t/2|w\cap w'|\ge s-t/2∣w∩w′∣≥s−t/2, so −q-q−q satisfies Step 3 of Rec\mathsf{Rec}Rec

Proved
FuzzyExtractors.ImprovedJS.intersection_bound

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

combinatoricsp2o-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,w′⊆Fw,w'\subseteq\mathcal Fw,w′⊆F with ∣w∣=∣w′∣=s|w|=|w'|=s∣w∣=∣w′∣=s and ∣w△w′∣≤t|w\triangle w'|\le t∣w△w′∣≤t. Then

  1. www and w′w'w′ have at least s−t/2s-t/2s−t/2 common points:
2 ∣w∩w′∣ ≥ 2s−t;2\,|w\cap w'|\ \ge\ 2s-t;2∣w∩w′∣ ≥ 2s−t;
  1. the polynomial −q-q−q, where q=p′−phighq=p'-p_{\mathrm{high}}q=p′−phigh​ for p′=∏x∈w(z−x)p'=\prod_{x\in w}(z-x)p′=∏x∈w​(z−x) and phighp_{\mathrm{high}}phigh​ built from SS(w)\mathsf{SS}(w)SS(w), satisfies the condition of Step 3 of Rec(w′,SS(w))\mathsf{Rec}(w',\mathsf{SS}(w))Rec(w′,SS(w)) in Construction 5: deg⁡(−q)≤s−t−1\deg(-q)\le s-t-1deg(−q)≤s−t−1 and −q(x)=phigh(x)-q(x)=p_{\mathrm{high}}(x)−q(x)=phigh​(x) for at least s−t/2s-t/2s−t/2 points x∈w′x\in w'x∈w′.

This shows that the Reed–Solomon decoding step of the recovery procedure has a solution whenever the input set is within distance ttt of the original.

Formalization Note. "At least s−t/2s-t/2s−t/2" is doubled to 2⋅#≥2s−t2\cdot\#\ge 2s-t2⋅#≥2s−t in N\mathbb NN, which covers odd ttt (distances in SDifs\mathrm{SDif}_sSDifs​ are even). 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): if |w| = |w′| = s and |w △ w′| ≤ t, then w and w′ share at
least s − t/2 points (doubled: 2|w ∩ w′| ≥ 2s − t), and −q, where q = p′ − p_high, satisfies the
condition of Step 3 of Rec on input (w′, SS(w)). -/
theorem intersection_bound {𝔽 : Type} [Field 𝔽] [DecidableEq 𝔽] (s t : ℕ) (hts : t ≤ s)
    (w w' : Finset 𝔽) (hw : w.card = s) (hw' : w'.card = s) (hd : (symmDiff w w').card ≤ t) :
    2 * s - t ≤ 2 * (w ∩ w').card ∧
      Step3Cond s t (sketchCoeffs s t w) w'
        (-(charPoly w - pHigh s t (sketchCoeffs s t w))) := by sorry

end FuzzyExtractors.ImprovedJS
Source
Dodis, Ostrovsky, Reyzin & Smith, Fuzzy Extractors, arXiv:cs/0602007v4, §6.2, analysis of Construction 5, p. 21, "Since the set w intersects w′ in at least s−t/2 points, the polynomial −q satisfies the conditions of Step 3 in Rec"; cf. §6, p. 18
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