Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(3.6), p. 15 — under C1 the errors (3.5) obey e_x(k+1) = (M(k) ⊗ I_p) e_x(k)

Proved
SubSuperStoch.AsyncTrack.error_system

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

bipartite-trackingerror-systemmulti-agent-systemp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1structural-balance

Consider the asynchronous leader–follower network (3.1)–(3.3) with step size τ\tauτ, gain ψ\psiψ and arbitrary communication instants. Assume condition C1: the signed digraph is structurally balanced with respect to the partition V1={v0}∪V1\mathcal V_1=\{v_0\}\cup V_1V1​={v0​}∪V1​, V2={v1,…,vn}∖V1\mathcal V_2=\{v_1,\dots,v_n\}\setminus V_1V2​={v1​,…,vn​}∖V1​. Define the error coordinates (3.5)

ei(k)=xi(k)−x0(k)  (vi∈V1),ei(k)=−xi(k)−x0(k)  (vi∉V1).e_i(k)=x_i(k)-x_0(k)\ \ (v_i\in V_1),\qquad e_i(k)=-x_i(k)-x_0(k)\ \ (v_i\notin V_1).ei​(k)=xi​(k)−x0​(k)  (vi​∈V1​),ei​(k)=−xi​(k)−x0​(k)  (vi​∈/V1​).

Then along every trajectory, for all k∈Nk\in\mathbb Nk∈N and every follower iii,

ei(k+1)=∑j=1n[M(k)]ij ej(k),e_i(k+1)=\sum_{j=1}^n[M(k)]_{ij}\,e_j(k),ei​(k+1)=j=1∑n​[M(k)]ij​ej​(k),

which is the error system ex(k+1)=[M(k)⊗Ip] ex(k)e_x(k+1)=[M(k)\otimes I_p]\,e_x(k)ex​(k+1)=[M(k)⊗Ip​]ex​(k) written coordinate-wise.

The identity converts bipartite tracking (followers in V1\mathcal V_1V1​ approach x0x_0x0​, followers in V2\mathcal V_2V2​ approach −x0-x_0−x0​) into the convergence to zero of the products M(k)⋯M(0)M(k)\cdots M(0)M(k)⋯M(0).

Formalization Note The stacked vector ex(k)∈Rnpe_x(k)\in\mathbb R^{np}ex​(k)∈Rnp and the Kronecker product are replaced by the equivalent coordinate-wise identity on the blocks ei(k)∈Rpe_i(k)\in\mathbb R^pei​(k)∈Rp. The gain bound (3.7), τ>0\tau>0τ>0, ψ>0\psi>0ψ>0 and the asynchronous-instant condition (2.10) are not assumed: the identity is algebraic and holds without them.

Preamble
import Mathlib
import Definitions.Def_SubSuperStoch_AsyncTrack_SignedDigraph
import Definitions.Def_SubSuperStoch_AsyncTrack_AsyncModel
Formal statement
namespace SubSuperStoch.AsyncTrack

/-- (3.5)–(3.6), p. 15: under condition C1 (with partition `𝒱₁ = {v₀} ∪ V₁`), every trajectory of
(3.1)–(3.3) satisfies the error system `e_x(k+1) = (M(k) ⊗ I_p) e_x(k)`, written coordinate-wise:
`e_i(k+1) = ∑_j [M(k)]_{ij} e_j(k)`. -/
theorem error_system {n p : ℕ} (a : Matrix (Fin n) (Fin n) ℝ) (b : Fin n → ℝ)
    (τ ψ : ℝ) (s : Fin n → ℕ → ℕ)
    (V₁ : Set (Fin n)) (hC1 : StructBalanced a b V₁)
    (x0 : ℕ → EuclideanSpace ℝ (Fin p)) (x : Fin n → ℕ → EuclideanSpace ℝ (Fin p))
    (hrun : IsRun a b τ ψ s x0 x) :
    ∀ k i, errVec V₁ x0 x i (k + 1) = ∑ j, Mmat a b τ ψ s k i j • errVec V₁ x0 x j k := by sorry

end SubSuperStoch.AsyncTrack
Source
Shi, Zheng, Shao, Cheng, arXiv:2004.01867v2, p. 15, (3.4), (3.5) and (3.6)
Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 10, 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