CommunicationComplexity.Deterministic.mono_partition_of_communicationComplexity_le
theoremverifiedimported Lean
Low deterministic complexity yields a small monochromatic partition. Let $g : X \times Y \to \alpha$ be a two-argument function, and let $n$ be a natural number. If the deterministic communication complexity $D(g)$ satisfies $D(g) \le n$, then there is a collection $\mathcal{P}$ of subsets of $X \times Y$ that is a monochromatic rectangle partition for $g$ — every member is a rectangle, every member is monochromatic for $g$, the members cover $X \times Y$, and distinct members are disjoint — and whose number of parts satisfies $\abs{\mathcal{P}} \le 2^n$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in variable {X Y α : Type*} in theorem CommunicationComplexity.Deterministic.mono_partition_of_communicationComplexity_le (g : X → Y → α) (n : ℕ) (h : communicationComplexity g ≤ n) : ∃ Part : Set (Set (X × Y)), Rectangle.IsMonoPartition Part g ∧ Set.ncard Part ≤ 2 ^ n
- Source
- TCSlib, `CommunicationComplexity.Deterministic.mono_partition_of_communicationComplexity_le`
- 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.mono_partition_of_communicationComplexity_le← CommunicationComplexity.Deterministic.mono_partition_of_communicationComplexity_le (TCSlib/CommunicationComplexity/DeterministicCC/DetRectangle.lean:492): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 9
- CommunicationComplexity.Deterministic.communicationComplexity_le_iffThreshold characterization of deterministic communication complexity. Let $f : X \to Y \to \alpha$ be a two-argument function and let $n$…
- 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.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.Deterministic.Protocol.leafRectanglesThe leaf rectangles of a protocol $p : \texttt{Protocol}\,X\,Y\,\alpha$ form the collection…
- CommunicationComplexity.Deterministic.communicationComplexityThe deterministic communication complexity of $f : X \to Y \to \alpha$ is defined as…
- CommunicationComplexity.Deterministic.Protocol.leafRectangles_cardLeaf rectangle count is at most two to the complexity. Let $p$ be a deterministic two-party communication protocol over input types $X$…
- 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.complexityThe communication complexity of a protocol $p$ is the worst-case total number of bits exchanged: an output node costs $0$, while an alice…
- 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.Rank.boolFunctionRank_le_pow_of_communicationComplexity_leRank bound from communication complexity. Let $X$ and $Y$ be finite types and let $f : X \to Y \to \mathrm{Bool}$ be a two-party Boolean…
- CommunicationComplexity.Deterministic.le_communicationComplexity_of_forall_lt_ncardRectangle-partition lower bound on communication complexity. Let $g : X \to Y \to \alpha$ be a two-argument function and let $n$ be a…
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 the deterministic communication complexity of `g` is at most `n`, then there is a monochromatic rectangle partition of `X × Y` for `g` with at most `2 ^ n` rectangles [RY20, Thm 1.7]: take the leaf rectangles of a protocol of complexity at most `n`. -/theorem CommunicationComplexity.Deterministic.mono_partition_of_communicationComplexity_le (g : X → Y → α) (n : ℕ) (h : communicationComplexity g ≤ n) : ∃ Part : Set (Set (X × Y)), Rectangle.IsMonoPartition Part g ∧ Set.ncard Part ≤ 2 ^ n := by obtain ⟨p, hp, hc⟩ := (communicationComplexity_le_iff g n).mp h exact ⟨Protocol.leafRectangles p, Protocol.leafRectangles_isMonoPartition p g hp, (Protocol.leafRectangles_card p).trans (Nat.pow_le_pow_right (by omega) hc)⟩