AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toPrivateCoin

abbrevimported Lean

Given a deterministic finite-message protocol $p$, the operation CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toPrivateCoin converts it into a private-coin finite-message protocol over arbitrary coin spaces $\Omega_X$ and $\Omega_Y$ by ignoring both coin inputs (via comap with $\mathrm{Prod.snd}$).

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory ProbabilityTheory in
abbrev CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toPrivateCoin
    {X Y α Ω_X Ω_Y : Type*}
    (p : Deterministic.FiniteMessage.Protocol X Y α) :
    PrivateCoin.FiniteMessage.Protocol Ω_X Ω_Y X Y α
Defined in
TCSlib, `CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toPrivateCoin`
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 3
Used by 5

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory ProbabilityTheory in
/-- Convert a deterministic finite-message protocol to a private-coin finite-message protocol by ignoring both coin spaces (via comap). -/
abbrev CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toPrivateCoin
    {X Y α Ω_X Ω_Y : Type*}
    (p : Deterministic.FiniteMessage.Protocol X Y α) :
    PrivateCoin.FiniteMessage.Protocol Ω_X Ω_Y X Y α :=
  p.comap Prod.snd Prod.snd
See it in the graphDiscuss this resultChallenge it