Theorem 3.1(a), proof — is invariant under the vector field of (3.1)
ProvedBilinearGramian.Kernel.imP_field_invariantbilinear-systemsgramiansinvariant-subspacesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let and , and let be nonnegative definite and solve
Then for every state and every input value ,
In the words of the paper: if , then , whatever the current input value ; is invariant under the dynamics of the bilinear system (3.1).
This pointwise statement about the vector field is the algebraic content of part (a) of Theorem 3.1; the remaining step passes from the vector field to trajectories.
Preamble
import Mathlib import Definitions.Def_BilinearGramian_Kernel_System import Definitions.Def_BilinearGramian_Kernel_GramianEquations open Matrix
Formal statement
namespace BilinearGramian.Kernel
/-- Benner–Damm 2011, Theorem 3.1, proof of (a), p. 696: if `P ≥ 0` solves the first equation of
(3.6), then `Im P` is invariant under the vector field of (3.1): for every state `z ∈ Im P` and
every input value `w ∈ ℝᵐ`, `A z + ∑_j N_j z w_j + B w ∈ Im P`. -/
theorem imP_field_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)
(z : Fin n → ℝ) (hz : z ∈ LinearMap.range (Matrix.toLin' P)) (w : Fin m → ℝ) :
field A N B z w ∈ LinearMap.range (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. 696, Theorem 3.1, proof of (a)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.