Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Couplings and maximal couplings of two random variables (Definitions 10.7.2–10.7.3)

Definition
WildeQIT_coupling

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

classical-informationentropyinformation-theorywilde-qit

Definition 10.7.2 (Coupling). A coupling of a pair (X,Y)(X,Y)(X,Y) of two random variables is a pair (X^,Y^)(\hat X,\hat Y)(X^,Y^) of two other random variables that have the same marginal distributions as those of XXX and YYY. Representing (X^,Y^)(\hat X,\hat Y)(X^,Y^) by its joint distribution ccc on X×Y\mathcal{X}\times\mathcal{Y}X×Y, this says

∑yc(x,y)=pX(x)  for all x,∑xc(x,y)=pY(y)  for all y.\sum_y c(x,y) = p_X(x)\ \text{ for all } x, \qquad \sum_x c(x,y) = p_Y(y)\ \text{ for all } y .y∑​c(x,y)=pX​(x)  for all x,x∑​c(x,y)=pY​(y)  for all y.

Definition 10.7.3 (Maximal coupling). A coupling (X^,Y^)(\hat X,\hat Y)(X^,Y^) of (X,Y)(X,Y)(X,Y), both on a common alphabet A\mathcal{A}A, is maximal if Pr⁡{X^=Y^}=∑uc(u,u)\Pr\{\hat X=\hat Y\}=\sum_{u}c(u,u)Pr{X^=Y^}=∑u​c(u,u) takes on its maximum value with respect to all couplings of XXX and YYY.

Maximal couplings realise the trace distance as a probability of disagreement (Lemma 10.7.2) and are the tool of the proof of the Zhang–Audenaert continuity bound.

Formalization Note. WildeQIT.FinDist.IsCoupling p q c is the conjunction of the two marginal conditions for c : FinDist (α × β); WildeQIT.FinDist.probEq c = ∑ x, c.prob (x, x) is Pr⁡{X^=Y^}\Pr\{\hat X=\hat Y\}Pr{X^=Y^} for c : FinDist (α × α); WildeQIT.FinDist.IsMaximalCoupling p q c is IsCoupling p q c ∧ ∀ c', IsCoupling p q c' → c'.probEq ≤ c.probEq. Existence of a maximal coupling is not asserted by the definition.

Definition code
import Definitions.Def_WildeQIT_FinDist

/-!
Wilde, *Quantum Information Theory* (2nd ed.), Definitions 10.7.2 (Coupling) and 10.7.3
(Maximal coupling): a coupling of `(X, Y)` is a pair `(X̂, Ŷ)` with the same marginals as `X`
and `Y`; it is maximal if `Pr{X̂ = Ŷ}` is as large as possible among all couplings.
A pair of random variables is represented by its joint distribution.
-/

namespace WildeQIT

namespace FinDist

variable {α β : Type} [Fintype α] [Fintype β]

/-- Definition 10.7.2. `c` (a joint distribution on `α × β`) is a coupling of `p` and `q`:
its first marginal is `p` and its second marginal is `q`. -/
def IsCoupling (p : FinDist α) (q : FinDist β) (c : FinDist (α × β)) : Prop :=
  (∀ x, c.fst.prob x = p.prob x) ∧ (∀ y, c.snd.prob y = q.prob y)

/-- `Pr{X̂ = Ŷ} = ∑_x c(x, x)` for a joint distribution `c` on `α × α`. -/
noncomputable def probEq (c : FinDist (α × α)) : ℝ := ∑ x, c.prob (x, x)

/-- Definition 10.7.3. A coupling `c` of `p` and `q` (both on `α`) is maximal if `Pr{X̂ = Ŷ}`
under `c` is at least `Pr{X̂ = Ŷ}` under every other coupling of `p` and `q`. -/
def IsMaximalCoupling (p q : FinDist α) (c : FinDist (α × α)) : Prop :=
  IsCoupling p q c ∧ ∀ c' : FinDist (α × α), IsCoupling p q c' → c'.probEq ≤ c.probEq

end FinDist

end WildeQIT
Source
Wilde, Quantum Information Theory 2nd ed. (Cambridge 2017; arXiv:1106.1445v8), Definition 10.7.2, §Continuity of Entropy (roster-items.csv line 17360); and Definition 10.7.3 (Maximal Coupling), line 17366.

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me