Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.1, p. 56 — a symmetric matrix is a P-matrix iff it is positive definite

Proved
RobinsonSR.NLP.pmatrix_iff_posdef_of_symm

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

p-matrixp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1positive-definiteprincipal-minorssymmetric-matrix

Let MMM be a symmetric real square matrix indexed by a finite set. Then all principal minors of MMM are positive if and only if MMM is positive definite:

det⁡MJJ>0 for every nonempty J⟺⟨w,Mw⟩>0 for every w≠0.\det M_{JJ}>0\ \text{for every nonempty } J\quad\Longleftrightarrow\quad \langle w,Mw\rangle>0\ \text{for every } w\neq 0 .detMJJ​>0 for every nonempty J⟺⟨w,Mw⟩>0 for every w=0.

In the proof of Theorem 4.1 this reduces the P-matrix requirement on the Schur complement (4.6) to positive definiteness.

Formalization Note Positive definiteness is stated without a symmetry clause (the paper's convention in §3); symmetry is the separate hypothesis. For an empty index set both sides hold vacuously.

Preamble
import Mathlib
import Definitions.Def_RobinsonSR_NLP_Setting
open scoped RealInnerProductSpace Matrix
Formal statement
namespace RobinsonSR.NLP

/-- Proof of Theorem 4.1, p. 56: a symmetric real matrix is a P-matrix (all principal minors
positive) if and only if it is positive definite. -/
theorem pmatrix_iff_posdef_of_symm {ι : Type*} [Fintype ι] [DecidableEq ι]
    (M : Matrix ι ι ℝ) (hM : M.IsSymm) :
    IsPMatrix M ↔ RobinsonSR.Schur.PosDefNS M := by sorry

end RobinsonSR.NLP
Source
Robinson, Strongly regular generalized equations, Math. Oper. Res. 5 (1980), p. 56, proof of Theorem 4.1; P-matrix defined p. 52
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