CommunicationComplexity.PublicCoin.Protocol.ApproxComputes
defimported Lean
A public-coin protocol $p$ $\varepsilon$-computes a function
$f : X \to Y \to \alpha$ if for every input pair $(x, y)$,
\[
\mathrm{vol}\bigl\{\omega \in \Omega \mid p.\texttt{rrun}\,x\,y\,\omega \ne f\,x\,y\bigr\} \;\le\; \varepsilon.
\]
Here the volume is taken with respect to the measure on $\Omega$ given by the
MeasureSpace instance.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory ProbabilityTheory in variable {Ω : Type*} {X Y α : Type*} in noncomputable def CommunicationComplexity.PublicCoin.Protocol.ApproxComputes [MeasureSpace Ω] (p : Protocol Ω X Y α) (f : X → Y → α) (ε : ℝ) : Prop
- Defined in
- TCSlib, `CommunicationComplexity.PublicCoin.Protocol.ApproxComputes`
- 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.PublicCoin.Protocol.ApproxComputes← CommunicationComplexity.PublicCoin.Protocol.ApproxComputes (TCSlib/CommunicationComplexity/NewmanTheorem/PublicCoinBasic.lean:116): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 2
- CommunicationComplexity.PublicCoin.ProtocolA public-coin protocol over shared randomness $\Omega$, with Alice's private input in $X$ and Bob's in $Y$ producing an output in…
- CommunicationComplexity.PublicCoin.Protocol.rrunGiven a public-coin protocol $p$, private inputs $x \in X$, $y \in Y$, and a shared random string $\omega \in \Omega$,…
- Used by 5
- CommunicationComplexity.PublicCoin.zeroErrorCommunicationComplexityFor types X, Y, and α, and a function f : X → Y → α, the zero-error public-coin expected communication complexity is defined as the…
- CommunicationComplexity.PublicCoin.communicationComplexity_le_iffBit 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…
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.exists_good_randomnessExistence of good randomness for derandomization. Let $\Omega$ be a finite probability space and let $X$ and $Y$ be finite input sets. Let…
- CommunicationComplexity.PublicCoin.communicationComplexityThe $\varepsilon$-error public-coin randomized communication complexity of $f : X \to Y \to \alpha$ is defined as…
- CommunicationComplexity.PublicCoin.newmanNewman's theorem for communication complexity. Let $X$ and $Y$ be finite types, let $f : X \to Y \to \alpha$, and let…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory ProbabilityTheory in variable {Ω : Type*} {X Y α : Type*} in /-- A public-coin protocol `ε`-computes a function `f` if for every input `(x, y)`, the probability (under the shared coin-flip measure) of producing an incorrect answer is at most `ε`; this is worst-case error `ε` [RY20, Ch. 3, §Variants of Randomized Protocols: worst-case error e]. -/ noncomputable def CommunicationComplexity.PublicCoin.Protocol.ApproxComputes [MeasureSpace Ω] (p : Protocol Ω X Y α) (f : X → Y → α) (ε : ℝ) : Prop := ∀ x y, (volume {ω : Ω | p.rrun x y ω ≠ f x y}).toReal ≤ ε