CommunicationComplexity.Internal.cdf_zero
theoremverifiedimported Lean
Cumulative distribution function vanishes at zero. Let $p$ be a probability mass function on $\mathrm{Fin}\,m$. Then the cumulative probability $\sum_{j < 0} p(j)$ vanishes; that is, $\mathrm{cdf}(p, 0) = 0$ in $\bbr_{\ge 0}^\infty$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory in open scoped ENNReal in @[simp] lemma CommunicationComplexity.Internal.cdf_zero {m : ℕ} (p : PMF (Fin m)) : cdf p 0 = 0
- Source
- TCSlib, `CommunicationComplexity.Internal.cdf_zero`
- 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.CommunicationComplexity.Internal.cdf_zero← CommunicationComplexity.Internal.cdf_zero (TCSlib/CommunicationComplexity/NewmanTheorem/PrivateCoinApproximation.lean:72): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- CommunicationComplexity.Internal.cdfGiven a probability mass function $p$ on $\mathrm{Fin}\,m$ and a natural number $n$, $\mathrm{cdf}(p, n)$ is the cumulative probability…
- Used by 5
- CommunicationComplexity.Internal.uniformApprox_approxUniform approximation error bound. Let $p$ be a probability mass function on $\mathrm{Fin}\,m$ with $m \ge 1$, and let $n \ge 1$ be an…
- CommunicationComplexity.Internal.invCdf_eq_iffCharacterization of the inverse CDF. Let $p$ be a probability mass function on $\mathrm{Fin}\,m = \{0, 1, \dots, m-1\}$ with $m \ge 1$,…
- CommunicationComplexity.Internal.invCdfGiven a PMF $p$ on $\mathrm{Fin}\,m$ (with $m \ge 1$) and a value $x \in \mathbb{R}_{\ge 0}^\infty$, $\mathrm{invCdf}(p, x)$ is the…
- CommunicationComplexity.Internal.cdf_monoMonotonicity of the cumulative distribution function. Let $p$ be a probability mass function on $\mathrm{Fin}\,m$, and for each natural…
- CommunicationComplexity.Internal.single_coin_approxApproximating a finite probability space by fair coin flips. Let $\Omega$ be a finite probability space, and let $\delta > 0$. Then there…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option relaxedAutoImplicit false inset_option autoImplicit false inopen MeasureTheory inopen scoped ENNReal in/-- The cumulative distribution function vanishes at `0`. -/@[simp] lemma CommunicationComplexity.Internal.cdf_zero {m : ℕ} (p : PMF (Fin m)) : cdf p 0 = 0 := by simp [cdf]