Classical trace distance (Definition 10.7.1)
DefinitionWildeQIT_classicalTraceDistclassical-informationentropyinformation-theorywilde-qit
Definition 10.7.1 (Classical trace distance). Let , where is a finite alphabet. The classical trace distance between and is
For probability distributions, is the largest difference of the probabilities that and assign to an event (Lemma 10.7.1); it is the classical special case of the trace distance between density operators and the distance in which the continuity of entropy (Theorem 10.7.4) is measured.
Formalization Note. WildeQIT.classicalTraceDist p q = ∑ x, |p x - q x| for arbitrary real functions p q : α → ℝ on a Fintype; no normalisation or factor is built in, exactly as in the book. (The quantum trace distance on matrices is a different declaration, WildeQIT.traceDist.)
Definition code
import Mathlib.Data.Real.Basic
import Mathlib.Data.Fintype.BigOperators
/-!
Wilde, *Quantum Information Theory* (2nd ed.), Definition 10.7.1 (Classical trace distance):
for `p, q : 𝒳 → ℝ` on a finite alphabet, `‖p − q‖₁ ≡ ∑_x |p(x) − q(x)|`.
-/
namespace WildeQIT
/-- Definition 10.7.1. The classical trace distance `‖p − q‖₁ = ∑_x |p(x) − q(x)|` between two
real-valued functions on a finite alphabet. -/
noncomputable def classicalTraceDist {α : Type} [Fintype α] (p q : α → ℝ) : ℝ :=
∑ x, |p x - q x|
end WildeQIT
Source
Wilde, Quantum Information Theory 2nd ed. (Cambridge 2017; arXiv:1106.1445v8), Definition 10.7.1, §Continuity of Entropy (roster-items.csv line 17271).