CommunicationComplexity.Deterministic.Protocol.leafRectanglesFinset
defimported Lean
Given a finite probability space $\mu$ on $X \times Y$ and a deterministic protocol $p$,
this is the canonical Finset enumerating the (finitely many) leaf rectangles of
$p$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory in open scoped BigOperators in variable {X Y : Type*} in noncomputable def CommunicationComplexity.Deterministic.Protocol.leafRectanglesFinset [μ : FiniteProbabilitySpace (X × Y)] (p : Protocol X Y Bool) : Finset (Set (X × Y))
- Defined in
- TCSlib, `CommunicationComplexity.Deterministic.Protocol.leafRectanglesFinset`
- 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.leafRectanglesFinset← CommunicationComplexity.Deterministic.Protocol.leafRectanglesFinset (TCSlib/CommunicationComplexity/NewmanTheorem/Discrepancy.lean:192): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 3
- 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.FiniteProbabilitySpaceA typeclass bundling a
MeasureSpacestructure on $\Omega$ together with aCommunicationComplexity.FiniteMeasureSpace…
- Used by 4
- CommunicationComplexity.Deterministic.Protocol.signedBias_eq_sum_rectanglesSigned bias as a sum over leaf rectangles. Let $\mu$ be a finite probability space on $X \times Y$, let $p$ be a deterministic Boolean…
- 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.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…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory in open scoped BigOperators in variable {X Y : Type*} in /-- A finite enumeration of the leaf rectangles of a protocol. -/ noncomputable def CommunicationComplexity.Deterministic.Protocol.leafRectanglesFinset [μ : FiniteProbabilitySpace (X × Y)] (p : Protocol X Y Bool) : Finset (Set (X × Y)) := (Set.toFinite p.leafRectangles).toFinset