AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.PrivateCoin.communicationComplexity_le_iff

theoremverifiedimported Lean

Characterization of private-coin complexity by upper bounds. Let $f : X \to Y \to \alpha$ be a function, let $\varepsilon \in \bbr$ be an error bound, and let $n \in \bbn$. Then the $\varepsilon$-error private-coin randomized communication complexity of $f$ is at most $n$ if and only if there exist coin-tape lengths $n_X, n_Y \in \bbn$ and a private-coin protocol $p$ with Alice's randomness space $\{0,1\}^{n_X}$ and Bob's randomness space $\{0,1\}^{n_Y}$, inputs in $X$ and $Y$, and outputs in $\alpha$, such that $p$ computes $f$ with error at most $\varepsilon$ on every input and the communication complexity of $p$ is at most $n$.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory ProbabilityTheory in
theorem CommunicationComplexity.PrivateCoin.communicationComplexity_le_iff
    {X Y α} (f : X → Y → α) (ε : ℝ) (n : ℕ) :
    communicationComplexity f ε ≤ n ↔
      ∃ (nX nY : ℕ)
        (p : Protocol (CoinTape nX) (CoinTape nY) X Y α),
        p.ApproxComputes f ε ∧
        p.complexity ≤ n
Source
TCSlib, `CommunicationComplexity.PrivateCoin.communicationComplexity_le_iff`
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
Classical.choiceQuot.soundpropext
Built on 24
Used by 2

Lean source view module on GitHub

set_option relaxedAutoImplicit false inset_option autoImplicit false inopen MeasureTheory ProbabilityTheory in/-- The `ε`-error private-coin communication complexity of `f` is at most `n` if and only if there is a private-coin protocol, over coin tapes of some lengths `nX`, `nY`, that `ε`-computes `f` with complexity at most `n`. -/theorem CommunicationComplexity.PrivateCoin.communicationComplexity_le_iff    {X Y α} (f : X → Y → α) (ε : ℝ) (n : ℕ) :    communicationComplexity f ε ≤ n ↔      ∃ (nX nY : ℕ)        (p : Protocol (CoinTape nX) (CoinTape nY) X Y α),        p.ApproxComputes f ε ∧        p.complexity ≤ n := by  unfold communicationComplexity  simp only [Internal.enat_iInf_le_coe_iff, Nat.cast_le, exists_prop]
See it in the graphDiscuss this resultChallenge it