CommunicationComplexity.Deterministic.FiniteMessage.Protocol.ofProtocol_complexity
theoremverifiedimported Lean
Embedding binary protocols preserves complexity. Let $p$ be a deterministic binary two-party communication protocol over input types $X$ and $Y$ with output type $\alpha$, and let its embedding into the finite-message framework send each Boolean message as an element of $\{\mathtt{false},\mathtt{true}\}$. Then the communication complexity of the embedded finite-message protocol equals the communication complexity of $p$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in variable {X Y α : Type*} in theorem CommunicationComplexity.Deterministic.FiniteMessage.Protocol.ofProtocol_complexity (p : Deterministic.Protocol X Y α) : (ofProtocol p).complexity = p.complexity
- Source
- TCSlib, `CommunicationComplexity.Deterministic.FiniteMessage.Protocol.ofProtocol_complexity`
- 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.ofProtocol_complexity← CommunicationComplexity.Deterministic.FiniteMessage.Protocol.ofProtocol_complexity (TCSlib/CommunicationComplexity/DeterministicCC/FiniteMessage.lean:343): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- 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.Protocol.clog_two_twoCeiling logarithm of two. The ceiling base-$2$ logarithm of $2$ equals $1$: $\lceil \log_2 2 \rceil = 1$, i.e.\
Nat.clog 2 2 = 1.… - CommunicationComplexity.Deterministic.FiniteMessage.Protocol.complexityThe worst-case communication cost of a finite-message protocol, measured in bits. An
outputnode costs $0$; analiceor… - 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.Deterministic.FiniteMessage.Protocol.ofProtocolEmbeds a binary protocol into the generalized finite-message framework by treating each Boolean message as an element of…
- Used by 5
- CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.ofProtocol_complexityEmbedding a binary private-coin protocol preserves complexity. Let $p$ be a binary private-coin protocol with randomness spaces $\Omega_X$…
- CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toProtocol_existsBinary simulation of a finite-message protocol. Let $X$, $Y$, and $\alpha$ be types, and let $p$ be a finite-message two-party protocol…
- CommunicationComplexity.PrivateCoin.communicationComplexity_le_iff_finiteMessageFinite-message characterization of private-coin complexity. Let $f : X \to Y \to \alpha$ be a function, let $\varepsilon \in \bbr$ be an…
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.ofProtocol_complexityComplexity invariance of the finite-message embedding. Let $\Omega$ be a shared-randomness space, let $X$ and $Y$ be the private input…
- CommunicationComplexity.PublicCoin.newmanNewman's theorem for communication complexity. Let $X$ and $Y$ be finite types, let $f : X \to Y \to \alpha$, and let…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option relaxedAutoImplicit false inset_option autoImplicit false invariable {X Y α : Type*} in/-- Viewing a binary protocol as a finite-message protocol does not change its complexity: each `Bool`-valued message costs `⌈log₂ 2⌉ = 1` bit. -/theorem CommunicationComplexity.Deterministic.FiniteMessage.Protocol.ofProtocol_complexity (p : Deterministic.Protocol X Y α) : (ofProtocol p).complexity = p.complexity := by induction p <;> simp only [ofProtocol, complexity, Deterministic.Protocol.complexity, Fintype.univ_bool, Finset.sup_insert, Finset.sup_singleton, Fintype.card_bool, clog_two_two, Nat.max_comm, *]