AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.Deterministic.communicationComplexity_le_of_finiteMessage_protocol

theoremverifiedimported Lean

Upper bound witnessed by a finite-message protocol. Let $f : X \to Y \to \alpha$ and let $p$ be a finite-message protocol over $X$, $Y$, $\alpha$ whose run function equals $f$. Then for every $c \in \mathbb{N} \cup \{\infty\}$ with $ FiniteMessage.Protocol.complexity\,(p) \le c$, the deterministic communication complexity of $f$ satisfies $D(f) \le c$. Each of the three public bounds above is a single application of this lemma to an explicit two-message protocol.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
theorem CommunicationComplexity.Deterministic.communicationComplexity_le_of_finiteMessage_protocol
    {X Y α : Type} {f : X → Y → α} (p : FiniteMessage.Protocol X Y α)
    (hrun : p.run = f) {c : ℕ∞} (hc : (p.complexity : ℕ∞) ≤ c) :
    communicationComplexity f ≤ c
Source
TCSlib, `CommunicationComplexity.Deterministic.communicationComplexity_le_of_finiteMessage_protocol`
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
Classical.choiceQuot.soundpropext
Built on 14
Used by 1

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
/-- Any finite-message protocol `p` that computes `f` witnesses the upper bound `communicationComplexity f ≤ c` for every `c` dominating `p.complexity`. Each of the three public bounds in this file is a single application of this lemma to an explicit two-message protocol. -/
theorem CommunicationComplexity.Deterministic.communicationComplexity_le_of_finiteMessage_protocol
    {X Y α : Type} {f : X → Y → α} (p : FiniteMessage.Protocol X Y α)
    (hrun : p.run = f) {c : ℕ∞} (hc : (p.complexity : ℕ∞) ≤ c) :
    communicationComplexity f ≤ c :=
  -- Go through `p.toProtocol` directly (rather than `communicationComplexity_le_iff_finiteMessage`),
  -- which keeps the axiom footprint minimal (historically `ofProtocol_complexity` used
  -- `native_decide`; it no longer does, but the direct route is also the shorter one).
  ((communicationComplexity_le_iff f p.complexity).2
    ⟨p.toProtocol, (FiniteMessage.Protocol.toProtocol_run p).trans hrun,
      (FiniteMessage.Protocol.toProtocol_complexity p).le⟩).trans hc
See it in the graphDiscuss this resultChallenge it