Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1 — every 1-rectangle cover of suppmat(M(n))\mathrm{suppmat}(M(n))suppmat(M(n)) has size 2Ω(n)2^{\Omega(n)}2Ω(n)

Proved
ExtensionComplexity.TSP.rectangle_cover_lower_bound

by mikedeng1 · 1 vote · Oct 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

communication-complexitylower-boundp2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1rectangle-cover

Let M=M(n)M=M(n)M=M(n) be the 2n×2n2^n\times 2^n2n×2n matrix Mab=(1−a⊤b)2M_{ab}=(1-a^\top b)^2Mab​=(1−a⊤b)2 indexed by nnn-bit strings, and let suppmat(M)\mathrm{suppmat}(M)suppmat(M) be its support matrix. Theorem 1 (de Wolf 2003): every 111-monochromatic rectangle cover of suppmat(M)\mathrm{suppmat}(M)suppmat(M) has size 2Ω(n)2^{\Omega(n)}2Ω(n). That is, there are C>0C>0C>0 and NNN such that for all n≥Nn\ge Nn≥N, if R1,…,RkR_1,\dots,R_kR1​,…,Rk​ are rectangles each containing only 111-entries of suppmat(M(n))\mathrm{suppmat}(M(n))suppmat(M(n)) and together containing all of them, then

k ≥ 2Cn.k\ \ge\ 2^{Cn}.k ≥ 2Cn.

Equivalently, the function (a,b)↦[a⊤b≠1](a,b)\mapsto[a^\top b\ne 1](a,b)↦[a⊤b=1] has nondeterministic communication complexity Ω(n)\Omega(n)Ω(n). Combined with Theorem 4 this gives rank+(M(n))=2Ω(n)\mathrm{rank}_+(M(n))=2^{\Omega(n)}rank+​(M(n))=2Ω(n), the source of all lower bounds in the mission.

Formalization Note 2Ω(n)2^{\Omega(n)}2Ω(n) is read as: there exist C>0C>0C>0 and NNN with k≥2Cnk\ge 2^{Cn}k≥2Cn (real power) for all n≥Nn\ge Nn≥N. Rectangles are arbitrary pairs of sets of bit strings and may overlap.

Preamble
import Mathlib
import Definitions.Def_ExtensionComplexity_TSP_CorrelationMatrix
import Definitions.Def_ExtensionComplexity_TSP_SlackMatrix
Formal statement
namespace ExtensionComplexity.TSP

/-- **Theorem 1** [de Wolf 2003] (Fiorini et al., J. ACM 62(2) (2015), Art. 17, p. 17:8): every
1-monochromatic rectangle cover of `suppmat(M)`, `M = M(n)`, has size `2^{Ω(n)}`: there are
`C > 0` and `N` such that for every `n ≥ N`, every cover of the 1-entries of the support of
`M(n)` by `k` 1-monochromatic rectangles has `k ≥ 2^{Cn}`. -/
theorem rectangle_cover_lower_bound :
    ∃ C : ℝ, 0 < C ∧ ∃ N : ℕ, ∀ n ≥ N, ∀ (k : ℕ)
      (R : Fin k → Set (Fin n → Bool) × Set (Fin n → Bool)),
      IsOneRectangleCover (suppM n) R → (2 : ℝ) ^ (C * n) ≤ k := by sorry

end ExtensionComplexity.TSP
Source
Fiorini, Massar, Pokutta, Tiwary, de Wolf, Exponential lower bounds for polytopes in combinatorial optimization, J. ACM 62(2) (2015), Art. 17, p. 17:8, Theorem 1
Human review
  • Endorsed by Shuze Chen · Oct 4, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 4, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me