CommunicationComplexity.Deterministic.OneWay.Protocol.cost
defimported Lean
The communication cost of a one-way protocol $p$ is $\lceil \log_2 |\mathtt{Message}| \rceil$ bits, where $\mathtt{Message}$ is the protocol's codebook.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in variable {X Y α : Type*} in def CommunicationComplexity.Deterministic.OneWay.Protocol.cost (p : Protocol X Y α) : ℕ
- Defined in
- TCSlib, `CommunicationComplexity.Deterministic.OneWay.Protocol.cost`
- 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.cost← CommunicationComplexity.Deterministic.OneWay.Protocol.cost (TCSlib/CommunicationComplexity/DeterministicCC/OneWay.lean:93): 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.Deterministic.OneWay.communicationComplexityThe one-way deterministic communication complexity of $f : X \to Y \to \alpha$ is the infimum (in $\mathbb{N}_\infty$) of the bit costs…
- 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.le_communicationComplexity_iffLower bound characterization of one-way communication complexity. Let $f : X \to Y \to \alpha$ be a function and let $k \in \bbn$. Then…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in variable {X Y α : Type*} in /-- Protocol-level communication cost in bits: `⌈log₂ |Message|⌉`, where `Message` is the protocol codebook/language. [Rou16, §1.7 Definition (one-way protocol)]. Deviation: Roughgarden charges the length of Alice's message; here messages are abstract codewords and the cost is the length of a fixed-length binary encoding of the codebook. -/ def CommunicationComplexity.Deterministic.OneWay.Protocol.cost (p : Protocol X Y α) : ℕ := Nat.clog 2 (Fintype.card p.Message)