AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.toProtocol_rrun

theoremverifiedimported Lean

Execution is preserved under conversion to a binary private-coin protocol. Let $p$ be a private-coin finite-message protocol with private-randomness spaces $\Omega_X$ and $\Omega_Y$, input spaces $X$ and $Y$, and output type $\alpha$, in which each message is an element of an arbitrary finite nonempty type. Fix inputs $x \in X$ and $y \in Y$ together with private coins $\omega_x \in \Omega_X$ and $\omega_y \in \Omega_Y$. Then converting $p$ to a binary private-coin protocol leaves its randomized execution unchanged: running the converted protocol on $x, y$ with coins $\omega_x, \omega_y$ returns the same element of $\alpha$ as running $p$ itself on the same inputs and coins.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory in
variable {Ω_X Ω_Y : Type*} {X Y α : Type*} in
@[simp]
theorem CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.toProtocol_rrun (p : Protocol Ω_X Ω_Y X Y α)
    (x : X) (y : Y) (ω_x : Ω_X) (ω_y : Ω_Y) :
    (p.toProtocol).rrun x y ω_x ω_y = p.rrun x y ω_x ω_y
Source
TCSlib, `CommunicationComplexity.PrivateCoin.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 24

Lean source view module on GitHub

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