CommunicationComplexity.Rectangle.monoPartition_cross_mem
theoremverifiedimported Lean
Cross closure 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}$. If $(x,y)$ and $(x',y')$ both belong to $R$, then the two "crossed" pairs $(x',y)$ and $(x,y')$ also belong to $R$.
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_cross_mem (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) : (x', y) ∈ R ∧ (x, y') ∈ R
- Source
- TCSlib, `CommunicationComplexity.Rectangle.monoPartition_cross_mem`
- 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_cross_mem← CommunicationComplexity.Rectangle.monoPartition_cross_mem (TCSlib/CommunicationComplexity/DeterministicCC/Rectangle.lean:129): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- 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.Rectangle.IsRectangle_iffCross characterization of combinatorial rectangles. A subset $R \subseteq X \times Y$ is a rectangle — that is, $R = A \times B$ for some…
- Used by 1
- CommunicationComplexity.Functions.Equality.le_communicationComplexityDeterministic complexity lower bound for equality. For every natural number $n \ge 1$, the deterministic communication complexity of the…
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, if `(x,y)` and `(x',y')` are in the same part, then so are `(x',y)` and `(x,y')`. -/ theorem CommunicationComplexity.Rectangle.monoPartition_cross_mem (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) : (x', y) ∈ R ∧ (x, y') ∈ R := (IsRectangle_iff R).mp (h.1 R hR) x x' y y' hxy hx'y'