Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Example 3.3 — the example system is locally controllable: (A, b) is controllable

Proved
BilinearGramian.Integrability.controllable

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

bilinear-systemscontrollabilityp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let A=diag⁡(−1,−2)A = \operatorname{diag}(-1,-2)A=diag(−1,−2) and b=(1,1)Tb = (1,1)^Tb=(1,1)T be the data of Example 3.3. The pair (A,b)(A, b)(A,b) is controllable: the Kalman matrix

[ b    Ab ]=[1−11−2][\,b \;\; Ab\,] = \begin{bmatrix} 1 & -1 \\ 1 & -2 \end{bmatrix}[bAb]=[11​−1−2​]

has rank 222. By the paper's definition (p. 694), the bilinear system of Example 3.3 is therefore locally controllable, for every value of ν\nuν.

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 v∈R2v \in \mathbb R^2v∈R2 with vTAkb=0v^T A^k b = 0vTAkb=0 for k=0,1k = 0, 1k=0,1 is v=0v = 0v=0.

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
  • 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