CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.ofProtocol
abbrevimported Lean
Embeds a binary public-coin protocol into a finite-message protocol by delegating to
CommunicationComplexity.Deterministic.FiniteMessage.Protocol.ofProtocol.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory in variable {Ω : Type*} {X Y α : Type*} in abbrev CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.ofProtocol (p : PublicCoin.Protocol Ω X Y α) : Protocol Ω X Y α
- Defined in
- TCSlib, `CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.ofProtocol`
- 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.FiniteMessage.Protocol.ofProtocol← CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.ofProtocol (TCSlib/CommunicationComplexity/NewmanTheorem/PublicCoinFiniteMessage.lean:168): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 3
- CommunicationComplexity.PublicCoin.ProtocolA public-coin protocol over shared randomness $\Omega$, with Alice's private input in $X$ and Bob's in $Y$ producing an output in…
- CommunicationComplexity.PublicCoin.FiniteMessage.ProtocolA public-coin finite-message protocol over shared-randomness space $\Omega$, private input sets $X$ and $Y$, and output type $\alpha$ is a…
- CommunicationComplexity.Deterministic.FiniteMessage.Protocol.ofProtocolEmbeds a binary protocol into the generalized finite-message framework by treating each Boolean message as an element of…
- Used by 3
- 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.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 in variable {Ω : Type*} {X Y α : Type*} in /-- Embed a binary public-coin protocol into a finite-message protocol. Delegates to `Deterministic.FiniteMessage.Protocol.ofProtocol`. -/ abbrev CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.ofProtocol (p : PublicCoin.Protocol Ω X Y α) : Protocol Ω X Y α := Deterministic.FiniteMessage.Protocol.ofProtocol p