Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.3, pp. 10–11 — ρ_TestAE is negligibly close to a state whose every branch is supported on B_test in Bob's basis

Proved
CommitOpen.Benign.lemma_4_3

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

commit-and-openp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-cryptographyquantum-samplingtrace-distance

Fix 0<α<10<\alpha<10<α<1 and ε>0\varepsilon>0ε>0. There is a negligible function ν\nuν with the following property. Let mmm be the number of qubits, k=⌊αm⌋k=\lfloor\alpha m\rfloork=⌊αm⌋, let x^∈{0,1}m\hat x\in\{0,1\}^mx^∈{0,1}m and θ^∈{+,×}m\hat\theta\in\{+,\times\}^mθ^∈{+,×}m be Bob's committed outcomes and bases, and let ∣φAE⟩|\varphi_{AE}\rangle∣φAE​⟩ be any unit vector of HA⊗HE\mathcal H_A\otimes\mathcal H_EHA​⊗HE​ (Alice's mmm qubits and Bob's finite-dimensional register), the joint state right before Step 2 of the verification in Fig. 4. Then there are unit vectors ∣φ~AEtest⟩|\tilde\varphi^{test}_{AE}\rangle∣φ~​AEtest​⟩, one for each test (T,T′)(T,T')(T,T′), such that

  1. each ∣φ~AEtest⟩|\tilde\varphi^{test}_{AE}\rangle∣φ~​AEtest​⟩ has the form ∑x∈Btestαxtest∣x⟩θ^∣ψEx⟩\sum_{x\in B_{test}}\alpha^{test}_x|x\rangle_{\hat\theta}|\psi^x_E\rangle∑x∈Btest​​αxtest​∣x⟩θ^​∣ψEx​⟩, i.e. (⟨x∣θ^⊗1)∣φ~AEtest⟩=0(\langle x|_{\hat\theta}\otimes1)|\tilde\varphi^{test}_{AE}\rangle=0(⟨x∣θ^​⊗1)∣φ~​AEtest​⟩=0 for every x∉Btestx\notin B_{test}x∈/Btest​;
  2. the cq states ρTestAE=ρTest⊗∣φAE⟩⟨φAE∣\rho_{TestAE}=\rho_{Test}\otimes|\varphi_{AE}\rangle\langle\varphi_{AE}|ρTestAE​=ρTest​⊗∣φAE​⟩⟨φAE​∣ and ρ~TestAE=∑testPTest(test)∣test⟩⟨test∣⊗∣φ~AEtest⟩⟨φ~AEtest∣\tilde\rho_{TestAE}=\sum_{test}P_{Test}(test)|test\rangle\langle test|\otimes|\tilde\varphi^{test}_{AE}\rangle\langle\tilde\varphi^{test}_{AE}|ρ~​TestAE​=∑test​PTest​(test)∣test⟩⟨test∣⊗∣φ~​AEtest​⟩⟨φ~​AEtest​∣ satisfy
δ(ρTestAE,ρ~TestAE)≤ν(m).\delta(\rho_{TestAE},\tilde\rho_{TestAE})\le\nu(m).δ(ρTestAE​,ρ~​TestAE​)≤ν(m).

Up to a negligible error, for every choice of the test and every outcome on TTT, the error rate observed on T′T'T′ bounds the error rate Alice would see on Tˉ\bar TTˉ if she measured in Bob's bases.

Formalization Note. "Negligibly close (in mmm)" is read as one negligible ν\nuν, chosen before mmm, x^\hat xx^, θ^\hat\thetaθ^, Bob's register and the state, so uniform in all of them. The coefficients αxtest\alpha^{test}_xαxtest​ are arbitrary, so the form in item 1 is exactly vanishing amplitude outside BtestB_{test}Btest​. The state is pure; the paper notes (p. 10) that a mixed state is purified and the purifying register joins EEE. ∣T∣=⌊αm⌋|T|=\lfloor\alpha m\rfloor∣T∣=⌊αm⌋.

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

theorem lemma_4_3 (α ε : ℝ) (hα0 : 0 < α) (hα1 : α < 1) (hε : 0 < ε) :
    ∃ ν : ℕ → ℝ, Negligible ν ∧
      ∀ (m : ℕ) (xhat θhat : Fin m → Bool) (E : Type) [Fintype E] [DecidableEq E]
        (φ : EuclideanSpace ℂ ((Fin m → Bool) × E)), ‖φ‖ = 1 →
        ∃ φt : Test m ⌊α * m⌋₊ → EuclideanSpace ℂ ((Fin m → Bool) × E),
          (∀ t, ‖φt t‖ = 1) ∧
          (∀ t y, y ∉ goodSet ε xhat t → amp θhat y (φt t) = 0) ∧
          traceDistance (cqState (fun _ : Test m ⌊α * m⌋₊ => φ)) (cqState φ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, pp. 10–11, Lemma 4.3
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