CommunicationComplexity.Deterministic.OneWay.Protocol.run
defimported Lean
Given a one-way protocol $p$ and inputs $x \in X$, $y \in Y$, executing the protocol yields the output $p.\mathtt{decode}(p.\mathtt{send}(x),\, y) \in \alpha$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in variable {X Y α : Type*} in def CommunicationComplexity.Deterministic.OneWay.Protocol.run (p : Protocol X Y α) (x : X) (y : Y) : α
- Defined in
- TCSlib, `CommunicationComplexity.Deterministic.OneWay.Protocol.run`
- 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.OneWay.Protocol.run← CommunicationComplexity.Deterministic.OneWay.Protocol.run (TCSlib/CommunicationComplexity/DeterministicCC/OneWay.lean:85): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 1
- CommunicationComplexity.Deterministic.OneWay.ProtocolA one-way deterministic communication protocol for inputs $x \in X$, $y \in Y$, and output type $\alpha$ is a structure consisting of a…
- Used by 3
- 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.Functions.Indexing.le_oneWayCommunicationComplexityOne-way complexity of Index is at least $n$. Every correct deterministic one-way protocol for $\mathrm{IND}_n$ has cost at least $n$; that…
- CommunicationComplexity.Deterministic.OneWay.Protocol.ComputesA one-way protocol $p$ computes a function $f : X \to Y \to \alpha$ if $p.\mathtt{run}(x, y) = f(x, y)$ for every pair of inputs…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in variable {X Y α : Type*} in /-- Execute a one-way protocol on input `(x, y)`. -/ def CommunicationComplexity.Deterministic.OneWay.Protocol.run (p : Protocol X Y α) (x : X) (y : Y) : α := p.decode (p.send x) y