CommunicationComplexity.Deterministic.Protocol.leafRectangles_isRectangle
theoremverifiedimported Lean
Leaf rectangles are combinatorial rectangles. Let $p$ be a deterministic two-party communication protocol with Alice's inputs drawn from $X$ and Bob's from $Y$, and let $R$ belong to the collection of leaf rectangles of $p$ over the full input space $X \times Y$. Then $R$ is a rectangle: there exist subsets $A \subseteq X$ and $B \subseteq Y$ with $R = A \times B$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in variable {X Y α : Type*} in lemma CommunicationComplexity.Deterministic.Protocol.leafRectangles_isRectangle (p : Protocol X Y α) (R : Set (X × Y)) (hR : R ∈ leafRectangles p) : Rectangle.IsRectangle R
- Source
- TCSlib, `CommunicationComplexity.Deterministic.Protocol.leafRectangles_isRectangle`
- 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_isRectangle← CommunicationComplexity.Deterministic.Protocol.leafRectangles_isRectangle (TCSlib/CommunicationComplexity/DeterministicCC/DetRectangle.lean:226): verbatim
- Verified
- 07 Oct 2026
- Axioms
propext- Built on 4
- CommunicationComplexity.Deterministic.Protocol.aux_isRectangleAuxiliary leaf sets are rectangles. Let $p$ be a deterministic two-party communication protocol over input types $X$ (Alice) and $Y$…
- 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…
- CommunicationComplexity.Rectangle.IsRectangleA subset $S \subseteq X \times Y$ is a rectangle if it factors as a product $A \times B$ for some $A \subseteq X$ and…
- Used by 2
- CommunicationComplexity.Deterministic.Protocol.leafRectangles_isMonoPartitionLeaf rectangles of a protocol form a monochromatic partition. Let $p$ be a deterministic two-party communication protocol over input types…
- CommunicationComplexity.Deterministic.Protocol.one_sub_two_distributionalError_le_two_pow_mulDiscrepancy lower bound on distributional error. Let $\mu$ be a finite probability measure on $X \times Y$, let…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in variable {X Y α : Type*} in /-- Every leaf rectangle of a protocol is a combinatorial rectangle `A ×ˢ B` [RY20, Lemma 1.6] (also [Rou16, Lemma 4.1, Lemma 4.2]). -/ lemma CommunicationComplexity.Deterministic.Protocol.leafRectangles_isRectangle (p : Protocol X Y α) (R : Set (X × Y)) (hR : R ∈ leafRectangles p) : Rectangle.IsRectangle R := aux_isRectangle p Set.univ Set.univ R hR