AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.PublicCoin.Protocol.rrun_eq

theoremverifiedimported Lean

Randomized execution as deterministic execution on paired inputs. Let $p$ be a public-coin protocol with shared randomness in $\Omega$, Alice's private input in $X$, and Bob's in $Y$, producing an output in $\alpha$. Then for every $x \in X$, $y \in Y$, and $\omega \in \Omega$, the randomized execution of $p$ on $x$, $y$ with random string $\omega$ equals the execution of the underlying deterministic protocol on the paired inputs $(\omega, x)$ and $(\omega, y)$.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory ProbabilityTheory in
variable {Ω : Type*} {X Y α : Type*} in
@[simp]
theorem CommunicationComplexity.PublicCoin.Protocol.rrun_eq (p : Protocol Ω X Y α) (x : X) (y : Y) (ω : Ω) :
    p.rrun x y ω = p.run (ω, x) (ω, y)
Source
TCSlib, `CommunicationComplexity.PublicCoin.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
none — Lean reports it depends on no axioms
Built on 9
Used by 20

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory ProbabilityTheory in
variable {Ω : Type*} {X Y α : Type*} in
/-- Running a public-coin protocol on inputs `x`, `y` with randomness `ω` is the same as running the underlying deterministic protocol on `(ω, x)` and `(ω, y)`. Definitional unfolding lemma for `rrun`. -/
@[simp]
theorem CommunicationComplexity.PublicCoin.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