Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 3 — the number of k-step control sequences between two trajectories is an entry of Q^k

Proved
DelayedBCN.Controllability.card_controls_eq_pow

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

boolean-control-networkcountingp2o-batch-p100bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider a delayed Boolean control network with trajectories of length μ≥1\mu\ge1μ≥1 and transition-count matrix QQQ. For every integer k≥0k\ge0k≥0 and all trajectories ya,yby_a,y_bya​,yb​, the number N1(k;ya,yb)\mathbb N_1(k;y_a,y_b)N1​(k;ya​,yb​) of control sequences (u(0),…,u(k−1))(u(0),\dots,u(k-1))(u(0),…,u(k−1)) that steer the network from y(0)=yay(0)=y_ay(0)=ya​ to y(k)=yby(k)=y_by(k)=yb​ without any restriction is

N1(k;ya,yb)=ybT Qk ya.\mathbb N_1(k;y_a,y_b)=y_b^{\mathsf T}\,Q^k\,y_a .N1​(k;ya​,yb​)=ybT​Qkya​.

This is the unconstrained case Ct=∅C_t=\emptysetCt​=∅ of Proposition 3.5, and underlies the state-counting formula of Theorem 4.3.

Formalization Note The identity is stated for all k≥0k\ge0k≥0; at k=0k=0k=0 both sides equal 111 if ya=yby_a=y_bya​=yb​ and 000 otherwise.

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

/-- Remark 3 (Lu et al. 2016, p. 484): the number of control sequences of length `k` that steer
`ya` to `yb` is the `(yb, ya)` entry of `Q^k`. -/
theorem card_controls_eq_pow {μ n m : ℕ} [NeZero μ] (F : Network μ n m)
    (ya yb : Traj μ n) (k : ℕ) :
    numSteering F k ya yb = (Q F ^ k) yb ya := 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. 484, Remark 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)).
  • ya,yby_a,y_bya​,yb​ are trajectories in (Bn)μ(\mathbb B^n)^\mu(Bn)μ.
  • kkk is any natural number.

Claim.

N1(k;ya,yb)=(Qk)(yb,ya).\mathbb N_1(k;y_a,y_b)=(Q^k)(y_b,y_a).N1​(k;ya​,yb​)=(Qk)(yb​,ya​).

The symbols mean the following:

  • Left-hand side. The number of control sequences U∈(Bm)kU\in(\mathbb B^m)^kU∈(Bm)k whose trajectory, started at yU(0)=yay_U(0)=y_ayU​(0)=ya​ and updated by 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)), satisfies yU(k)=yby_U(k)=y_byU​(k)=yb​.
  • QQQ. Q(b,a)=#{u∈Bm:σF(u,a)=b}Q(b,a)=\#\{u\in\mathbb B^m:\sigma_F(u,a)=b\}Q(b,a)=#{u∈Bm:σF​(u,a)=b}, a matrix with natural-number entries indexed by trajectories.
  • Right-hand side. QkQ^kQk is its kkk-th matrix power, read at row yby_byb​ and column yay_aya​.

Degenerate cases.

  • k=0k=0k=0. It is not excluded. There is exactly one (empty) control sequence and Q0Q^0Q0 is the identity. So the statement asserts that 1=11=11=1 when ya=yby_a=y_bya​=yb​ and 0=00=00=0 otherwise.
  • m=0m=0m=0. Both sides are 000 or 111.
  • n=0n=0n=0. There is a single trajectory, so both sides equal 2mk2^{mk}2mk.
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