AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toProtocol

defimported Lean

A noncomputable function that converts a finite-message protocol $p$ into a binary protocol CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toProtocol $p$ with the same run behavior and the same communication complexity, encoding each $\beta$-valued message as $\lceil \log_2 |\beta| \rceil$ bits.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
variable {X Y α : Type*} in
noncomputable def CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toProtocol (p : Protocol X Y α) : Deterministic.Protocol X Y α
Defined in
TCSlib, `CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toProtocol`
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
none listed
Built on 7
Used by 8

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
variable {X Y α : Type*} in
/-- Convert a finite-message protocol to a binary protocol with the same run behavior and complexity, encoding each `β`-valued message as `⌈log₂ |β|⌉` bits. This is folklore (a `|β|`-ary message costs `⌈log₂ |β|⌉` bits); no textbook counterpart was located, so no citation is attached. The protocol is obtained noncomputably from the existence proof `toProtocol_exists`. -/
noncomputable def CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toProtocol (p : Protocol X Y α) : Deterministic.Protocol X Y α :=
  (toProtocol_exists p).choose
See it in the graphDiscuss this resultChallenge it