Example 3.3 — the example system is locally controllable: (A, b) is controllable
ProvedBilinearGramian.Integrability.controllablebilinear-systemscontrollabilityp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let and be the data of Example 3.3. The pair is controllable: the Kalman matrix
has rank . By the paper's definition (p. 694), the bilinear system of Example 3.3 is therefore locally controllable, for every value of .
This is the hypothesis under which the gradient formula (3.8) was claimed, so it makes Example 3.3 a counterexample within the claim's scope.
Formalization Note Controllability is stated as: the only with for is .
Preamble
import Mathlib import Definitions.Def_BilinearGramian_Integrability_LinGramian import Definitions.Def_BilinearGramian_Integrability_Example33 open Matrix
Formal statement
namespace BilinearGramian.Integrability /-- Example 3.3 (Benner–Damm 2011, p. 697, with the definition of local controllability on p. 694): the system of Example 3.3 is locally controllable, i.e. the pair `(A, b) = (diag(-1, -2), (1, 1)ᵀ)` is controllable. -/ theorem controllable : IsControllable exA exB := by sorry end BilinearGramian.Integrability
Source
Benner, Damm, Lyapunov Equations, Energy Functionals, and Model Order Reduction of Bilinear and Stochastic Systems, SIAM J. Control Optim. 49(2) (2011), p. 694 (definition) and p. 697, Example 3.3 ("a locally controllable system")
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.