AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.alice

defimported Lean

Given a function $f : X \to \Omega_X \to \beta$ (Alice's message function depending on her public input and private randomness) and a continuation $P : \beta \to \mathsf{Protocol}$, constructs a protocol node at which Alice sends a $\beta$-valued message and execution branches on it.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory in
variable {Ω_X Ω_Y : Type*} {X Y α : Type*} in
def CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.alice {β : Type} [Fintype β] [Nonempty β]
    (f : X → Ω_X → β) (P : β → Protocol Ω_X Ω_Y X Y α) :
    Protocol Ω_X Ω_Y X Y α
Defined in
TCSlib, `CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.alice`
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 2
Used by 3

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory in
variable {Ω_X Ω_Y : Type*} {X Y α : Type*} in
/-- Alice sends a `β`-valued message depending on her input `x` and private randomness `ω_x`. -/
def CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.alice {β : Type} [Fintype β] [Nonempty β]
    (f : X → Ω_X → β) (P : β → Protocol Ω_X Ω_Y X Y α) :
    Protocol Ω_X Ω_Y X Y α :=
  Deterministic.FiniteMessage.Protocol.alice (fun ⟨ω, x⟩ => f x ω) P
See it in the graphDiscuss this resultChallenge it