CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.ApproxComputes
defimported Lean
A protocol $p$ $\varepsilon$-computes a function $f : X \to Y \to \alpha$ if for every input pair $(x, y)$, \[ \Pr_{\omega}\bigl[p.\mathrm{rrun}\,x\,y\,\omega \ne f\,x\,y\bigr] \;\le\; \varepsilon. \]
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory in variable {Ω : Type*} {X Y α : Type*} in noncomputable def CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.ApproxComputes [MeasureSpace Ω] (p : Protocol Ω X Y α) (f : X → Y → α) (ε : ℝ) : Prop
- Defined in
- TCSlib, `CommunicationComplexity.PublicCoin.FiniteMessage.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.FiniteMessage.Protocol.ApproxComputes← CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.ApproxComputes (TCSlib/CommunicationComplexity/NewmanTheorem/PublicCoinFiniteMessage.lean:126): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 2
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.rrun$\mathrm{rrun}(p, x, y, \omega)$ executes the protocol $p$ on private inputs $x$ and $y$ with shared randomness $\omega$, defined as…
- CommunicationComplexity.PublicCoin.FiniteMessage.ProtocolA public-coin finite-message protocol over shared-randomness space $\Omega$, private input sets $X$ and $Y$, and output type $\alpha$ is a…
- Used by 5
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.newmanProtocolGiven a public-coin finite-message protocol $p$ over a probability space $\Omega$ that $\varepsilon$-computes $f : X \to Y \to \alpha$,…
- 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.FiniteMessage.Protocol.newmanProtocol_ApproxComputesNewman's reduction preserves approximate correctness. Let $\Omega$ be a finite probability space, let $X$ and $Y$ be finite types, and let…
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.newmanProtocol_complexityCommunication cost of the Newman protocol. Let $X$ and $Y$ be finite types, let $\Omega$ be a finite probability space, and let $p$ be a…
- 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 in variable {Ω : Type*} {X Y α : Type*} in /-- A public-coin finite-message protocol `ε`-computes a function `f` if for every input `(x, y)`, the probability (over the shared randomness) of producing an incorrect answer is at most `ε`; this is worst-case error `ε` [RY20, Ch. 3, §Variants of Randomized Protocols]. Deviation: messages come from arbitrary finite types rather than being single bits. -/ noncomputable def CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.ApproxComputes [MeasureSpace Ω] (p : Protocol Ω X Y α) (f : X → Y → α) (ε : ℝ) : Prop := ∀ x y, volume.real {ω : Ω | p.rrun x y ω ≠ f x y} ≤ ε