Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered Holevo–Helstrom optimum (10)

Open
QAlgorithms.Papers.Independent.Intakenext100.P45.helstrom

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

prove2quantum

For density operators ρ,σ\rho,\sigmaρ,σ with priors π0,π1>0\pi_0,\pi_1>0π0​,π1​>0 summing to one, let D=π1σ−π0ρD=\pi_1\sigma-\pi_0\rhoD=π1​σ−π0​ρ. The projector onto ran⁡D+\operatorname{ran}D_+ranD+​ attains the minimum over every binary effect, and

Pe∗=π1−Tr⁡D+=1−∥D∥12.P_e^*=\pi_1-\operatorname{Tr}D_+=\frac{1-\|D\|_1}{2}.Pe∗​=π1​−TrD+​=21−∥D∥1​​.

The outer factor 1/21/21/2 applies to the complete expression. This is the finite-copy optimum used in the Chernoff theorem.

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 pp.8,9: Unnumbered Holevo–Helstrom optimum (10). -/
theorem helstrom (rho sigma : Mat I)
    (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
    (p0 p1 : ℝ) (h0 : 0 < p0) (h1 : 0 < p1) (hp : p0+p1=1) :
    let D := (p1 : ℂ) • sigma - (p0 : ℂ) • rho
    let Pstar := positiveProjection D
    IsProjection Pstar ∧ IsEffect Pstar ∧
    bayesError rho sigma Pstar p0 p1 = p1-(positivePart D).trace.re ∧
    p1-(positivePart D).trace.re = helstromError rho sigma p0 p1 ∧
    (∀ P : Mat I, IsEffect P →
      helstromError rho sigma p0 p1 ≤ bayesError rho sigma P p0 p1) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P45

end
Source
Asymptotic Error Rates in Quantum Hypothesis Testing, arXiv:0708.4282v1, PDF p. 8, Unnumbered Holevo–Helstrom optimum (10)
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 positive semidefinite complex matrices ρ,σ\rho,\sigmaρ,σ indexed by III with trace one, and every real p0,p1>0p_0,p_1>0p0​,p1​>0 satisfying p0+p1=1p_0+p_1=1p0​+p1​=1, let

D=p1σ−p0ρ,D+=max⁡(D,0),P∗=the orthogonal projection onto range⁡(D+),D=p_1\sigma-p_0\rho,\qquad D_+=\max(D,0),\qquad P_*=\text{the orthogonal projection onto }\operatorname{range}(D_+),D=p1​σ−p0​ρ,D+​=max(D,0),P∗​=the orthogonal projection onto range(D+​),

with the positive part defined by continuous functional calculus. Define

B(P)=p0Re⁡tr⁡(Pρ)+p1Re⁡tr⁡((1−P)σ),∥M∥1=Re⁡tr⁡M†M.B(P)=p_0\operatorname{Re}\operatorname{tr}(P\rho) +p_1\operatorname{Re}\operatorname{tr}((1-P)\sigma), \qquad \|M\|_1=\operatorname{Re}\operatorname{tr}\sqrt{M^\dagger M}.B(P)=p0​Retr(Pρ)+p1​Retr((1−P)σ),∥M∥1​=RetrM†M​.

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

B(P∗)=p1−Re⁡tr⁡(D+)=1−∥D∥12.B(P_*)=p_1-\operatorname{Re}\operatorname{tr}(D_+) =\frac{1-\|D\|_1}{2}.B(P∗​)=p1​−Retr(D+​)=21−∥D∥1​​.

For every matrix PPP such that PPP and 1−P1-P1−P are positive semidefinite,

1−∥D∥12≤B(P).\frac{1-\|D\|_1}{2}\leq B(P).21−∥D∥1​​≤B(P).

The density hypotheses exclude an empty III.

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