AFTD Auto-Formalizing Theoretical Domains

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.
Verified
07 Oct 2026
Axioms
none listed
Built on 2
Used by 14

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
See it in the graphDiscuss this resultChallenge it