AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.ofProtocol_complexity

theoremverifiedimported Lean

Complexity invariance of the finite-message embedding. Let $\Omega$ be a shared-randomness space, let $X$ and $Y$ be the private input sets of Alice and Bob, let $\alpha$ be an output type, and let $p$ be a binary public-coin protocol over shared randomness $\Omega$ with these private inputs and this output — that is, a deterministic protocol whose players branch on Boolean messages, with Alice reading $\Omega \times X$ and Bob reading $\Omega \times Y$. Embedding $p$ into the finite-message framework by regarding each Boolean message as an element of the two-element type $\mathrm{Bool}$ yields a finite-message protocol whose worst-case communication complexity equals the worst-case communication complexity 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.ofProtocol_complexity
    (p : PublicCoin.Protocol Ω X Y α) :
    (ofProtocol p).complexity = p.complexity
Source
TCSlib, `CommunicationComplexity.PublicCoin.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.
Verified
07 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 19
Used by 7

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 finite-message protocol obtained from a binary public-coin protocol `p` by `ofProtocol` has exactly the complexity of `p`. -/
@[simp]
theorem CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.ofProtocol_complexity
    (p : PublicCoin.Protocol Ω X Y α) :
    (ofProtocol p).complexity = p.complexity :=
  Deterministic.FiniteMessage.Protocol.ofProtocol_complexity p
See it in the graphDiscuss this resultChallenge it