AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.tvDistance

defimported Lean

The total variation distance between two probability measures $\mu$ and $\nu$ on $\Omega$ is defined as $\tfrac{1}{2}$ times the total variation norm of the signed measure $\mu - \nu$, i.e.\ $\mathrm{TV}(\mu,\nu) = \tfrac{1}{2}\|\mu - \nu\|_{\mathrm{TV}}$.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory in
noncomputable def CommunicationComplexity.tvDistance {Ω : Type*} [MeasurableSpace Ω]
    (μ ν : Measure Ω) [IsProbabilityMeasure μ] [IsProbabilityMeasure ν] : ℝ
Defined in
TCSlib, `CommunicationComplexity.tvDistance`
Lean proof
By Lucy Horowitz, Timothe Kasriel, Mihir Singhal, from github.com/Shilun-Allan-Li/tcslib at c8a02591b1e5 (Copyright (c) 2026 Lucy Horowitz, Timothe Kasriel, and Mihir Singhal. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.25.0.
Verified
07 Oct 2026
Axioms
none listed
Built on 1
Used by 7

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory in
/-- Total variation distance between probability measures, defined as half the total mass of the total variation `|μ − ν|` of the signed measure `μ - ν` (i.e. half of `P(Ω) + N(Ω)` for the Jordan decomposition `μ − ν = P − N`). [LPW17, §4.1, eq. (4.1)] (statistical distance; also the `|p − q|` of [RY20, Lemma 6.6]); deviation: LPW define it as the supremum over events (`tvDistanceSup` here) and prove the other forms; `tvDistance_eq_tvDistanceSup` shows the two agree. -/
noncomputable def CommunicationComplexity.tvDistance {Ω : Type*} [MeasurableSpace Ω]
    (μ ν : Measure Ω) [IsProbabilityMeasure μ] [IsProbabilityMeasure ν] : ℝ :=
  (1 / 2 : ℝ) * (signedMeasureDiff μ ν).totalVariation.real Set.univ
See it in the graphDiscuss this resultChallenge it