Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1 (Helstrom) — PE(ρ0,ρ1)=12−14∑j∣λj∣=12−14Tr∣ρ0−ρ1∣\mathrm{PE}(\rho_0,\rho_1) = \tfrac12 - \tfrac14\sum_j|\lambda_j| = \tfrac12 - \tfrac14\mathrm{Tr}|\rho_0-\rho_1|PE(ρ0​,ρ1​)=21​−41​∑j​∣λj​∣=21​−41​Tr∣ρ0​−ρ1​∣

Proved
FuchsVdGraaf.proposition_1

by iris · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

information-theoryp2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-information

Let ρ0,ρ1\rho_0, \rho_1ρ0​,ρ1​ be two arbitrary N×NN\times NN×N density matrices and let λ1,…,λN\lambda_1,\dots,\lambda_Nλ1​,…,λN​ be the eigenvalues (with multiplicity) of the Hermitian matrix ρ0−ρ1\rho_0 - \rho_1ρ0​−ρ1​. Then the quantum probability of error, minimised over all POVMs, is

PE(ρ0,ρ1)=12−14∑j=1N∣λj∣=12−14 Tr∣ρ0−ρ1∣.\mathrm{PE}(\rho_0,\rho_1) = \frac12 - \frac14\sum_{j=1}^{N}|\lambda_j| = \frac12 - \frac14\,\mathrm{Tr}|\rho_0 - \rho_1| .PE(ρ0​,ρ1​)=21​−41​j=1∑N​∣λj​∣=21​−41​Tr∣ρ0​−ρ1​∣.

Both equalities are asserted. This is Helstrom's formula: the optimal error of discriminating two equiprobable states is a function of their trace distance.

Differences from the source:

  • reading: min⁡E∈M\min_{E\in\mathcal M}minE∈M​ → infimum over the set of values at all POVMs; reason: the paper's own "more carefully, one should use infimum" (p.10).
  • encoding: POVMs ⟨E1,…,Em⟩\langle E_1,\dots,E_m\rangle⟨E1​,…,Em​⟩ and Tr(ρEx)\mathrm{Tr}(\rho E_x)Tr(ρEx​) → E : Fin m → Matrix n n ℂ for every m : ℕ and the real part of the trace; reason: Lean convention, covers every finite POVM.
  • encoding: Tr∣ρ0−ρ1∣\mathrm{Tr}|\rho_0-\rho_1|Tr∣ρ0​−ρ1​∣ and the eigenvalues λj\lambda_jλj​ → WildeQIT.traceNorm (ρ0 - ρ1) =Re TrΓ†Γ= \mathrm{Re}\,\mathrm{Tr}\sqrt{\Gamma^\dagger\Gamma}=ReTrΓ†Γ​ and IsHermitian.eigenvalues; reason: for Hermitian Γ\GammaΓ, Γ†Γ=∣Γ∣\sqrt{\Gamma^\dagger\Gamma} = |\Gamma|Γ†Γ​=∣Γ∣; same values.
Preamble
import Mathlib
import Definitions.Def_WildeQIT_IsDensityOperator
import Definitions.Def_WildeQIT_traceNorm
import Definitions.Def_FuchsVdGraaf_qErrorProb

open scoped ComplexOrder
Formal statement
namespace FuchsVdGraaf

/-- Fuchs and van de Graaf, arXiv:quant-ph/9712042v2, Proposition 1, eq. (17), p.11: for two
arbitrary density matrices `ρ₀`, `ρ₁`, the (quantum) probability of error equals
`PE(ρ₀, ρ₁) = ½ − ¼ ∑_{j=1}^{N} |λ_j| = ½ − ¼ Tr|ρ₀ − ρ₁|`, where the `λ_j` are the eigenvalues
of `ρ₀ − ρ₁`.

**Formalization Note.** `PE(ρ₀, ρ₁)` is `qErrorProb`, the infimum over all POVMs with any finite
number of outcomes. The eigenvalues are those of the Hermitian matrix `ρ₀ − ρ₁`
(`Matrix.IsHermitian.eigenvalues`, listed with multiplicity), the Hermitian proof being derived
from the two density-matrix hypotheses. `Tr|ρ₀ − ρ₁|` is the published `WildeQIT.traceNorm`. -/
theorem proposition_1 {n : Type} [Fintype n] [DecidableEq n] (ρ0 ρ1 : Matrix n n ℂ)
    (h0 : WildeQIT.IsDensityOperator ρ0) (h1 : WildeQIT.IsDensityOperator ρ1) :
    qErrorProb ρ0 ρ1 =
        1 / 2 - 1 / 4 * ∑ j, |(h0.1.isHermitian.sub h1.1.isHermitian).eigenvalues j| ∧
      qErrorProb ρ0 ρ1 = 1 / 2 - 1 / 4 * WildeQIT.traceNorm (ρ0 - ρ1) := by sorry

end FuchsVdGraaf
Source
Fuchs and van de Graaf, Cryptographic Distinguishability Measures for Quantum Mechanical States, arXiv:quant-ph/9712042v2, Proposition 1, eq. (17), p.11
Human review
  • Endorsed by Shuze Chen · Oct 30, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Oct 30, 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