Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

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

Proved
FuchsVdGraaf.proposition_3

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 N×NN\times NN×N density matrices and let λ1,…,λN\lambda_1,\dots,\lambda_Nλ1​,…,λN​ be the eigenvalues (with multiplicity) of ρ0−ρ1\rho_0 - \rho_1ρ0​−ρ1​. Then the quantum Kolmogorov distance, maximised over all POVMs, is

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

Both equalities are asserted. The quantum Kolmogorov distance is therefore the trace distance, which in particular satisfies the triangle inequality.

Differences from the source:

  • reading: max⁡E∈M\max_{E\in\mathcal M}maxE∈M​ → supremum over the set of values at all POVMs; reason: the paper's own "more carefully" remark (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) 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_qKolmogorov

open scoped ComplexOrder
Formal statement
namespace FuchsVdGraaf

/-- Fuchs and van de Graaf, arXiv:quant-ph/9712042v2, Proposition 3, eq. (21), p.12: the
Kolmogorov distance between two density matrices `ρ₀`, `ρ₁` equals
`K(ρ₀, ρ₁) = ½ ∑_{j=1}^{N} |λ_j| = ½ Tr|ρ₀ − ρ₁|`, where the `λ_j` are the eigenvalues of
`ρ₀ − ρ₁`.

**Formalization Note.** `K(ρ₀, ρ₁)` is `qKolmogorov`, the supremum over all POVMs with any finite
number of outcomes. The eigenvalues are those of the Hermitian matrix `ρ₀ − ρ₁`
(`Matrix.IsHermitian.eigenvalues`, with multiplicity). `Tr|ρ₀ − ρ₁|` is `WildeQIT.traceNorm`. -/
theorem proposition_3 {n : Type} [Fintype n] [DecidableEq n] (ρ0 ρ1 : Matrix n n ℂ)
    (h0 : WildeQIT.IsDensityOperator ρ0) (h1 : WildeQIT.IsDensityOperator ρ1) :
    qKolmogorov ρ0 ρ1 =
        1 / 2 * ∑ j, |(h0.1.isHermitian.sub h1.1.isHermitian).eigenvalues j| ∧
      qKolmogorov ρ0 ρ1 = 1 / 2 * 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 3, eq. (21), p.12
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