CommunicationComplexity.PrivateCoin.Protocol.ApproxComputes
defimported Lean
A private-coin protocol $p$ $\varepsilon$-computes a function $f : X \to Y \to \alpha$ if for every input pair $(x, y)$, \[ \mu\!\left\{\,\omega \in \Omega_X \times \Omega_Y \;\middle|\; p.\mathrm{rrun}\;x\;y\;\omega_1\;\omega_2 \ne f\,x\,y\,\right\} \;\le\; \varepsilon. \] This formalises the standard notion of bounded-error private-coin randomized communication complexity.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory ProbabilityTheory in variable {Ω_X Ω_Y : Type*} {X Y α : Type*} in noncomputable def CommunicationComplexity.PrivateCoin.Protocol.ApproxComputes [MeasureSpace Ω_X] [MeasureSpace Ω_Y] (p : Protocol Ω_X Ω_Y X Y α) (f : X → Y → α) (ε : ℝ) : Prop
- Defined in
- TCSlib, `CommunicationComplexity.PrivateCoin.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.PrivateCoin.Protocol.ApproxComputes← CommunicationComplexity.PrivateCoin.Protocol.ApproxComputes (TCSlib/CommunicationComplexity/NewmanTheorem/PrivateCoinBasic.lean:122): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 2
- CommunicationComplexity.PrivateCoin.Protocol.rrun$\texttt{rrun}\;p\;x\;y\;\omega_x\;\omega_y$ executes the private-coin protocol $p$ on inputs $x \in X$ and $y \in Y$ with Alice's private…
- CommunicationComplexity.PrivateCoin.ProtocolA private-coin protocol with randomness spaces $\Omega_X$ and $\Omega_Y$, input spaces $X$ and $Y$, and output type $\alpha$ is…
- Used by 5
- CommunicationComplexity.PrivateCoin.communicationComplexity_le_iffCharacterization of private-coin complexity by upper bounds. Let $f : X \to Y \to \alpha$ be a function, let $\varepsilon \in \bbr$ be an…
- 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.PrivateCoin.communicationComplexityThe $\varepsilon$-error private-coin randomized communication complexity of $f : X \to Y \to \alpha$ is the extended natural number…
- CommunicationComplexity.PrivateCoin.communicationComplexity_le_iff_finiteMessageFinite-message characterization of private-coin complexity. Let $f : X \to Y \to \alpha$ be a function, let $\varepsilon \in \bbr$ be an…
- CommunicationComplexity.PrivateCoin.zeroErrorCommunicationComplexityFor types X, Y, and α, and a function f : X → Y → α, the zero-error private-coin expected communication complexity is defined as the…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory ProbabilityTheory in variable {Ω_X Ω_Y : Type*} {X Y α : Type*} in /-- A private-coin protocol `ε`-computes a function `f` if for every input `(x, y)`, the probability (under the product of the two coin-flip measures) 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.PrivateCoin.Protocol.ApproxComputes [MeasureSpace Ω_X] [MeasureSpace Ω_Y] (p : Protocol Ω_X Ω_Y X Y α) (f : X → Y → α) (ε : ℝ) : Prop := ∀ x y, (volume {ω : Ω_X × Ω_Y | p.rrun x y ω.1 ω.2 ≠ f x y}).toReal ≤ ε