AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.Deterministic.OneWay.Protocol.run

defimported Lean

Given a one-way protocol $p$ and inputs $x \in X$, $y \in Y$, executing the protocol yields the output $p.\mathtt{decode}(p.\mathtt{send}(x),\, y) \in \alpha$.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
variable {X Y α : Type*} in
def CommunicationComplexity.Deterministic.OneWay.Protocol.run (p : Protocol X Y α) (x : X) (y : Y) : α
Defined in
TCSlib, `CommunicationComplexity.Deterministic.OneWay.Protocol.run`
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 1
Used by 3

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
variable {X Y α : Type*} in
/-- Execute a one-way protocol on input `(x, y)`. -/
def CommunicationComplexity.Deterministic.OneWay.Protocol.run (p : Protocol X Y α) (x : X) (y : Y) : α :=
  p.decode (p.send x) y
See it in the graphDiscuss this resultChallenge it