AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.toCoinTape_complexity

theoremverifiedimported Lean

Coin-tape conversion preserves communication complexity. Let $\Omega_X$ and $\Omega_Y$ be finite probability spaces, let $X$, $Y$ be input types and $\alpha$ an output type, and let $p$ be a private-coin finite-message protocol over $\Omega_X$, $\Omega_Y$ (that is, a deterministic finite-message protocol on the input types $\Omega_X \times X$ and $\Omega_Y \times Y$). For every real tolerance $\delta > 0$, the coin-tape protocol produced from $p$ and $\delta$ — the finite-message protocol over $\mathrm{CoinTape}(n_X) \times X$ and $\mathrm{CoinTape}(n_Y) \times Y$ obtained by precomposing $p$ with the inverse-CDF approximating maps — has communication complexity exactly equal to that of $p$.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory in
open scoped ENNReal in
@[simp]
theorem CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.toCoinTape_complexity
    {Ω_X Ω_Y : Type*}
    [FiniteProbabilitySpace Ω_X] [FiniteProbabilitySpace Ω_Y]
    {X Y α : Type*}
    (p : FiniteMessage.Protocol Ω_X Ω_Y X Y α)
    (δ : ℝ) (hδ : 0 < δ) :
    (p.toCoinTape δ hδ).2.2.complexity = p.complexity
Source
TCSlib, `CommunicationComplexity.PrivateCoin.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 23
Used by 12

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open MeasureTheory in
open scoped ENNReal in
/-- The coin-tape approximation of a protocol has the same complexity as the original protocol (pulling back the coins does not change the message trees). -/
@[simp]
theorem CommunicationComplexity.PrivateCoin.FiniteMessage.Protocol.toCoinTape_complexity
    {Ω_X Ω_Y : Type*}
    [FiniteProbabilitySpace Ω_X] [FiniteProbabilitySpace Ω_Y]
    {X Y α : Type*}
    (p : FiniteMessage.Protocol Ω_X Ω_Y X Y α)
    (δ : ℝ) (hδ : 0 < δ) :
    (p.toCoinTape δ hδ).2.2.complexity = p.complexity := by
  simp [FiniteMessage.Protocol.toCoinTape]
See it in the graphDiscuss this resultChallenge it