AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.Rectangle.IsMonoPartition

defimported Lean

A collection $\mathcal{P}$ of subsets of $X \times Y$ is a monochromatic rectangle partition for $g : X \to Y \to \alpha$ if every member of $\mathcal{P}$ is a rectangle, every member is monochromatic for $g$, the members cover all of $X \times Y$, and distinct members are disjoint.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
variable {X Y α : Type*} in
def CommunicationComplexity.Rectangle.IsMonoPartition
    (Part : Set (Set (X × Y))) (g : X → Y → α) : Prop
Defined in
TCSlib, `CommunicationComplexity.Rectangle.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.
Verified
07 Oct 2026
Axioms
none listed
Built on 2
Used by 12

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
variable {X Y α : Type*} in
/-- A set of sets is a monochromatic rectangle partition of `X × Y` with respect to `g` if every member is a rectangle, every member is monochromatic for `g`, the members cover `X × Y`, and distinct members are disjoint. [RY20, Thm 1.7] (the notion of a partition of `X × Y` into monochromatic rectangles). -/
def CommunicationComplexity.Rectangle.IsMonoPartition
    (Part : Set (Set (X × Y))) (g : X → Y → α) : Prop :=
  (∀ R ∈ Part, IsRectangle R) ∧
  (∀ R ∈ Part, IsMonochromatic R g) ∧
  ⋃₀ Part = Set.univ ∧
  (∀ R S, R ∈ Part → S ∈ Part → R ≠ S → Disjoint R S)
See it in the graphDiscuss this resultChallenge it