CommunicationComplexity.PrivateCoin.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)$, \[ \mathrm{vol}\bigl(\{(\omega_x, \omega_y) \mid p.\texttt{rrun}\,x\,y\,\omega_x\,\omega_y \ne f\,x\,y\}\bigr) \;\le\; \varepsilon. \]
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory in variable {Ω_X Ω_Y : Type*} {X Y α : Type*} in noncomputable def CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.ApproxComputes [MeasureSpace Ω_X] [MeasureSpace Ω_Y] (p : Protocol Ω_X Ω_Y X Y α) (f : X → Y → α) (ε : ℝ) : Prop
- Defined in
- TCSlib, `CommunicationComplexity.PrivateCoin.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.PrivateCoin.FiniteMessage.Protocol.ApproxComputes← CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.ApproxComputes (TCSlib/CommunicationComplexity/NewmanTheorem/PrivateCoinFiniteMessage.lean:132): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 2
- CommunicationComplexity.PrivateCoin.FiniteMessage.ProtocolA private-coin finite-message protocol over input types $X$, $Y$ with private randomness types $\Omega_X$, $\Omega_Y$ and output type…
- CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.rrun$\texttt{rrun}\,p\,x\,y\,\omega_x\,\omega_y$ executes the protocol $p$ on public inputs $x : X$, $y : Y$ with Alice's private coin…
- Used by 6
- CommunicationComplexity.PrivateCoin.communicationComplexity_le_of_finiteMessageFinite-probability protocols bound private-coin complexity. Let $X$, $Y$, and $\alpha$ be types, let $f : X \to Y \to \alpha$ be the…
- 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.FiniteMessage.Protocol.ApproxComputes_eq_ApproxSatisfiesApproximate computation as approximate satisfaction of equality. Let $p$ be a private-coin finite-message protocol over input types $X$,…
- 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.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.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 {Ω_X Ω_Y : Type*} {X Y α : Type*} in /-- A private-coin finite-message protocol `ε`-computes a function `f` if for every input `(x, y)`, the probability (over the product of the two private randomness spaces) 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.PrivateCoin.FiniteMessage.Protocol.ApproxComputes [MeasureSpace Ω_X] [MeasureSpace Ω_Y] (p : Protocol Ω_X Ω_Y X Y α) (f : X → Y → α) (ε : ℝ) : Prop := ∀ x y, volume.real {ω : Ω_X × Ω_Y | p.rrun x y ω.1 ω.2 ≠ f x y} ≤ ε