CommunicationComplexity.PrivateCoin.communicationComplexity_le_of_finiteMessage
Finite-probability protocols bound private-coin complexity. Let $X$, $Y$, and $\alpha$ be types, let $f : X \to Y \to \alpha$ be the function to be computed, and let $\Omega_X$ and $\Omega_Y$ be finite probability spaces serving as the two players' private randomness. Fix real numbers $\varepsilon'$ and $\varepsilon$ with $\varepsilon' < \varepsilon$, and let $p$ be a finite-message private-coin protocol with randomness spaces $\Omega_X$ and $\Omega_Y$, input types $X$ and $Y$, and output type $\alpha$, and suppose that $p$ computes $f$ with error at most $\varepsilon'$, i.e.\ for every input pair $(x,y)$ the probability that $p$ returns a value other than $f(x,y)$ is at most $\varepsilon'$. Then the $\varepsilon$-error private-coin randomized communication complexity of $f$ satisfies $R_\varepsilon(f) \le \mathrm{complexity}(p)$, where the right-hand side is the worst-case number of bits exchanged by $p$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory ProbabilityTheory in theorem CommunicationComplexity.PrivateCoin.communicationComplexity_le_of_finiteMessage {X Y α} {Ω_X Ω_Y : Type*} [FiniteProbabilitySpace Ω_X] [FiniteProbabilitySpace Ω_Y] (f : X → Y → α) (ε ε' : ℝ) (hε : ε' < ε) (p : FiniteMessage.Protocol Ω_X Ω_Y X Y α) (hp : p.ApproxComputes f ε') : PrivateCoin.communicationComplexity f ε ≤ p.complexity
- Source
- TCSlib, `CommunicationComplexity.PrivateCoin.communicationComplexity_le_of_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_of_finiteMessage← CommunicationComplexity.PrivateCoin.communicationComplexity_le_of_finiteMessage (TCSlib/CommunicationComplexity/NewmanTheorem/PrivateCoinComplexity.lean:166): verbatim
- Verified
- 16 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 32
- CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.toCoinTapeGiven a finite-message private-coin protocol $p$ over finite probability spaces $\Omega_X$ and $\Omega_Y$, and a tolerance $\delta > 0$,…
- CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.toCoinTape_approxSatisfiesCoin-tape conversion preserves approximate correctness. Let $p$ be a private-coin finite-message protocol over input types $X$, $Y$ and…
- 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.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.FiniteMessage.Protocol.complexityThe worst-case communication cost of a finite-message protocol, measured in bits. An
outputnode costs $0$; analiceor… - CommunicationComplexity.FiniteProbabilitySpaceA typeclass bundling a
MeasureSpacestructure on $\Omega$ together with aCommunicationComplexity.FiniteMeasureSpace… - CommunicationComplexity.PrivateCoin.communicationComplexityThe $\varepsilon$-error private-coin randomized communication complexity of $f : X \to Y \to \alpha$ is the extended natural number…
- 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.ApproxComputes_eq_ApproxSatisfiesApproximate computation as approximate satisfaction of equality. Let $p$ be a private-coin finite-message protocol over input types $X$,…
- 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.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.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.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.instProdCommunicationComplexity.instProd
- CommunicationComplexity.instPiCommunicationComplexity.instPi
- CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.ApproxSatisfiesA protocol $p$ $\varepsilon$-satisfies a predicate $Q : X \to Y \to \alpha \to \mathrm{Prop}$ if for every input pair $(x, 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…
- Used by 1
- 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 /-- If a private-coin finite-message protocol over arbitrary finite probability spaces `ε'`-computes `f` with `ε' < ε`, then the private-coin communication complexity at error `ε` is at most the protocol's complexity. The strict inequality pays for replacing the two given probability spaces by coin tapes via `toCoinTape`, which approximates the distributions to within the slack `ε - ε'` at no cost in communication. -/ theorem CommunicationComplexity.PrivateCoin.communicationComplexity_le_of_finiteMessage {X Y α} {Ω_X Ω_Y : Type*} [FiniteProbabilitySpace Ω_X] [FiniteProbabilitySpace Ω_Y] (f : X → Y → α) (ε ε' : ℝ) (hε : ε' < ε) (p : FiniteMessage.Protocol Ω_X Ω_Y X Y α) (hp : p.ApproxComputes f ε') : PrivateCoin.communicationComplexity f ε ≤ p.complexity := by rw [communicationComplexity_le_iff_finiteMessage] -- Convert ApproxComputes to ApproxSatisfies rw [FiniteMessage.Protocol.ApproxComputes_eq_ApproxSatisfies] at hp -- Use toCoinTape to get a CoinTape-based protocol have hδ : 0 < ε - ε' := sub_pos.mpr hε let tc := p.toCoinTape (ε - ε') hδ refine ⟨tc.1, tc.2.1, tc.2.2, ?_, le_of_eq ?_⟩ · -- ApproxComputes at error ε rw [FiniteMessage.Protocol.ApproxComputes_eq_ApproxSatisfies] -- toCoinTape_approxSatisfies gives error ε' + (ε - ε') = ε have h := p.toCoinTape_approxSatisfies _ ε' (ε - ε') hδ hp convert h using 1; ring · exact p.toCoinTape_complexity (ε - ε') hδ