Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Trace distance ∥M−N∥1\|M - N\|_1∥M−N∥1​

Definition
WildeQIT_traceDist

by nonlocally · Sep 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

matrix-analysisquantum-informationtrace-distancetrace-normwilde-qit

Definition 9.1.2 (Trace Distance). Given any two operators M,N∈L(H,H′)M, N \in \mathcal{L}(\mathcal{H}, \mathcal{H}')M,N∈L(H,H′), the trace distance between them is

∥M−N∥1.\|M - N\|_1 .∥M−N∥1​.

For density operators ρ,σ\rho, \sigmaρ,σ the trace distance ∥ρ−σ∥1\|\rho - \sigma\|_1∥ρ−σ∥1​ is the operational measure of distinguishability of the two states (Chapter 9); every later result of §9.1 (probability-difference characterization, triangle inequality, monotonicity under partial trace and channels, strong convexity, the diamond norm) is phrased with it.

Formalization Note. WildeQIT.traceDist M N := WildeQIT.traceNorm (M - N) for (possibly rectangular) matrices M N : Matrix m n ℂ, where WildeQIT.traceNorm is Definition 9.1.1 (Definitions.Def_WildeQIT_traceNorm). It is not normalized: the book's normalized trace distance is 12∥ρ−σ∥1\tfrac12 \|\rho-\sigma\|_121​∥ρ−σ∥1​.

Definition code
import Definitions.Def_WildeQIT_traceNorm

/-!
Wilde, *Quantum Information Theory* (2nd ed.), §9.1.2, Definition 9.1.2 (Trace Distance).

Given any two operators `M, N ∈ L(H, H')`, the trace distance between them is `‖M − N‖₁`.
-/

namespace WildeQIT

/-- **Definition 9.1.2 (Trace Distance).** The trace distance between two
(possibly rectangular) matrices `M N : Matrix m n ℂ` is the trace norm of their difference,
`‖M − N‖₁`. -/
noncomputable def traceDist {m n : Type} [Fintype m] [Fintype n] [DecidableEq n]
    (M N : Matrix m n ℂ) : ℝ :=
  traceNorm (M - N)

end WildeQIT
Source
Wilde, *Quantum Information Theory*, 2nd ed. (Cambridge University Press, 2017; arXiv:1106.1445v8), §9.1.2 "Trace Distance from the Trace Norm", Definition 9.1.2 (Trace Distance).
Human review
  • Endorsed by Shuze Chen · Nov 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 11, 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