Theorem 3.1(a), proof —
ProvedBilinearGramian.Kernel.kerP_subsetbilinear-systemsgramianslyapunov-equationsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let and , and let be nonnegative definite and solve the first generalized Lyapunov equation of (3.6),
Then
Equivalently: if , then and for every .
This is the first step of the proof that states reachable from 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.