CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toDeterministic
abbrevimported Lean
Given a public-coin finite-message protocol $p$ and a fixed randomness sample
$\omega : \Omega$, PublicCoin.FiniteMessage.Protocol.toDeterministic~$p~\omega$
is the deterministic finite-message protocol obtained by substituting $\omega$
for the shared randomness (via comap with $\mathrm{Prod.mk}\,\omega$).
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory ProbabilityTheory in abbrev CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toDeterministic {Ω X Y α : Type*} (p : PublicCoin.FiniteMessage.Protocol Ω X Y α) (ω : Ω) : Deterministic.FiniteMessage.Protocol X Y α
- Defined in
- TCSlib, `CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toDeterministic`
- 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.toDeterministic← CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toDeterministic (TCSlib/CommunicationComplexity/NewmanTheorem/Comparison.lean:109): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 3
- CommunicationComplexity.Deterministic.FiniteMessage.ProtocolA generalized deterministic two-party communication protocol over input types $X$, $Y$ and output type $\alpha$. At each step a player…
- CommunicationComplexity.Deterministic.FiniteMessage.Protocol.comapGiven maps $f_X : X' \to X$ and $f_Y : Y' \to Y$, the pullback $p.\mathrm{comap}\,f_X\,f_Y$ is the finite-message protocol over $X'$, $Y'$…
- 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…
- Used by 5
- 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.PublicCoin.FiniteMessage.Protocol.toDeterministic_complexityFixing shared randomness preserves communication complexity. Let $p$ be a public-coin finite-message protocol over a shared-randomness…
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.newmanProtocol_ApproxComputesNewman's reduction preserves approximate correctness. Let $\Omega$ be a finite probability space, let $X$ and $Y$ be finite types, and let…
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.newmanProtocol_complexityCommunication cost of the Newman protocol. Let $X$ and $Y$ be finite types, let $\Omega$ be a finite probability space, and let $p$ be a…
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toDeterministic_runFixing randomness commutes with execution. Let $p$ be a public-coin finite-message protocol over a shared-randomness space $\Omega$,…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory ProbabilityTheory in /-- Fix the randomness of a public-coin finite-message protocol, producing a deterministic finite-message protocol with the same complexity (via comap). -/ abbrev CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toDeterministic {Ω X Y α : Type*} (p : PublicCoin.FiniteMessage.Protocol Ω X Y α) (ω : Ω) : Deterministic.FiniteMessage.Protocol X Y α := p.comap (Prod.mk ω) (Prod.mk ω)