Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma C.1 — the points producing a fixed sketch value form a code of error-correcting distance t

Proved
FuzzyExtractors.LowerBound.lemma_C_1_T_isCode

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

coding-theoryp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1secure-sketch

Let M\mathcal MM be a finite metric space with integer-valued distance dis\mathrm{dis}dis, and let (SS,Rec)(\mathsf{SS},\mathsf{Rec})(SS,Rec) satisfy the correctness property of a secure sketch for ttt errors: if dis(w,w′)≤t\mathrm{dis}(w,w')\le tdis(w,w′)≤t and sss is a possible output of SS(w)\mathsf{SS}(w)SS(w), then Rec(w′,s)=w\mathsf{Rec}(w',s)=wRec(w′,s)=w. Then for every S⊆MS\subseteq\mathcal MS⊆M and every sketch value vvv, the set

T={ w∈S:Pr⁡[SS(w)=v]>0 }T = \{\,w\in S : \Pr[\mathsf{SS}(w)=v]>0\,\}T={w∈S:Pr[SS(w)=v]>0}

is an (M,∣T∣,t)(\mathcal M,|T|,t)(M,∣T∣,t)-code: for every w′∈Mw'\in\mathcal Mw′∈M, at most one element of TTT lies within distance ttt of w′w'w′.

This is the step of the proof of Lemma C.1 that converts the correctness of the sketch into a packing of balls.

Formalization Note The metric axioms of §2.1 are explicit hypotheses. Symmetry is used because the ball condition measures dis(w′,c)\mathrm{dis}(w',c)dis(w′,c) while correctness is stated for dis(c,w′)\mathrm{dis}(c,w')dis(c,w′); zero distance and the triangle inequality carry the paper's standing metric assumption.

Preamble
import Mathlib
import Definitions.Def_FuzzyExtractors_LowerBound_Basic
Formal statement
namespace FuzzyExtractors.LowerBound

/-- Appendix C, proof of Lemma C.1, pp. 40–41: for a sketch with the correctness property for
distance `t` in a finite metric space, the points of `S` that can produce a fixed sketch value
`v` form a code of error-correcting distance `t`. -/
theorem lemma_C_1_T_isCode {M V : Type} [Fintype M] (dis : M → M → ℕ)
    (hzero : ∀ x y, dis x y = 0 ↔ x = y)
    (hsymm : ∀ x y, dis x y = dis y x)
    (htri : ∀ x y z, dis x z ≤ dis x y + dis y z)
    (t : ℕ) (SS : M → PMF V) (Rec : M → V → PMF M)
    (hcorr : FuzzyExtractors.Hamming.SketchCorrect dis t SS Rec) (S : Finset M) (v : V) :
    FuzzyExtractors.Hamming.IsCode dis (producers SS S v) t := by sorry

end FuzzyExtractors.LowerBound
Source
Dodis, Ostrovsky, Reyzin & Smith, Fuzzy Extractors, arXiv:cs/0602007v4, Appendix C, proof of Lemma C.1, pp. 40–41, "We claim that these 2^{m′} values of w form a code of error-correcting distance t"
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