Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.1 (S-lemma) — if N has a positive eigenvalue, xᵀNx ⩾ 0 ⇒ xᵀMx ⩾ 0 iff M − αN ⩾ 0 for some α ⩾ 0

Proved
QuadMatIneq.Stabilization.lemma_4_1

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

linear-matrix-inequalityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quadratic-formss-lemma

Let M,N∈SnM,N\in\mathbb{S}^nM,N∈Sn be symmetric matrices and suppose that NNN has at least one positive eigenvalue. Then

x⊤Mx⩾0  for all x∈Rn with x⊤Nx⩾0⟺∃ α⩾0: M−αN⩾0.x^\top Mx\geqslant 0\ \text{ for all } x\in\mathbb{R}^n \text{ with } x^\top Nx\geqslant 0 \quad\Longleftrightarrow\quad \exists\,\alpha\geqslant 0:\ M-\alpha N\geqslant 0 .x⊤Mx⩾0  for all x∈Rn with x⊤Nx⩾0⟺∃α⩾0: M−αN⩾0.

This is Yakubovich's S-lemma, recalled in the paper as the vector-valued base case from which the matrix S-lemma (Theorem 4.7) is derived. The positive-eigenvalue hypothesis is the Slater condition: some xˉ\bar xxˉ has xˉ⊤Nxˉ>0\bar x^\top N\bar x>0xˉ⊤Nxˉ>0.

Formalization Note The index set is an arbitrary finite type; M−αN⩾0M-\alpha N\geqslant 0M−αN⩾0 is PosSemidef. The positive-eigenvalue hypothesis uses Mathlib's eigenvalues of the symmetric matrix NNN.

Preamble
import Mathlib
import Definitions.Def_QuadMatIneq_Stabilization_QMI

open Matrix
Formal statement
namespace QuadMatIneq.Stabilization

/-- Lemma 4.1 (S-lemma), p. 9. -/
theorem lemma_4_1 {k : Type*} [Fintype k] [DecidableEq k]
    (M N : Matrix k k ℝ) (hM : M.IsHermitian) (hN : N.IsHermitian)
    (hpos : ∃ i, 0 < hN.eigenvalues i) :
    (∀ x : k → ℝ, 0 ≤ x ⬝ᵥ (N *ᵥ x) → 0 ≤ x ⬝ᵥ (M *ᵥ x)) ↔
      ∃ α : ℝ, 0 ≤ α ∧ (M - α • N).PosSemidef := by sorry

end QuadMatIneq.Stabilization
Source
van Waarde–Camlibel–Eising–Trentelman, arXiv:2203.12959v3, Lemma 4.1, p. 9
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