AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.Deterministic.OneWay.Protocol.Computes

defimported Lean

A one-way protocol $p$ computes a function $f : X \to Y \to \alpha$ if $p.\mathtt{run}(x, y) = f(x, y)$ for every pair of inputs $(x, y)$.

Statement

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

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
variable {X Y α : Type*} in
/-- A one-way protocol computes `f` when its execution agrees with `f` everywhere. [Rou16, §1.7 Definition (one-way protocol)]. -/
def CommunicationComplexity.Deterministic.OneWay.Protocol.Computes (p : Protocol X Y α) (f : X → Y → α) : Prop :=
  p.run = f
See it in the graphDiscuss this resultChallenge it