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.CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.alice← CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.alice (TCSlib/CommunicationComplexity/NewmanTheorem/PrivateCoinFiniteMessage.lean:89): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 2
- CommunicationComplexity.Deterministic.FiniteMessage.ProtocolA generalized deterministic two-party communication protocol over input types $X$, $Y$ and output type $\alpha$. At each step a player…
- CommunicationComplexity.PrivateCoin.FiniteMessage.ProtocolA private-coin finite-message protocol over input types $X$, $Y$ with private randomness types $\Omega_X$, $\Omega_Y$ and output type…
- Used by 3
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.newmanProtocolGiven a public-coin finite-message protocol $p$ over a probability space $\Omega$ that $\varepsilon$-computes $f : X \to Y \to \alpha$,…
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.newmanProtocol_ApproxComputesNewman's reduction preserves approximate correctness. Let $\Omega$ be a finite probability space, let $X$ and $Y$ be finite types, and let…
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.newmanProtocol_complexityCommunication cost of the Newman protocol. Let $X$ and $Y$ be finite types, let $\Omega$ be a finite probability space, and let $p$ be a…
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