Proof of Proposition 4.16(b), p. 17 — and imply that of (4.17) has a positive eigenvalue
ProvedQuadMatIneq.Petersen.slatereigenvaluesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1petersen-lemmaslater-condition
Let with and with , and let
be the matrix of (4.17). Then has at least one positive eigenvalue.
This verifies the Slater condition of the matrix S-lemma (Theorem 4.7) in the non-strict Petersen lemma.
Formalization Note The symmetry of is passed as a hypothesis so that its eigenvalues can be named; it is always satisfied, because is symmetric.
Preamble
import Mathlib import Definitions.Def_QuadMatIneq_Petersen_QMI import Definitions.Def_QuadMatIneq_Petersen_Setup
Formal statement
namespace QuadMatIneq.Petersen
open Matrix
theorem slater {n p q : ℕ} (Fbar : Matrix (Fin q) (Fin q) ℝ) (G : Matrix (Fin q) (Fin n) ℝ)
(hFbar : Fbar.PosDef) (hG : G ≠ 0)
(hN : (petersenN (p := Fin p) Fbar G).IsHermitian) :
∃ i, 0 < hN.eigenvalues i := by sorry
end QuadMatIneq.Petersen
Source
van Waarde–Camlibel–Eising–Trentelman, arXiv:2203.12959v3, §4.5.3, proof of Proposition 4.16(b), p. 17 ("Note that the conditions of that theorem are satisfied since F̄ > 0 and G ≠ 0 imply that N has at least one positive eigenvalue.")
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.