CommunicationComplexity.PublicCoin.newman
Newman's theorem for communication complexity. Let $X$ and $Y$ be finite types, let $f : X \to Y \to \alpha$, and let $\varepsilon, \varepsilon', c \in \bbr$ satisfy $1 < c$ and $c\varepsilon < \varepsilon'$. Then the private-coin communication complexity of $f$ at error tolerance $\varepsilon'$ does not exceed the public-coin communication complexity of $f$ at error tolerance $\varepsilon$ increased by $\lceil \log_2 t(X, Y, \varepsilon, c)\rceil$, where $t(X, Y, \varepsilon, c)$ is the derandomization sample count; that is, \[ \mathrm{CC}^{\mathrm{priv}}_{\varepsilon'}(f) \;\le\; \mathrm{CC}^{\mathrm{pub}}_{\varepsilon}(f) \;+\; \bigl\lceil \log_2 t(X, Y, \varepsilon, c) \bigr\rceil , \] with both complexities taken as values in $\bbn \cup \{\infty\}$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory ProbabilityTheory in theorem CommunicationComplexity.PublicCoin.newman {X Y α : Type*} [Fintype X] [Fintype Y] (f : X → Y → α) (ε ε' : ℝ) (c : ℝ) (hc : 1 < c) (hε' : c * ε < ε') : PrivateCoin.communicationComplexity f ε' ≤ PublicCoin.communicationComplexity f ε + Nat.clog 2 (FiniteMessage.Protocol.derandomizationSamples X Y ε c)
- Formalizes
- Newman's theorem for communication complexity, as formalized in TCSlib (`CommunicationComplexity.PublicCoin.newman`)
- 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.newman← CommunicationComplexity.PublicCoin.newman (TCSlib/CommunicationComplexity/NewmanTheorem/Newman.lean:236): verbatim
- Verified
- 16 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 63
- 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.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.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.PublicCoin.FiniteMessage.Protocol.newmanProtocol_ApproxComputesNewman's reduction preserves approximate correctness. Let $\Omega$ be a finite probability space, let $X$ and $Y$ be finite types, and let…
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.newmanProtocol_complexityCommunication cost of the Newman protocol. Let $X$ and $Y$ be finite types, let $\Omega$ be a finite probability space, and let $p$ be a…
- 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.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.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.PublicCoin.FiniteMessage.Protocol.derandomizationSamplesGiven finite types $X$ and $Y$ and real parameters $\varepsilon, c$, the number of random samples required for derandomization via…
- CommunicationComplexity.PrivateCoin.communicationComplexityThe $\varepsilon$-error private-coin randomized communication complexity of $f : X \to Y \to \alpha$ is the extended natural number…
- CommunicationComplexity.PublicCoin.communicationComplexityThe $\varepsilon$-error public-coin randomized communication complexity of $f : X \to Y \to \alpha$ is defined as…
- CommunicationComplexity.PublicCoin.communicationComplexity_le_iffBit bound as existence of an approximating protocol. Let $f : X \to Y \to \alpha$ be a function of Alice's input and Bob's input, let…
- 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.PublicCoin.FiniteMessage.Protocol.ofProtocolEmbeds a binary public-coin protocol into a finite-message protocol by delegating to…
- 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.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.PublicCoin.Protocol.toDeterministic_runFixing the shared randomness agrees with the randomised run. Let $p$ be a public-coin protocol over a randomness space $\Omega$, with…
- CommunicationComplexity.PublicCoin.Protocol.toDeterministic_complexityFixing shared randomness preserves communication complexity. Let $p$ be a public-coin communication protocol over a shared randomness…
- 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.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.PublicCoin.FiniteMessage.Protocol.ofProtocol_rrunEmbedding preserves randomized execution. Let $\Omega$ be a shared-randomness space, let $X$ and $Y$ be the private input sets of the two…
- 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…
- 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.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.PublicCoin.newmanIndexSpaceGiven finite input types $X$ and $Y$ and parameters $\varepsilon, c \in \mathbb{R}$, the Newman index space is…
- CommunicationComplexity.PublicCoin.ProtocolA public-coin protocol over shared randomness $\Omega$, with Alice's private input in $X$ and Bob's in $Y$ producing an output in…
- 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.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.PublicCoin.Protocol.ApproxComputesA public-coin protocol $p$ $\varepsilon$-computes a function $f : X \to Y \to \alpha$ if for every input pair $(x, y)$,…
- 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.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.communicationComplexity_le_iffThreshold characterization of deterministic communication complexity. Let $f : X \to Y \to \alpha$ be a two-argument function and let $n$…
- 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…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory ProbabilityTheory in /-- Newman's theorem: for every `c > 1` and every `ε' > c · ε`, the private-coin communication complexity of `f` at error `ε'` is at most the public-coin communication complexity of `f` at error `ε` plus `⌈log₂ (derandomizationSamples X Y ε c)⌉`, i.e. plus `O(log log(|X|·|Y|) + log(1/((c−1) ε)))` bits (the logarithm of `t = O(log(|X|·|Y|)/((c−1)² ε²))` seeds). [RY20, Thm 3.5] / [Rou16, Thm 4.9]; historically [New91]. Deviation: the bound is stated as `R^priv_{ε'}(f) ≤ R^pub_ε(f) + ⌈log₂ derandomizationSamples⌉` for any `ε' > c · ε` with `c > 1`, over arbitrary finite input types `X`, `Y`, in place of the textbook `c + log(n/ε²) + O(1)` at error `2ε`; the slack factor `c > 1` is the Chernoff/union-bound slack of the derandomization (`exists_good_randomness`; the textbook fixes `c = 2`, hence its error `2ε`), and the strict inequality `c · ε < ε'` is what the discretisation of private randomness (`PrivateCoin.communicationComplexity_le_of_finiteMessage`) needs. **Proof sketch.** Step 1: if the public-coin complexity is infinite there is nothing to prove; otherwise it equals some `n`, and there is a public-coin protocol `p` that ε-computes `f` with complexity at most `n`. Step 2: lift `p` to a finite-message public-coin protocol `pfm` with the same runs, hence still ε-computing `f`. Step 3: the Newman protocol `q` built from `pfm` is a private-coin finite-message protocol that `(c · ε)`-computes `f` (`newmanProtocol_ApproxComputes`); since `c · ε < ε'`, the private-coin complexity at error `ε'` is at most the complexity of `q`. Step 4: the complexity of `q` is `⌈log₂ t⌉` plus the complexity of `pfm`, which equals that of `p` and is at most `n`; assemble the chain of inequalities. -/ theorem CommunicationComplexity.PublicCoin.newman {X Y α : Type*} [Fintype X] [Fintype Y] (f : X → Y → α) (ε ε' : ℝ) (c : ℝ) (hc : 1 < c) (hε' : c * ε < ε') : PrivateCoin.communicationComplexity f ε' ≤ PublicCoin.communicationComplexity f ε + Nat.clog 2 (FiniteMessage.Protocol.derandomizationSamples X Y ε c) := by -- Step 1: match on the public-coin complexity match h : PublicCoin.communicationComplexity f ε with | ⊤ => simp | (n : ℕ) => -- There exists a public-coin protocol with complexity ≤ n obtain ⟨m, p, hp, hc_le⟩ := (PublicCoin.communicationComplexity_le_iff f ε n).mp (le_of_eq h) -- Step 2: lift to FiniteMessage let pfm := PublicCoin.FiniteMessage.Protocol.ofProtocol p have hpfm_approx : pfm.ApproxComputes f ε := by intro x y simp only [pfm, PublicCoin.FiniteMessage.Protocol.rrun, Deterministic.FiniteMessage.Protocol.ofProtocol_run] exact hp x y -- Step 3: apply newmanProtocol: get a private-coin FM protocol that (c*ε)-computes f let q := pfm.newmanProtocol f ε c hc hpfm_approx have hq_approx := FiniteMessage.Protocol.newmanProtocol_ApproxComputes pfm f ε c hc hpfm_approx -- q (c*ε)-computes f with c*ε < ε', so we can use -- communicationComplexity_le_of_finiteMessage have hbound := PrivateCoin.communicationComplexity_le_of_finiteMessage f ε' (c * ε) hε' q hq_approx -- Step 4: bound q.complexity and assemble the chain have hpfm_comp : pfm.complexity = p.complexity := Deterministic.FiniteMessage.Protocol.ofProtocol_complexity p have hq_comp : q.complexity = Nat.clog 2 (FiniteMessage.Protocol.derandomizationSamples X Y ε c) + pfm.complexity := FiniteMessage.Protocol.newmanProtocol_complexity pfm f ε c hc hpfm_approx set t_log := Nat.clog 2 (FiniteMessage.Protocol.derandomizationSamples X Y ε c) -- Goal is: CC ≤ ↑n + ↑t_log calc PrivateCoin.communicationComplexity f ε' ≤ (q.complexity : ENat) := hbound _ = ↑(t_log + pfm.complexity) := by exact_mod_cast hq_comp _ = ↑(t_log + p.complexity) := by rw [hpfm_comp] _ ≤ ↑(t_log + n) := by exact_mod_cast Nat.add_le_add_left hc_le _ _ = ↑n + ↑t_log := by push_cast; ring