AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.PublicCoin.Protocol.toDeterministic

abbrevimported Lean

Given a public-coin protocol $p$ over randomness space $\Omega$ and a fixed outcome $\omega : \Omega$, PublicCoin.Protocol.toDeterministic~$p~\omega$ is the deterministic protocol obtained by substituting $\omega$ for the shared randomness (implemented via comap with $\mathrm{Prod.mk}\,\omega$).

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory ProbabilityTheory in
abbrev CommunicationComplexity.PublicCoin.Protocol.toDeterministic
    {Ω X Y α : Type*}
    (p : PublicCoin.Protocol Ω X Y α) (ω : Ω) :
    Deterministic.Protocol X Y α
Defined in
TCSlib, `CommunicationComplexity.PublicCoin.Protocol.toDeterministic`
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 22
Used by 2

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory ProbabilityTheory in
/-- Fix the randomness of a binary public-coin protocol, producing a deterministic protocol with the same complexity (via comap). -/
abbrev CommunicationComplexity.PublicCoin.Protocol.toDeterministic
    {Ω X Y α : Type*}
    (p : PublicCoin.Protocol Ω X Y α) (ω : Ω) :
    Deterministic.Protocol X Y α :=
  p.comap (Prod.mk ω) (Prod.mk ω)
See it in the graphDiscuss this resultChallenge it