Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Definition 9.2 — Dobrushin coefficient

Definition
DuchiSIT_DobrushinCoefficient

by Mrnaiq · Nov 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

information-theoryprobabilitytotal-variation

The real supremum, over all pairs of input states, of the total-variation distance between the corresponding output probability laws. Total variation reuses the existing event-supremum definition, normalized to lie between zero and one on probability laws. The spaces are arbitrary measurable spaces; no finite-state, topology, stationarity or irreducibility assumption is imposed. Real suprema use zero on an empty index set. The source notation is extended explicitly to empty spaces and spaces with at most one probability measure.

Definition code
import Definitions.Def_TotalVariationDist
import Definitions.Def_DuchiSIT_ChannelAction
set_option autoImplicit false
noncomputable section
open MeasureTheory ProbabilityTheory
namespace DuchiSIT

def dobrushin {X Y : Type*} [MeasurableSpace X] [MeasurableSpace Y]
    (K : Kernel X Y) [IsMarkovKernel K] : ℝ :=
  sSup {r : ℝ | ∃ x y : X, r = MarkovChainCLT.tvDist (K x) (K y)}

end DuchiSIT
Source
John Duchi, Lecture Notes on Statistics and Information Theory, December 6, 2023, Section 9.1, printed pp. 220–222, Definitions 9.1–9.2 and Proposition 9.1.1; total variation uses Lemma 2.2.4. https://web.stanford.edu/class/stats311/lecture-notes.pdf
Read-back

What the Lean code literally says, in plain math · gpt-6

For arbitrary types XXX and YYY, each equipped with a measurable-space structure, and any kernel KKK from XXX to YYY satisfying the Markov-kernel assumption (so K(x)K(x)K(x) is a probability measure on YYY for every x∈Xx\in Xx∈X), the definition assigns the real number δ(K)=sup⁡{d(K(x),K(y)):x,y∈X}\delta(K)=\sup\{d(K(x),K(y)):x,y\in X\}δ(K)=sup{d(K(x),K(y)):x,y∈X}, where, for any two measures μ,ν\mu,\nuμ,ν on a measurable space, the imported definition is d(μ,ν)=sup⁡{∣toReal⁡(μ(A))−toReal⁡(ν(A))∣:A is a measurable subset}d(\mu,\nu)=\sup\{|\operatorname{toReal}(\mu(A))-\operatorname{toReal}(\nu(A))|:A\text{ is a measurable subset}\}d(μ,ν)=sup{∣toReal(μ(A))−toReal(ν(A))∣:A is a measurable subset}. Here the set AAA ranges over measurable subsets of YYY when evaluating d(K(x),K(y))d(K(x),K(y))d(K(x),K(y)), and toReal⁡\operatorname{toReal}toReal converts a finite extended nonnegative real to its real value and sends +∞+\infty+∞ to 000. Both suprema are suprema in R\mathbb RR of sets of real numbers; the real supremum convention gives 000 for an empty set or a set unbounded above. For these probability measures the inner set contains 000 (take A=∅A=\varnothingA=∅) and is bounded above by 111, and the outer set is also bounded above by 111. The pair x,yx,yx,y may consist of equal points; there is no distinctness or nonemptiness hypothesis on XXX or YYY. If XXX is empty the outer set is empty and δ(K)=0\delta(K)=0δ(K)=0; if XXX is nonempty the outer set contains 000. An empty YYY admits no such Markov kernel when XXX is nonempty, since there is no probability measure on the empty space. No input measure on XXX is an argument of this definition.

Human review
  • Endorsed by Shuze Chen · Nov 12, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Mrnaiq · Nov 12, 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