AFTD Auto-Formalizing Theoretical Domains

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.
Verified
07 Oct 2026
Axioms
none listed
Built on 1
Used by 2

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)
See it in the graphDiscuss this resultChallenge it