Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 9.1.1: 12∥ρ−σ∥1=max⁡0≤Λ≤ITr⁡{Λ(ρ−σ)}\tfrac12\|\rho-\sigma\|_1=\max_{0\le\Lambda\le I}\operatorname{Tr}\{\Lambda(\rho-\sigma)\}21​∥ρ−σ∥1​=max0≤Λ≤I​Tr{Λ(ρ−σ)}

Proved
WildeQIT.DiamondDist.lemma_9_1_1

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

p2o-gran-per-chapterp2o-plan-bookp2o-v1quantum-informationtrace-distance

Let ρ,σ∈D(H)\rho,\sigma\in\mathcal D(\mathcal H)ρ,σ∈D(H) be density operators (positive semi-definite, unit trace) on a finite-dimensional Hilbert space H\mathcal HH. The normalized trace distance equals the largest probability difference that ρ\rhoρ and σ\sigmaσ can give to the same measurement outcome Λ\LambdaΛ:

12∥ρ−σ∥1=max⁡0≤Λ≤ITr⁡{Λ(ρ−σ)},\tfrac12\|\rho-\sigma\|_1=\max_{0\le\Lambda\le I}\operatorname{Tr}\{\Lambda(\rho-\sigma)\},21​∥ρ−σ∥1​=0≤Λ≤Imax​Tr{Λ(ρ−σ)},

the maximum being over all positive semi-definite Λ∈L(H)\Lambda\in\mathcal L(\mathcal H)Λ∈L(H) with eigenvalues at most one. In particular the maximum is attained.

This is the characterization behind the operational meaning of the trace distance (optimal success probability of distinguishing two states) and the proofs of Lemma 9.1.2 and Corollaries 9.1.1, 9.1.2.

Formalization Note 0≤Λ≤I0\le\Lambda\le I0≤Λ≤I is written as Λ⪰0\Lambda\succeq0Λ⪰0 and I−Λ⪰0I-\Lambda\succeq0I−Λ⪰0, which is equivalent to "positive semi-definite with eigenvalues bounded by one". The trace Tr⁡{Λ(ρ−σ)}\operatorname{Tr}\{\Lambda(\rho-\sigma)\}Tr{Λ(ρ−σ)} is real for such Λ\LambdaΛ; Lean takes the real part of the complex trace. traceDist ρ σ is the unnormalized ∥ρ−σ∥1\|\rho-\sigma\|_1∥ρ−σ∥1​.

Differences from the source:

  • encoding: max⁡0≤Λ≤I\max_{0\le\Lambda\le I}max0≤Λ≤I​ → IsGreatest of {Re⁡Tr⁡{Λ(ρ−σ)}:Λ⪰0, I−Λ⪰0}\{\operatorname{Re}\operatorname{Tr}\{\Lambda(\rho-\sigma)\} : \Lambda\succeq0,\ I-\Lambda\succeq0\}{ReTr{Λ(ρ−σ)}:Λ⪰0, I−Λ⪰0}; reason: states that the maximum exists and equals 12∥ρ−σ∥1\frac12\|\rho-\sigma\|_121​∥ρ−σ∥1​; the trace is real on this set
  • encoding: states on H\mathcal HH → Matrix n n ℂ over a finite index type; reason: the book works in finite dimensions
Preamble
import Definitions.Def_WildeQIT_traceDist
import Definitions.Def_WildeQIT_IsDensityOperator
Formal statement
/-!
Wilde, *From Classical to Quantum Shannon Theory*, arXiv:1106.1445v8, Lemma 9.1.1, p. 254.
-/

open Matrix
open scoped ComplexOrder

namespace WildeQIT.DiamondDist

/-- **Lemma 9.1.1** (Wilde, arXiv:1106.1445v8, p. 254, eq. (9.27)). For quantum states
`ρ, σ ∈ D(H)`, `(1/2)‖ρ − σ‖₁ = max_{0 ≤ Λ ≤ I} Tr{Λ(ρ − σ)}`, the maximization being over
all positive semi-definite `Λ ∈ L(H)` with eigenvalues bounded from above by one.

Formalization Note: `0 ≤ Λ ≤ I` is `Λ.PosSemidef ∧ (1 − Λ).PosSemidef`; `Tr{Λ(ρ − σ)}` is
real for such `Λ` and is taken as the real part of the complex trace. The maximum is stated as
`IsGreatest` (attained, and an upper bound). -/
theorem lemma_9_1_1 {n : Type} [Fintype n] [DecidableEq n] (ρ σ : Matrix n n ℂ)
    (hρ : IsDensityOperator ρ) (hσ : IsDensityOperator σ) :
    IsGreatest {x : ℝ | ∃ Λ : Matrix n n ℂ, Λ.PosSemidef ∧ (1 - Λ).PosSemidef ∧ x = (Λ * (ρ - σ)).trace.re} ((1 / 2 : ℝ) * traceDist ρ σ) := by sorry

end WildeQIT.DiamondDist
Source
Wilde, From Classical to Quantum Shannon Theory, arXiv:1106.1445v8, Lemma 9.1.1, p. 254, eq. (9.27)
Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 1, 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