CommunicationComplexity.Deterministic.Protocol.leafRectangles
defimported Lean
The leaf rectangles of a protocol $p : \texttt{Protocol}\,X\,Y\,\alpha$ form the collection $\texttt{leafRectangles}(p) = \texttt{leafRectanglesAux}(p, X, Y)$, i.e.\ the set of input rectangles induced by the leaves of $p$ over the full input space $X \times Y$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in variable {X Y α : Type*} in def CommunicationComplexity.Deterministic.Protocol.leafRectangles (p : Protocol X Y α) : Set (Set (X × Y))
- Defined in
- TCSlib, `CommunicationComplexity.Deterministic.Protocol.leafRectangles`
- 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← CommunicationComplexity.Deterministic.Protocol.leafRectangles (TCSlib/CommunicationComplexity/DeterministicCC/DetRectangle.lean:124): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- 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 14
- 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.leafRectangles_coverLeaf rectangles cover the input space. Let $p$ be a deterministic communication protocol over input types $X$ (Alice) and $Y$ (Bob)…
- CommunicationComplexity.Deterministic.Protocol.leafRectangles_disjointDistinct leaf rectangles are disjoint. Let $p$ be a deterministic two-party communication protocol over input types $X$ and $Y$ producing…
- CommunicationComplexity.Deterministic.Protocol.mem_leafRectanglesFinsetMembership in the finite set of leaf rectangles. Let $X \times Y$ carry the structure of a finite probability space, let $p$ be a…
- CommunicationComplexity.Deterministic.Protocol.rectangleSign_eq_boolSignRectangle sign equals Boolean sign on leaf rectangles. Let $p$ be a deterministic two-party communication protocol with Boolean output,…
- CommunicationComplexity.Deterministic.Protocol.sum_indicator_leafRectangles_eqIndicator sum over leaf rectangles recovers the protocol output. Let $X$ and $Y$ be input types whose product $X \times Y$ carries a…
- 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…
- CommunicationComplexity.Deterministic.Protocol.leafRectanglesFinsetGiven a finite probability space $\mu$ on $X \times Y$ and a deterministic protocol $p$, this is the canonical
Finsetenumerating… - 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…
- CommunicationComplexity.Deterministic.Protocol.leafRectangles_isRectangleLeaf rectangles are combinatorial rectangles. Let $p$ be a deterministic two-party communication protocol with Alice's inputs drawn from…
- CommunicationComplexity.Deterministic.mono_partition_of_communicationComplexity_leLow deterministic complexity yields a small monochromatic partition. Let $g : X \times Y \to \alpha$ be a two-argument function, and let…
- 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…
- CommunicationComplexity.Deterministic.Protocol.leafRectangles_cardLeaf rectangle count is at most two to the complexity. Let $p$ be a deterministic two-party communication protocol over input types $X$…
- CommunicationComplexity.Deterministic.Protocol.leafRectangles_monoLeaf rectangles of a protocol are monochromatic. Let $p$ be a deterministic two-party communication protocol over input types $X$ and $Y$…
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: for each leaf `v`, the set `R_v` of inputs `(x, y)` on which the protocol reaches `v` [RY20, Lemma 1.6] (the rectangles `R_v` of the leaves). Deviation: this is a set of subsets of `X × Y` rather than a family indexed by the leaves, so leaves with identical input sets (for instance two unreachable leaves, both with empty input set) contribute a single element. -/ def CommunicationComplexity.Deterministic.Protocol.leafRectangles (p : Protocol X Y α) : Set (Set (X × Y)) := leafRectanglesAux p Set.univ Set.univ