AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toPrivateCoin_rrun

theoremverifiedimported Lean

Ignoring private coins recovers the deterministic output. Let $p$ be a deterministic finite-message protocol over input types $X$ and $Y$ with output type $\alpha$, and fix arbitrary private-coin spaces $\Omega_X$ and $\Omega_Y$. Form from $p$ the private-coin protocol over $\Omega_X$, $\Omega_Y$ that runs $p$ on the underlying inputs while discarding both players' coins. Then for all inputs $x \in X$, $y \in Y$ and all coin draws $\omega_x \in \Omega_X$, $\omega_y \in \Omega_Y$, executing this private-coin protocol on $x$, $y$ with the coins $\omega_x$, $\omega_y$ returns exactly the value that the deterministic execution of $p$ on $x$, $y$ produces, regardless of the coins.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory ProbabilityTheory in
@[simp]
theorem CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toPrivateCoin_rrun
    {X Y α Ω_X Ω_Y : Type*}
    (p : Deterministic.FiniteMessage.Protocol X Y α)
    (x : X) (y : Y) (ω_x : Ω_X) (ω_y : Ω_Y) :
    PrivateCoin.FiniteMessage.Protocol.rrun
      (p.toPrivateCoin (Ω_X := Ω_X) (Ω_Y := Ω_Y)) x y ω_x ω_y =
      p.run x y
Source
TCSlib, `CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toPrivateCoin_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 5
Used by 1

Lean source view module on GitHub

set_option relaxedAutoImplicit false inset_option autoImplicit false inopen MeasureTheory ProbabilityTheory in/-- A deterministic finite-message protocol viewed as a private-coin protocol outputs, on `(x, y)` and any coins `ω_x`, `ω_y`, the same value as the deterministic protocol on `(x, y)`. -/@[simp]theorem CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toPrivateCoin_rrun    {X Y α Ω_X Ω_Y : Type*}    (p : Deterministic.FiniteMessage.Protocol X Y α)    (x : X) (y : Y) (ω_x : Ω_X) (ω_y : Ω_Y) :    PrivateCoin.FiniteMessage.Protocol.rrun      (p.toPrivateCoin (Ω_X := Ω_X) (Ω_Y := Ω_Y)) x y ω_x ω_y =      p.run x y := by  simp [toPrivateCoin, PrivateCoin.FiniteMessage.Protocol.rrun,    Deterministic.FiniteMessage.Protocol.comap_run]
See it in the graphDiscuss this resultChallenge it