CommunicationComplexity.PrivateCoin.Protocol
abbrevimported Lean
A private-coin protocol with randomness spaces $\Omega_X$ and $\Omega_Y$, input spaces $X$ and $Y$, and output type $\alpha$ is defined as a deterministic protocol $\texttt{Deterministic.Protocol}\;(\Omega_X \times X)\;(\Omega_Y \times Y)\;\alpha$. Alice's message function receives the pair $(\omega_x, x)$ and Bob's receives $(\omega_y, y)$, so each player's coin flip is invisible to the other.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory ProbabilityTheory in abbrev CommunicationComplexity.PrivateCoin.Protocol (Ω_X Ω_Y : Type*) (X Y α : Type*)
- Defined in
- TCSlib, `CommunicationComplexity.PrivateCoin.Protocol`
- 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← CommunicationComplexity.PrivateCoin.Protocol (TCSlib/CommunicationComplexity/NewmanTheorem/PrivateCoinBasic.lean:66): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 1
- CommunicationComplexity.Deterministic.ProtocolA deterministic two-party communication protocol over input types $X$ (Alice) and $Y$ (Bob) producing a value of type $\alpha$ is an…
- Used by 12
- 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.PrivateCoin.FiniteMessage.Protocol.toProtocol_rrunExecution is preserved under conversion to a binary private-coin protocol. Let $p$ be a private-coin finite-message protocol with…
- CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.ofProtocol_complexityEmbedding a binary private-coin protocol preserves complexity. Let $p$ be a binary private-coin protocol with randomness spaces $\Omega_X$…
- CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.ofProtocolEmbeds a binary private-coin protocol into a private-coin finite-message protocol by delegating to…
- CommunicationComplexity.PrivateCoin.Protocol.ApproxComputesA private-coin protocol $p$ $\varepsilon$-computes a function $f : X \to Y \to \alpha$ if for every input pair $(x, y)$,…
- CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.ofProtocol_rrunEmbedding preserves randomized execution of private-coin protocols. The embedding of a binary private-coin protocol into the…
- CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.toProtocolConverts a private-coin finite-message protocol into a binary-tree private-coin protocol by delegating to…
- CommunicationComplexity.PrivateCoin.Protocol.rrun_eqRandomized execution as deterministic run on paired inputs. Let $p$ be a private-coin protocol with randomness spaces $\Omega_X$ and…
- 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.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.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 /-- A private-coin protocol with randomness `Ω_X` for Alice and `Ω_Y` for Bob, inputs `X`, `Y` and outputs `α`: a deterministic protocol where Alice's input is augmented with her private randomness and Bob's with his, so Alice's message functions see `(ω_x, x)` and Bob's see `(ω_y, y)`, and neither player sees the other's coins [RY20, Ch. 3, §Variants of Randomized Protocols: private coins]. -/ abbrev CommunicationComplexity.PrivateCoin.Protocol (Ω_X Ω_Y : Type*) (X Y α : Type*) := Deterministic.Protocol (Ω_X × X) (Ω_Y × Y) α