CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toPrivateCoin_rrun
Ignoring private coins recovers the deterministic output. Let $p$ be a deterministic finite-message protocol over input types $X$ and $Y$ with output type $\alpha$, and fix arbitrary private-coin spaces $\Omega_X$ and $\Omega_Y$. Form from $p$ the private-coin protocol over $\Omega_X$, $\Omega_Y$ that runs $p$ on the underlying inputs while discarding both players' coins. Then for all inputs $x \in X$, $y \in Y$ and all coin draws $\omega_x \in \Omega_X$, $\omega_y \in \Omega_Y$, executing this private-coin protocol on $x$, $y$ with the coins $\omega_x$, $\omega_y$ returns exactly the value that the deterministic execution of $p$ on $x$, $y$ produces, regardless of the coins.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory ProbabilityTheory in @[simp] theorem CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toPrivateCoin_rrun {X Y α Ω_X Ω_Y : Type*} (p : Deterministic.FiniteMessage.Protocol X Y α) (x : X) (y : Y) (ω_x : Ω_X) (ω_y : Ω_Y) : PrivateCoin.FiniteMessage.Protocol.rrun (p.toPrivateCoin (Ω_X := Ω_X) (Ω_Y := Ω_Y)) x y ω_x ω_y = p.run x y
- Source
- TCSlib, `CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toPrivateCoin_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.Deterministic.FiniteMessage.Protocol.toPrivateCoin_rrun← CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toPrivateCoin_rrun (TCSlib/CommunicationComplexity/NewmanTheorem/Comparison.lean:86): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- CommunicationComplexity.Deterministic.FiniteMessage.ProtocolA generalized deterministic two-party communication protocol over input types $X$, $Y$ and output type $\alpha$. At each step a player…
- CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toPrivateCoinGiven a deterministic finite-message protocol $p$, the operation…
- 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.comap_runExecution commutes with pullback. Let $p$ be a finite-message deterministic communication protocol over input types $X$, $Y$ with output…
- 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…
- Used by 1
- 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…
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 ProbabilityTheory in/-- A deterministic finite-message protocol viewed as a private-coin protocol outputs, on `(x, y)` and any coins `ω_x`, `ω_y`, the same value as the deterministic protocol on `(x, y)`. -/@[simp]theorem CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toPrivateCoin_rrun {X Y α Ω_X Ω_Y : Type*} (p : Deterministic.FiniteMessage.Protocol X Y α) (x : X) (y : Y) (ω_x : Ω_X) (ω_y : Ω_Y) : PrivateCoin.FiniteMessage.Protocol.rrun (p.toPrivateCoin (Ω_X := Ω_X) (Ω_Y := Ω_Y)) x y ω_x ω_y = p.run x y := by simp [toPrivateCoin, PrivateCoin.FiniteMessage.Protocol.rrun, Deterministic.FiniteMessage.Protocol.comap_run]