CommunicationComplexity.Deterministic.Protocol.mem_leafRectanglesFinset
theoremverifiedimported Lean
Membership in the finite set of leaf rectangles. Let $X \times Y$ carry the structure of a finite probability space, let $p$ be a deterministic two-party communication protocol on inputs $X$ (Alice) and $Y$ (Bob) with Boolean output, and let $R \subseteq X \times Y$. Then $R$ belongs to the finite set enumerating the leaf rectangles of $p$ if and only if $R$ is a leaf rectangle 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 lemma CommunicationComplexity.Deterministic.Protocol.mem_leafRectanglesFinset [μ : FiniteProbabilitySpace (X × Y)] (p : Protocol X Y Bool) (R : Set (X × Y)) : R ∈ leafRectanglesFinset p ↔ R ∈ p.leafRectangles
- Source
- TCSlib, `CommunicationComplexity.Deterministic.Protocol.mem_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.mem_leafRectanglesFinset← CommunicationComplexity.Deterministic.Protocol.mem_leafRectanglesFinset (TCSlib/CommunicationComplexity/NewmanTheorem/Discrepancy.lean:199): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- CommunicationComplexity.Deterministic.Protocol.leafRectanglesThe leaf rectangles of a protocol $p : \texttt{Protocol}\,X\,Y\,\alpha$ form the collection…
- 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.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 2
- 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
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option relaxedAutoImplicit false inset_option autoImplicit false inopen MeasureTheory inopen scoped BigOperators invariable {X Y : Type*} in/-- Membership in the finite enumeration of leaf rectangles is membership in the set of leaf rectangles. -/lemma CommunicationComplexity.Deterministic.Protocol.mem_leafRectanglesFinset [μ : FiniteProbabilitySpace (X × Y)] (p : Protocol X Y Bool) (R : Set (X × Y)) : R ∈ leafRectanglesFinset p ↔ R ∈ p.leafRectangles := by classical simpa [leafRectanglesFinset] using ((Set.toFinite p.leafRectangles).mem_toFinset (a := R))