Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.1(a), proof — Im P\mathrm{Im}\,PImP is invariant under the vector field of (3.1)

Proved
BilinearGramian.Kernel.imP_field_invariant

by mikedeng1 · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

bilinear-systemsgramiansinvariant-subspacesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let A,N1,…,Nm∈Rn×nA, N_1,\dots,N_m \in\mathbb R^{n\times n}A,N1​,…,Nm​∈Rn×n and B∈Rn×mB\in\mathbb R^{n\times m}B∈Rn×m, and let P∈Rn×nP\in\mathbb R^{n\times n}P∈Rn×n be nonnegative definite and solve

AP+PAT+∑j=1mNjPNjT=−BBT.AP + PA^T + \sum_{j=1}^m N_j P N_j^T = -BB^T.AP+PAT+j=1∑m​Nj​PNjT​=−BBT.

Then for every state z∈Im Pz\in\mathrm{Im}\,Pz∈ImP and every input value w=(w1,…,wm)∈Rmw = (w_1,\dots,w_m)\in\mathbb R^mw=(w1​,…,wm​)∈Rm,

Az+∑j=1mwjNjz+Bw∈Im P.Az + \sum_{j=1}^m w_j N_j z + Bw \in \mathrm{Im}\,P .Az+j=1∑m​wj​Nj​z+Bw∈ImP.

In the words of the paper: if x(t)∈Im Px(t)\in\mathrm{Im}\,Px(t)∈ImP, then x˙(t)∈Im P\dot x(t)\in\mathrm{Im}\,Px˙(t)∈ImP, whatever the current input value u(t)u(t)u(t); Im P\mathrm{Im}\,PImP 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
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me