AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.Deterministic.Protocol.run

defimported Lean

Given a protocol $p$, run evaluates $p$ on inputs $x : X$ and $y : Y$ by recursively following the bit-branching structure until an output node is reached, returning the stored value of type $\alpha$.

Statement

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

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
variable {X Y α : Type*} in
/-- Executes the protocol on inputs `x` and `y`, returning the output value: starting at the root, the owner of the current node evaluates its message function on its own input and both parties descend to the indicated child, until a leaf is reached. [RY20, Ch. 1, Definition (outcome)]. -/
def CommunicationComplexity.Deterministic.Protocol.run (p : Protocol X Y α) (x : X) (y : Y) : α :=
  match p with
  | .output val => val
  | .alice f P => (P (f x)).run x y
  | .bob f P => (P (f y)).run x y
See it in the graphDiscuss this resultChallenge it