Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma C.1 — some sketch value v leaves H∞(W | SS(W) = v) ≥ m′

Proved
FuzzyExtractors.LowerBound.lemma_C_1_good_value

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

min-entropyp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1secure-sketch

Let M\mathcal MM be a finite set, SS\mathsf{SS}SS a randomized sketching procedure on M\mathcal MM, and S⊆MS\subseteq\mathcal MS⊆M nonempty. Let WWW be uniform over SSS and suppose H~∞(W∣SS(W))≥m′\tilde{\mathbf H}_\infty(W\mid\mathsf{SS}(W))\ge m'H~∞​(W∣SS(W))≥m′. Then there is a sketch value vvv with Pr⁡[SS(W)=v]>0\Pr[\mathsf{SS}(W)=v]>0Pr[SS(W)=v]>0 such that for every www,

Pr⁡[W=w∧SS(W)=v]≤2−m′ Pr⁡[SS(W)=v],\Pr[W=w \wedge \mathsf{SS}(W)=v] \le 2^{-m'}\,\Pr[\mathsf{SS}(W)=v],Pr[W=w∧SS(W)=v]≤2−m′Pr[SS(W)=v],

that is, H∞(W∣SS(W)=v)≥m′\mathbf H_\infty(W\mid \mathsf{SS}(W)=v)\ge m'H∞​(W∣SS(W)=v)≥m′.

This is the first step of the proof of Lemma C.1: an average bound on the guessing probability yields one value of the sketch where the bound holds.

Formalization Note The conditional min-entropy is written in joint form, multiplied through by Pr⁡[SS(W)=v]\Pr[\mathsf{SS}(W)=v]Pr[SS(W)=v], so no division by a probability occurs; positivity of Pr⁡[SS(W)=v]\Pr[\mathsf{SS}(W)=v]Pr[SS(W)=v] is part of the conclusion. Probabilities are in [0,∞][0,\infty][0,∞] (ENNReal), and 2−m′2^{-m'}2−m′ is embedded from the reals.

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

/-- Appendix C, proof of Lemma C.1, p. 40: if `W` is uniform over a nonempty `S ⊆ 𝓜` and
`H̃∞(W | SS(W)) ≥ m'`, then some sketch value `v` has positive probability and
`H∞(W | SS(W) = v) ≥ m'`, i.e. `Pr[W = w ∧ SS(W) = v] ≤ 2^(-m') · Pr[SS(W) = v]` for every `w`. -/
theorem lemma_C_1_good_value {M V : Type} [Fintype M] (SS : M → PMF V) (S : Finset M)
    (hS : S.Nonempty) (m' : ℝ)
    (h : m' ≤ FuzzyExtractors.Hamming.avgMinEntropy (FuzzyExtractors.Hamming.withSketch SS (PMF.uniformOfFinset S hS))) :
    ∃ v : V, 0 < ((PMF.uniformOfFinset S hS).bind SS) v ∧
      ∀ w : M, FuzzyExtractors.Hamming.withSketch SS (PMF.uniformOfFinset S hS) (w, v) ≤
        ENNReal.ofReal ((2 : ℝ) ^ (-m')) * ((PMF.uniformOfFinset S hS).bind SS) v := by sorry

end FuzzyExtractors.LowerBound
Source
Dodis, Ostrovsky, Reyzin & Smith, Fuzzy Extractors, arXiv:cs/0602007v4, Appendix C, proof of Lemma C.1, p. 40, "In particular, there must be some value v such that H∞(W | SS(W) = v) ≥ m′"
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