Theorem 3.1(a), proof —
ProvedBilinearGramian.Kernel.kerP_At_invariantbilinear-systemsgramianslyapunov-equationsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let and , and let be nonnegative definite and solve
Then is invariant under :
that is, implies .
Together with the inclusions , this is what makes invariant under the dynamics of (3.1).
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 `Aᵀ Ker P ⊂ Ker P`. -/
theorem kerP_At_invariant {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) :
(LinearMap.ker (Matrix.toLin' P)).map (Matrix.toLin' Aᵀ) ≤
LinearMap.ker (Matrix.toLin' P) := 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.