AFTD Auto-Formalizing Theoretical Domains

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.
Verified
07 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3
Used by 23

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
See it in the graphDiscuss this resultChallenge it