Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.1, p. 56 — (4.8) defines V uniquely, S = G⁰V = VᵀℒʺV, so S is symmetric

Proved
RobinsonSR.NLP.schur_eq_and_symm

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

kkt-matrixp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1schur-complementsymmetric-matrix

Let QQQ (n×nn\times nn×n), 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 the matrix (4.5) built from Q,H,G+Q,H,G^+Q,H,G+ is nonsingular and QQQ is symmetric, and let SSS be the Schur complement (4.6). Then:

  1. the equations
QV+HTA+G+TB=G0T,−HV=0,−G+V=0(4.8)Q V+H^TA+G^{+T}B=G^{0T},\qquad -HV=0,\qquad -G^+V=0\qquad(4.8)QV+HTA+G+TB=G0T,−HV=0,−G+V=0(4.8)

have exactly one solution (V,A,B)(V,A,B)(V,A,B) with VVV n×sn\times sn×s, AAA q×sq\times sq×s, BBB r×sr\times sr×s; 2. every solution of (4.8) satisfies

S=G0VandS=VTQV;S=G^0V\qquad\text{and}\qquad S=V^TQV;S=G0VandS=VTQV;
  1. SSS is symmetric.

In the proof of Theorem 4.1 this identifies the Schur complement with a quadratic form of L′′\mathcal L''L′′ restricted to the null space of HHH and G+G^+G+.

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: if the matrix (4.5) is nonsingular, the equations (4.8)
`ℒ″V + HᵀA + G⁺ᵀB = G⁰ᵀ, −HV = 0, −G⁺V = 0` have exactly one solution `(V, A, B)`; for it the
Schur complement (4.6) satisfies `S = G⁰V`, and, `ℒ″` being symmetric, `S = VᵀℒʺV`; hence `S` is
symmetric. -/
theorem schur_eq_and_symm {ι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 ℝ)
    (hK : (kktMatrix Q H Gp).det ≠ 0) (hQ : Q.IsSymm) :
    (∃! VAB : Matrix ιn ιs ℝ × Matrix ιq ιs ℝ × Matrix ιr ιs ℝ,
        Q * VAB.1 + Hᵀ * VAB.2.1 + Gpᵀ * VAB.2.2 = G0ᵀ ∧ -H * VAB.1 = 0 ∧ -Gp * VAB.1 = 0) ∧
    (∀ (V : Matrix ιn ιs ℝ) (A : Matrix ιq ιs ℝ) (B : Matrix ιr ιs ℝ),
        Q * V + Hᵀ * A + Gpᵀ * B = G0ᵀ → -H * V = 0 → -Gp * V = 0 →
          schurS Q H Gp G0 = G0 * V ∧ schurS Q H Gp G0 = Vᵀ * Q * V) ∧
    (schurS Q H Gp G0).IsSymm := 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