AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.Rectangle.monoPartition_point_mem

theoremverifiedimported Lean

Every point lies in some part of a partition. Let $g : X \times Y \to \alpha$ and let $\mathcal{P}$ be a monochromatic rectangle partition for $g$. Then every point $p \in X \times Y$ belongs to at least one member $R \in \mathcal{P}$.

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_point_mem (h : IsMonoPartition Part g)
    (p : X × Y) : ∃ R ∈ Part, p ∈ R
Source
TCSlib, `CommunicationComplexity.Rectangle.monoPartition_point_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.
Verified
07 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
Used by 5

Lean source view module on GitHub

set_option relaxedAutoImplicit false inset_option autoImplicit false invariable {X Y α : Type*} invariable {Part : Set (Set (X × Y))} {g : X → Y → α} in/-- Every point of `X × Y` lies in some member of a monochromatic rectangle partition. -/theorem CommunicationComplexity.Rectangle.monoPartition_point_mem (h : IsMonoPartition Part g)    (p : X × Y) : ∃ R ∈ Part, p ∈ R := by  have := h.2.2.1 ▸ Set.mem_univ p  exact Set.mem_sUnion.mp this
See it in the graphDiscuss this resultChallenge it