AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toProtocol_complexity

theoremverifiedimported Lean

Conversion to a binary protocol preserves complexity. Let $p$ be a finite-message deterministic two-party communication protocol over input types $X$ (Alice) and $Y$ (Bob) with outputs in $\alpha$, in which each message is an element of an arbitrary finite nonempty type. Its conversion into a binary protocol, obtained by encoding every $\beta$-valued message as $\lceil \log_2 \abs{\beta} \rceil$ bits, has communication complexity equal to that of $p$.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
variable {X Y α : Type*} in
@[simp]
theorem CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toProtocol_complexity (p : Protocol X Y α) :
    (toProtocol p).complexity = p.complexity
Source
TCSlib, `CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toProtocol_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.
Verified
07 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 9
Used by 34

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
variable {X Y α : Type*} in
/-- The binary protocol obtained from a finite-message protocol has the same complexity: encoding each `β`-valued message in binary costs exactly `⌈log₂ |β|⌉` bits. Folklore; no textbook counterpart was located, so no citation is attached. -/
@[simp]
theorem CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toProtocol_complexity (p : Protocol X Y α) :
    (toProtocol p).complexity = p.complexity :=
  (toProtocol_exists p).choose_spec.2
See it in the graphDiscuss this resultChallenge it