AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.PrivateCoin.Protocol

abbrevimported Lean

A private-coin protocol with randomness spaces $\Omega_X$ and $\Omega_Y$, input spaces $X$ and $Y$, and output type $\alpha$ is defined as a deterministic protocol $\texttt{Deterministic.Protocol}\;(\Omega_X \times X)\;(\Omega_Y \times Y)\;\alpha$. Alice's message function receives the pair $(\omega_x, x)$ and Bob's receives $(\omega_y, y)$, so each player's coin flip is invisible to the other.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory ProbabilityTheory in
abbrev CommunicationComplexity.PrivateCoin.Protocol (Ω_X Ω_Y : Type*) (X Y α : Type*)
Defined in
TCSlib, `CommunicationComplexity.PrivateCoin.Protocol`
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 1
Used by 12

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory ProbabilityTheory in
/-- A private-coin protocol with randomness `Ω_X` for Alice and `Ω_Y` for Bob, inputs `X`, `Y` and outputs `α`: a deterministic protocol where Alice's input is augmented with her private randomness and Bob's with his, so Alice's message functions see `(ω_x, x)` and Bob's see `(ω_y, y)`, and neither player sees the other's coins [RY20, Ch. 3, §Variants of Randomized Protocols: private coins]. -/
abbrev CommunicationComplexity.PrivateCoin.Protocol (Ω_X Ω_Y : Type*) (X Y α : Type*) :=
  Deterministic.Protocol (Ω_X × X) (Ω_Y × Y) α
See it in the graphDiscuss this resultChallenge it