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.CommunicationComplexity.Deterministic.Protocol.leafRectangles_finite← CommunicationComplexity.Deterministic.Protocol.leafRectangles_finite (TCSlib/CommunicationComplexity/DeterministicCC/DetRectangle.lean:437): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- CommunicationComplexity.Deterministic.Protocol.aux_finiteFiniteness of the auxiliary leaf rectangles. Let $X$, $Y$, and $\alpha$ be types, let $p$ be a deterministic two-party communication…
- CommunicationComplexity.Deterministic.Protocol.leafRectanglesThe leaf rectangles of a protocol $p : \texttt{Protocol}\,X\,Y\,\alpha$ form the collection…
- CommunicationComplexity.Deterministic.ProtocolA deterministic two-party communication protocol over input types $X$ (Alice) and $Y$ (Bob) producing a value of type $\alpha$ is an…
- Used by 1
- CommunicationComplexity.Deterministic.foolingSet_ncard_le_pow_of_communicationComplexity_leFooling set bound from communication complexity. Let $g : X \times Y \to \alpha$ be a two-argument function, and let…
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