Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.1, p. 18 — the hypotheses of Corollary 4.13 hold: N ∈ 𝚷_{n,n+m} for Φ ∈ 𝚷_{n,T} and (A_s, B_s) ∈ Σ, and M₂₂ ⩽ 0 for P > 0

Proved
QuadMatIneq.Stabilization.corollary_4_13_hypotheses

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

data-driven-controlp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quadratic-matrix-inequality

Let Φ∈Πn,T\Phi\in\boldsymbol\Pi_{n,T}Φ∈Πn,T​, and let the data (U−,X)(U_-,X)(U−​,X) be generated by the system (2.1) with noise satisfying (2.3), i.e. some (As,Bs)(A_s,B_s)(As​,Bs​) lies in Σ\SigmaΣ. Let NNN be the matrix (5.2), and MMM the matrix (5.1) for a matrix P>0P>0P>0 and a gain KKK. Then

N∈Πn,n+mandM22=−[IK]P[IK] ⁣⊤⩽0.N\in\boldsymbol\Pi_{n,n+m}\qquad\text{and}\qquad M_{22}=-\begin{bmatrix}I\\K\end{bmatrix}P\begin{bmatrix}I\\K\end{bmatrix}^{\!\top}\leqslant 0 .N∈Πn,n+m​andM22​=−[IK​]P[IK​]⊤⩽0.

In the paper this is the verification that N22⩽0N_{22}\leqslant 0N22​⩽0, N ∣ N22⩾0N\,|\,N_{22}\geqslant 0N∣N22​⩾0, ker⁡N22⊆ker⁡N12\ker N_{22}\subseteq\ker N_{12}kerN22​⊆kerN12​ and M22⩽0M_{22}\leqslant 0M22​⩽0, which allows Corollary 4.13 to be applied to the inclusion (5.3).

Formalization Note The data-generation hypothesis is stated as ∃ As,Bs\exists\,A_s,B_s∃As​,Bs​ with (As,Bs)∈Σ(A_s,B_s)\in\Sigma(As​,Bs​)∈Σ; without it N ∣ N22⩾0N\,|\,N_{22}\geqslant 0N∣N22​⩾0 can fail. M22M_{22}M22​ is the lower-right (n+m)×(n+m)(n+m)\times(n+m)(n+m)×(n+m) block of Mmat P K.

Preamble
import Mathlib
import Definitions.Def_QuadMatIneq_Stabilization_QMI
import Definitions.Def_QuadMatIneq_Stabilization_Data

open Matrix Filter Topology
Formal statement
namespace QuadMatIneq.Stabilization

/-- §5.1, p. 18: the hypotheses of Corollary 4.13 hold for the matrices `N` of (5.2) and `M`
of (5.1): `N ∈ 𝚷_{n,n+m}` (from `Φ ∈ 𝚷_{n,T}` and `(A_s, B_s) ∈ Σ`), and `M₂₂ ⩽ 0` (from `P > 0`). -/
theorem corollary_4_13_hypotheses {n m T : ℕ}
    (Φ : Matrix (Fin n ⊕ Fin T) (Fin n ⊕ Fin T) ℝ) (X : Matrix (Fin n) (Fin (T + 1)) ℝ)
    (Um : Matrix (Fin m) (Fin T) ℝ) (hΦ : InPi Φ)
    (hgen : ∃ As : Matrix (Fin n) (Fin n) ℝ, ∃ Bs : Matrix (Fin n) (Fin m) ℝ,
      (As, Bs) ∈ Sigma Φ X Um)
    (P : Matrix (Fin n) (Fin n) ℝ) (hP : P.PosDef) (K : Matrix (Fin m) (Fin n) ℝ) :
    InPi (Nmat Φ X Um) ∧ (-(Mmat P K).toBlocks₂₂).PosSemidef := by sorry

end QuadMatIneq.Stabilization
Source
van Waarde–Camlibel–Eising–Trentelman, arXiv:2203.12959v3, §5.1, p. 18, paragraph after (5.3)
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