CommunicationComplexity.PublicCoin.Protocol
abbrevimported Lean
A public-coin protocol over shared randomness $\Omega$, with Alice's private input in $X$ and Bob's in $Y$ producing an output in $\alpha$, is a deterministic protocol whose combined input types are $\Omega \times X$ (for Alice) and $\Omega \times Y$ (for Bob). In other words, both players observe the same random string $\omega \in \Omega$ alongside their private inputs.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory ProbabilityTheory in abbrev CommunicationComplexity.PublicCoin.Protocol (Ω : Type*) (X Y α : Type*)
- Defined in
- TCSlib, `CommunicationComplexity.PublicCoin.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.PublicCoin.Protocol← CommunicationComplexity.PublicCoin.Protocol (TCSlib/CommunicationComplexity/NewmanTheorem/PublicCoinBasic.lean:62): 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 16
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.ofProtocolEmbeds a binary public-coin protocol into a finite-message protocol by delegating to…
- CommunicationComplexity.PublicCoin.zeroErrorCommunicationComplexityFor types X, Y, and α, and a function f : X → Y → α, the zero-error public-coin expected communication complexity is defined as the…
- CommunicationComplexity.PublicCoin.communicationComplexity_le_iffBit bound as existence of an approximating protocol. Let $f : X \to Y \to \alpha$ be a function of Alice's input and Bob's input, let…
- CommunicationComplexity.PublicCoin.Protocol.toDeterministic_runFixing the shared randomness agrees with the randomised run. Let $p$ be a public-coin protocol over a randomness space $\Omega$, 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.PublicCoin.Protocol.toDeterministic_complexityFixing shared randomness preserves communication complexity. Let $p$ be a public-coin communication protocol over a shared randomness…
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.ofProtocol_rrunEmbedding preserves randomized execution. Let $\Omega$ be a shared-randomness space, let $X$ and $Y$ be the private input sets of the two…
- CommunicationComplexity.PublicCoin.Protocol.rrun_eqRandomized execution as deterministic execution on paired inputs. Let $p$ be a public-coin protocol with shared randomness in $\Omega$,…
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toProtocolConverts a public-coin finite-message protocol to a binary public-coin protocol by delegating to…
- CommunicationComplexity.PublicCoin.Protocol.ApproxComputesA public-coin protocol $p$ $\varepsilon$-computes a function $f : X \to Y \to \alpha$ if for every input pair $(x, y)$,…
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toProtocol_rrunBinary conversion preserves randomized execution. Let $p$ be a public-coin finite-message protocol with shared-randomness space $\Omega$,…
- CommunicationComplexity.PublicCoin.Protocol.toDeterministicGiven a public-coin protocol $p$ over randomness space $\Omega$ and a fixed outcome $\omega : \Omega$,…
- CommunicationComplexity.PublicCoin.Protocol.rrunGiven a public-coin protocol $p$, private inputs $x \in X$, $y \in Y$, and a shared random string $\omega \in \Omega$,…
- CommunicationComplexity.PublicCoin.communicationComplexityThe $\varepsilon$-error public-coin randomized communication complexity of $f : X \to Y \to \alpha$ is defined as…
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.ofProtocol_complexityComplexity invariance of the finite-message embedding. Let $\Omega$ be a shared-randomness space, let $X$ and $Y$ be the private input…
- 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 ProbabilityTheory in /-- A public-coin protocol with randomness `Ω`, inputs `X`, `Y` and outputs `α`: a deterministic protocol where both Alice and Bob see the shared random string `ω : Ω` in addition to their own inputs, so Alice's input is `(ω, x)` and Bob's is `(ω, y)` [RY20, Ch. 3, §Variants of Randomized Protocols: public coins]. -/ abbrev CommunicationComplexity.PublicCoin.Protocol (Ω : Type*) (X Y α : Type*) := Deterministic.Protocol (Ω × X) (Ω × Y) α