CommunicationComplexity.Deterministic.le_communicationComplexity_iff
theoremverifiedimported Lean
Lower-bound characterization of communication complexity. Let $f : X \to Y \to \alpha$ be a two-argument function, let $D(f) \in \bbn_\infty$ denote its deterministic communication complexity, and let $n$ be a natural number. Then $n \le D(f)$ if and only if every deterministic protocol $p$ that computes $f$ has communication complexity at least $n$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in theorem CommunicationComplexity.Deterministic.le_communicationComplexity_iff {X Y α : Type*} (f : X → Y → α) (n : ℕ) : (n : ENat) ≤ communicationComplexity f ↔ ∀ p : Protocol X Y α, p.Computes f → n ≤ p.complexity
- Source
- TCSlib, `CommunicationComplexity.Deterministic.le_communicationComplexity_iff`
- 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.CommunicationComplexity.Deterministic.le_communicationComplexity_iff← CommunicationComplexity.Deterministic.le_communicationComplexity_iff (TCSlib/CommunicationComplexity/DeterministicCC/DetComplexity.lean:125): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- CommunicationComplexity.Deterministic.Protocol.complexityThe communication complexity of a protocol $p$ is the worst-case total number of bits exchanged: an output node costs $0$, while an alice…
- CommunicationComplexity.Deterministic.communicationComplexityThe deterministic communication complexity of $f : X \to Y \to \alpha$ is defined as…
- CommunicationComplexity.Deterministic.ProtocolA deterministic two-party communication protocol over input types $X$ (Alice) and $Y$ (Bob) producing a value of type $\alpha$ is an…
- CommunicationComplexity.Deterministic.Protocol.ComputesA 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$…
- Used by 3
- CommunicationComplexity.Functions.Indexing.le_oneWayCommunicationComplexityOne-way complexity of Index is at least $n$. Every correct deterministic one-way protocol for $\mathrm{IND}_n$ has cost at least $n$; that…
- CommunicationComplexity.Deterministic.OneWay.le_communicationComplexity_iffLower bound characterization of one-way communication complexity. Let $f : X \to Y \to \alpha$ be a function and let $k \in \bbn$. Then…
- CommunicationComplexity.Deterministic.le_communicationComplexity_of_forall_lt_ncardRectangle-partition lower bound on communication complexity. Let $g : X \to Y \to \alpha$ be a two-argument function and let $n$ be a…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option relaxedAutoImplicit false inset_option autoImplicit false in/-- The deterministic communication complexity of `f` is at least `n` if and only if every protocol computing `f` uses at least `n` bits. This is the form in which lower bounds are proved. -/theorem CommunicationComplexity.Deterministic.le_communicationComplexity_iff {X Y α : Type*} (f : X → Y → α) (n : ℕ) : (n : ENat) ≤ communicationComplexity f ↔ ∀ p : Protocol X Y α, p.Computes f → n ≤ p.complexity := by simp only [communicationComplexity, le_iInf_iff, Nat.cast_le]