AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.Deterministic.Protocol.leafRectangles_finite

theoremverifiedimported Lean

Finiteness of a protocol's leaf rectangles. For any deterministic two-party communication protocol $p$ over input types $X$ (Alice) and $Y$ (Bob) producing values in $\alpha$, the collection of leaf rectangles of $p$ — the input rectangles in $X \times Y$ induced by the leaves of $p$ over the full input space — is finite.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
variable {X Y α : Type*} in
lemma CommunicationComplexity.Deterministic.Protocol.leafRectangles_finite (p : Protocol X Y α) :
    (leafRectangles p).Finite
Source
TCSlib, `CommunicationComplexity.Deterministic.Protocol.leafRectangles_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 3
Used by 1

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
variable {X Y α : Type*} in
/-- The set of leaf rectangles of a protocol is finite. -/
lemma CommunicationComplexity.Deterministic.Protocol.leafRectangles_finite (p : Protocol X Y α) :
    (leafRectangles p).Finite :=
  aux_finite p Set.univ Set.univ
See it in the graphDiscuss this resultChallenge it