AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toCoinTape_complexity

theoremverifiedimported Lean

Coin-tape conversion preserves complexity. Let $\Omega$ be a finite probability space, and let $p$ be a public-coin finite-message protocol over shared randomness $\Omega$ with input sets $X$, $Y$ and output type $\alpha$. For every real number $\delta > 0$, the coin-tape conversion of $p$ at slack $\delta$ yields a length $n$ and a finite-message protocol over $\mathrm{CoinTape}(n)$ whose communication complexity equals the communication complexity of $p$.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory in
@[simp]
theorem CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toCoinTape_complexity
    {Ω : Type*} [FiniteProbabilitySpace Ω]
    {X Y α : Type*}
    (p : FiniteMessage.Protocol Ω X Y α)
    (δ : ℝ) (hδ : 0 < δ) :
    (p.toCoinTape δ hδ).2.complexity = p.complexity
Source
TCSlib, `CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toCoinTape_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 28
Used by 4

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory in
/-- The coin-tape approximation of a public-coin finite-message protocol `p` has exactly the complexity of `p`: pulling back along the map on randomness changes no message. -/
@[simp]
theorem CommunicationComplexity.PublicCoin.FiniteMessage.Protocol.toCoinTape_complexity
    {Ω : Type*} [FiniteProbabilitySpace Ω]
    {X Y α : Type*}
    (p : FiniteMessage.Protocol Ω X Y α)
    (δ : ℝ) (hδ : 0 < δ) :
    (p.toCoinTape δ hδ).2.complexity = p.complexity := by
  simp [FiniteMessage.Protocol.toCoinTape]
See it in the graphDiscuss this resultChallenge it