Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 4.16, p. 17 — for α>0\alpha>0α>0, M−αN>0M-\alpha N>0M−αN>0 iff −C−αG⊤FˉG−1αEE⊤>0-C-\alpha G^\top\bar FG-\frac1\alpha EE^\top>0−C−αG⊤FˉG−α1​EE⊤>0 (and the ⩾\geqslant⩾ analogue)

Proved
QuadMatIneq.Petersen.schur_step

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

linear-matrix-inequalityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1petersen-lemmaschur-complement

Let C∈Rn×nC\in\mathbb R^{n\times n}C∈Rn×n be symmetric, E∈Rn×pE\in\mathbb R^{n\times p}E∈Rn×p, Fˉ∈Rq×q\bar F\in\mathbb R^{q\times q}Fˉ∈Rq×q with Fˉ⩾0\bar F\geqslant0Fˉ⩾0, G∈Rq×nG\in\mathbb R^{q\times n}G∈Rq×n, and let M,NM,NM,N be the matrices (4.17). For every real α>0\alpha>0α>0,

M−αN>0  ⟺  −C−αG⊤FˉG−1αEE⊤>0,M-\alpha N>0\iff -C-\alpha G^\top\bar FG-\tfrac1\alpha EE^\top>0,M−αN>0⟺−C−αG⊤FˉG−α1​EE⊤>0,

and

M−αN⩾0  ⟺  −C−αG⊤FˉG−1αEE⊤⩾0.M-\alpha N\geqslant0\iff -C-\alpha G^\top\bar FG-\tfrac1\alpha EE^\top\geqslant0.M−αN⩾0⟺−C−αG⊤FˉG−α1​EE⊤⩾0.

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 λ:=1/α\lambda:=1/\alphaλ:=1/α.

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
  • 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