AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.PublicCoin.Protocol.toDeterministic_complexity

theoremverifiedimported Lean

Fixing shared randomness preserves communication complexity. Let $p$ be a public-coin communication protocol over a shared randomness space $\Omega$, with Alice's private input in $X$, Bob's in $Y$, and output in $\alpha$, and let $\omega \in \Omega$ be any outcome of the shared randomness. Then the communication complexity of the deterministic protocol obtained from $p$ by fixing the shared randomness to $\omega$ equals the communication complexity of $p$ itself.

Statement

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

Lean source view module on GitHub

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