Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 5.3 — trajectory controllability implies state controllability

Proved
DelayedBCN.Controllability.stateControllable_of_trajControllable

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

boolean-control-networkcontrollabilityp2o-batch-p100bp2o-gran-per-chapterp2o-plan-paperp2o-v1state-controllability

Consider a delayed Boolean control network (2.2) with delay length μ≥1\mu\ge1μ≥1, without any forbidden states or trajectories. If it is trajectory controllable (Definition 3.1: every trajectory is reachable from every initial trajectory in some k≥1k\ge1k≥1 steps), then it is state controllable (Definition 4.1: from every initial trajectory aaa, every state xdx_dxd​ equals x(k)x(k)x(k) for some k>0k>0k>0 and some control sequence of length kkk):

trajectory controllable ⟹ state controllable.\text{trajectory controllable}\ \Longrightarrow\ \text{state controllable}.trajectory controllable ⟹ state controllable.

The converse fails in general (Remark 5 of the paper), so trajectory controllability is a sufficient but not necessary condition for state controllability.

Preamble
import Mathlib
import Definitions.Def_DelayedBCN_Controllability_Model
import Definitions.Def_DelayedBCN_Controllability_Matrix
Formal statement
namespace DelayedBCN.Controllability

/-- Corollary 5.3 (Lu et al. 2016, p. 490): a trajectory controllable delayed BCN (no forbidden
states or trajectories) is state controllable. -/
theorem stateControllable_of_trajControllable {μ n m : ℕ} [NeZero μ] (F : Network μ n m)
    (h : TrajControllable F) : StateControllable F := by sorry

end DelayedBCN.Controllability
Source
Lu, Zhong, Ho, Tang & Cao, On Controllability of Delayed Boolean Control Networks, SIAM J. Control Optim. 54(2) 2016, p. 490, Corollary 5.3
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Setup.

  • μ≥1\mu\ge1μ≥1; n,mn,mn,m are arbitrary natural numbers.
  • F:Bm×(Bn)μ→BnF:\mathbb B^m\times(\mathbb B^n)^\mu\to\mathbb B^nF:Bm×(Bn)μ→Bn is an arbitrary network. One step is σF(u,X)=(X1,…,Xμ−1,F(u,X))\sigma_F(u,X)=(X_1,\dots,X_{\mu-1},F(u,X))σF​(u,X)=(X1​,…,Xμ−1​,F(u,X)).

Hypothesis. FFF is trajectory controllable. That is, for every initial trajectory X0X^0X0 and every trajectory XdX^dXd there are k≥1k\ge1k≥1 and U∈(Bm)kU\in(\mathbb B^m)^kU∈(Bm)k with yU(k)=Xdy_U(k)=X^dyU​(k)=Xd, where yU(0)=X0y_U(0)=X^0yU​(0)=X0 and yU(i+1)=σF(u(i),yU(i))y_U(i+1)=\sigma_F(u(i),y_U(i))yU​(i+1)=σF​(u(i),yU​(i)).

Claim. FFF is state controllable. That is, for every initial trajectory X0X^0X0 and every state xd∈Bnx^d\in\mathbb B^nxd∈Bn there are k≥1k\ge1k≥1 and U∈(Bm)kU\in(\mathbb B^m)^kU∈(Bm)k such that the last entry of yU(k)y_U(k)yU​(k) equals xdx^dxd.

No forbidden states or forbidden trajectories are involved.

Degenerate cases.

  • n=0n=0n=0. There is one state and one trajectory, and both properties hold, since one step reaches the only trajectory.
  • m=0m=0m=0. The hypothesis requires the single deterministic evolution from each start to reach every trajectory after at least one step. The conclusion then follows as stated.
  • μ=0\mu=0μ=0. Excluded.
Human review
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 27, 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