Total Variation Distance Eq Sum Max Sub
ProvedLIDT.PMF.totalVariationDistance_eq_sum_max_sublidt
Total variation as the sum of positive mass differences. Let and be probability mass functions on a finite type . Write and for the real values obtained from and . Then
This rewrites the symmetric absolute-difference definition of total variation as the total mass gained by .
Formalization credit: Sirui Lu, Ruixuan Deng, Yanqiao Zhu, and Zhengfeng Ji (arXiv:2609.19814). Mathematical source: Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, and Henry Yuen (arXiv:2009.12982).
Formalization Note. The source declaration is PMF.totalVariationDistance_eq_sum_max_sub; its Lean statement gives the exact quantifier order and all boundary hypotheses.
Preamble
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_Distribution import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_PMFAverages import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_ParametersBase import Definitions.Def_LIDT_MIPStarRE_Quantum_FiniteMatrix_Basic import Definitions.Def_LIDT_MIPStarRE_Quantum_FiniteMatrix_BlockDiagonal import Definitions.Def_LIDT_MIPStarRE_Quantum_FiniteMatrix_NormalizedTrace import Definitions.Def_LIDT_MIPStarRE_Quantum_FiniteMatrix_Order import Definitions.Def_LIDT_MIPStarRE_Quantum_FiniteMatrix_TracePairing import Mathlib import Mathlib.Analysis.MeanInequalitiesPow import Mathlib.Probability.ProbabilityMassFunction.Monad open LIDT /-! # PMF-weighted finite expectation identities This module contains finite expectation identities stated directly for Mathlib probability mass functions. They connect `PMF.map` and `PMF.bind` to the real-weighted finite sums used by the low individual degree test averaging layer. ## Main declarations * `PMF.map_apply_toReal` * `PMF.realWeightedSum` * `PMF.realWeightedSumLinearMap` * `PMF.realWeightedSum_map` * `PMF.realWeightedSum_bind` * `PMF.map_sum_smul` * `PMF.bind_apply_toReal` * `PMF.bind_sum_smul` * `PMF.sum_toReal_eq_one` * `PMF.sum_const_smul` * `PMF.totalVariationDistance` * `PMF.totalVariationDistance_eq_sum_max_sub` * `PMF.totalVariationDistance_uniformOfFintype_uniformOfFinset_eq` * `PMF.sum_le_sum_add_totalVariationDistance` * `PMF.sum_rpow_one_div_le_rpow_sum` * `PMF.realWeightedSum_rpow_one_div_le_rpow` * `PMF.uniformOfFintype_map_equiv` * `PMF.uniformOfFintype_prod_apply_toReal` * `PMF.uniformOfFintype_prod_eq_bind` * `PMF.uniformOfFintype_sum_equiv_smul` * `PMF.uniformOfFintype_prod_sum_smul` * `PMF.uniformOfFintype_sum_equiv_fst_smul` * `PMF.uniformOfFintype_sum_equiv_snd_smul` * `PMF.uniformOfFintype_sum_factor_equiv_smul` * `PMF.uniformOfFintype_sum_factor_equiv_fst_smul` * `PMF.uniformOfFintype_sum_factor_equiv_snd_smul` ## References These are formalization-internal finite probability lemmas for the low individual degree test development. -/ @[expose] public section open scoped BigOperators open LIDT.PMF
Formal statement
theorem LIDT.PMF.totalVariationDistance_eq_sum_max_sub {α : Type*}
[Fintype α] (p q : PMF α) :
_root_.LIDT.PMF.totalVariationDistance p q =
∑ a : α, max 0 ((q a).toReal - (p a).toReal) := by sorrySource