Proof of Theorem 4.1, p. 56 — (4.8) defines V uniquely, S = G⁰V = VᵀℒʺV, so S is symmetric
ProvedRobinsonSR.NLP.schur_eq_and_symmkkt-matrixp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1schur-complementsymmetric-matrix
Let (), (), () and () be real matrices, assume the matrix (4.5) built from is nonsingular and is symmetric, and let be the Schur complement (4.6). Then:
- the equations
have exactly one solution with , , ; 2. every solution of (4.8) satisfies
- is symmetric.
In the proof of Theorem 4.1 this identifies the Schur complement with a quadratic form of restricted to the null space of and .
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.