AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.Deterministic.OneWay.communicationComplexity

defimported Lean

The one-way deterministic communication complexity of $f : X \to Y \to \alpha$ is the infimum (in $\mathbb{N}_\infty$) of the bit costs $p.\mathtt{cost}$ over all one-way protocols $p$ that compute $f$.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
variable {X Y α : Type*} in
noncomputable def CommunicationComplexity.Deterministic.OneWay.communicationComplexity (f : X → Y → α) : ENat
Defined in
TCSlib, `CommunicationComplexity.Deterministic.OneWay.communicationComplexity`
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 3
Used by 2

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
variable {X Y α : Type*} in
/-- One-way deterministic communication complexity of `f`: the infimum, over one-way protocols computing `f`, of protocol bit cost. [Rou16, §1.7 Definition (one-way communication complexity)]. Deviation: defined as an `ENat` infimum, so it is `⊤` when no one-way protocol computes `f`. -/
noncomputable def CommunicationComplexity.Deterministic.OneWay.communicationComplexity (f : X → Y → α) : ENat :=
  ⨅ (p : Protocol X Y α) (_ : Protocol.Computes p f), (Protocol.cost p : ENat)
See it in the graphDiscuss this resultChallenge it