AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.Deterministic.FiniteMessage.Protocol.ofProtocol

defimported Lean

Embeds a binary protocol into the generalized finite-message framework by treating each Boolean message as an element of $\beta = \mathrm{Bool}$, giving a CommunicationComplexity.Deterministic.Protocol $X\,Y\,\alpha$ with the same tree structure.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
variable {X Y α : Type*} in
def CommunicationComplexity.Deterministic.FiniteMessage.Protocol.ofProtocol : Deterministic.Protocol X Y α → Protocol X Y α
Defined in
TCSlib, `CommunicationComplexity.Deterministic.FiniteMessage.Protocol.ofProtocol`
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 2
Used by 5

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
variable {X Y α : Type*} in
/-- Embed a binary protocol into a generalized protocol (with `β = Bool` at each step). -/
def CommunicationComplexity.Deterministic.FiniteMessage.Protocol.ofProtocol : Deterministic.Protocol X Y α → Protocol X Y α
  | Deterministic.Protocol.output val => Deterministic.FiniteMessage.Protocol.output val
  | Deterministic.Protocol.alice f P =>
      Deterministic.FiniteMessage.Protocol.alice f (fun b => ofProtocol (P b))
  | Deterministic.Protocol.bob f P =>
      Deterministic.FiniteMessage.Protocol.bob f (fun b => ofProtocol (P b))
See it in the graphDiscuss this resultChallenge it