CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol
abbrevimported Lean
A private-coin finite-message protocol over input types $X$, $Y$ with private randomness types $\Omega_X$, $\Omega_Y$ and output type $\alpha$ is defined as a deterministic finite-message protocol whose effective input for Alice is $\Omega_X \times X$ and for Bob is $\Omega_Y \times Y$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory in abbrev CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol (Ω_X Ω_Y : Type*) (X Y α : Type*)
- Defined in
- TCSlib, `CommunicationComplexity.PrivateCoin.FiniteMessage.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.FiniteMessage.Protocol← CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol (TCSlib/CommunicationComplexity/NewmanTheorem/PrivateCoinFiniteMessage.lean:75): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 1
- CommunicationComplexity.Deterministic.FiniteMessage.ProtocolA generalized deterministic two-party communication protocol over input types $X$, $Y$ and output type $\alpha$. At each step a player…
- Used by 19
- 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.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.toProtocol_rrunExecution is preserved under conversion to a binary private-coin protocol. Let $p$ be a private-coin finite-message protocol with…
- 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.Deterministic.FiniteMessage.Protocol.toPrivateCoinGiven a deterministic finite-message protocol $p$, the operation…
- 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.ofProtocolEmbeds a binary private-coin protocol into a private-coin finite-message protocol by delegating to…
- CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.rrun_eqExplicit-coin execution as paired-input execution. Let $p$ be a private-coin finite-message protocol over input types $X$, $Y$, with…
- CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.toProtocolConverts a private-coin finite-message protocol into a binary-tree private-coin protocol by delegating to…
- CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.toCoinTapeGiven a finite-message private-coin protocol $p$ over finite probability spaces $\Omega_X$ and $\Omega_Y$, and a tolerance $\delta > 0$,…
- 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…
- 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.FiniteMessage.Protocol.toProtocol_complexityComplexity is preserved by the binary conversion. Let $p$ be a private-coin finite-message protocol with private randomness spaces…
- CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.aliceGiven a function $f : X \to \Omega_X \to \beta$ (Alice's message function depending on her public input and private randomness) and a…
- CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.ApproxSatisfiesA protocol $p$ $\varepsilon$-satisfies a predicate $Q : X \to Y \to \alpha \to \mathrm{Prop}$ if for every input pair $(x, y)$,…
- CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.toCoinTape_complexityCoin-tape conversion preserves communication complexity. Let $\Omega_X$ and $\Omega_Y$ be finite probability spaces, let $X$, $Y$ be input…
- CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.ApproxComputesA protocol $p$ $\varepsilon$-computes a function $f : X \to Y \to \alpha$ if for every input pair $(x, y)$,…
- CommunicationComplexity.PublicCoin.newmanNewman's theorem for communication complexity. Let $X$ and $Y$ be finite types, let $f : X \to Y \to \alpha$, and let…
- 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…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory in /-- A private-coin finite-message protocol with randomness `Ω_X` for Alice and `Ω_Y` for Bob, inputs `X`, `Y` and outputs `α`: a deterministic finite-message protocol where Alice's input is `Ω_X × X` and Bob's is `Ω_Y × Y`, so each player sees only their own random string [RY20, Ch. 3, §Variants of Randomized Protocols]. Deviation: each message is an element of an arbitrary finite type rather than a single bit, charged `⌈log₂ |β|⌉` bits. -/ abbrev CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol (Ω_X Ω_Y : Type*) (X Y α : Type*) := Deterministic.FiniteMessage.Protocol (Ω_X × X) (Ω_Y × Y) α