Proposition 9.1.1 — contraction inequality
ProvedDuchiSIT.tv_channel_leFor every Markov kernel and every pair of input probability laws, their output total-variation distance is at most the Dobrushin row coefficient times their input total-variation distance. 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.
import Definitions.Def_DuchiSIT_DobrushinCoefficient set_option autoImplicit false open MeasureTheory ProbabilityTheory
namespace DuchiSIT
theorem tv_channel_le {X Y : Type*}
[MeasurableSpace X] [MeasurableSpace Y]
(K : Kernel X Y) [IsMarkovKernel K]
(μ ν : ProbabilityMeasure X) :
MarkovChainCLT.tvDist (channel K μ : Measure Y) (channel K ν : Measure Y) ≤
dobrushin K * MarkovChainCLT.tvDist (μ : Measure X) (ν : Measure X) := by sorry
end DuchiSIT
Read-back
What the Lean code literally says, in plain math · gpt-6
For any two types and , each equipped with an arbitrary measurable-space structure, any measurable probability kernel from to (so is a probability measure for every , and is measurable for every measurable ), and any probability measures and on , let and be the probability measures whose underlying measures are the kernel–measure compositions and ; on each measurable , and . For measures on any one of these measurable spaces, define , where measure values lie in the extended nonnegative reals and sends a finite value to its real value and sends to . Define , with the supremum taken in the real numbers. The assertion is
Every measure appearing here is a probability measure, hence every set value in these distance expressions is finite; consequently this is the normalization , with values in , and is also in . There are no assumptions of finiteness, countability, a topology, or a standard Borel structure, and the measures may coincide and the coefficient may be zero. Empty types are not explicitly excluded by the type binders: for an empty the real supremum defining is the empty supremum, equal to , but no probability measures on that exist, so there is no instance of the theorem's hypotheses; an empty likewise admits no such Markov kernel when carries these probability measures.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.