CommunicationComplexity.Deterministic.Protocol.leafRectangles_mono
theoremverifiedimported Lean
Leaf rectangles of a protocol are monochromatic. Let $p$ be a deterministic two-party communication protocol over input types $X$ and $Y$ with output type $\alpha$, and let $g : X \to Y \to \alpha$ be a function that $p$ computes, meaning that running $p$ on any pair of inputs $(x, y)$ returns $g\,x\,y$. Then every leaf rectangle $R$ of $p$ is monochromatic for $g$: the value $g\,x\,y$ is the same for all $(x, y) \in R$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in variable {X Y α : Type*} in lemma CommunicationComplexity.Deterministic.Protocol.leafRectangles_mono (p : Protocol X Y α) (g : X → Y → α) (h_comp : Computes p g) (R : Set (X × Y)) (hR : R ∈ leafRectangles p) : Rectangle.IsMonochromatic R g
- Source
- TCSlib, `CommunicationComplexity.Deterministic.Protocol.leafRectangles_mono`
- 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_mono← CommunicationComplexity.Deterministic.Protocol.leafRectangles_mono (TCSlib/CommunicationComplexity/DeterministicCC/DetRectangle.lean:372): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- CommunicationComplexity.Deterministic.Protocol.aux_monoLeaf rectangles are output-monochromatic. Let $p$ be a deterministic communication protocol over input types $X$ (Alice) and $Y$ (Bob)…
- 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.,…
- 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$…
- Used by 2
- CommunicationComplexity.Deterministic.Protocol.leafRectangles_isMonoPartitionLeaf rectangles of a protocol form a monochromatic partition. Let $p$ be a deterministic two-party communication protocol over input types…
- CommunicationComplexity.Deterministic.Protocol.rectangleSign_eq_boolSignRectangle sign equals Boolean sign on leaf rectangles. Let $p$ be a deterministic two-party communication protocol with Boolean output,…
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 invariable {X Y α : Type*} in/-- If `p` computes `g`, then every leaf rectangle of `p` is monochromatic for `g`, i.e. `g` takes a single value on it [RY20, Lemma 1.6]: two inputs in the same leaf rectangle reach the same leaf, hence produce the same output. -/lemma CommunicationComplexity.Deterministic.Protocol.leafRectangles_mono (p : Protocol X Y α) (g : X → Y → α) (h_comp : Computes p g) (R : Set (X × Y)) (hR : R ∈ leafRectangles p) : Rectangle.IsMonochromatic R g := by intro x x' y y' hxy hxy' have := aux_mono p Set.univ Set.univ R hR x x' y y' hxy hxy' simp only [Computes, funext_iff] at h_comp rw [← h_comp x y, ← h_comp x' y']; exact this