CommunicationComplexity.Deterministic.Protocol.leafRectangles_isMonoPartition
theoremverifiedimported Lean
Leaf rectangles of a protocol form a monochromatic partition. Let $p$ be a deterministic two-party communication protocol over input types $X$ and $Y$ producing outputs in $\alpha$, and let $g : X \to Y \to \alpha$. If $p$ computes $g$, then the collection of leaf rectangles of $p$ is a monochromatic rectangle partition of $X \times Y$ for $g$: every leaf rectangle is a rectangle and is monochromatic for $g$, the leaf rectangles cover all of $X \times Y$, and any two distinct leaf rectangles are disjoint.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in variable {X Y α : Type*} in theorem CommunicationComplexity.Deterministic.Protocol.leafRectangles_isMonoPartition (p : Protocol X Y α) (g : X → Y → α) (h_comp : Computes p g) : Rectangle.IsMonoPartition (leafRectangles p) g
- Source
- TCSlib, `CommunicationComplexity.Deterministic.Protocol.leafRectangles_isMonoPartition`
- 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_isMonoPartition← CommunicationComplexity.Deterministic.Protocol.leafRectangles_isMonoPartition (TCSlib/CommunicationComplexity/DeterministicCC/DetRectangle.lean:445): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 10
- 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.Rectangle.IsMonoPartitionA collection $\mathcal{P}$ of subsets of $X \times Y$ is a monochromatic rectangle partition for $g : X \to Y \to \alpha$ if every…
- 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.Deterministic.Protocol.ComputesA protocol $p$ computes a two-argument function $f : X \to Y \to \alpha$ if $p.\texttt{run}\,x\,y = f\,x\,y$ for all inputs $x : X$…
- 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.Protocol.leafRectangles_monoLeaf rectangles of a protocol are monochromatic. Let $p$ be a deterministic two-party communication protocol over input types $X$ and $Y$…
- CommunicationComplexity.Rectangle.IsRectangleA subset $S \subseteq X \times Y$ is a rectangle if it factors as a product $A \times B$ for some $A \subseteq X$ and…
- CommunicationComplexity.Rectangle.IsMonochromaticA set $S \subseteq X \times Y$ is monochromatic for a function $g : X \to Y \to \alpha$ if $g$ is constant on $S$, i.e.,…
- Used by 3
- 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.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.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…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in variable {X Y α : Type*} in /-- If `p` computes `g`, then the leaf rectangles of `p` form a monochromatic rectangle partition of `X × Y` for `g`: every member is a rectangle, `g` is constant on every member, the members cover `X × Y`, and distinct members are disjoint [RY20, Lemma 1.6] (also [Rou16, Lemma 4.1, Lemma 4.2]). -/ theorem CommunicationComplexity.Deterministic.Protocol.leafRectangles_isMonoPartition (p : Protocol X Y α) (g : X → Y → α) (h_comp : Computes p g) : Rectangle.IsMonoPartition (leafRectangles p) g := ⟨fun R hR => leafRectangles_isRectangle p R hR, fun R hR => leafRectangles_mono p g h_comp R hR, leafRectangles_cover p, fun R S hR hS hne => leafRectangles_disjoint p R S hR hS hne⟩