CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.toProtocol_rrun
Execution is preserved under conversion to a binary private-coin protocol. Let $p$ be a private-coin finite-message protocol with private-randomness spaces $\Omega_X$ and $\Omega_Y$, input spaces $X$ and $Y$, and output type $\alpha$, in which each message is an element of an arbitrary finite nonempty type. Fix inputs $x \in X$ and $y \in Y$ together with private coins $\omega_x \in \Omega_X$ and $\omega_y \in \Omega_Y$. Then converting $p$ to a binary private-coin protocol leaves its randomized execution unchanged: running the converted protocol on $x, y$ with coins $\omega_x, \omega_y$ returns the same element of $\alpha$ as running $p$ itself on the same inputs and coins.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory in variable {Ω_X Ω_Y : Type*} {X Y α : Type*} in @[simp] theorem CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.toProtocol_rrun (p : Protocol Ω_X Ω_Y X Y α) (x : X) (y : Y) (ω_x : Ω_X) (ω_y : Ω_Y) : (p.toProtocol).rrun x y ω_x ω_y = p.rrun x y ω_x ω_y
- Source
- TCSlib, `CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.toProtocol_rrun`
- 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.toProtocol_rrun← CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.toProtocol_rrun (TCSlib/CommunicationComplexity/NewmanTheorem/PrivateCoinFiniteMessage.lean:158): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 19
- 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.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.PrivateCoin.FiniteMessage.Protocol.toProtocolConverts a private-coin finite-message protocol into a binary-tree private-coin protocol by delegating to…
- 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.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.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.PrivateCoin.Protocol.rrun$\texttt{rrun}\;p\;x\;y\;\omega_x\;\omega_y$ executes the private-coin protocol $p$ on inputs $x \in X$ and $y \in Y$ with Alice's private…
- 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.FiniteMessage.Protocol.comap_complexityPullback preserves communication complexity. Let $p$ be a finite-message deterministic communication protocol over input types $X$ and $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.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.Protocol.swap_complexityRole swap preserves communication complexity. Let $p$ be a deterministic two-party communication protocol with Alice's inputs drawn from a…
- 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.PrivateCoin.ProtocolA private-coin protocol with randomness spaces $\Omega_X$ and $\Omega_Y$, input spaces $X$ and $Y$, and output type $\alpha$ is…
- 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.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.runGiven a protocol $p$,
runevaluates $p$ on inputs $x : X$ and $y : Y$ by recursively following the bit-branching structure until… - CommunicationComplexity.Deterministic.FiniteMessage.Protocol.runGiven a finite-message protocol $p$ and inputs $x : X$, $y : Y$,
runexecutes $p$ recursively: at analicenode it… - CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toProtocolA noncomputable function that converts a finite-message protocol $p$ into a binary protocol…
- Used by 24
- 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…
- 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.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.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.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.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.toDeterministic_complexityFixing shared randomness preserves communication complexity. Let $p$ be a public-coin communication protocol over a shared randomness…
- 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.PrivateCoin.FiniteMessage.Protocol.ofProtocol_rrunEmbedding preserves randomized execution of private-coin protocols. The embedding of a binary private-coin protocol into the…
- 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.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_approxSatisfiesCoin-tape conversion preserves approximate correctness. Let $p$ be a private-coin finite-message protocol over input types $X$, $Y$ and…
- CommunicationComplexity.PrivateCoin.communicationComplexityThe $\varepsilon$-error private-coin randomized communication complexity of $f : X \to Y \to \alpha$ is the extended natural number…
- 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.PrivateCoin.communicationComplexity_le_iff_finiteMessageFinite-message characterization of private-coin complexity. Let $f : X \to Y \to \alpha$ be a function, let $\varepsilon \in \bbr$ be an…
- CommunicationComplexity.PublicCoin.Protocol.toDeterministicGiven a public-coin protocol $p$ over randomness space $\Omega$ and a fixed outcome $\omega : \Omega$,…
- 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.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.FiniteMessage.Protocol.toDeterministic_runFixing randomness commutes with execution. Let $p$ be a public-coin finite-message protocol over a shared-randomness space $\Omega$,…
- CommunicationComplexity.PublicCoin.communicationComplexityThe $\varepsilon$-error public-coin randomized communication complexity of $f : X \to Y \to \alpha$ is defined as…
- 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.newmanNewman's theorem for communication complexity. Let $X$ and $Y$ be finite types, let $f : X \to Y \to \alpha$, and let…
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toCoinTapeGiven a public-coin finite-message protocol $p$ over an arbitrary finite probability space $\Omega$ and a slack $\delta > 0$, this…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option relaxedAutoImplicit false inset_option autoImplicit false inopen MeasureTheory invariable {Ω_X Ω_Y : Type*} {X Y α : Type*} in/-- The binary private-coin protocol obtained from a finite-message protocol `p` by `toProtocol` has the same output as `p` on every input `x`, `y` and every pair of random strings `ω_x`, `ω_y`. -/@[simp]theorem CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.toProtocol_rrun (p : Protocol Ω_X Ω_Y X Y α) (x : X) (y : Y) (ω_x : Ω_X) (ω_y : Ω_Y) : (p.toProtocol).rrun x y ω_x ω_y = p.rrun x y ω_x ω_y := by simp [PrivateCoin.Protocol.rrun, rrun, Deterministic.FiniteMessage.Protocol.toProtocol_run]