AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toDeterministic_complexity

theoremverifiedimported Lean

Fixing shared randomness preserves communication complexity. Let $p$ be a public-coin finite-message protocol over a shared-randomness space $\Omega$, private input sets $X$ and $Y$, and output type $\alpha$, and let $\omega \in \Omega$ be any fixed randomness sample. Then the deterministic finite-message protocol obtained by substituting $\omega$ for the shared randomness has the same communication complexity as $p$ itself.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory ProbabilityTheory in
@[simp]
theorem CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toDeterministic_complexity
    {Ω X Y α : Type*}
    (p : PublicCoin.FiniteMessage.Protocol Ω X Y α) (ω : Ω) :
    (p.toDeterministic ω).complexity = p.complexity
Source
TCSlib, `CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toDeterministic_complexity`
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
16 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 23
Used by 4

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory ProbabilityTheory in
/-- Fixing the randomness of a public-coin finite-message protocol does not change its complexity. -/
@[simp]
theorem CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toDeterministic_complexity
    {Ω X Y α : Type*}
    (p : PublicCoin.FiniteMessage.Protocol Ω X Y α) (ω : Ω) :
    (p.toDeterministic ω).complexity = p.complexity := by
  simp [toDeterministic]
See it in the graphDiscuss this resultChallenge it