CommunicationComplexity.Deterministic.FiniteMessage.Protocol.comap
defimported Lean
Given 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'$ obtained by precomposing every message function with $f_X$ or $f_Y$ respectively, leaving the protocol tree structure unchanged.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in variable {X Y α : Type*} in def CommunicationComplexity.Deterministic.FiniteMessage.Protocol.comap {X' Y' : Type*} (p : Protocol X Y α) (fX : X' → X) (fY : Y' → Y) : Protocol X' Y' α
- Defined in
- TCSlib, `CommunicationComplexity.Deterministic.FiniteMessage.Protocol.comap`
- 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.comap← CommunicationComplexity.Deterministic.FiniteMessage.Protocol.comap (TCSlib/CommunicationComplexity/DeterministicCC/FiniteMessage.lean:359): 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 8
- CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toPrivateCoinGiven a deterministic finite-message protocol $p$, the operation…
- 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.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.Deterministic.FiniteMessage.Protocol.comap_complexityPullback preserves communication complexity. Let $p$ be a finite-message deterministic communication protocol over input types $X$ and $Y$…
- CommunicationComplexity.Deterministic.FiniteMessage.Protocol.comap_runExecution commutes with pullback. Let $p$ be a finite-message deterministic communication protocol over input types $X$, $Y$ with output…
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toDeterministicGiven a public-coin finite-message protocol $p$ and a fixed randomness sample $\omega : \Omega$,…
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toCoinTapeGiven a public-coin finite-message protocol $p$ over an arbitrary finite probability space $\Omega$ and a slack $\delta > 0$, this…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in variable {X Y α : Type*} in /-- Pull back a finite-message protocol along functions `fX : X' → X` and `fY : Y' → Y`, composing each message function with the maps. -/ def CommunicationComplexity.Deterministic.FiniteMessage.Protocol.comap {X' Y' : Type*} (p : Protocol X Y α) (fX : X' → X) (fY : Y' → Y) : Protocol X' Y' α := match p with | .output a => .output a | Protocol.alice f P => Protocol.alice (f ∘ fX) (fun b => (P b).comap fX fY) | Protocol.bob f P => Protocol.bob (f ∘ fY) (fun b => (P b).comap fX fY)