Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma C.1 (second sentence) — for uniform passwords, m′ ≤ log K(𝓜, t)

Proved
FuzzyExtractors.LowerBound.lemma_C_1_uniform

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

coding-theorylower-boundp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1secure-sketch

Let M\mathcal MM be a nonempty finite metric space with integer-valued distance dis\mathrm{dis}dis. If (SS,Rec)(\mathsf{SS},\mathsf{Rec})(SS,Rec) is an (M,m,m′,t)(\mathcal M,m,m',t)(M,m,m′,t)-secure sketch with m=log⁡∣M∣m=\log|\mathcal M|m=log∣M∣ (the password is truly uniform), then

m′≤log⁡K(M,t),m' \le \log K(\mathcal M,t),m′≤logK(M,t),

where K(M,t)K(\mathcal M,t)K(M,t) is the largest size of an (M,K,t)(\mathcal M,K,t)(M,K,t)-code.

The residual entropy of a sketch for uniform inputs is bounded by the logarithm of the best code size, so sketches built from optimal codes have optimal entropy loss.

Formalization Note The metric axioms of §2.1 are stated explicitly; nonemptiness of M\mathcal MM is implicit in the paper (for empty M\mathcal MM no distribution exists and the claim fails). K(M,t)K(\mathcal M,t)K(M,t) is K dis t Finset.univ.

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

/-- Lemma C.1, second sentence (Appendix C, p. 40): when `m = log |𝓜|`, an (𝓜, m, m', t)-secure
sketch has `m' ≤ log K(𝓜, t)`. -/
theorem lemma_C_1_uniform {M V : Type} [Fintype M] [Nonempty 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)
    (m m' : ℝ) (t : ℕ)
    (SS : M → PMF V) (Rec : M → V → PMF M) (hSS : FuzzyExtractors.Hamming.IsSecureSketch dis m m' t SS Rec)
    (hm : m = Real.logb 2 (Fintype.card M)) :
    m' ≤ Real.logb 2 (K dis t Finset.univ) := by sorry

end FuzzyExtractors.LowerBound
Source
Dodis, Ostrovsky, Reyzin & Smith, Fuzzy Extractors, arXiv:cs/0602007v4, Lemma C.1 (second sentence), p. 40
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