Theorem 3.10 — a delayed BCN is trajectory controllable iff Q is irreducible
ProvedDelayedBCN.Controllability.trajControllable_iff_irreducibleConsider a delayed Boolean control network (2.2) with state nodes, inputs, delay length and arbitrary update functions, and let be its transition-count matrix ( = number of input values taking trajectory to trajectory in one step). Then
Trajectory controllability is Definition 3.1: for every initial trajectory and every trajectory there are and a control sequence of length with . Irreducibility is Definition 3.7, applied to with its entries viewed as real numbers.
The theorem replaces a search over control sequences of unbounded length by a finite matrix test.
Formalization Note Controllability is defined through the dynamics and control sequences, not through powers of . The step count in Definition 3.1 is (see the model file). No assumption on , or the update functions is made.
import Mathlib import Definitions.Def_DelayedBCN_Controllability_Model import Definitions.Def_DelayedBCN_Controllability_Matrix
namespace DelayedBCN.Controllability
/-- Theorem 3.10 (Lu et al. 2016, p. 486): the delayed BCN is trajectory controllable
(Definition 3.1) if and only if `Q` is irreducible (Definition 3.7). -/
theorem trajControllable_iff_irreducible {μ n m : ℕ} [NeZero μ] (F : Network μ n m) :
TrajControllable F ↔ IsIrreducibleMat ((Q F).map (fun x : ℕ => (x : ℝ))) := by sorry
end DelayedBCN.Controllability
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Setup.
- ; are arbitrary natural numbers.
- is an arbitrary network. One step is .
Claim.
where is the matrix with its entries cast to real numbers.
Trajectory controllable. For every initial trajectory and every trajectory there are some and some with . Here and . The requirement applies even when .
Irreducible. Let be the number of trajectories. is irreducible if there is no bijection together with an , , such that for all and . Equivalently, there is no split of the trajectories into two nonempty parts and with for all and .
Degenerate cases.
- . There is exactly one trajectory, so is and irreducible by definition. The statement asserts that is then trajectory controllable, which holds because the unique trajectory is reached after one step.
- . Each trajectory has exactly one successor, and the statement applies unchanged.
- Size. The index set is never empty, because .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.