Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.2, pp. 6–7 — for Π ∈ 𝚷_{q,r}: 𝒵_r(Π) nonempty, convex; bounded iff Π₂₂ < 0; interior iff Π₂₂ = 0 or Π|Π₂₂ > 0; 𝒵⁺ ≠ ∅ iff Π|Π₂₂ > 0; 𝒵⁰ ≠ ∅ iff rank condition

Proved
QuadMatIneq.Basic.theorem_3_2

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

boundednessconvexityinteriorp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quadratic-matrix-inequalityrankschur-complement

Let q,r≥0q, r \ge 0q,r≥0 and let Π∈Πq,r\Pi \in \boldsymbol\Pi_{q,r}Π∈Πq,r​: Π=[Π11Π12Π21Π22]∈Sq+r\Pi = \begin{bmatrix}\Pi_{11} & \Pi_{12}\\ \Pi_{21} & \Pi_{22}\end{bmatrix} \in \mathbb S^{q+r}Π=[Π11​Π21​​Π12​Π22​​]∈Sq+r is symmetric, with Π11\Pi_{11}Π11​ of size q×qq\times qq×q and Π22\Pi_{22}Π22​ of size r×rr\times rr×r, and

Π22≤0,Π ∣ Π22:=Π11−Π12Π22†Π21≥0,ker⁡Π22⊆ker⁡Π12,\Pi_{22} \le 0,\qquad \Pi\,|\,\Pi_{22} := \Pi_{11} - \Pi_{12}\Pi_{22}^\dagger\Pi_{21} \ge 0,\qquad \ker\Pi_{22}\subseteq\ker\Pi_{12},Π22​≤0,Π∣Π22​:=Π11​−Π12​Π22†​Π21​≥0,kerΠ22​⊆kerΠ12​,

where Π22†\Pi_{22}^\daggerΠ22†​ is the Moore–Penrose pseudo-inverse. For Z∈Rr×qZ \in \mathbb{R}^{r\times q}Z∈Rr×q write FΠ(Z)=[IqZ]⊤Π[IqZ]F_\Pi(Z) = \begin{bmatrix} I_q \\ Z\end{bmatrix}^\top \Pi \begin{bmatrix} I_q \\ Z\end{bmatrix}FΠ​(Z)=[Iq​Z​]⊤Π[Iq​Z​], and let Zr(Π)={Z:FΠ(Z)≥0}\mathcal Z_r(\Pi) = \{Z : F_\Pi(Z)\ge 0\}Zr​(Π)={Z:FΠ​(Z)≥0}, Zr+(Π)={Z:FΠ(Z)>0}\mathcal Z_r^+(\Pi) = \{Z : F_\Pi(Z) > 0\}Zr+​(Π)={Z:FΠ​(Z)>0}, Zr0(Π)={Z:FΠ(Z)=0}\mathcal Z_r^0(\Pi) = \{Z : F_\Pi(Z) = 0\}Zr0​(Π)={Z:FΠ​(Z)=0}. Then:

  1. (a) Zr(Π)\mathcal Z_r(\Pi)Zr​(Π) is nonempty and convex;
  2. (b) if q≥1q \ge 1q≥1, Zr(Π)\mathcal Z_r(\Pi)Zr​(Π) is bounded if and only if Π22<0\Pi_{22} < 0Π22​<0;
  3. (c) Zr(Π)\mathcal Z_r(\Pi)Zr​(Π) has nonempty interior if and only if Π22=0\Pi_{22} = 0Π22​=0 or Π ∣ Π22>0\Pi\,|\,\Pi_{22} > 0Π∣Π22​>0;
  4. (d) Zr+(Π)\mathcal Z_r^+(\Pi)Zr+​(Π) is nonempty if and only if Π ∣ Π22>0\Pi\,|\,\Pi_{22} > 0Π∣Π22​>0;
  5. (e) Zr0(Π)\mathcal Z_r^0(\Pi)Zr0​(Π) is nonempty if and only if rank⁡Π22≥rank⁡(Π ∣ Π22)\operatorname{rank}\Pi_{22} \ge \operatorname{rank}(\Pi\,|\,\Pi_{22})rankΠ22​≥rank(Π∣Π22​).

These are the basic properties of the solution sets of quadratic matrix inequalities. In data-driven control the set Zr(Π)\mathcal Z_r(\Pi)Zr​(Π) describes all system matrices consistent with noisy data, and the theorem characterizes, purely in terms of the blocks of Π\PiΠ, when this set is nonempty, bounded, has interior, or contains strict and boundary solutions.

Formalization Note. "Bounded" is entrywise boundedness (∃C\exists C∃C with ∣Zij∣≤C|Z_{ij}|\le C∣Zij​∣≤C on the set), equivalent to boundedness in any norm; the interior is taken in Rr×q\mathbb R^{r\times q}Rr×q with its Euclidean topology. Part (b) carries the added hypothesis q≥1q \ge 1q≥1 (Nonempty ι): for q=0q = 0q=0 the space Rr×0\mathbb R^{r\times 0}Rr×0 is a point, the set is bounded, and Π22\Pi_{22}Π22​ may still be singular, so (b) as printed fails; the paper's proof picks a nonzero vector of Rq\mathbb R^qRq. Parts (a), (c), (d), (e) are stated without it, and hold for q=0q = 0q=0 and r=0r = 0r=0.

Preamble
import Mathlib
import Definitions.Def_QuadMatIneq_Basic_QMI
Formal statement
namespace QuadMatIneq.Basic
open Matrix
theorem theorem_3_2 {ι κ : Type*} [Fintype ι] [Fintype κ] [DecidableEq ι] [DecidableEq κ]
    (P : Matrix (ι ⊕ κ) (ι ⊕ κ) ℝ) (hP : InPi P) :
    -- (a) nonempty and convex
    ((ZSet P).Nonempty ∧ Convex ℝ (ZSet P)) ∧
    -- (b) bounded iff Π₂₂ < 0 (for q ⩾ 1)
    (Nonempty ι → ((∃ C : ℝ, ∀ Z ∈ ZSet P, ∀ i j, |Z i j| ≤ C) ↔ (-P.toBlocks₂₂).PosDef)) ∧
    -- (c) nonempty interior iff Π₂₂ = 0 or Π|Π₂₂ > 0
    ((interior (ZSet P)).Nonempty ↔ P.toBlocks₂₂ = 0 ∨ (schur P).PosDef) ∧
    -- (d) 𝒵_r^+(Π) nonempty iff Π|Π₂₂ > 0
    ((ZPlus P).Nonempty ↔ (schur P).PosDef) ∧
    -- (e) 𝒵_r^0(Π) nonempty iff rank Π₂₂ ⩾ rank Π|Π₂₂
    ((ZZero P).Nonempty ↔ (schur P).rank ≤ P.toBlocks₂₂.rank) := by sorry
end QuadMatIneq.Basic
Source
van Waarde–Camlibel–Eising–Trentelman, arXiv:2203.12959v3, Theorem 3.2, pp. 6–7
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