AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.Deterministic.Protocol.leafRectangles_cover

theoremverifiedimported Lean

Leaf rectangles cover the input space. Let $p$ be a deterministic communication protocol over input types $X$ (Alice) and $Y$ (Bob) producing a value of some type $\alpha$. Then the leaf rectangles of $p$ cover the entire input space: the union of all rectangles in the collection of leaf rectangles of $p$ equals $X \times Y$.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
variable {X Y α : Type*} in
lemma CommunicationComplexity.Deterministic.Protocol.leafRectangles_cover (p : Protocol X Y α) :
    ⋃₀ leafRectangles p = Set.univ
Source
TCSlib, `CommunicationComplexity.Deterministic.Protocol.leafRectangles_cover`
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.
What was changed in CommunicationComplexity.Deterministic.Protocol.leafRectangles_cover
--- TCSlib/CommunicationComplexity/DeterministicCC/DetRectangle.lean:335 (CommunicationComplexity.Deterministic.Protocol.leafRectangles_cover)
+++ as compiled here
@@ -1,5 +1,6 @@
-/-- The leaf rectangles of a protocol cover the whole input space `X × Y`
-[RY20, Lemma 1.6] (also [Rou16, Lemma 4.1, Lemma 4.2]). -/
-lemma leafRectangles_cover (p : Protocol X Y α) :
+set_option relaxedAutoImplicit false in
+set_option autoImplicit false in
+variable {X Y α : Type*} in
+lemma CommunicationComplexity.Deterministic.Protocol.leafRectangles_cover (p : Protocol X Y α) :
     ⋃₀ leafRectangles p = Set.univ :=
-  Set.eq_univ_of_univ_subset (by simpa using aux_cover p Set.univ Set.univ)
+  Set.eq_univ_of_univ_subset (by simpa [leafRectangles] using aux_cover p Set.univ Set.univ)
Verified
07 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3
Used by 1

Lean source view module on GitHub

set_option relaxedAutoImplicit false inset_option autoImplicit false invariable {X Y α : Type*} in/-- The leaf rectangles of a protocol cover the whole input space `X × Y` [RY20, Lemma 1.6] (also [Rou16, Lemma 4.1, Lemma 4.2]). -/lemma CommunicationComplexity.Deterministic.Protocol.leafRectangles_cover (p : Protocol X Y α) :    ⋃₀ leafRectangles p = Set.univ :=  Set.eq_univ_of_univ_subset (by simpa [leafRectangles] using aux_cover p Set.univ Set.univ)
See it in the graphDiscuss this resultChallenge it