CommunicationComplexity.Deterministic.Protocol.leafRectangles_disjoint
theoremverifiedimported Lean
Distinct leaf rectangles are disjoint. Let $p$ be a deterministic two-party communication protocol over input types $X$ and $Y$ producing values in $\alpha$, and let $R$ and $S$ be two of its leaf rectangles, that is, two of the input rectangles induced by the leaves of $p$ over $X \times Y$. If $R \neq S$, then $R$ and $S$ are disjoint as subsets of $X \times Y$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in variable {X Y α : Type*} in lemma CommunicationComplexity.Deterministic.Protocol.leafRectangles_disjoint (p : Protocol X Y α) (R S : Set (X × Y)) (hR : R ∈ leafRectangles p) (hS : S ∈ leafRectangles p) (hne : R ≠ S) : Disjoint R S
- Source
- TCSlib, `CommunicationComplexity.Deterministic.Protocol.leafRectangles_disjoint`
- 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_disjoint← CommunicationComplexity.Deterministic.Protocol.leafRectangles_disjoint (TCSlib/CommunicationComplexity/DeterministicCC/DetRectangle.lean:341): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- CommunicationComplexity.Deterministic.Protocol.aux_disjointDistinct auxiliary leaf rectangles are disjoint. Let $p$ be a deterministic 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…
- Used by 1
- 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…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in variable {X Y α : Type*} in /-- Two distinct leaf rectangles of a protocol are disjoint [RY20, Lemma 1.6] (also [Rou16, Lemma 4.1, Lemma 4.2]). -/ lemma CommunicationComplexity.Deterministic.Protocol.leafRectangles_disjoint (p : Protocol X Y α) (R S : Set (X × Y)) (hR : R ∈ leafRectangles p) (hS : S ∈ leafRectangles p) (hne : R ≠ S) : Disjoint R S := aux_disjoint p Set.univ Set.univ R S hR hS hne