CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.newmanProtocol
defimported Lean
Given a public-coin finite-message protocol $p$ over a probability space $\Omega$ that $\varepsilon$-computes $f : X \to Y \to \alpha$, and a constant $c > 1$, the Newman protocol is a private-coin finite-message protocol in which Alice draws a random index $i$ from $\mathtt{newmanIndexSpace}\;X\;Y\;\varepsilon\;c$ and sends it to Bob; both players then run the $i$-th seed from a fixed table of good randomness values (obtained via a Chernoff and union-bound argument) through the original public-coin protocol deterministically.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory ProbabilityTheory in noncomputable def CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.newmanProtocol {Ω X Y α : Type*} [FiniteProbabilitySpace Ω] [Fintype X] [Fintype Y] (p : FiniteMessage.Protocol Ω X Y α) (f : X → Y → α) (ε c : ℝ) (hc : 1 < c) (hp : p.ApproxComputes f ε) : PrivateCoin.FiniteMessage.Protocol (newmanIndexSpace X Y ε c) Unit X Y α
- Defined in
- TCSlib, `CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.newmanProtocol`
- 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← CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.newmanProtocol (TCSlib/CommunicationComplexity/NewmanTheorem/Newman.lean:114): verbatim
- Verified
- 16 Oct 2026
- Axioms
- none listed
- Built on 42
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.exists_good_randomnessExistence of good randomness for derandomization. Let $\Omega$ be a finite probability space and let $X$ and $Y$ be finite input sets. Let…
- 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.Unit.measureSpaceUnit with the Dirac probability measure.
- 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.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.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.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.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.PublicCoin.FiniteMessage.Protocol.derandomizationSamplesGiven finite types $X$ and $Y$ and real parameters $\varepsilon, c$, the number of random samples required for derandomization via…
- 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…
- Used by 3
- 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.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 Newman private-coin protocol built from a public-coin protocol `p` that ε-computes `f`: Alice samples a random index `i` from `newmanIndexSpace` (her private randomness; Bob has none) and sends it to Bob, and both then run the deterministic protocol obtained from `p` by fixing its public randomness to the `i`-th seed of a fixed table of good seeds (the table is the witness of `exists_good_randomness`, obtained by a Chernoff + union bound). [RY20, Thm 3.5 proof] (Alice sends the index of one of the `t` good strings). -/ noncomputable def CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.newmanProtocol {Ω X Y α : Type*} [FiniteProbabilitySpace Ω] [Fintype X] [Fintype Y] (p : FiniteMessage.Protocol Ω X Y α) (f : X → Y → α) (ε c : ℝ) (hc : 1 < c) (hp : p.ApproxComputes f ε) : PrivateCoin.FiniteMessage.Protocol (newmanIndexSpace X Y ε c) Unit X Y α := -- Choose good randomness values via Chernoff + union bound let ωs := (FiniteMessage.Protocol.exists_good_randomness p f ε c hc hp).choose -- Alice sends her random index i ∈ newmanIndexSpace to Bob, -- then both simulate with ωs(i) PrivateCoin.FiniteMessage.Protocol.alice (fun _ ω_x => ω_x) (fun i => (p.toDeterministic (ωs i)).toPrivateCoin)