Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Quantum Neyman–Pearson lemma with nonnegative spectral ties

Proved
QAlgorithms.Papers.Independent.Gap48.P41.quantum_Neyman_Pearson

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

prove2quantum

Let III be a nonempty finite orthonormal basis, and let ρ,σ\rho,\sigmaρ,σ be positive semidefinite complex matrices of trace one with supp⁡ρ⊆supp⁡σ\operatorname{supp}\rho\subseteq\operatorname{supp}\sigmasuppρ⊆suppσ. For a positive integer nnn, an arbitrary effect 0≤An≤I0\le A_n\le I0≤An​≤I accepts the null state ρ⊗n\rho^{\otimes n}ρ⊗n. Write αn(An)=Tr⁡[ρ⊗n(I−An)]\alpha_n(A_n)=\operatorname{Tr}[\rho^{\otimes n}(I-A_n)]αn​(An​)=Tr[ρ⊗n(I−An​)] and βn(An)=Tr⁡[σ⊗nAn]\beta_n(A_n)=\operatorname{Tr}[\sigma^{\otimes n}A_n]βn​(An​)=Tr[σ⊗nAn​]. All logarithms are natural, with log⁡0=−∞\log0=-\inftylog0=−∞ in rates. Write D(ρ∥σ)=Tr⁡[ρ(log⁡ρ−log⁡σ)]D(\rho\Vert\sigma)=\operatorname{Tr}[\rho(\log\rho-\log\sigma)]D(ρ∥σ)=Tr[ρ(logρ−logσ)], using support-restricted spectral logarithms inside the trace.

For λ∈R\lambda\in\mathbb Rλ∈R, set Bn,λ=ρ⊗n−enλσ⊗nB_{n,\lambda}=\rho^{\otimes n}-e^{n\lambda}\sigma^{\otimes n}Bn,λ​=ρ⊗n−enλσ⊗n and let Xn,λ=1[0,∞)(Bn,λ)X_{n,\lambda}=\mathbf1_{[0,\infty)}(B_{n,\lambda})Xn,λ​=1[0,∞)​(Bn,λ​) be its nonnegative spectral projection. It is an effect, and every effect AnA_nAn​ satisfies

Tr⁡(Bn,λAn)≤Tr⁡(Bn,λXn,λ).\operatorname{Tr}(B_{n,\lambda}A_n)\le\operatorname{Tr}(B_{n,\lambda}X_{n,\lambda}).Tr(Bn,λ​An​)≤Tr(Bn,λ​Xn,λ​).

This is the paper's variational testing lemma, including its zero-eigenvalue acceptance convention.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P41
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap48.P41

open scoped Matrix ComplexOrder BigOperators

open Filter QAlgorithms

open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)

open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)

open QAlgorithms.Papers.Independent.Information100.P07 (positiveProjection)

open QAlgorithms.Papers.Independent.Dependency50.P28
  (tr SupportLE relativeEntropy scalarPower classicalD typeI accept TestSequence
    scaled logNonnegativeExtended)

open QAlgorithms.Papers.Independent.Claimed50.P15 (legendre)

open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw)

attribute [local instance] Classical.propDecidable Classical.decEq

variable {I : Type} [Fintype I] [DecidableEq I]

/-- PDF p.3, Lemma 1, (5): the nonnegative-spectrum test is an effect and maximizes
Tr[(rho^n-exp(n lambda)sigma^n) A] over ALL effects, with the source's zero ties. -/
theorem quantum_Neyman_Pearson [Nonempty I]
    (rho sigma : Mat I) (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
    (hsupp : SupportLE rho sigma) (n : ℕ) (hn : 0 < n) (lambda : ℝ)
    (A : Mat (Fin n → I)) (hA : IsEffect A) :
    IsEffect (nonnegativeProjection (blockDifference rho sigma n lambda)) ∧
    tr (blockDifference rho sigma n lambda * A) ≤
      tr (blockDifference rho sigma n lambda *
        nonnegativeProjection (blockDifference rho sigma n lambda)) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P41

end
Source
Strong Converse and Stein's Lemma in the Quantum Hypothesis Testing, arXiv:quant-ph/9906090v1, PDF p. 3, §2, Lemma 1, (5): quantum Neyman–Pearson test
Read-back

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

Let III be any nonempty finite index type with decidable equality. Let ρ,σ\rho,\sigmaρ,σ be complex matrices indexed by III, each positive semidefinite with trace 111, and suppose ker⁡σ⊆ker⁡ρ\ker\sigma\subseteq\ker\rhokerσ⊆kerρ. For every positive natural number nnn, real number λ\lambdaλ, and matrix AAA indexed by functions {0,…,n−1}→I\{0,\ldots,n-1\}\to I{0,…,n−1}→I satisfying A⪰0A\succeq0A⪰0 and In−A⪰0I_n-A\succeq0In​−A⪰0, define

B=ρ⊗n−enλσ⊗n,T=In−Pran⁡(f(−B)),f(t)=max⁡(t,0),B=\rho^{\otimes n}-e^{n\lambda}\sigma^{\otimes n}, \qquad T=I_n-P_{\operatorname{ran}(f(-B))}, \qquad f(t)=\max(t,0),B=ρ⊗n−enλσ⊗n,T=In​−Pran(f(−B))​,f(t)=max(t,0),

where (X⊗n)x,y=∏i=0n−1Xxi,yi(X^{\otimes n})_{x,y}=\prod_{i=0}^{n-1}X_{x_i,y_i}(X⊗n)x,y​=∏i=0n−1​Xxi​,yi​​, f(−B)f(-B)f(−B) uses real continuous functional calculus, and PSP_SPS​ is the orthogonal projection onto SSS. Then T⪰0T\succeq0T⪰0 and In−T⪰0I_n-T\succeq0In​−T⪰0, and

Re⁡Tr⁡(BA)≤Re⁡Tr⁡(BT).\operatorname{Re}\operatorname{Tr}(BA) \le \operatorname{Re}\operatorname{Tr}(BT).ReTr(BA)≤ReTr(BT).
Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · 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