CommunicationComplexity.Deterministic.communicationComplexity_le_of_finiteMessage_protocol
theoremverifiedimported Lean
Upper bound witnessed by a finite-message protocol. Let $f : X \to Y \to \alpha$ and let $p$ be a finite-message protocol over $X$, $Y$, $\alpha$ whose run function equals $f$. Then for every $c \in \mathbb{N} \cup \{\infty\}$ with $ FiniteMessage.Protocol.complexity\,(p) \le c$, the deterministic communication complexity of $f$ satisfies $D(f) \le c$. Each of the three public bounds above is a single application of this lemma to an explicit two-message protocol.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in theorem CommunicationComplexity.Deterministic.communicationComplexity_le_of_finiteMessage_protocol {X Y α : Type} {f : X → Y → α} (p : FiniteMessage.Protocol X Y α) (hrun : p.run = f) {c : ℕ∞} (hc : (p.complexity : ℕ∞) ≤ c) : communicationComplexity f ≤ c
- Source
- TCSlib, `CommunicationComplexity.Deterministic.communicationComplexity_le_of_finiteMessage_protocol`
- 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.communicationComplexity_le_of_finiteMessage_protocol← CommunicationComplexity.Deterministic.communicationComplexity_le_of_finiteMessage_protocol (TCSlib/CommunicationComplexity/DeterministicCC/UpperBounds.lean:59): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 14
- CommunicationComplexity.Deterministic.communicationComplexity_le_iffThreshold characterization of deterministic communication complexity. Let $f : X \to Y \to \alpha$ be a two-argument function and let $n$…
- CommunicationComplexity.Deterministic.Protocol.complexityThe communication complexity of a protocol $p$ is the worst-case total number of bits exchanged: an output node costs $0$, while an alice…
- 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.runGiven a finite-message protocol $p$ and inputs $x : X$, $y : Y$,
runexecutes $p$ recursively: at analicenode it… - CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toProtocolA noncomputable function that converts a finite-message protocol $p$ into a binary protocol…
- CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toProtocol_runConversion to binary protocol preserves output. Let $p$ be a finite-message deterministic two-party protocol over input types $X$ and $Y$…
- CommunicationComplexity.Deterministic.FiniteMessage.Protocol.complexityThe worst-case communication cost of a finite-message protocol, measured in bits. An
outputnode costs $0$; analiceor… - CommunicationComplexity.Deterministic.communicationComplexityThe deterministic communication complexity of $f : X \to Y \to \alpha$ is defined as…
- CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.toProtocol_complexityComplexity is preserved by the binary conversion. Let $p$ be a private-coin finite-message protocol with private randomness spaces…
- CommunicationComplexity.Deterministic.ProtocolA deterministic two-party communication protocol over input types $X$ (Alice) and $Y$ (Bob) producing a value of type $\alpha$ is an…
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toProtocol_complexityConversion to a binary public-coin protocol preserves communication complexity. Let $\Omega$ be a shared-randomness space and let $p$ be a…
- CommunicationComplexity.Deterministic.Protocol.runGiven a protocol $p$,
runevaluates $p$ on inputs $x : X$ and $y : Y$ by recursively following the bit-branching structure until… - CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toProtocol_complexityConversion to a binary protocol preserves complexity. Let $p$ be a finite-message deterministic two-party communication protocol over…
- CommunicationComplexity.Deterministic.Protocol.ComputesA protocol $p$ computes a two-argument function $f : X \to Y \to \alpha$ if $p.\texttt{run}\,x\,y = f\,x\,y$ for all inputs $x : X$…
- Used by 1
- CommunicationComplexity.Deterministic.communicationComplexity_le_clog_card_X_alphaTrivial upper bound on deterministic communication complexity. Let $X$ and $\alpha$ be finite nonempty types, let $Y$ be an arbitrary…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in /-- Any finite-message protocol `p` that computes `f` witnesses the upper bound `communicationComplexity f ≤ c` for every `c` dominating `p.complexity`. Each of the three public bounds in this file is a single application of this lemma to an explicit two-message protocol. -/ theorem CommunicationComplexity.Deterministic.communicationComplexity_le_of_finiteMessage_protocol {X Y α : Type} {f : X → Y → α} (p : FiniteMessage.Protocol X Y α) (hrun : p.run = f) {c : ℕ∞} (hc : (p.complexity : ℕ∞) ≤ c) : communicationComplexity f ≤ c := -- Go through `p.toProtocol` directly (rather than `communicationComplexity_le_iff_finiteMessage`), -- which keeps the axiom footprint minimal (historically `ofProtocol_complexity` used -- `native_decide`; it no longer does, but the direct route is also the shorter one). ((communicationComplexity_le_iff f p.complexity).2 ⟨p.toProtocol, (FiniteMessage.Protocol.toProtocol_run p).trans hrun, (FiniteMessage.Protocol.toProtocol_complexity p).le⟩).trans hc