CommunicationComplexity.Rectangle.monoPartition_values_eq
theoremverifiedimported Lean
Constant values within a part. Let $\mathcal{P}$ be a monochromatic rectangle partition for a function $g : X \to Y \to \alpha$, and let $R \in \mathcal{P}$. Then $g$ is constant on $R$: for any $(x,y), (x',y') \in R$ we have $g\,x\,y = g\,x'\,y'$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in variable {X Y α : Type*} in variable {Part : Set (Set (X × Y))} {g : X → Y → α} in theorem CommunicationComplexity.Rectangle.monoPartition_values_eq (h : IsMonoPartition Part g) {R : Set (X × Y)} (hR : R ∈ Part) {x x' : X} {y y' : Y} (hxy : (x, y) ∈ R) (hx'y' : (x', y') ∈ R) : g x y = g x' y'
- Source
- TCSlib, `CommunicationComplexity.Rectangle.monoPartition_values_eq`
- 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.Rectangle.monoPartition_values_eq← CommunicationComplexity.Rectangle.monoPartition_values_eq (TCSlib/CommunicationComplexity/DeterministicCC/Rectangle.lean:138): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- 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…
- Used by 3
- CommunicationComplexity.Functions.Equality.le_communicationComplexityDeterministic complexity lower bound for equality. For every natural number $n \ge 1$, the deterministic communication complexity of the…
- CommunicationComplexity.Deterministic.Rank.boolFunctionRank_le_ncardRank bounded by monochromatic partition size. Let $X$ be a finite set, $Y$ a finite set, and $f : X \to Y \to \mathrm{Bool}$ a Boolean…
- CommunicationComplexity.Functions.Disjointness.le_communicationComplexityLower bound on the communication complexity of disjointness. Fix an integer $n \ge 1$, and consider the set-disjointness function on…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in variable {X Y α : Type*} in variable {Part : Set (Set (X × Y))} {g : X → Y → α} in /-- In a monochromatic rectangle partition, any two points in the same part have equal function values. -/ theorem CommunicationComplexity.Rectangle.monoPartition_values_eq (h : IsMonoPartition Part g) {R : Set (X × Y)} (hR : R ∈ Part) {x x' : X} {y y' : Y} (hxy : (x, y) ∈ R) (hx'y' : (x', y') ∈ R) : g x y = g x' y' := h.2.1 R hR x x' y y' hxy hx'y'