Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 4.3, p. 11 — for any outcome x, the probability over the test that x ∉ B_test is negligible in m

Proved
CommitOpen.Benign.sampling_negligible

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

concentrationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-cryptographysampling

Fix 0<α<10<\alpha<10<α<1 and ε>0\varepsilon>0ε>0. There is a negligible function ν\nuν such that for every mmm and all strings x,x^∈{0,1}mx,\hat x\in\{0,1\}^mx,x^∈{0,1}m,

Pr⁡test∼PTest[x∉Btest]≤ν(m),\Pr_{test\sim P_{Test}}\big[x\notin B_{test}\big]\le\nu(m),test∼PTest​Pr​[x∈/Btest​]≤ν(m),

where test=(T,T′)test=(T,T')test=(T,T′), TTT is a uniform subset of size k=⌊αm⌋k=\lfloor\alpha m\rfloork=⌊αm⌋, T′T'T′ is a uniform subset of TTT, and Btest={x:rH(x∣Tˉ,x^∣Tˉ)≤rH(x∣T′,x^∣T′)+ε}B_{test}=\{x: r_H(x|_{\bar T},\hat x|_{\bar T})\le r_H(x|_{T'},\hat x|_{T'})+\varepsilon\}Btest​={x:rH​(x∣Tˉ​,x^∣Tˉ​)≤rH​(x∣T′​,x^∣T′​)+ε}.

The relative error rate on a random sample of positions predicts the error rate on the unsampled positions. This is the classical sampling problem the paper invokes with a reference to Hoeffding's inequality; it is the probabilistic core of Lemma 4.3.

Formalization Note. ν\nuν depends only on α\alphaα and ε\varepsilonε; it is uniform in mmm, xxx and x^\hat xx^. The paper's ∣T∣=αm|T|=\alpha m∣T∣=αm is ⌊αm⌋\lfloor\alpha m\rfloor⌊αm⌋, identical when αm\alpha mαm is an integer. rHr_HrH​ on T′=∅T'=\emptysetT′=∅ is 000.

Preamble
import Mathlib
import Definitions.Def_CommitOpen_Benign_Model
Formal statement
namespace CommitOpen.Benign

theorem sampling_negligible (α ε : ℝ) (hα0 : 0 < α) (hα1 : α < 1) (hε : 0 < ε) :
    ∃ ν : ℕ → ℝ, Negligible ν ∧
      ∀ (m : ℕ) (x xhat : Fin m → Bool),
        ∑ t ∈ Finset.univ.filter (fun t : Test m ⌊α * m⌋₊ => x ∉ goodSet ε xhat t),
          testProb m ⌊α * m⌋₊ t ≤ ν m := by sorry

end CommitOpen.Benign
Source
Damgård, Fehr, Lunemann, Salvail & Schaffner, Improving the Security of Quantum Protocols via Commit-and-Open, arXiv:0902.3918v4, p. 11, proof of Lemma 4.3 (last sentence), citing [Hoe63]
Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 22, 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