CommunicationComplexity.PrivateCoin.communicationComplexity
defimported Lean
The $\varepsilon$-error private-coin randomized communication complexity of $f : X \to Y \to \alpha$ is the extended natural number \[ R_\varepsilon(f) \;=\; \inf_{\substack{n_X, n_Y \in \mathbb{N},\\ p : \mathrm{Protocol}(\{0,1\}^{n_X}, \{0,1\}^{n_Y}, X, Y, \alpha),\\ p.\mathrm{ApproxComputes}\,f\,\varepsilon}} p.\mathrm{complexity}, \] i.e.\ the minimum worst-case number of bits exchanged over all private-coin randomized protocols that compute $f$ with error at most $\varepsilon$ on every input.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory ProbabilityTheory in noncomputable def CommunicationComplexity.PrivateCoin.communicationComplexity {X Y α} (f : X → Y → α) (ε : ℝ) : ENat
- Defined in
- TCSlib, `CommunicationComplexity.PrivateCoin.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.CommunicationComplexity.PrivateCoin.communicationComplexity← CommunicationComplexity.PrivateCoin.communicationComplexity (TCSlib/CommunicationComplexity/NewmanTheorem/PrivateCoinComplexity.lean:73): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 22
- 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.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.ofProtocol_complexityEmbedding a binary private-coin protocol preserves complexity. Let $p$ be a binary private-coin protocol with randomness spaces $\Omega_X$…
- 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.Protocol.ApproxComputesA private-coin protocol $p$ $\varepsilon$-computes a function $f : X \to Y \to \alpha$ if for every input pair $(x, y)$,…
- CommunicationComplexity.coinTapeFiniteProbabilitySpaceCommunicationComplexity.coinTapeFiniteProbabilitySpace
- 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.ofProtocol_rrunEmbedding preserves randomized execution of private-coin protocols. The embedding of a binary private-coin protocol into the…
- 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.Deterministic.Protocol.comap_complexityPull-back preserves communication complexity. Let $p$ be a deterministic two-party communication protocol with Alice's inputs drawn from…
- 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.coinTapeMeasureThe uniform probability measure on
CoinTape n. Every outcome ofnindependent fair coin flips is equally likely. - 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.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.FiniteMessage.Protocol.comap_complexityPullback preserves communication complexity. Let $p$ be a finite-message deterministic communication protocol over input types $X$ and $Y$…
- CommunicationComplexity.coinTapeIsProbabilityMeasureCommunicationComplexity.coinTapeIsProbabilityMeasure
- 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.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.Protocol.swap_complexityRole swap preserves communication complexity. Let $p$ be a deterministic two-party communication protocol with Alice's inputs drawn from a…
- 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.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.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…
- Used by 4
- 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.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…
- CommunicationComplexity.PrivateCoin.communicationComplexity_le_iff_finiteMessageFinite-message characterization of private-coin complexity. Let $f : X \to Y \to \alpha$ be a function, let $\varepsilon \in \bbr$ be an…
- CommunicationComplexity.PublicCoin.newmanNewman's theorem for communication complexity. Let $X$ and $Y$ be finite types, let $f : X \to Y \to \alpha$, and let…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory ProbabilityTheory in /-- The `ε`-error private-coin randomized communication complexity `R^priv_ε(f)` of `f`, defined as the minimum worst-case number of bits exchanged over all private-coin randomized protocols that compute `f` with error at most `ε` on every input [RY20, Ch. 3, §Variants of Randomized Protocols]. Deviation: the minimum is an infimum in `ℕ∞` (equal to `⊤` if no protocol qualifies), and the two players' private randomness are coin tapes `CoinTape nX` and `CoinTape nY` of some finite lengths, quantified over all `nX`, `nY`. -/ noncomputable def CommunicationComplexity.PrivateCoin.communicationComplexity {X Y α} (f : X → Y → α) (ε : ℝ) : ENat := ⨅ (nX : ℕ) (nY : ℕ) (p : Protocol (CoinTape nX) (CoinTape nY) X Y α) (_ : p.ApproxComputes f ε), (p.complexity : ENat)