AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.PublicCoin.communicationComplexity

defimported Lean

The $\varepsilon$-error public-coin randomized communication complexity of $f : X \to Y \to \alpha$ is defined as \[ \mathrm{R}^{\mathrm{pub}}_\varepsilon(f) \;=\; \inf_{\substack{n \in \mathbb{N},\; p \text{ a protocol on } \mathrm{CoinTape}(n) \\ p \text{ $\varepsilon$-approximates } f}} p.\mathrm{complexity}, \] the infimum (in $\mathbb{N}_\infty$) of the worst-case bit complexity over all public-coin randomized protocols that compute $f$ with error at most $\varepsilon$ on every input.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory ProbabilityTheory in
noncomputable def CommunicationComplexity.PublicCoin.communicationComplexity
    {X Y α} (f : X → Y → α) (ε : ℝ) : ENat
Defined in
TCSlib, `CommunicationComplexity.PublicCoin.communicationComplexity`
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 26
Used by 2

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory ProbabilityTheory in
/-- The `ε`-error public-coin randomized communication complexity `R^pub_ε(f)` of `f`, defined as the minimum worst-case number of bits exchanged over all public-coin randomized protocols that compute `f` with error at most `ε` on every input [RY20, Ch. 3, §Variants of Randomized Protocols]. Deviation: the minimum is an infimum in `ℕ∞` (equal to `⊤` if no protocol qualifies), and the shared randomness is a coin tape `CoinTape n` of some finite length `n`, quantified over all `n`. -/
noncomputable def CommunicationComplexity.PublicCoin.communicationComplexity
    {X Y α} (f : X → Y → α) (ε : ℝ) : ENat :=
  ⨅ (n : ℕ)
    (p : Protocol (CoinTape n) X Y α)
    (_ : p.ApproxComputes f ε),
    (p.complexity : ENat)
See it in the graphDiscuss this resultChallenge it