CommunicationComplexity.Internal.uniformApprox
defimported Lean
Given a PMF $p$ on $\mathrm{Fin}\,m$ and a positive integer $n$, the map $\mathrm{uniformApprox}(p, n) : \mathrm{Fin}\,n \to \mathrm{Fin}\,m$ sends $j \mapsto \mathrm{invCdf}(p, j/n)$, discretizing the unit interval into $n$ equally spaced points and mapping each through the quantile function of $p$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory in open scoped ENNReal in noncomputable def CommunicationComplexity.Internal.uniformApprox {m : ℕ} [NeZero m] (p : PMF (Fin m)) (n : ℕ) [NeZero n] : Fin n → Fin m
- Defined in
- TCSlib, `CommunicationComplexity.Internal.uniformApprox`
- 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.uniformApprox← CommunicationComplexity.Internal.uniformApprox (TCSlib/CommunicationComplexity/NewmanTheorem/PrivateCoinApproximation.lean:167): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 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…
- Used by 2
- 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.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
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory in open scoped ENNReal in /-- The uniform approximation of a PMF `p` on `Fin m` by `n` grid points: the map `Fin n → Fin m` sending `i` to `invCdf p (i / n)`. The pushforward of the uniform distribution on `Fin n` along this map approximates `p` (`uniformApprox_approx`). -/ noncomputable def CommunicationComplexity.Internal.uniformApprox {m : ℕ} [NeZero m] (p : PMF (Fin m)) (n : ℕ) [NeZero n] : Fin n → Fin m := fun i => invCdf p ((i : ℝ≥0∞) / n)