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.CommunicationComplexity.Deterministic.Protocol.aux_finite← CommunicationComplexity.Deterministic.Protocol.aux_finite (TCSlib/CommunicationComplexity/DeterministicCC/DetRectangle.lean:418): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- CommunicationComplexity.Deterministic.Protocol.leafRectanglesAuxFor a protocol $p$ and sets $A \subseteq X$, $B \subseteq Y$, $\texttt{leafRectanglesAux}(p, A, B)$ is the collection of rectangles…
- 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.Protocol.leafRectangles_finiteFiniteness of a protocol's leaf rectangles. For any deterministic two-party communication protocol $p$ over input types $X$ (Alice) and…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
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 _ _)