CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.rrun_eq
theoremverifiedimported Lean
Randomized execution unfolds to deterministic execution. Let $p$ be a public-coin finite-message protocol over shared-randomness space $\Omega$, private input sets $X$ and $Y$, and output type $\alpha$, and let $x \in X$, $y \in Y$, and $\omega \in \Omega$. Then the randomized execution of $p$ on inputs $x$ and $y$ with shared randomness $\omega$ agrees with the deterministic execution of $p$ on Alice's effective input $(\omega, x)$ and Bob's effective input $(\omega, y)$: \[ \mathrm{rrun}(p, x, y, \omega) = \mathrm{run}(p, (\omega, x), (\omega, y)). \]
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory in variable {Ω : Type*} {X Y α : Type*} in @[simp] theorem CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.rrun_eq (p : Protocol Ω X Y α) (x : X) (y : Y) (ω : Ω) : p.rrun x y ω = p.run (ω, x) (ω, y)
- Source
- TCSlib, `CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.rrun_eq`
- 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.rrun_eq← CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.rrun_eq (TCSlib/CommunicationComplexity/NewmanTheorem/PublicCoinFiniteMessage.lean:107): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- CommunicationComplexity.Deterministic.FiniteMessage.Protocol.runGiven a finite-message protocol $p$ and inputs $x : X$, $y : Y$,
runexecutes $p$ recursively: at analicenode it… - 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.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.FiniteMessage.Protocol.runGiven a finite-message protocol $p$ and inputs $x : X$, $y : Y$,
- Used by 23
- 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.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.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.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.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.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.PublicCoin.Protocol.rrun_eqRandomized execution as deterministic execution on paired inputs. Let $p$ be a public-coin protocol with shared randomness in $\Omega$,…
- 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.PublicCoin.FiniteMessage.Protocol.toProtocolConverts a public-coin finite-message protocol to a binary public-coin protocol by delegating to…
- 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.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.toProtocol_rrunBinary conversion preserves randomized execution. Let $p$ be a public-coin finite-message protocol with shared-randomness space $\Omega$,…
- CommunicationComplexity.PublicCoin.Protocol.toDeterministicGiven a public-coin protocol $p$ over randomness space $\Omega$ and a fixed outcome $\omega : \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.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.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.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
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory in variable {Ω : Type*} {X Y α : Type*} in /-- Running a public-coin finite-message protocol on inputs `x`, `y` with randomness `ω` is the same as running the underlying deterministic finite-message protocol on `(ω, x)` and `(ω, y)`. Definitional unfolding lemma for `rrun`. -/ @[simp] theorem CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.rrun_eq (p : Protocol Ω X Y α) (x : X) (y : Y) (ω : Ω) : p.rrun x y ω = p.run (ω, x) (ω, y) := rfl