AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.PublicCoin.FiniteMessage.Protocol

abbrevimported Lean

A public-coin finite-message protocol over shared-randomness space $\Omega$, private input sets $X$ and $Y$, and output type $\alpha$ is a deterministic finite-message protocol in which Alice's effective input is $\Omega \times X$ and Bob's effective input is $\Omega \times Y$.

Statement

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

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory in
/-- A public-coin finite-message protocol with randomness `Ω`, inputs `X`, `Y` and outputs `α`: a deterministic finite-message protocol where Alice's input is `Ω × X` and Bob's is `Ω × Y`, so both players see the shared random string [RY20, Ch. 3, §Variants of Randomized Protocols]. Deviation: each message is an element of an arbitrary finite type rather than a single bit, charged `⌈log₂ |β|⌉` bits. -/
abbrev CommunicationComplexity.PublicCoin.FiniteMessage.Protocol (Ω : Type*) (X Y α : Type*) :=
  Deterministic.FiniteMessage.Protocol (Ω × X) (Ω × Y) α
See it in the graphDiscuss this resultChallenge it