AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.PublicCoin.communicationComplexity_le_iff

theoremverifiedimported Lean

Bit bound as existence of an approximating protocol. Let $f : X \to Y \to \alpha$ be a function of Alice's input and Bob's input, let $\varepsilon \in \bbr$ be an error parameter, and let $m \in \bbn$. Then the $\varepsilon$-error public-coin communication complexity satisfies $\mathrm{R}^{\mathrm{pub}}_\varepsilon(f) \le m$ if and only if there exist a length $n \in \bbn$ and a public-coin protocol $p$ over the coin tape $\mathrm{CoinTape}(n)$ such that $p$ $\varepsilon$-computes $f$ and the worst-case bit complexity of $p$ is at most $m$.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory ProbabilityTheory in
theorem CommunicationComplexity.PublicCoin.communicationComplexity_le_iff
    {X Y α} (f : X → Y → α) (ε : ℝ) (m : ℕ) :
    communicationComplexity f ε ≤ m ↔
      ∃ (n : ℕ) (p : Protocol (CoinTape n) X Y α),
        p.ApproxComputes f ε ∧
        p.complexity ≤ m
Source
TCSlib, `CommunicationComplexity.PublicCoin.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 28
Used by 1

Lean source view module on GitHub

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