Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 4.4, p. 11 — min-entropy and max-entropy bounds h(err + ε)n after the test

Proved
CommitOpen.Benign.corollary_4_4

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

commit-and-openmax-entropymin-entropyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-cryptography

Let ε>0\varepsilon>0ε>0, x^∈{0,1}m\hat x\in\{0,1\}^mx^∈{0,1}m, θ^∈{+,×}m\hat\theta\in\{+,\times\}^mθ^∈{+,×}m, and let ∣φ~AEtest⟩|\tilde\varphi^{test}_{AE}\rangle∣φ~​AEtest​⟩ be a unit vector of the form of Lemma 4.3 for a fixed test (T,T′)(T,T')(T,T′): (⟨y∣θ^⊗1)∣φ~AEtest⟩=0(\langle y|_{\hat\theta}\otimes1)|\tilde\varphi^{test}_{AE}\rangle=0(⟨y∣θ^​⊗1)∣φ~​AEtest​⟩=0 for all y∉Btesty\notin B_{test}y∈/Btest​. Fix Alice's bases θ\thetaθ and an outcome x∣Tx|_Tx∣T​ of measuring the registers AiA_iAi​, i∈Ti\in Ti∈T, in the bases θ^i\hat\theta_iθ^i​, observed with positive probability, and let

err:=rH(x∣T′,x^∣T′),err+ε≤12.err:=r_H(x|_{T'},\hat x|_{T'}),\qquad err+\varepsilon\le\tfrac12.err:=rH​(x∣T′​,x^∣T′​),err+ε≤21​.

Let σE\sigma_EσE​ be Bob's state after this measurement, let n=∣Tˉ∣n=|\bar T|n=∣Tˉ∣, and let XXX be the outcome of measuring the remaining registers in the bases θ∣Tˉ\theta|_{\bar T}θ∣Tˉ​. Then

H0(σE)≤h(err+ε) n,H_0(\sigma_E)\le h(err+\varepsilon)\,n,H0​(σE​)≤h(err+ε)n,

and for every I⊆TˉI\subseteq\bar TI⊆Tˉ and every x∣Iˉx|_{\bar I}x∣Iˉ​ of positive probability,

H∞(X∣I ∣ X∣Iˉ=x∣Iˉ)≥dH(θ∣I,θ^∣I)−h(err+ε) n.H_\infty\big(X|_I\,\big|\,X|_{\bar I}=x|_{\bar I}\big)\ge d_H(\theta|_I,\hat\theta|_I)-h(err+\varepsilon)\,n.H∞​(X∣I​​X∣Iˉ​=x∣Iˉ​)≥dH​(θ∣I​,θ^∣I​)−h(err+ε)n.

The number of errors on the checked positions bounds both the uncertainty of Alice's remaining bits and the size of Bob's quantum memory. With err=0err=0err=0 these are the bounds (1) of Definition 4.1 with β=h(ε)\beta=h(\varepsilon)β=h(ε).

Formalization Note. The paper assumes err≤12err\le\tfrac12err≤21​; the proof uses the Hamming-ball bound with radius (err+ε)n(err+\varepsilon)n(err+ε)n, valid only for err+ε≤12err+\varepsilon\le\tfrac12err+ε≤21​. As printed the corollary fails (err=ε=12err=\varepsilon=\tfrac12err=ε=21​: BtestB_{test}Btest​ is everything, H0(σE)H_0(\sigma_E)H0​(σE​) can be nnn, while h(1)n=0h(1)n=0h(1)n=0), so the hypothesis err+ε≤12err+\varepsilon\le\tfrac12err+ε≤21​ is used. ∣T∣|T|∣T∣ is any kkk (the paper's αm\alpha mαm); the proof does not use it. Alice's measurements on TTT (in θ^\hat\thetaθ^) and on Tˉ\bar TTˉ (in θ\thetaθ) are one measurement in the mixed basis; the conditioning X∣Iˉ=x∣IˉX|_{\bar I}=x|_{\bar I}X∣Iˉ​=x∣Iˉ​ includes the observed x∣Tx|_Tx∣T​, as in the paper, where ∣ψAE⟩|\psi_{AE}\rangle∣ψAE​⟩ is the collapsed state. σE\sigma_EσE​ is kept unnormalized (same rank). III and Iˉ\bar IIˉ are sets of positions in {1,…,m}\{1,\dots,m\}{1,…,m}, with I⊆TˉI\subseteq\bar TI⊆Tˉ, as in footnote 12.

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

theorem corollary_4_4 {m k : ℕ} {E : Type} [Fintype E] [DecidableEq E] (ε : ℝ) (hε : 0 < ε)
    (xhat θhat θ : Fin m → Bool) (t : Test m k)
    (φt : EuclideanSpace ℂ ((Fin m → Bool) × E)) (hunit : ‖φt‖ = 1)
    (hform : ∀ y, y ∉ goodSet ε xhat t → amp θhat y φt = 0)
    (x : Fin m → Bool) (herr : relHamming t.1.2 x xhat + ε ≤ 1 / 2)
    (hpos : 0 < ∑ y ∈ agreeOn t.1.1 x, outcomeProb (mixBasis t.1.1 θhat θ) φt y) :
    maxEntropy (bobState (mixBasis t.1.1 θhat θ) φt t.1.1 x) ≤
        binEntropy2 (relHamming t.1.2 x xhat + ε) * (t.1.1ᶜ.card : ℝ) ∧
      ∀ I : Finset (Fin m), I ⊆ t.1.1ᶜ →
        0 < ∑ y ∈ agreeOn Iᶜ x, outcomeProb (mixBasis t.1.1 θhat θ) φt y →
        (hammingOn I θ θhat : ℝ) - binEntropy2 (relHamming t.1.2 x xhat + ε) * (t.1.1ᶜ.card : ℝ) ≤
          condMinEntropy (outcomeProb (mixBasis t.1.1 θhat θ) φt) I x := 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, Corollary 4.4 (with footnote 12)
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