AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.Deterministic.FiniteMessage.Protocol.comap_complexity

theoremverifiedimported Lean

Pullback preserves communication complexity. Let $p$ be a finite-message deterministic communication protocol over input types $X$ and $Y$ with output type $\alpha$, and let $f_X : X' \to X$ and $f_Y : Y' \to Y$ be maps of input types. Then the pullback protocol obtained by precomposing every message function of $p$ with $f_X$ or $f_Y$ (as appropriate) has the same communication complexity as $p$.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
variable {X Y α : Type*} in
@[simp]
theorem CommunicationComplexity.Deterministic.FiniteMessage.Protocol.comap_complexity {X' Y' : Type*} (p : Protocol X Y α) (fX : X' → X) (fY : Y' → Y) :
    (p.comap fX fY).complexity = p.complexity
Source
TCSlib, `CommunicationComplexity.Deterministic.FiniteMessage.Protocol.comap_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
Classical.choiceQuot.soundpropext
Built on 4
Used by 33

Lean source view module on GitHub

set_option relaxedAutoImplicit false inset_option autoImplicit false invariable {X Y α : Type*} in/-- Pulling a finite-message protocol back along input maps does not change its complexity. -/@[simp]theorem CommunicationComplexity.Deterministic.FiniteMessage.Protocol.comap_complexity {X' Y' : Type*} (p : Protocol X Y α) (fX : X' → X) (fY : Y' → Y) :    (p.comap fX fY).complexity = p.complexity := by  induction p <;> simp [comap, complexity, *]
See it in the graphDiscuss this resultChallenge it