AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.Deterministic.Protocol.aux_finite

theoremverifiedimported Lean

Finiteness of the auxiliary leaf rectangles. Let $X$, $Y$, and $\alpha$ be types, let $p$ be a deterministic two-party communication protocol over inputs $X$ (Alice) and $Y$ (Bob) with outputs in $\alpha$, and let $A \subseteq X$ and $B \subseteq Y$. Then the collection of leaf rectangles induced by $p$ when its reachable inputs are constrained to $A \times B$ is finite.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
variable {X Y α : Type*} in
lemma CommunicationComplexity.Deterministic.Protocol.aux_finite (p : Protocol X Y α) (A : Set X) (B : Set Y) :
    (leafRectanglesAux p A B).Finite
Source
TCSlib, `CommunicationComplexity.Deterministic.Protocol.aux_finite`
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 2
Used by 1

Lean source view module on GitHub

set_option relaxedAutoImplicit false inset_option autoImplicit false invariable {X Y α : Type*} in/-- The set of leaf rectangles of `p` relative to `A ×ˢ B` is finite. -/lemma CommunicationComplexity.Deterministic.Protocol.aux_finite (p : Protocol X Y α) (A : Set X) (B : Set Y) :    (leafRectanglesAux p A B).Finite := by  induction p generalizing A B with  | output _ =>    simp [leafRectanglesAux]  | alice f P ih =>    simp only [leafRectanglesAux]    exact (ih false _ _).union (ih true _ _)  | bob f P ih =>    simp only [leafRectanglesAux]    exact (ih false _ _).union (ih true _ _)
See it in the graphDiscuss this resultChallenge it