Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.1(a), proof — NjT Ker P⊂Ker P⊂Ker BTN_j^T\,\mathrm{Ker}\,P \subset \mathrm{Ker}\,P \subset \mathrm{Ker}\,B^TNjT​KerP⊂KerP⊂KerBT

Proved
BilinearGramian.Kernel.kerP_subset

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

bilinear-systemsgramianslyapunov-equationsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let A,N1,…,Nm∈Rn×nA, N_1,\dots,N_m \in\mathbb R^{n\times n}A,N1​,…,Nm​∈Rn×n and B∈Rn×mB\in\mathbb R^{n\times m}B∈Rn×m, and let P∈Rn×nP\in\mathbb R^{n\times n}P∈Rn×n be nonnegative definite and solve the first generalized Lyapunov equation of (3.6),

AP+PAT+∑j=1mNjPNjT=−BBT.AP + PA^T + \sum_{j=1}^m N_j P N_j^T = -BB^T.AP+PAT+j=1∑m​Nj​PNjT​=−BBT.

Then

NjT Ker P⊂Ker P(j=1,…,m),Ker P⊂Ker BT.N_j^T\,\mathrm{Ker}\,P \subset \mathrm{Ker}\,P \quad (j=1,\dots,m), \qquad \mathrm{Ker}\,P \subset \mathrm{Ker}\,B^T .NjT​KerP⊂KerP(j=1,…,m),KerP⊂KerBT.

Equivalently: if Pv=0Pv = 0Pv=0, then BTv=0B^Tv = 0BTv=0 and PNjTv=0PN_j^Tv = 0PNjT​v=0 for every jjj.

This is the first step of the proof that states reachable from 000 lie in the image of the controllability Gramian.

Preamble
import Mathlib
import Definitions.Def_BilinearGramian_Kernel_GramianEquations

open Matrix
Formal statement
namespace BilinearGramian.Kernel

/-- Benner–Damm 2011, Theorem 3.1, proof of (a), p. 695: if `P ≥ 0` solves the first equation of
(3.6), then `N_jᵀ Ker P ⊂ Ker P ⊂ Ker Bᵀ` for every `j`. -/
theorem kerP_subset {n m : ℕ} (A : Matrix (Fin n) (Fin n) ℝ)
    (N : Fin m → Matrix (Fin n) (Fin n) ℝ) (B : Matrix (Fin n) (Fin m) ℝ)
    (P : Matrix (Fin n) (Fin n) ℝ) (hP : P.PosSemidef) (hPeq : ReachGramianEq A N B P) :
    (∀ j : Fin m,
      (LinearMap.ker (Matrix.toLin' P)).map (Matrix.toLin' (N j)ᵀ) ≤
        LinearMap.ker (Matrix.toLin' P)) ∧
    LinearMap.ker (Matrix.toLin' P) ≤ LinearMap.ker (Matrix.toLin' Bᵀ) := by sorry

end BilinearGramian.Kernel
Source
Benner, Damm, Lyapunov Equations, Energy Functionals, and Model Order Reduction of Bilinear and Stochastic Systems, SIAM J. Control Optim. 49(2) (2011), p. 695, Theorem 3.1, proof of (a)
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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