Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Supplementary Note 2, Lemma 1: high fidelity implies low entropy

Open
QAlgorithms.Papers.Independent.Intakenext100.P87.lemma_1

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let R≥1R\ge1R≥1 and let ρ\rhoρ be a positive semidefinite trace-one operator on the RRR pairs. Entropy is measured in bits. Suppose 0<δ<1−4−R0<\delta<1-4^{-R}0<δ<1−4−R and the squared singlet overlap satisfies ⟨Ψ−⊗R∣ρ∣Ψ−⊗R⟩>1−δ\langle\Psi^-{}^{\otimes R}|\rho|\Psi^-{}^{\otimes R}\rangle>1-\delta⟨Ψ−⊗R∣ρ∣Ψ−⊗R⟩>1−δ. Then

S(ρ)<−(1−δ)log⁡2(1−δ)−δlog⁡2 ⁣(δ4R−1).S(\rho)<-(1-\delta)\log_2(1-\delta)-\delta\log_2\!\left(\frac{\delta}{4^R-1}\right).S(ρ)<−(1−δ)log2​(1−δ)−δlog2​(4R−1δ​).

The explicit interval for δ\deltaδ is the increasing branch used in the source's maximum-entropy comparison, and the strict inequality matches the strict overlap assumption.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P87
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P87

open scoped Matrix ComplexConjugate

open QAlgorithms.Measurements

/-- PDF p.19, Lemma 1: the proof uses the increasing entropy branch, here stated explicitly. -/
theorem lemma_1 (R : ℕ) (hR : 0 < R)
    (rho : Matrix (PairRegister R) (PairRegister R) ℂ) (hrho : IsDensityMatrix rho)
    (delta : ℝ) (hd : 0 < delta) (hsmall : delta < 1 - 1 / (2 : ℝ) ^ (2 * R))
    (hF : 1 - delta < singletOverlap rho) :
    vnEntropy rho < -(1 - delta) * Real.logb 2 (1 - delta) -
      delta * Real.logb 2 (delta / ((2 : ℝ) ^ (2 * R) - 1)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P87

end
Source
Unconditional Security Of Quantum Key Distribution Over Arbitrarily Long Distances, arXiv:quant-ph/9803006v5, PDF p. 19, Supplementary Note 2, Lemma 1: high fidelity implies low entropy
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every positive integer RRR, let ρ\rhoρ be a positive semidefinite complex matrix of trace 111, indexed by pairs of Boolean strings of length RRR. Define sR(u,v)=2−R/2(−1)∣{i:ui=true}∣s_R(u,v)=2^{-R/2}(-1)^{|\{i:u_i=\mathrm{true}\}|}sR​(u,v)=2−R/2(−1)∣{i:ui​=true}∣ if vi=¬uiv_i=\neg u_ivi​=¬ui​ for every iii, and zero otherwise. For every real δ\deltaδ satisfying 0<δ<1−2−2R0<\delta<1-2^{-2R}0<δ<1−2−2R, if

1−δ<Re⁡tr⁡(sRsR†ρ),1-\delta<\operatorname{Re}\operatorname{tr}(s_Rs_R^\dagger\rho),1−δ<Retr(sR​sR†​ρ),

then

−Re⁡tr⁡ ⁣(f(ρ))<−(1−δ)log⁡2(1−δ)−δlog⁡2 ⁣(δ22R−1),-\operatorname{Re}\operatorname{tr}\!\bigl(f(\rho)\bigr) < -(1-\delta)\log_2(1-\delta) -\delta\log_2\!\left(\frac{\delta}{2^{2R}-1}\right),−Retr(f(ρ))<−(1−δ)log2​(1−δ)−δlog2​(22R−1δ​),

where f(t)=tlog⁡2tf(t)=t\log_2tf(t)=tlog2​t is applied to ρ\rhoρ by continuous functional calculus, with f(0)=0f(0)=0f(0)=0. Both the overlap hypothesis and the entropy conclusion are strict inequalities; R=0R=0R=0 is excluded.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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