Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1, Quantum Neyman–Pearson

Open
QAlgorithms.Papers.Independent.Intakenext100.P45.quantumNeymanPearson

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

prove2quantum

Let ρ,σ\rho,\sigmaρ,σ be density operators, T>0T>0T>0, and P∗P_*P∗​ the projector onto the range of (Tσ−ρ)+(T\sigma-\rho)_+(Tσ−ρ)+​. For any effect 0≤P≤I0\le P\le I0≤P≤I, define α(P)=Tr⁡(Pρ)\alpha(P)=\operatorname{Tr}(P\rho)α(P)=Tr(Pρ) and β(P)=Tr⁡((I−P)σ)\beta(P)=\operatorname{Tr}((I-P)\sigma)β(P)=Tr((I−P)σ). Then

α(P)+Tβ(P)≥α(P∗)+Tβ(P∗)=T−Tr⁡(Tσ−ρ)+.\alpha(P)+T\beta(P)\ge\alpha(P_*)+T\beta(P_*)=T-\operatorname{Tr}(T\sigma-\rho)_+.α(P)+Tβ(P)≥α(P∗​)+Tβ(P∗​)=T−Tr(Tσ−ρ)+​.

Moreover, α(P)≤α(P∗)\alpha(P)\le\alpha(P_*)α(P)≤α(P∗​) implies β(P)≥β(P∗)\beta(P)\ge\beta(P_*)β(P)≥β(P∗​). The strict positive spectral projector excludes the kernel, without any support-inclusion assumption.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P45
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P45

open QAlgorithms Filter

open scoped Matrix ComplexConjugate ComplexOrder ENNReal BigOperators Topology

open QAlgorithms.Papers.Independent.Information100.P07
  (support positivePart positiveProjection IsProjection)

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

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

open QAlgorithms.Papers.Independent.Dependency50.P28 (logNonnegativeExtended relativeEntropy)

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

attribute [local instance] Classical.propDecidable Classical.decEq

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

/-- arXiv:0708.4282v1, PDF p.7: Lemma 1, Quantum Neyman–Pearson. -/
theorem quantumNeymanPearson (rho sigma : Mat I)
    (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
    (T : ℝ) (hT : 0 < T) (P : Mat I) (hP : IsEffect P) :
    let Pstar := positiveProjection ((T : ℂ) • sigma-rho)
    IsProjection Pstar ∧ IsEffect Pstar ∧
    typeIError rho Pstar + T*typeIIError sigma Pstar ≤ typeIError rho P + T*typeIIError sigma P ∧
    typeIError rho Pstar + T*typeIIError sigma Pstar =
      T-(positivePart ((T : ℂ) • sigma-rho)).trace.re ∧
    (typeIError rho P ≤ typeIError rho Pstar → typeIIError sigma Pstar ≤ typeIIError sigma P) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P45

end
Source
Asymptotic Error Rates in Quantum Hypothesis Testing, arXiv:0708.4282v1, PDF p. 7, Lemma 1, Quantum Neyman–Pearson
Read-back

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

For every finite index type III with decidable equality, every pair of positive semidefinite complex matrices ρ,σ\rho,\sigmaρ,σ indexed by III with tr⁡ρ=tr⁡σ=1\operatorname{tr}\rho=\operatorname{tr}\sigma=1trρ=trσ=1, every real T>0T>0T>0, and every matrix PPP such that PPP and 1−P1-P1−P are positive semidefinite, define

A=Tσ−ρ,A+=max⁡(A,0),P∗=the orthogonal projection onto range⁡(A+),A=T\sigma-\rho,\qquad A_+=\max(A,0),\qquad P_*=\text{the orthogonal projection onto }\operatorname{range}(A_+),A=Tσ−ρ,A+​=max(A,0),P∗​=the orthogonal projection onto range(A+​),

where the positive part is defined by continuous functional calculus. Write

αρ(Q)=Re⁡tr⁡(Qρ),βσ(Q)=Re⁡tr⁡((1−Q)σ).\alpha_\rho(Q)=\operatorname{Re}\operatorname{tr}(Q\rho), \qquad \beta_\sigma(Q)=\operatorname{Re}\operatorname{tr}((1-Q)\sigma).αρ​(Q)=Retr(Qρ),βσ​(Q)=Retr((1−Q)σ).

Then P∗P_*P∗​ is Hermitian and idempotent, both P∗P_*P∗​ and 1−P∗1-P_*1−P∗​ are positive semidefinite, and

αρ(P∗)+Tβσ(P∗)≤αρ(P)+Tβσ(P),αρ(P∗)+Tβσ(P∗)=T−Re⁡tr⁡(A+).\alpha_\rho(P_*)+T\beta_\sigma(P_*) \leq \alpha_\rho(P)+T\beta_\sigma(P), \qquad \alpha_\rho(P_*)+T\beta_\sigma(P_*) =T-\operatorname{Re}\operatorname{tr}(A_+).αρ​(P∗​)+Tβσ​(P∗​)≤αρ​(P)+Tβσ​(P),αρ​(P∗​)+Tβσ​(P∗​)=T−Retr(A+​).

Moreover, αρ(P)≤αρ(P∗)\alpha_\rho(P)\leq\alpha_\rho(P_*)αρ​(P)≤αρ​(P∗​) implies βσ(P∗)≤βσ(P)\beta_\sigma(P_*)\leq\beta_\sigma(P)βσ​(P∗​)≤βσ​(P). The density hypotheses cannot hold when III is empty.

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