CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toPrivateCoin
abbrevimported Lean
Given a deterministic finite-message protocol $p$, the operation
CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toPrivateCoin converts it into a
private-coin finite-message protocol over arbitrary coin spaces $\Omega_X$ and
$\Omega_Y$ by ignoring both coin inputs (via comap with $\mathrm{Prod.snd}$).
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory ProbabilityTheory in abbrev CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toPrivateCoin {X Y α Ω_X Ω_Y : Type*} (p : Deterministic.FiniteMessage.Protocol X Y α) : PrivateCoin.FiniteMessage.Protocol Ω_X Ω_Y X Y α
- Defined in
- TCSlib, `CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toPrivateCoin`
- 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.Deterministic.FiniteMessage.Protocol.toPrivateCoin← CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toPrivateCoin (TCSlib/CommunicationComplexity/NewmanTheorem/Comparison.lean:76): 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.PrivateCoin.FiniteMessage.ProtocolA private-coin finite-message protocol over input types $X$, $Y$ with private randomness types $\Omega_X$, $\Omega_Y$ and output type…
- 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.Deterministic.FiniteMessage.Protocol.toPrivateCoin_rrunIgnoring private coins recovers the deterministic output. Let $p$ be a deterministic finite-message protocol over input types $X$ and $Y$…
- CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toPrivateCoin_complexityComplexity is preserved by passage to the private-coin model. Let $p$ be a deterministic finite-message protocol over input types $X$, $Y$…
- 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…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory ProbabilityTheory in /-- Convert a deterministic finite-message protocol to a private-coin finite-message protocol by ignoring both coin spaces (via comap). -/ abbrev CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toPrivateCoin {X Y α Ω_X Ω_Y : Type*} (p : Deterministic.FiniteMessage.Protocol X Y α) : PrivateCoin.FiniteMessage.Protocol Ω_X Ω_Y X Y α := p.comap Prod.snd Prod.snd