AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.PublicCoin.Protocol

abbrevimported Lean

A public-coin protocol over shared randomness $\Omega$, with Alice's private input in $X$ and Bob's in $Y$ producing an output in $\alpha$, is a deterministic protocol whose combined input types are $\Omega \times X$ (for Alice) and $\Omega \times Y$ (for Bob). In other words, both players observe the same random string $\omega \in \Omega$ alongside their private inputs.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory ProbabilityTheory in
abbrev CommunicationComplexity.PublicCoin.Protocol (Ω : Type*) (X Y α : Type*)
Defined in
TCSlib, `CommunicationComplexity.PublicCoin.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 16

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory ProbabilityTheory in
/-- A public-coin protocol with randomness `Ω`, inputs `X`, `Y` and outputs `α`: a deterministic protocol where both Alice and Bob see the shared random string `ω : Ω` in addition to their own inputs, so Alice's input is `(ω, x)` and Bob's is `(ω, y)` [RY20, Ch. 3, §Variants of Randomized Protocols: public coins]. -/
abbrev CommunicationComplexity.PublicCoin.Protocol (Ω : Type*) (X Y α : Type*) :=
  Deterministic.Protocol (Ω × X) (Ω × Y) α
See it in the graphDiscuss this resultChallenge it