AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.ofProtocol_rrun

theoremverifiedimported Lean

Embedding preserves randomized execution. Let $\Omega$ be a shared-randomness space, let $X$ and $Y$ be the private input sets of the two players, and let $\alpha$ be an output type. Let $p$ be a binary public-coin protocol over these types, that is, a deterministic protocol whose players receive inputs in $\Omega \times X$ and $\Omega \times Y$. Embedding $p$ into the finite-message framework—by treating each Boolean message as a message drawn from the two-element type—and then running the result yields the same output as running $p$ directly: for every private input $x \in X$, every private input $y \in Y$, and every shared random string $\omega \in \Omega$, the finite-message embedding of $p$, executed on the paired inputs $(\omega, x)$ and $(\omega, y)$, returns the same value in $\alpha$ as $p$ executed on those same paired inputs.

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.ofProtocol_rrun
    (p : PublicCoin.Protocol Ω X Y α)
    (x : X) (y : Y) (ω : Ω) :
    (ofProtocol p).rrun x y ω = p.rrun x y ω
Source
TCSlib, `CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.ofProtocol_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 7

Lean source view module on GitHub

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