Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.8 (Matrix Finsler's lemma), p. 12 — under ker⁡Θ⊆ker⁡M∣M22\ker\Theta\subseteq\ker M|M_{22}kerΘ⊆kerM∣M22​, Zr0(N)⊆Zr(M)\mathcal Z_r^0(N)\subseteq\mathcal Z_r(M)Zr0​(N)⊆Zr​(M) iff M−αN⩾0M-\alpha N\geqslant0M−αN⩾0 for some α⩾0\alpha\geqslant0α⩾0

Proved
QuadMatIneq.Finsler.theorem_4_8

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

finsler-lemmalinear-matrix-inequalityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quadratic-matrix-inequalitys-lemma

Let M,N∈Sq+rM,N\in\mathbb S^{q+r}M,N∈Sq+r be partitioned as in (4.1), with M11,N11M_{11},N_{11}M11​,N11​ of size q×qq\times qq×q and M22,N22M_{22},N_{22}M22​,N22​ of size r×rr\times rr×r.

  1. If there exists α∈R\alpha\in\mathbb Rα∈R such that M−αN⩾0M-\alpha N\geqslant0M−αN⩾0, then Zr0(N)⊆Zr(M)\mathcal Z_r^0(N)\subseteq\mathcal Z_r(M)Zr0​(N)⊆Zr​(M).
  2. Define
Θ:=[I−N22†N21]⊤M[I−N22†N21].(4.4)\Theta:=\begin{bmatrix}I\\ -N_{22}^\dagger N_{21}\end{bmatrix}^\top M\begin{bmatrix}I\\ -N_{22}^\dagger N_{21}\end{bmatrix}.\qquad(4.4)Θ:=[I−N22†​N21​​]⊤M[I−N22†​N21​​].(4.4)

Assume that q⩾1q\geqslant1q⩾1, M,N∈Πq,rM,N\in\boldsymbol\Pi_{q,r}M,N∈Πq,r​, N ∣ N22=0N\,|\,N_{22}=0N∣N22​=0 and ker⁡Θ⊆ker⁡(M ∣ M22)\ker\Theta\subseteq\ker(M\,|\,M_{22})kerΘ⊆ker(M∣M22​). Then

Zr0(N)⊆Zr(M)  ⟺  ∃ α⩾0: M−αN⩾0.\mathcal Z_r^0(N)\subseteq\mathcal Z_r(M)\iff\exists\,\alpha\geqslant0:\ M-\alpha N\geqslant0 .Zr0​(N)⊆Zr​(M)⟺∃α⩾0: M−αN⩾0.

Here Zr0(N)\mathcal Z_r^0(N)Zr0​(N) is the set of Z∈Rr×qZ\in\mathbb R^{r\times q}Z∈Rr×q with [IZ]⊤N[IZ]=0\begin{bmatrix}I\\ Z\end{bmatrix}^\top N\begin{bmatrix}I\\ Z\end{bmatrix}=0[IZ​]⊤N[IZ​]=0 and Zr(M)\mathcal Z_r(M)Zr​(M) the set with [IZ]⊤M[IZ]⩾0\begin{bmatrix}I\\ Z\end{bmatrix}^\top M\begin{bmatrix}I\\ Z\end{bmatrix}\geqslant0[IZ​]⊤M[IZ​]⩾0. This is a matrix version of Finsler's lemma: it is the counterpart of the matrix S-lemma (Theorem 4.7) for the case where N∈Πq,rN\in\boldsymbol\Pi_{q,r}N∈Πq,r​ has no positive eigenvalue, in which Zr(N)=Zr0(N)\mathcal Z_r(N)=\mathcal Z_r^0(N)Zr​(N)=Zr0​(N) and the Slater condition fails. Example 4.9 shows that the kernel assumption on Θ\ThetaΘ cannot be dropped.

Formalization Note The two statements are the two conjuncts of one Lean theorem. Symmetry of MMM and NNN is a hypothesis of both. In the second statement q⩾1q\geqslant1q⩾1 (Nonempty ι) is added: the paper's proof picks a nonzero η∈Rq\eta\in\mathbb R^qη∈Rq, and at q=0q=0q=0 the equivalence fails (r=1r=1r=1, N=[0]N=[0]N=[0], M=[−1]M=[-1]M=[−1]: every hypothesis holds, both sets are the single point of R1×0\mathbb R^{1\times0}R1×0, and no α⩾0\alpha\geqslant0α⩾0 gives M−αN⩾0M-\alpha N\geqslant0M−αN⩾0). The multiplier is any real number in the first statement and nonnegative in the second, as printed. The kernel inclusion is stated with matrix–vector products.

Preamble
import Mathlib
import Definitions.Def_QuadMatIneq_Finsler_QMI
Formal statement
namespace QuadMatIneq.Finsler
open Matrix QuadMatIneq.Basic
theorem theorem_4_8 {ι κ : Type*} [Fintype ι] [Fintype κ] [DecidableEq ι] [DecidableEq κ]
    (M N : Matrix (ι ⊕ κ) (ι ⊕ κ) ℝ) (hMh : M.IsHermitian) (hNh : N.IsHermitian) :
    ((∃ α : ℝ, (M - α • N).PosSemidef) → ZZero N ⊆ ZSet M) ∧
    (Nonempty ι → InPi M → InPi N → schur N = 0 →
      (∀ v : ι → ℝ, Theta M N *ᵥ v = 0 → schur M *ᵥ v = 0) →
      (ZZero N ⊆ ZSet M ↔ ∃ α : ℝ, 0 ≤ α ∧ (M - α • N).PosSemidef)) := by sorry
end QuadMatIneq.Finsler
Source
van Waarde–Camlibel–Eising–Trentelman, arXiv:2203.12959v3, Theorem 4.8 (Matrix Finsler's lemma), p. 12, with (4.4); standing partition (4.1), p. 10
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