Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6 — ⟨2 diag(a)−aa⊤,x⟩≤1\langle 2\,\mathrm{diag}(a)-aa^\top,x\rangle\le 1⟨2diag(a)−aa⊤,x⟩≤1 is valid for COR(n)\mathrm{COR}(n)COR(n) with slack MabM_{ab}Mab​ at bb⊤bb^\topbb⊤

Proved
ExtensionComplexity.TSP.cor_valid_inequality_slack

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

correlation-polytopep2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1slack-matrixvalid-inequality

For a∈{0,1}na\in\{0,1\}^na∈{0,1}n consider the inequality

⟨2 diag(a)−aa⊤, x⟩ ≤ 1,(5)\langle 2\,\mathrm{diag}(a)-aa^\top,\ x\rangle\ \le\ 1,\tag{5}⟨2diag(a)−aa⊤, x⟩ ≤ 1,(5)

where ⟨X,Y⟩=∑i,jXijYij\langle X,Y\rangle=\sum_{i,j}X_{ij}Y_{ij}⟨X,Y⟩=∑i,j​Xij​Yij​ is the Frobenius inner product and diag(a)\mathrm{diag}(a)diag(a) the diagonal matrix with aaa on its diagonal. Lemma 6: for every a∈{0,1}na\in\{0,1\}^na∈{0,1}n,

  1. inequality (5) is valid for COR(n)\mathrm{COR}(n)COR(n), i.e. holds for every x∈COR(n)x\in\mathrm{COR}(n)x∈COR(n);
  2. the slack of the vertex x=bb⊤x=bb^\topx=bb⊤ with respect to (5) is precisely MabM_{ab}Mab​:
1−⟨2 diag(a)−aa⊤, bb⊤⟩=(1−a⊤b)2for all b∈{0,1}n.1-\langle 2\,\mathrm{diag}(a)-aa^\top,\ bb^\top\rangle=(1-a^\top b)^2\quad\text{for all } b\in\{0,1\}^n.1−⟨2diag(a)−aa⊤, bb⊤⟩=(1−a⊤b)2for all b∈{0,1}n.

Hence the 2n×2n2^n\times 2^n2n×2n submatrix of a slack matrix of COR(n)\mathrm{COR}(n)COR(n) formed by the inequalities (5) and the vertices bb⊤bb^\topbb⊤ is exactly M(n)M(n)M(n).

Formalization Note x∈Rn×nx\in\mathbb R^{n\times n}x∈Rn×n is a vector indexed by ordered pairs (i,j)(i,j)(i,j), and the Frobenius product is the dot product over all ordered pairs.

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

/-- **Lemma 6** (Fiorini et al., J. ACM 62(2) (2015), Art. 17, p. 17:12): for all `a ∈ {0,1}^n`,
the inequality `⟨2 diag(a) − aaᵀ, x⟩ ≤ 1` (5) is valid for `COR(n)`, and the slack of the vertex
`x = bbᵀ` with respect to (5) is precisely `M_ab`. `⟨·,·⟩` is the Frobenius inner product, the
sum over ordered pairs `(i, j)`. -/
theorem cor_valid_inequality_slack {n : ℕ} (a : Fin n → Bool) :
    (∀ x ∈ corPolytope n, corIneqCoeff a ⬝ᵥ x ≤ 1) ∧
      ∀ b : Fin n → Bool, 1 - corIneqCoeff a ⬝ᵥ outerBits b = matM n a b := 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:12, Lemma 6 and inequality (5); p. 17:8, eq. (4) and footnote 5
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