Theorem 3.1(b), proof — and
ProvedBilinearGramian.Kernel.kerQ_subsetbilinear-systemsgramianslyapunov-equationsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let and , and let be nonnegative definite and solve the second generalized Lyapunov equation of (3.6),
Then
This is the dual of the kernel inclusions for the controllability Gramian, and the first step of the proof that states in produce no output.
Preamble
import Mathlib import Definitions.Def_BilinearGramian_Kernel_GramianEquations open Matrix
Formal statement
namespace BilinearGramian.Kernel
/-- Benner–Damm 2011, Theorem 3.1, proof of (b), p. 696: if `Q ≥ 0` solves the second equation of
(3.6), then `N_j Ker Q ⊂ Ker Q ⊂ Ker C` for every `j`, and `A Ker Q ⊂ Ker Q`. -/
theorem kerQ_subset {n m p : ℕ} (A : Matrix (Fin n) (Fin n) ℝ)
(N : Fin m → Matrix (Fin n) (Fin n) ℝ) (C : Matrix (Fin p) (Fin n) ℝ)
(Q : Matrix (Fin n) (Fin n) ℝ) (hQ : Q.PosSemidef) (hQeq : ObsGramianEq A N C Q) :
(∀ j : Fin m,
(LinearMap.ker (Matrix.toLin' Q)).map (Matrix.toLin' (N j)) ≤
LinearMap.ker (Matrix.toLin' Q)) ∧
LinearMap.ker (Matrix.toLin' Q) ≤ LinearMap.ker (Matrix.toLin' C) ∧
(LinearMap.ker (Matrix.toLin' Q)).map (Matrix.toLin' A) ≤
LinearMap.ker (Matrix.toLin' Q) := 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. 696, Theorem 3.1, proof of (b)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.