Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.1, p. 56 — the KKT matrix (4.5) is nonsingular

Proved
RobinsonSR.NLP.matrix_4_5_nonsingular

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

kkt-matrixlinear-independencenonsingular-matrixp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1second-order-sufficiency

Let QQQ be an n×nn\times nn×n, HHH a q×nq\times nq×n and G+G^+G+ an r×nr\times nr×n real matrix (playing L′′\mathcal L''L′′, h′(x0)h'(x_0)h′(x0​) and g+′(x0)g^{+\prime}(x_0)g+′(x0​)). 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. the rows of HHH and G+G^+G+ are jointly linearly independent: HTb+G+Tc=0H^Tb+G^{+T}c=0HTb+G+Tc=0 implies b=0b=0b=0 and c=0c=0c=0.

Then the matrix

[QHTG+T−H00−G+00](4.5)\begin{bmatrix}Q&H^{T}&G^{+T}\\-H&0&0\\-G^{+}&0&0\end{bmatrix}\qquad(4.5)​Q−H−G+​HT00​G+T00​​(4.5)

is nonsingular.

This is the first step of the proof of Theorem 4.1: it makes the Schur complement (4.6) well defined.

Formalization Note The index sets are arbitrary finite types, so the statement covers the degenerate cases n=0n=0n=0, q=0q=0q=0 or r=0r=0r=0. The page applies the full linear independence assumption (b), which also involves G0G^0G0; only its consequence for HHH and G+G^+G+ is used, and that is what is assumed here. QQQ need not be symmetric.

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 (on the null
space of `H` and `G⁺`) and linear independence of the rows of `H` and `G⁺`, the matrix (4.5)
`[ℒ″ Hᵀ G⁺ᵀ; −H 0 0; −G⁺ 0 0]` is nonsingular. -/
theorem matrix_4_5_nonsingular {ιn ιq ιr : Type*} [Fintype ιn] [Fintype ιq] [Fintype ιr]
    [DecidableEq ιn] [DecidableEq ιq] [DecidableEq ιr]
    (Q : Matrix ιn ιn ℝ) (H : Matrix ιq ιn ℝ) (Gp : Matrix ιr ιn ℝ)
    (hSSOSC : ∀ y : ιn → ℝ, y ≠ 0 → Gp *ᵥ y = 0 → H *ᵥ y = 0 → 0 < y ⬝ᵥ (Q *ᵥ y))
    (hLI : ∀ (b : ιq → ℝ) (c : ιr → ℝ), Hᵀ *ᵥ b + Gpᵀ *ᵥ c = 0 → b = 0 ∧ c = 0) :
    (kktMatrix Q H Gp).det ≠ 0 := by sorry

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