AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.PublicCoin.Protocol.rrun

defimported Lean

Given a public-coin protocol $p$, private inputs $x \in X$, $y \in Y$, and a shared random string $\omega \in \Omega$, $\texttt{rrun}\,p\,x\,y\,\omega$ executes the underlying deterministic protocol on the paired inputs $(\omega, x)$ and $(\omega, y)$ and returns the resulting output.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory ProbabilityTheory in
variable {Ω : Type*} {X Y α : Type*} in
def CommunicationComplexity.PublicCoin.Protocol.rrun (p : Protocol Ω X Y α) (x : X) (y : Y) (ω : Ω) : α
Defined in
TCSlib, `CommunicationComplexity.PublicCoin.Protocol.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.
Verified
07 Oct 2026
Axioms
none listed
Built on 2
Used by 6

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
/-- The output of the public-coin protocol `p` on inputs `x`, `y` when the shared random string is `ω`: the deterministic run of `p` on `(ω, x)` and `(ω, y)` [RY20, Ch. 3, §Variants of Randomized Protocols: public coins]. -/
def CommunicationComplexity.PublicCoin.Protocol.rrun (p : Protocol Ω X Y α) (x : X) (y : Y) (ω : Ω) : α :=
  p.run (ω, x) (ω, y)
See it in the graphDiscuss this resultChallenge it