Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Example 3.3 — a locally controllable bilinear system for which x ↦ P̃(x)⁻¹x is not a gradient near 0, so (3.8) fails

Proved
BilinearGramian.Integrability.example_3_3

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

bilinear-systemscounterexampleenergy-functionalsgramianslyapunov-equationsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider the single-input bilinear system of Example 3.3,

x˙=Ax+Nx u+b u,A=[−100−2],N=ν[0110],b=[11],\dot x = Ax + Nx\,u + b\,u, \qquad A = \begin{bmatrix} -1 & 0 \\ 0 & -2 \end{bmatrix}, \quad N = \nu \begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix}, \quad b = \begin{bmatrix} 1 \\ 1 \end{bmatrix},x˙=Ax+Nxu+bu,A=[−10​0−2​],N=ν[01​10​],b=[11​],

with a real parameter ν≠0\nu \neq 0ν=0. For every x∈R2x \in \mathbb R^2x∈R2 let P~(x)\tilde P(x)P~(x) be the solution of the Lyapunov equation (3.9),

AP~(x)+P~(x)AT=−(Nx+b)(Nx+b)T.A \tilde P(x) + \tilde P(x) A^T = -(Nx + b)(Nx + b)^T .AP~(x)+P~(x)AT=−(Nx+b)(Nx+b)T.

Then:

  1. the system is locally controllable, i.e. the pair (A,b)(A, b)(A,b) is controllable;
  2. for every ε>0\varepsilon > 0ε>0 there is no function E:R2→RE : \mathbb R^2 \to \mathbb RE:R2→R such that
∇E(x)=P~(x)−1xfor all x with 0<∥x∥<ε.\nabla E(x) = \tilde P(x)^{-1} x \qquad \text{for all } x \text{ with } 0 < \|x\| < \varepsilon .∇E(x)=P~(x)−1xfor all x with 0<∥x∥<ε.

In words: the vector field x↦P~(x)−1xx \mapsto \tilde P(x)^{-1}xx↦P~(x)−1x is not integrable on any punctured neighbourhood of the origin. In particular the formula ∇Ec(x)=P~(x)−1x\nabla E_c(x) = \tilde P(x)^{-1}x∇Ec​(x)=P~(x)−1x of (3.8), claimed in the literature for the controllability energy functional EcE_cEc​ of a locally controllable bilinear system "for x≠0x \neq 0x=0 with ∥x∥\|x\|∥x∥ sufficiently small", cannot hold for this system.

Formalization Note The statement refutes every candidate potential EEE, which is exactly "not integrable", and so does not need the definition of EcE_cEc​. EEE is only required to be differentiable, with the given gradient, at the points of the punctured ball. ν≠0\nu \neq 0ν=0 is added: at ν=0\nu = 0ν=0 the Gramian P~(x)\tilde P(x)P~(x) is a constant symmetric matrix and the field is a gradient, whereas the paper calls ν\nuν "irrelevant for the computation". P~\tilde PP~ is any function satisfying (3.9) at every point; since AAA is stable there is exactly one. The plane is EuclideanSpace ℝ (Fin 2) so that the gradient is the Euclidean one. (Pt x)⁻¹ is Mathlib's matrix inverse, which is 000 at singular matrices; P~(x)\tilde P(x)P~(x) is invertible near the origin, so this value does not enter. The analogous claim for the observability Gramian Q~\tilde QQ~​, which the paper says can be argued similarly, is not part of this statement.

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, pp. 697–698). For the single-input bilinear system with
`A = diag(-1, -2)`, `N = ν [0 1; 1 0]` (`ν ≠ 0`), `b = (1, 1)ᵀ`: the system is locally
controllable (`(A, b)` controllable), and if `P̃(x)` is defined by (3.9) for every `x`, then on no
punctured ball `0 < ‖x‖ < ε` is the field `x ↦ P̃(x)⁻¹ x` the gradient of a real function `E`;
so (3.8), `∇E_c(x) = P̃(x)⁻¹ x` for `x ≠ 0` with `‖x‖` sufficiently small, cannot hold. -/
theorem example_3_3 (ν : ℝ) (hν : ν ≠ 0) (Pt : (Fin 2 → ℝ) → Matrix (Fin 2) (Fin 2) ℝ)
    (hPt : ∀ x, IsLinGramian exA (fun _ : Fin 1 => exN ν) exB x (Pt x)) :
    IsControllable exA exB ∧
      ∀ ε > 0, ¬ ∃ E : EuclideanSpace ℝ (Fin 2) → ℝ,
        ∀ x : EuclideanSpace ℝ (Fin 2), 0 < ‖x‖ → ‖x‖ < ε →
          HasGradientAt E (WithLp.toLp 2 ((Pt x.ofLp)⁻¹ *ᵥ x.ofLp)) x := 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), pp. 697–698, Example 3.3
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