Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.1, p. 56 — under (a′) and (b) the Schur complement (4.6) is positive definite

Proved
RobinsonSR.NLP.schur_posdef

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

linear-independencep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1positive-definiteschur-complementsecond-order-sufficiency

Let QQQ (n×nn\times nn×n, symmetric), HHH (q×nq\times nq×n), G+G^+G+ (r×nr\times nr×n) and G0G^0G0 (s×ns\times ns×n) be real matrices. Assume

  1. the strong second-order sufficient condition: ⟨y,Qy⟩>0\langle y,Qy\rangle>0⟨y,Qy⟩>0 for every nonzero yyy with G+y=0G^+y=0G+y=0 and Hy=0Hy=0Hy=0;
  2. linear independence (b): the rows of G+G^+G+, G0G^0G0 and HHH are jointly linearly independent, i.e. HTb+G+Tc+G0Td=0H^Tb+G^{+T}c+G^{0T}d=0HTb+G+Tc+G0Td=0 implies b=0b=0b=0, c=0c=0c=0, d=0d=0d=0.

Then the Schur complement

S=[G000][QHTG+T−H00−G+00]−1[G0T00](4.6)S=\begin{bmatrix}G^0&0&0\end{bmatrix}\begin{bmatrix}Q&H^{T}&G^{+T}\\-H&0&0\\-G^{+}&0&0\end{bmatrix}^{-1}\begin{bmatrix}G^{0T}\\0\\0\end{bmatrix}\qquad(4.6)S=[G0​0​0​]​Q−H−G+​HT00​G+T00​​−1​G0T00​​(4.6)

is positive definite: ⟨z,Sz⟩>0\langle z,Sz\rangle>0⟨z,Sz⟩>0 for every z≠0z\ne0z=0.

Together with the two previous steps this shows that SSS is a P-matrix, the condition of the §4 criterion.

Formalization Note The nonsingularity of (4.5) is not assumed: it follows from the two hypotheses.

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: under the strong second-order sufficient condition, symmetry of
`ℒ″` and linear independence of the rows of `G⁺`, `G⁰` and `H`, the Schur complement (4.6) is
positive definite. -/
theorem schur_posdef {ιn ιq ιr ιs : Type*} [Fintype ιn] [Fintype ιq] [Fintype ιr]
    [Fintype ιs] [DecidableEq ιn] [DecidableEq ιq] [DecidableEq ιr]
    (Q : Matrix ιn ιn ℝ) (H : Matrix ιq ιn ℝ) (Gp : Matrix ιr ιn ℝ) (G0 : Matrix ιs ιn ℝ)
    (hQ : Q.IsSymm)
    (hSSOSC : ∀ y : ιn → ℝ, y ≠ 0 → Gp *ᵥ y = 0 → H *ᵥ y = 0 → 0 < y ⬝ᵥ (Q *ᵥ y))
    (hLI : ∀ (b : ιq → ℝ) (c : ιr → ℝ) (d : ιs → ℝ),
      Hᵀ *ᵥ b + Gpᵀ *ᵥ c + G0ᵀ *ᵥ d = 0 → b = 0 ∧ c = 0 ∧ d = 0) :
    RobinsonSR.Schur.PosDefNS (schurS Q H Gp G0) := by sorry

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