Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3.6 — a symmetric P is PSD iff Σᵢⱼ pᵢⱼ yᵢⱼ ≥ 0 for every PSD Y

Proved
GeometryOfGraphs.EuclidDist.proposition_3_6

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1positive-semidefinite-coneself-dualitysemidefinite-programming

Let XXX be a finite index set and let P=(pi,j)i,j∈XP = (p_{i,j})_{i,j\in X}P=(pi,j​)i,j∈X​ be a real symmetric matrix. Then PPP is positive semidefinite if and only if

∑i,jpi,j yi,j  ≥  0for every real positive semidefinite matrix Y=(yi,j).\sum_{i,j} p_{i,j}\, y_{i,j} \;\ge\; 0 \qquad \text{for every real positive semidefinite matrix } Y = (y_{i,j}).i,j∑​pi,j​yi,j​≥0for every real positive semidefinite matrix Y=(yi,j​).

In other words, the cone PSDnPSD_nPSDn​ of real symmetric positive semidefinite n×nn\times nn×n matrices is self-dual under the trace pairing ⟨P,Y⟩=∑i,jpi,jyi,j\langle P, Y\rangle = \sum_{i,j} p_{i,j} y_{i,j}⟨P,Y⟩=∑i,j​pi,j​yi,j​. The paper uses it as the complete list of linear inequalities defining PSDnPSD_nPSDn​, which is what the duality step in the proof of Corollary 3.5 needs.

Formalization Note The page says "a matrix PPP belongs to PSDnPSD_nPSDn​", and PSDnPSD_nPSDn​ is defined on the same page as a cone of symmetric matrices. The hypothesis that PPP is symmetric (P.IsSymm) is therefore made explicit: without it the "if" direction would be false, since a nonzero antisymmetric PPP pairs to 000 with every symmetric YYY. Matrices are indexed by an arbitrary finite type rather than {1,…,n}\{1,\dots,n\}{1,…,n}.

Preamble
import Mathlib
Formal statement
namespace GeometryOfGraphs.EuclidDist

/-- Proposition 3.6 (p. 224): a real symmetric matrix `P` is positive semidefinite iff
`∑_{i,j} p_ij * y_ij ≥ 0` for every positive semidefinite `Y`. -/
theorem proposition_3_6 {X : Type*} [Fintype X] [DecidableEq X]
    (P : Matrix X X ℝ) (hP : P.IsSymm) :
    P.PosSemidef ↔
      ∀ Y : Matrix X X ℝ, Y.PosSemidef → 0 ≤ ∑ i, ∑ j, P i j * Y i j := by sorry

end GeometryOfGraphs.EuclidDist
Source
N. Linial, E. London, Y. Rabinovich, The geometry of graphs and some of its algorithmic applications, Combinatorica 15 (1995), p. 224, Proposition 3.6
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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