AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toProtocol_rrun

theoremverifiedimported Lean

Binary conversion preserves randomized execution. Let $p$ be a public-coin finite-message protocol with shared-randomness space $\Omega$, private input sets $X$ and $Y$, and output type $\alpha$, and let $q$ be the binary public-coin protocol obtained from $p$ by encoding each finite-alphabet message as a string of bits. Then for every pair of private inputs $x \in X$ and $y \in Y$ and every shared random string $\omega \in \Omega$, the two protocols produce the same output when executed on those inputs with that randomness: the randomized execution of $q$ on $x$, $y$, $\omega$ equals the randomized execution of $p$ on $x$, $y$, $\omega$.

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.toProtocol_rrun (p : Protocol Ω X Y α)
    (x : X) (y : Y) (ω : Ω) :
    (p.toProtocol).rrun x y ω = p.rrun x y ω
Source
TCSlib, `CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toProtocol_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
Classical.choiceQuot.soundpropext
Built on 19
Used by 18

Lean source view module on GitHub

set_option relaxedAutoImplicit false inset_option autoImplicit false inopen MeasureTheory invariable {Ω : Type*} {X Y α : Type*} in/-- The binary public-coin protocol obtained from a finite-message protocol `p` by `toProtocol` has the same output as `p` on every input `x`, `y` and every random string `ω`. -/@[simp]theorem CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toProtocol_rrun (p : Protocol Ω X Y α)    (x : X) (y : Y) (ω : Ω) :    (p.toProtocol).rrun x y ω = p.rrun x y ω := by  simp [PublicCoin.Protocol.rrun, rrun,    Deterministic.FiniteMessage.Protocol.toProtocol_run]
See it in the graphDiscuss this resultChallenge it