Proof of Proposition 4.16, p. 17 — for , iff (and the analogue)
ProvedQuadMatIneq.Petersen.schur_steplinear-matrix-inequalityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1petersen-lemmaschur-complement
Let be symmetric, , with , , and let be the matrices (4.17). For every real ,
and
This is the Schur-complement step of the paper's proof: it turns the multiplier condition of the matrix S-lemmas into the condition of Petersen's lemma with .
Formalization Note The second (non-strict) equivalence is the analogue the paper uses when it says "the proof of statement (b) is analogous"; it is added to the same item and cited to the same page.
Preamble
import Mathlib import Definitions.Def_QuadMatIneq_Petersen_QMI import Definitions.Def_QuadMatIneq_Petersen_Setup
Formal statement
namespace QuadMatIneq.Petersen
open Matrix
theorem schur_step {n p q : ℕ} (C : Matrix (Fin n) (Fin n) ℝ) (E : Matrix (Fin n) (Fin p) ℝ)
(Fbar : Matrix (Fin q) (Fin q) ℝ) (G : Matrix (Fin q) (Fin n) ℝ)
(hC : C.IsHermitian) (hFbar : Fbar.PosSemidef) (α : ℝ) (hα : 0 < α) :
((petersenM C E - α • petersenN Fbar G).PosDef ↔
(-C - α • (Gᵀ * Fbar * G) - α⁻¹ • (E * Eᵀ)).PosDef) ∧
((petersenM C E - α • petersenN Fbar G).PosSemidef ↔
(-C - α • (Gᵀ * Fbar * G) - α⁻¹ • (E * Eᵀ)).PosSemidef) := by sorry
end QuadMatIneq.Petersen
Source
van Waarde–Camlibel–Eising–Trentelman, arXiv:2203.12959v3, §4.5.3, proof of Proposition 4.16(a), p. 17 ("By using a Schur complement argument …"); non-strict analogue: proof of (b), same page
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.