Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 4.2 -- total variation as half the ℓ1\ell^1ℓ1 distance

Proved
MarkovMixing.tv_eq_half_l1

by Shuze Chen · Aug 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

markov-chainsmixing-timesprobability

Let μ\muμ and ν\nuν be probability distributions on a finite state space VVV, and let

∥μ−ν∥TV=max⁡A⊆V∣μ(A)−ν(A)∣\|\mu-\nu\|_{TV}=\max_{A\subseteq V}\bigl|\mu(A)-\nu(A)\bigr|∥μ−ν∥TV​=A⊆Vmax​​μ(A)−ν(A)​

denote their total variation distance — the largest discrepancy the two distributions assign to a single event.

The theorem gives the two standard closed forms for this distance (Proposition 4.2 and Remark 4.3 of Levin–Peres–Wilmer). First, it is half the ℓ1\ell^1ℓ1 distance between the mass functions:

∥μ−ν∥TV=12∑x∈V∣μ(x)−ν(x)∣.\|\mu-\nu\|_{TV}=\frac12\sum_{x\in V}\bigl|\mu(x)-\nu(x)\bigr|.∥μ−ν∥TV​=21​x∈V∑​​μ(x)−ν(x)​.

Second, it equals the total excess of μ\muμ over ν\nuν on the set where μ\muμ dominates:

∥μ−ν∥TV=∑x: μ(x)≥ν(x)(μ(x)−ν(x)),\|\mu-\nu\|_{TV}=\sum_{x:\,\mu(x)\ge\nu(x)}\bigl(\mu(x)-\nu(x)\bigr),∥μ−ν∥TV​=x:μ(x)≥ν(x)∑​(μ(x)−ν(x)),

i.e. the maximum in the definition is attained at the event {x:μ(x)≥ν(x)}\{x:\mu(x)\ge\nu(x)\}{x:μ(x)≥ν(x)}.

Preamble
import Definitions.Def_mm_mixing
Formal statement
namespace MarkovMixing

/-- **Proposition 4.2 and Remark 4.3** (LPW): the total variation distance is
half the `ℓ¹` distance, and equals the excess of `μ` over `ν` on the set
where `μ ≥ ν`. -/
theorem tv_eq_half_l1 {V : Type*} [Fintype V] [DecidableEq V]
    (μ ν : V → ℝ) (hμ : IsDist μ) (hν : IsDist ν) :
    tvDist μ ν = 2⁻¹ * ∑ x, |μ x - ν x| ∧
    tvDist μ ν = ∑ x ∈ Finset.univ.filter (fun x : V => ν x ≤ μ x), (μ x - ν x) := by
  sorry

end MarkovMixing
Source
D. A. Levin, Y. Peres, E. L. Wilmer, Markov Chains and Mixing Times, AMS 2009, https://documents.epfl.ch/groups/i/ip/ipg/www/2013-2014/Random_Walks/markovmixing.pdf, Section 4.1, Proposition 4.2 and Remark 4.3, p. 48
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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