CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.ApproxSatisfies
defimported Lean
A protocol $p$ $\varepsilon$-satisfies a predicate $Q : X \to Y \to \alpha \to \mathrm{Prop}$ if for every input pair $(x, y)$, \[ \mathrm{vol}\bigl(\{(\omega_x, \omega_y) \mid \neg Q\,x\,y\,(p.\texttt{rrun}\,x\,y\,\omega_x\,\omega_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 def CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.ApproxSatisfies [MeasureSpace Ω_X] [MeasureSpace Ω_Y] (p : Protocol Ω_X Ω_Y X Y α) (Q : X → Y → α → Prop) (ε : ℝ) : Prop
- Defined in
- TCSlib, `CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.ApproxSatisfies`
- 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.ApproxSatisfies← CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.ApproxSatisfies (TCSlib/CommunicationComplexity/NewmanTheorem/PrivateCoinFiniteMessage.lean:119): 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 3
- 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.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.PrivateCoin.FiniteMessage.Protocol.toCoinTape_approxSatisfiesCoin-tape conversion preserves approximate correctness. Let $p$ be a private-coin finite-message protocol over input types $X$, $Y$ and…
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 finite-message protocol `ε`-satisfies a predicate `Q` if for every input `(x, y)`, the probability that `Q x y (p.rrun ...)` fails is at most `ε`. -/ def CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.ApproxSatisfies [MeasureSpace Ω_X] [MeasureSpace Ω_Y] (p : Protocol Ω_X Ω_Y X Y α) (Q : X → Y → α → Prop) (ε : ℝ) : Prop := ∀ x y, volume.real {ω : Ω_X × Ω_Y | ¬Q x y (p.rrun x y ω.1 ω.2)} ≤ ε