AFTD Auto-Formalizing Theoretical Domains

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

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