Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 4.16(b), p. 17 — Fˉ>0\bar F>0Fˉ>0 and G≠0G\neq0G=0 imply that NNN of (4.17) has a positive eigenvalue

Proved
QuadMatIneq.Petersen.slater

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

eigenvaluesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1petersen-lemmaslater-condition

Let Fˉ∈Rq×q\bar F\in\mathbb R^{q\times q}Fˉ∈Rq×q with Fˉ>0\bar F>0Fˉ>0 and G∈Rq×nG\in\mathbb R^{q\times n}G∈Rq×n with G≠0G\neq0G=0, and let

N=[G⊤FˉG00−Ip]N=\begin{bmatrix}G^\top\bar FG&0\\0&-I_p\end{bmatrix}N=[G⊤FˉG0​0−Ip​​]

be the matrix of (4.17). Then NNN 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 NNN is passed as a hypothesis so that its eigenvalues can be named; it is always satisfied, because Fˉ\bar FFˉ 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
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 10, 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