AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toProtocol_complexity

theoremverifiedimported Lean

Conversion to a binary public-coin protocol preserves communication complexity. Let $\Omega$ be a shared-randomness space and let $p$ be a public-coin finite-message protocol with Alice's private input in $X$, Bob's in $Y$, and output in $\alpha$; that is, a deterministic finite-message protocol whose effective input types are $\Omega \times X$ for Alice and $\Omega \times Y$ for Bob, in which each message is an element of an arbitrary finite nonempty type $\beta$ costing $\lceil \log_2 \abs{\beta} \rceil$ bits. Then the binary public-coin protocol obtained from $p$ by encoding every $\beta$-valued message as $\lceil \log_2 \abs{\beta} \rceil$ bits has communication complexity exactly equal to that of $p$.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory in
variable {Ω : Type*} {X Y α : Type*} in
@[simp]
theorem CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toProtocol_complexity (p : Protocol Ω X Y α) :
    (p.toProtocol).complexity = p.complexity
Source
TCSlib, `CommunicationComplexity.PublicCoin.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 16
Used by 19

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory in
variable {Ω : Type*} {X Y α : Type*} in
/-- The binary public-coin protocol obtained from a finite-message protocol `p` by `toProtocol` has exactly the complexity of `p`, where a `β`-valued message of `p` is charged `⌈log₂ |β|⌉` bits. -/
@[simp]
theorem CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toProtocol_complexity (p : Protocol Ω X Y α) :
    (p.toProtocol).complexity = p.complexity :=
  Deterministic.FiniteMessage.Protocol.toProtocol_complexity p
See it in the graphDiscuss this resultChallenge it