CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.toCoinTape
defimported Lean
Given a finite-message private-coin protocol $p$ over finite probability spaces $\Omega_X$ and $\Omega_Y$, and a tolerance $\delta > 0$, $\mathrm{toCoinTape}(p, \delta)$ produces $n_X$, $n_Y$, and a new finite-message protocol over $\mathrm{CoinTape}(n_X) \times \mathrm{CoinTape}(n_Y)$ obtained by precomposing $p$ with the inverse-CDF approximating maps $\varphi_X$ and $\varphi_Y$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory in open scoped ENNReal in noncomputable def CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.toCoinTape {Ω_X Ω_Y : Type*} [FiniteProbabilitySpace Ω_X] [FiniteProbabilitySpace Ω_Y] {X Y α : Type*} (p : FiniteMessage.Protocol Ω_X Ω_Y X Y α) (δ : ℝ) (hδ : 0 < δ) : Σ (nX : ℕ) (nY : ℕ), FiniteMessage.Protocol (CoinTape nX) (CoinTape nY) X Y α
- Defined in
- TCSlib, `CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.toCoinTape`
- 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← CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.toCoinTape (TCSlib/CommunicationComplexity/NewmanTheorem/PrivateCoinApproximation.lean:552): verbatim
- Verified
- 16 Oct 2026
- Axioms
- none listed
- Built on 23
- 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.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.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.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.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
- Used by 3
- 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.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.FiniteMessage.Protocol.toCoinTape_complexityCoin-tape conversion preserves communication complexity. Let $\Omega_X$ and $\Omega_Y$ be finite probability spaces, let $X$, $Y$ be input…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory in open scoped ENNReal in /-- The coin-tape approximation of a private-coin finite-message protocol `p` over arbitrary finite probability spaces: given `δ > 0`, the tape lengths `nX`, `nY` and the maps `φ_X`, `φ_Y` of `product_coin_approx` are chosen, and the protocol is `p` with Alice's and Bob's coins pulled back along `φ_X` and `φ_Y`. It has the same complexity as `p`, and its error on every input exceeds that of `p` by at most `δ` (`toCoinTape_approxSatisfies`). This is the discretisation step of Newman's theorem [New91]; the construction does not depend on any correctness predicate `Q`. -/ noncomputable def CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.toCoinTape {Ω_X Ω_Y : Type*} [FiniteProbabilitySpace Ω_X] [FiniteProbabilitySpace Ω_Y] {X Y α : Type*} (p : FiniteMessage.Protocol Ω_X Ω_Y X Y α) (δ : ℝ) (hδ : 0 < δ) : Σ (nX : ℕ) (nY : ℕ), FiniteMessage.Protocol (CoinTape nX) (CoinTape nY) X Y α := let data := Internal.product_coin_approx (Ω_X := Ω_X) (Ω_Y := Ω_Y) δ hδ let nX := data.choose let nY := data.choose_spec.choose let φ_X := data.choose_spec.choose_spec.choose let φ_Y := data.choose_spec.choose_spec.choose_spec.choose ⟨nX, nY, p.comap (Prod.map φ_X id) (Prod.map φ_Y id)⟩