CommunicationComplexity.Deterministic.FiniteMessage.Protocol.ofProtocol_run
theoremverifiedimported Lean
Embedding preserves protocol output. Let $X$ and $Y$ be the input types of Alice and Bob, let $\alpha$ be an output type, and let $p$ be a deterministic binary two-party communication protocol producing values in $\alpha$. Regard $p$ as a finite-message protocol by treating each of its Boolean messages as an element of the two-element type. Then for all inputs $x \in X$ and $y \in Y$, executing this embedded finite-message protocol on $x$ and $y$ yields the same value in $\alpha$ as executing $p$ directly on $x$ and $y$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in variable {X Y α : Type*} in theorem CommunicationComplexity.Deterministic.FiniteMessage.Protocol.ofProtocol_run (p : Deterministic.Protocol X Y α) (x : X) (y : Y) : (ofProtocol p).run x y = p.run x y
- Source
- TCSlib, `CommunicationComplexity.Deterministic.FiniteMessage.Protocol.ofProtocol_run`
- 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.Deterministic.FiniteMessage.Protocol.ofProtocol_run← CommunicationComplexity.Deterministic.FiniteMessage.Protocol.ofProtocol_run (TCSlib/CommunicationComplexity/DeterministicCC/FiniteMessage.lean:334): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- CommunicationComplexity.Deterministic.FiniteMessage.Protocol.runGiven a finite-message protocol $p$ and inputs $x : X$, $y : Y$,
runexecutes $p$ recursively: at analicenode it… - CommunicationComplexity.Deterministic.ProtocolA deterministic two-party communication protocol over input types $X$ (Alice) and $Y$ (Bob) producing a value of type $\alpha$ is an…
- CommunicationComplexity.Deterministic.Protocol.runGiven a protocol $p$,
runevaluates $p$ on inputs $x : X$ and $y : Y$ by recursively following the bit-branching structure until… - CommunicationComplexity.Deterministic.FiniteMessage.Protocol.ofProtocolEmbeds a binary protocol into the generalized finite-message framework by treating each Boolean message as an element of…
- CommunicationComplexity.Deterministic.FiniteMessage.Protocol.runGiven a finite-message protocol $p$ and inputs $x : X$, $y : Y$,
- Used by 5
- CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.ofProtocol_rrunEmbedding preserves randomized execution. Let $\Omega$ be a shared-randomness space, let $X$ and $Y$ be the private input sets of the two…
- CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.ofProtocol_rrunEmbedding preserves randomized execution of private-coin protocols. The embedding of a binary private-coin protocol into the…
- CommunicationComplexity.Deterministic.FiniteMessage.Protocol.toProtocol_existsBinary simulation of a finite-message protocol. Let $X$, $Y$, and $\alpha$ be types, and let $p$ be a finite-message two-party protocol…
- CommunicationComplexity.PrivateCoin.communicationComplexity_le_iff_finiteMessageFinite-message characterization of private-coin complexity. Let $f : X \to Y \to \alpha$ be a function, let $\varepsilon \in \bbr$ be an…
- CommunicationComplexity.PublicCoin.newmanNewman's theorem for communication complexity. Let $X$ and $Y$ be finite types, let $f : X \to Y \to \alpha$, and let…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option relaxedAutoImplicit false inset_option autoImplicit false invariable {X Y α : Type*} in/-- Viewing a binary protocol as a finite-message protocol does not change its outcome on any input. -/theorem CommunicationComplexity.Deterministic.FiniteMessage.Protocol.ofProtocol_run (p : Deterministic.Protocol X Y α) (x : X) (y : Y) : (ofProtocol p).run x y = p.run x y := by induction p <;> simp [ofProtocol, run, Deterministic.Protocol.run, *]