AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.Deterministic.Protocol.Computes

defimported Lean

A protocol $p$ computes a two-argument function $f : X \to Y \to \alpha$ if $p.\texttt{run}\,x\,y = f\,x\,y$ for all inputs $x : X$ and $y : Y$.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
variable {X Y α : Type*} in
def CommunicationComplexity.Deterministic.Protocol.Computes (p : Protocol X Y α) (f : X → Y → α) : Prop
Defined in
TCSlib, `CommunicationComplexity.Deterministic.Protocol.Computes`
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 11

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
variable {X Y α : Type*} in
/-- A protocol computes a function `f` if it produces `f x y` on all inputs `(x, y)`. [RY20, Ch. 1, Definition (computing a function, complexity, rounds)]. Deviation: the output type `α` is arbitrary rather than Boolean, and the leaf must output `f x y` itself rather than merely determine it. -/
def CommunicationComplexity.Deterministic.Protocol.Computes (p : Protocol X Y α) (f : X → Y → α) : Prop :=
  p.run = f
See it in the graphDiscuss this resultChallenge it