Theorem 3.1 — states reached from lie in ; states in produce zero output
ProvedBilinearGramian.Kernel.theorem_3_1Let , and , and consider the bilinear control system (3.1)–(3.2)
and the homogeneous bilinear system (3.5), , . Inputs are integrable on every compact interval, and solutions are understood in the integral (Carathéodory) sense.
- (Reachability.) Let be nonnegative definite and satisfy . Then for every input , every solution of (3.1) with satisfies
- (Observability.) Let be nonnegative definite and satisfy , and let . Then for every input , every solution of (3.5) with has zero output:
Part 1 says that states outside the image of the controllability Gramian cannot be reached from the origin (their controllability energy is infinite); part 2 says that states in the kernel of the observability Gramian are indistinguishable from at the output (their observability energy vanishes). This is the structural justification for balanced truncation of bilinear systems: such states can be removed without changing the input–output behaviour.
Formalization Note No stability of and no uniqueness of , is assumed: any nonnegative definite solution of (3.6) works, as in the paper. Part 2 is stated for every input , not only as printed in the theorem; the paper's proof establishes this stronger form (" for all , implying "), and it is what the clause "i.e., " requires. The restatements through the energy functionals , of (3.3)–(3.4) are not formalized. Solutions are any continuous functions satisfying the integral equation on , so no uniqueness theorem is presupposed.
Retired 2026-10-27: a Lean-vs-paper fidelity audit found this statement weaker than, or narrower than, the cited result. A corrected statement will be resubmitted.
import Mathlib import Definitions.Def_BilinearGramian_Kernel_System import Definitions.Def_BilinearGramian_Kernel_GramianEquations open Matrix
namespace BilinearGramian.Kernel
/-- Benner–Damm 2011, Theorem 3.1, p. 695.
(a) If `P ≥ 0` solves the first equation of (3.6), every solution of the bilinear system (3.1)
started at `x(0) = 0` stays in `Im P` for all `t ≥ 0`, for every admissible input `u`.
(b) If `Q ≥ 0` solves the second equation of (3.6) and `x0 ∈ Ker Q`, every solution of the
homogeneous bilinear system (3.5) started at `x0` has output `y(t) = C x(t) = 0` for all `t ≥ 0`,
for every admissible input `u` (in particular for `u = 0`). -/
theorem theorem_3_1 {n m p : ℕ} (A : Matrix (Fin n) (Fin n) ℝ)
(N : Fin m → Matrix (Fin n) (Fin n) ℝ) (B : Matrix (Fin n) (Fin m) ℝ)
(C : Matrix (Fin p) (Fin n) ℝ) :
(∀ P : Matrix (Fin n) (Fin n) ℝ, P.PosSemidef → ReachGramianEq A N B P →
∀ (u : ℝ → Fin m → ℝ) (x : ℝ → Fin n → ℝ), IsInput u → IsSolution A N B u 0 x →
∀ t : ℝ, 0 ≤ t → x t ∈ LinearMap.range (Matrix.toLin' P)) ∧
(∀ Q : Matrix (Fin n) (Fin n) ℝ, Q.PosSemidef → ObsGramianEq A N C Q →
∀ x0 : Fin n → ℝ, x0 ∈ LinearMap.ker (Matrix.toLin' Q) →
∀ (u : ℝ → Fin m → ℝ) (x : ℝ → Fin n → ℝ), IsInput u → IsHomSolution A N u x0 x →
∀ t : ℝ, 0 ≤ t → C *ᵥ x t = 0) := by sorry
end BilinearGramian.Kernel
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.