CommunicationComplexity.Internal.cdf
defimported Lean
Given a probability mass function $p$ on $\mathrm{Fin}\,m$ and a natural number $n$, $\mathrm{cdf}(p, n)$ is the cumulative probability $\sum_{j < n} p(j)$, computed as an extended non-negative real ($\mathbb{R}_{\ge 0}^\infty$).
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory in open scoped ENNReal in noncomputable def CommunicationComplexity.Internal.cdf {m : ℕ} (p : PMF (Fin m)) (n : ℕ) : ℝ≥0∞
- Defined in
- TCSlib, `CommunicationComplexity.Internal.cdf`
- 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← CommunicationComplexity.Internal.cdf (TCSlib/CommunicationComplexity/NewmanTheorem/PrivateCoinApproximation.lean:68): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Used by 7
- 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.cdf_succCDF successor recurrence. Let $p$ be a probability mass function on $\mathrm{Fin}\,m$, and let $n \in \mathrm{Fin}\,m$. Then the…
- 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.cdf_zeroCumulative distribution function vanishes at zero. Let $p$ be a probability mass function on $\mathrm{Fin}\,m$. Then the cumulative…
- CommunicationComplexity.Internal.cdf_oneTotal cumulative probability equals one. Let $p$ be a probability mass function on the finite set…
- 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…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory in open scoped ENNReal in /-- The cumulative distribution function of a PMF `p` on `Fin m`: `cdf p n` is the total mass `p` assigns to the indices `j < n`. -/ noncomputable def CommunicationComplexity.Internal.cdf {m : ℕ} (p : PMF (Fin m)) (n : ℕ) : ℝ≥0∞ := ∑ j : Fin m, if j < n then p j else 0