CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.toCoinTape_approxSatisfies
Coin-tape conversion preserves approximate correctness. Let $p$ be a private-coin finite-message protocol over input types $X$, $Y$ and output type $\alpha$, whose private randomness for Alice and Bob is drawn from finite probability spaces $\Omega_X$ and $\Omega_Y$. Let $Q : X \to Y \to \alpha \to \mathrm{Prop}$ be a predicate on input–output triples, and let $\varepsilon$ and $\delta$ be real numbers with $\delta > 0$. Suppose $p$ $\varepsilon$-satisfies $Q$; that is, for every input pair $(x, y)$ the probability, over Alice's and Bob's private coins $(\omega_x, \omega_y)$, that the output of $p$ fails to satisfy $Q\,x\,y$ is at most $\varepsilon$. Then the protocol obtained by converting $p$ at tolerance $\delta$ — replacing the private randomness by fair coin tapes of some lengths $n_X$ and $n_Y$ — $(\varepsilon + \delta)$-satisfies $Q$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory in open scoped ENNReal in theorem CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.toCoinTape_approxSatisfies {Ω_X Ω_Y : Type*} [FiniteProbabilitySpace Ω_X] [FiniteProbabilitySpace Ω_Y] {X Y α : Type*} (p : FiniteMessage.Protocol Ω_X Ω_Y X Y α) (Q : X → Y → α → Prop) (ε δ : ℝ) (hδ : 0 < δ) (hp : p.ApproxSatisfies Q ε) : (p.toCoinTape δ hδ).2.2.ApproxSatisfies Q (ε + δ)
- Source
- TCSlib, `CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.toCoinTape_approxSatisfies`
- 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.FiniteMessage.Protocol.toCoinTape_approxSatisfies← CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.toCoinTape_approxSatisfies (TCSlib/CommunicationComplexity/NewmanTheorem/PrivateCoinApproximation.lean:589): verbatim
- Verified
- 16 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 28
- CommunicationComplexity.Internal.product_coin_approxProduct-space coin approximation. Let $\Omega_X$ and $\Omega_Y$ be finite probability spaces, and let $\delta > 0$. Give each coin-tape…
- 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_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.comapGiven maps $f_X : X' \to X$ and $f_Y : Y' \to Y$, the pullback $p.\mathrm{comap}\,f_X\,f_Y$ is the finite-message protocol over $X'$, $Y'$…
- 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.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.FiniteProbabilitySpaceA typeclass bundling a
MeasureSpacestructure on $\Omega$ together with aCommunicationComplexity.FiniteMeasureSpace… - 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.ApproxSatisfiesA protocol $p$ $\varepsilon$-satisfies a predicate $Q : X \to Y \to \alpha \to \mathrm{Prop}$ if for every input pair $(x, y)$,…
- CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.rrun$\texttt{rrun}\,p\,x\,y\,\omega_x\,\omega_y$ executes the protocol $p$ on public inputs $x : X$, $y : Y$ with Alice's private coin…
- 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_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.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.Deterministic.FiniteMessage.Protocol.runGiven a finite-message protocol $p$ and inputs $x : X$, $y : Y$,
runexecutes $p$ recursively: at analicenode it…
- Used by 1
- 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…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory in open scoped ENNReal in /-- If a private-coin finite-message protocol `p` satisfies the predicate `Q` on every input except with probability at most `ε`, then its coin-tape approximation with slack `δ` satisfies `Q` on every input except with probability at most `ε + δ`. This is the discretisation step of Newman's theorem [New91]. **Proof sketch.** Fix an input `(x, y)` and unfold the construction to expose the maps `φ_X`, `φ_Y` and their approximation property. The set of coin tapes on which the approximating protocol violates `Q` is the preimage under `(φ_X, φ_Y)` of the set `S` of coins on which `p` violates `Q`. By `product_coin_approx` the probability of that preimage is at most `vol S + δ`, and `vol S ≤ ε` by hypothesis. -/ theorem CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.toCoinTape_approxSatisfies {Ω_X Ω_Y : Type*} [FiniteProbabilitySpace Ω_X] [FiniteProbabilitySpace Ω_Y] {X Y α : Type*} (p : FiniteMessage.Protocol Ω_X Ω_Y X Y α) (Q : X → Y → α → Prop) (ε δ : ℝ) (hδ : 0 < δ) (hp : p.ApproxSatisfies Q ε) : (p.toCoinTape δ hδ).2.2.ApproxSatisfies Q (ε + δ) := by intro x y simp only [FiniteMessage.Protocol.toCoinTape] -- Extract the approximation data set data := Internal.product_coin_approx (Ω_X := Ω_X) (Ω_Y := Ω_Y) δ hδ set φ_X := data.choose_spec.choose_spec.choose set φ_Y := data.choose_spec.choose_spec.choose_spec.choose have happrox := data.choose_spec.choose_spec.choose_spec.choose_spec -- The error set under the new protocol is the preimage under (φ_X, φ_Y) let S := {ω : Ω_X × Ω_Y | ¬Q x y (p.rrun x y ω.1 ω.2)} have hset : {ω : CoinTape data.choose × CoinTape data.choose_spec.choose | ¬Q x y (FiniteMessage.Protocol.rrun (p.comap (Prod.map φ_X id) (Prod.map φ_Y id)) x y ω.1 ω.2)} = Prod.map φ_X φ_Y ⁻¹' S := by ext ω; simp only [Set.mem_setOf_eq, Set.mem_preimage, Prod.map, S, FiniteMessage.Protocol.rrun, Deterministic.FiniteMessage.Protocol.comap_run, Function.id_def] rw [hset] calc volume.real (Prod.map φ_X φ_Y ⁻¹' S : Set (CoinTape data.choose × CoinTape data.choose_spec.choose)) ≤ volume.real S + δ := happrox S _ ≤ ε + δ := by have hpS : volume.real S ≤ ε := by simpa [S] using hp x y linarith