CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.newmanProtocol_complexity
Communication cost of the Newman protocol. Let $X$ and $Y$ be finite types, let $\Omega$ be a finite probability space, and let $p$ be a public-coin finite-message protocol over $\Omega$ with private inputs in $X$ and $Y$ and outputs in a type $\alpha$. Fix a target function $f : X \to Y \to \alpha$, real parameters $\varepsilon$ and $c$ with $c > 1$, and suppose that $p$ $\varepsilon$-computes $f$. Then the communication complexity of the associated Newman protocol equals \[ \left\lceil \log_2 t(X, Y, \varepsilon, c) \right\rceil + \mathrm{complexity}(p), \] where $t(X, Y, \varepsilon, c)$ is the derandomization sample count and $\mathrm{complexity}(p)$ is the communication complexity of $p$; that is, running the Newman protocol costs exactly the cost of $p$ together with the number of bits Alice needs to name one seed in the table of size $t(X, Y, \varepsilon, c)$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory ProbabilityTheory in theorem CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.newmanProtocol_complexity {Ω X Y α : Type*} [FiniteProbabilitySpace Ω] [Fintype X] [Fintype Y] (p : FiniteMessage.Protocol Ω X Y α) (f : X → Y → α) (ε c : ℝ) (hc : 1 < c) (hp : p.ApproxComputes f ε) : (p.newmanProtocol f ε c hc hp).complexity = Nat.clog 2 (FiniteMessage.Protocol.derandomizationSamples X Y ε c) + p.complexity
- Source
- TCSlib, `CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.newmanProtocol_complexity`
- 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.PublicCoin.FiniteMessage.Protocol.newmanProtocol_complexity← CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.newmanProtocol_complexity (TCSlib/CommunicationComplexity/NewmanTheorem/Newman.lean:193): verbatim
- Verified
- 16 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 44
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.newmanProtocolGiven a public-coin finite-message protocol $p$ over a probability space $\Omega$ that $\varepsilon$-computes $f : X \to Y \to \alpha$,…
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toCoinTape_complexityCoin-tape conversion preserves complexity. Let $\Omega$ be a finite probability space, and let $p$ be a public-coin finite-message…
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toDeterministic_complexityFixing shared randomness preserves communication complexity. Let $p$ be a public-coin finite-message protocol over a shared-randomness…
- CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toPrivateCoin_complexityComplexity is preserved by passage to the private-coin model. Let $p$ be a deterministic finite-message protocol over input types $X$, $Y$…
- CommunicationComplexity.Unit.finiteProbabilitySpaceCommunicationComplexity.Unit.finiteProbabilitySpace
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toDeterministic_runFixing randomness commutes with execution. Let $p$ be a public-coin finite-message protocol over a shared-randomness space $\Omega$,…
- 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.PublicCoin.newmanIndexSpace.finiteProbabilitySpaceCommunicationComplexity.PublicCoin.newmanIndexSpace.finiteProbabilitySpace
- CommunicationComplexity.Deterministic.FiniteMessage.Protocol.complexityThe worst-case communication cost of a finite-message protocol, measured in bits. An
outputnode costs $0$; analiceor… - CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.derandomizationSamplesGiven finite types $X$ and $Y$ and real parameters $\varepsilon, c$, the number of random samples required for derandomization via…
- CommunicationComplexity.FiniteProbabilitySpaceA typeclass bundling a
MeasureSpacestructure on $\Omega$ together with aCommunicationComplexity.FiniteMeasureSpace… - CommunicationComplexity.PublicCoin.newmanIndexSpaceGiven finite input types $X$ and $Y$ and parameters $\varepsilon, c \in \mathbb{R}$, the Newman index space is…
- CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.aliceGiven a function $f : X \to \Omega_X \to \beta$ (Alice's message function depending on her public input and private randomness) and a…
- CommunicationComplexity.PublicCoin.FiniteMessage.ProtocolA public-coin finite-message protocol over shared-randomness space $\Omega$, private input sets $X$ and $Y$, and output type $\alpha$ is a…
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.ApproxComputesA protocol $p$ $\varepsilon$-computes a function $f : X \to Y \to \alpha$ if for every input pair $(x, y)$,…
- 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.PublicCoin.Protocol.rrun_eqRandomized execution as deterministic execution on paired inputs. Let $p$ be a public-coin protocol with shared randomness in $\Omega$,…
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.rrun_eqRandomized execution unfolds to deterministic execution. Let $p$ be a public-coin finite-message protocol over shared-randomness space…
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toProtocol_rrunBinary conversion preserves randomized execution. Let $p$ be a public-coin finite-message protocol with shared-randomness space $\Omega$,…
- 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.coinTapeFiniteProbabilitySpaceCommunicationComplexity.coinTapeFiniteProbabilitySpace
- CommunicationComplexity.instProdCommunicationComplexity.instProd
- CommunicationComplexity.instPiCommunicationComplexity.instPi
- CommunicationComplexity.PublicCoin.newmanIndexSpace.fintypeCommunicationComplexity.PublicCoin.newmanIndexSpace.fintype
- CommunicationComplexity.PublicCoin.newmanIndexSpace.nonemptyCommunicationComplexity.PublicCoin.newmanIndexSpace.nonempty
- CommunicationComplexity.PublicCoin.newmanIndexSpace.measureSpaceCommunicationComplexity.PublicCoin.newmanIndexSpace.measureSpace
- CommunicationComplexity.PublicCoin.newmanIndexSpace.isProbabilityMeasureCommunicationComplexity.PublicCoin.newmanIndexSpace.isProbabilityMeasure
- CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toPrivateCoinGiven a deterministic finite-message protocol $p$, the operation…
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toDeterministicGiven a public-coin finite-message protocol $p$ and a fixed randomness sample $\omega : \Omega$,…
- CommunicationComplexity.Deterministic.FiniteMessage.ProtocolA generalized deterministic two-party communication protocol over input types $X$, $Y$ and output type $\alpha$. At each step a player…
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.rrun$\mathrm{rrun}(p, x, y, \omega)$ executes the protocol $p$ on private inputs $x$ and $y$ with shared randomness $\omega$, defined as…
- CommunicationComplexity.PublicCoin.Protocol.toDeterministic_complexityFixing shared randomness preserves communication complexity. Let $p$ be a public-coin communication protocol over a shared randomness…
- 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 /-- The communication complexity of the Newman protocol is `⌈log₂ (derandomizationSamples X Y ε c)⌉ + complexity of p`: Alice's index costs `⌈log₂ t⌉` bits, after which the simulated deterministic protocol costs exactly what `p` costs. [RY20, Thm 3.5 proof]. The proof unfolds the protocol and evaluates the supremum over indices of a constant function. -/ theorem CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.newmanProtocol_complexity {Ω X Y α : Type*} [FiniteProbabilitySpace Ω] [Fintype X] [Fintype Y] (p : FiniteMessage.Protocol Ω X Y α) (f : X → Y → α) (ε c : ℝ) (hc : 1 < c) (hp : p.ApproxComputes f ε) : (p.newmanProtocol f ε c hc hp).complexity = Nat.clog 2 (FiniteMessage.Protocol.derandomizationSamples X Y ε c) + p.complexity := by unfold newmanProtocol PrivateCoin.FiniteMessage.Protocol.alice simp only [Deterministic.FiniteMessage.Protocol.complexity, Deterministic.FiniteMessage.Protocol.toPrivateCoin_complexity, PublicCoin.FiniteMessage.Protocol.toDeterministic_complexity] -- sup of constant function = constant (since newmanIndexSpace is nonempty) rw [Finset.sup_const (α := ℕ) (Finset.univ_nonempty (α := newmanIndexSpace X Y ε c)), show Fintype.card (newmanIndexSpace X Y ε c) = FiniteMessage.Protocol.derandomizationSamples X Y ε c from Fintype.card_fin _]