CommunicationComplexity.PrivateCoin.communicationComplexity_le_iff_finiteMessage
Finite-message characterization of private-coin complexity. Let $f : X \to Y \to \alpha$ be a function, let $\varepsilon \in \bbr$ be an error bound, and let $n \in \bbn$. Then the $\varepsilon$-error private-coin randomized communication complexity satisfies $R_\varepsilon(f) \le n$ if and only if there exist coin-tape lengths $n_X, n_Y \in \bbn$ and a private-coin finite-message protocol $p$ with randomness spaces $\{0,1\}^{n_X}$ and $\{0,1\}^{n_Y}$ (over input types $X$, $Y$ and output type $\alpha$) such that $p$ computes $f$ with error at most $\varepsilon$ on every input pair and has worst-case communication cost at most $n$. Thus the private-coin complexity, defined via binary-message protocols, is unchanged when one instead allows protocols whose players may send elements of arbitrary finite nonempty message alphabets, each $\beta$-valued message being charged $\lceil \log_2 \abs{\beta} \rceil$ bits.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory ProbabilityTheory in theorem CommunicationComplexity.PrivateCoin.communicationComplexity_le_iff_finiteMessage {X Y α} (f : X → Y → α) (ε : ℝ) (n : ℕ) : communicationComplexity f ε ≤ n ↔ ∃ (nX nY : ℕ) (p : FiniteMessage.Protocol (CoinTape nX) (CoinTape nY) X Y α), p.ApproxComputes f ε ∧ p.complexity ≤ n
- Source
- TCSlib, `CommunicationComplexity.PrivateCoin.communicationComplexity_le_iff_finiteMessage`
- 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.PrivateCoin.communicationComplexity_le_iff_finiteMessage← CommunicationComplexity.PrivateCoin.communicationComplexity_le_iff_finiteMessage (TCSlib/CommunicationComplexity/NewmanTheorem/PrivateCoinComplexity.lean:119): verbatim
- Verified
- 16 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 40
- CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.toCoinTape_complexityCoin-tape conversion preserves communication complexity. Let $\Omega_X$ and $\Omega_Y$ be finite probability spaces, let $X$, $Y$ be input…
- CommunicationComplexity.Deterministic.Protocol.runGiven a protocol $p$,
runevaluates $p$ on inputs $x : X$ and $y : Y$ by recursively following the bit-branching structure until… - CommunicationComplexity.Deterministic.FiniteMessage.Protocol.complexityThe worst-case communication cost of a finite-message protocol, measured in bits. An
outputnode costs $0$; analiceor… - CommunicationComplexity.Deterministic.FiniteMessage.Protocol.ofProtocol_complexityEmbedding binary protocols preserves complexity. Let $p$ be a deterministic binary two-party communication protocol over input types $X$…
- CommunicationComplexity.Deterministic.FiniteMessage.Protocol.ofProtocol_runEmbedding preserves protocol output. Let $X$ and $Y$ be the input types of Alice and Bob, let $\alpha$ be an output type, and let $p$ be a…
- CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toProtocolA noncomputable function that converts a finite-message protocol $p$ into a binary protocol…
- CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toProtocol_complexityConversion to a binary protocol preserves complexity. Let $p$ be a finite-message deterministic two-party communication protocol over…
- CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toProtocol_runConversion to binary protocol preserves output. Let $p$ be a finite-message deterministic two-party protocol over input types $X$ and $Y$…
- CommunicationComplexity.CoinTape$\texttt{CoinTape}(n)$ is the type $\mathrm{Fin}\,n \to \mathrm{Bool}$, i.e.\ the set of all binary strings of length $n$, representing…
- CommunicationComplexity.PrivateCoin.communicationComplexityThe $\varepsilon$-error private-coin randomized communication complexity of $f : X \to Y \to \alpha$ is the extended natural number…
- CommunicationComplexity.PrivateCoin.communicationComplexity_le_iffCharacterization of private-coin complexity by upper bounds. Let $f : X \to Y \to \alpha$ be a function, let $\varepsilon \in \bbr$ be an…
- CommunicationComplexity.PrivateCoin.FiniteMessage.ProtocolA private-coin finite-message protocol over input types $X$, $Y$ with private randomness types $\Omega_X$, $\Omega_Y$ and output type…
- CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.ApproxComputesA protocol $p$ $\varepsilon$-computes a function $f : X \to Y \to \alpha$ if for every input pair $(x, y)$,…
- CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.ofProtocolEmbeds a binary private-coin protocol into a private-coin finite-message protocol by delegating to…
- CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.rrun$\texttt{rrun}\,p\,x\,y\,\omega_x\,\omega_y$ executes the protocol $p$ on public inputs $x : X$, $y : Y$ with Alice's private coin…
- CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.toProtocolConverts a private-coin finite-message protocol into a binary-tree private-coin protocol by delegating to…
- CommunicationComplexity.Deterministic.Protocol.swap_runRole swap preserves protocol output. Let $p$ be a deterministic two-party communication protocol with Alice's inputs drawn from $X$, Bob's…
- CommunicationComplexity.Deterministic.Protocol.swap_complexityRole swap preserves communication complexity. Let $p$ be a deterministic two-party communication protocol with Alice's inputs drawn from a…
- CommunicationComplexity.Deterministic.Protocol.swap_swapRole swap is an involution. Let $p$ be a deterministic two-party communication protocol with Alice's inputs drawn from a type $X$, Bob's…
- CommunicationComplexity.Deterministic.Protocol.comap_runPull-back commutes with protocol execution. Let $p$ be a deterministic two-party communication protocol with Alice's inputs drawn from $X$…
- CommunicationComplexity.Deterministic.Protocol.comap_complexityPull-back preserves communication complexity. Let $p$ be a deterministic two-party communication protocol with Alice's inputs drawn from…
- CommunicationComplexity.Deterministic.FiniteMessage.Protocol.comap_runExecution commutes with pullback. Let $p$ be a finite-message deterministic communication protocol over input types $X$, $Y$ with output…
- CommunicationComplexity.Deterministic.FiniteMessage.Protocol.comap_complexityPullback preserves communication complexity. Let $p$ be a finite-message deterministic communication protocol over input types $X$ and $Y$…
- CommunicationComplexity.PrivateCoin.Protocol.rrun_eqRandomized execution as deterministic run on paired inputs. Let $p$ be a private-coin protocol with randomness spaces $\Omega_X$ and…
- CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.rrun_eqExplicit-coin execution as paired-input execution. Let $p$ be a private-coin finite-message protocol over input types $X$, $Y$, with…
- CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.toProtocol_rrunExecution is preserved under conversion to a binary private-coin protocol. Let $p$ be a private-coin finite-message protocol with…
- CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.toProtocol_complexityComplexity is preserved by the binary conversion. Let $p$ be a private-coin finite-message protocol with private randomness spaces…
- CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.ofProtocol_rrunEmbedding preserves randomized execution of private-coin protocols. The embedding of a binary private-coin protocol into the…
- CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.ofProtocol_complexityEmbedding a binary private-coin protocol preserves complexity. Let $p$ be a binary private-coin protocol with randomness spaces $\Omega_X$…
- CommunicationComplexity.coinTapeMeasureThe uniform probability measure on
CoinTape n. Every outcome ofnindependent fair coin flips is equally likely. - CommunicationComplexity.coinTapeIsProbabilityMeasureCommunicationComplexity.coinTapeIsProbabilityMeasure
- CommunicationComplexity.coinTapeFiniteProbabilitySpaceCommunicationComplexity.coinTapeFiniteProbabilitySpace
- 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.PrivateCoin.Protocol.rrun$\texttt{rrun}\;p\;x\;y\;\omega_x\;\omega_y$ executes the private-coin protocol $p$ on inputs $x \in X$ and $y \in Y$ with Alice's private…
- CommunicationComplexity.Deterministic.FiniteMessage.Protocol.ofProtocolEmbeds a binary protocol into the generalized finite-message framework by treating each Boolean message as an element of…
- CommunicationComplexity.PrivateCoin.Protocol.ApproxComputesA private-coin protocol $p$ $\varepsilon$-computes a function $f : X \to Y \to \alpha$ if for every input pair $(x, y)$,…
- CommunicationComplexity.Deterministic.FiniteMessage.Protocol.runGiven a finite-message protocol $p$ and inputs $x : X$, $y : Y$,
runexecutes $p$ recursively: at analicenode it… - CommunicationComplexity.PrivateCoin.ProtocolA private-coin protocol with randomness spaces $\Omega_X$ and $\Omega_Y$, input spaces $X$ and $Y$, and output type $\alpha$ is…
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toProtocol_complexityConversion to a binary public-coin protocol preserves communication complexity. Let $\Omega$ be a shared-randomness space and let $p$ be a…
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.ofProtocol_complexityComplexity invariance of the finite-message embedding. Let $\Omega$ be a shared-randomness space, let $X$ and $Y$ be the private input…
- Used by 1
- CommunicationComplexity.PrivateCoin.communicationComplexity_le_of_finiteMessageFinite-probability protocols bound private-coin complexity. Let $X$, $Y$, and $\alpha$ be types, let $f : X \to Y \to \alpha$ be the…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory ProbabilityTheory in /-- The `ε`-error private-coin communication complexity of `f` is at most `n` if and only if there is a private-coin *finite-message* protocol, over coin tapes of some lengths `nX`, `nY`, that `ε`-computes `f` with complexity at most `n`. Both directions convert the protocol with `ofProtocol` / `toProtocol`, which preserve the run function and the complexity. **Proof sketch.** Rewrite the left side (`communicationComplexity_le_iff`) as the existence of a binary protocol that `ε`-computes `f` with complexity at most the bound. Forward: given a binary protocol, `ofProtocol` yields a finite-message protocol with the same run on every input and the same complexity, so the error bound and the complexity bound carry over. Backward: `toProtocol` turns a finite-message protocol into a binary one; unfolding the failure event on each input and rewriting with `toProtocol_run` shows the error is unchanged, and the complexity is preserved. -/ theorem CommunicationComplexity.PrivateCoin.communicationComplexity_le_iff_finiteMessage {X Y α} (f : X → Y → α) (ε : ℝ) (n : ℕ) : communicationComplexity f ε ≤ n ↔ ∃ (nX nY : ℕ) (p : FiniteMessage.Protocol (CoinTape nX) (CoinTape nY) X Y α), p.ApproxComputes f ε ∧ p.complexity ≤ n := by rw [communicationComplexity_le_iff] constructor · -- Binary → FiniteMessage via ofProtocol rintro ⟨nX, nY, p, hp, hc⟩ refine ⟨nX, nY, FiniteMessage.Protocol.ofProtocol p, ?_, Deterministic.FiniteMessage.Protocol.ofProtocol_complexity p ▸ hc⟩ intro x y simp only [FiniteMessage.Protocol.rrun, Deterministic.FiniteMessage.Protocol.ofProtocol_run] exact hp x y · -- FiniteMessage → Binary via toProtocol rintro ⟨nX, nY, p, hp, hc⟩ refine ⟨nX, nY, p.toProtocol, ?_, Deterministic.FiniteMessage.Protocol.toProtocol_complexity p ▸ hc⟩ intro x y change (volume {ω : CoinTape nX × CoinTape nY | Deterministic.Protocol.run (Deterministic.FiniteMessage.Protocol.toProtocol p) (ω.1, x) (ω.2, y) ≠ f x y}).toReal ≤ ε simp only [Deterministic.FiniteMessage.Protocol.toProtocol_run] exact hp x y