Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1 2): a full queued run lowers the backlog βp,i\beta_{p,i}βp,i​ by ζmdpτp,i\zeta_m d_p\tau_{p,i}ζm​dp​τp,i​

Proved
KumarSeidman.Supervisor.lemma1_backlog_decrease

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

lyapunovmanufacturing-systemsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1schedulingsupervisory-control

Under (1), (24) and z≥0z\ge 0z≥0, let a supervised trajectory be given, and suppose buffer bp,ib_{p,i}bp,i​ of machine m=μp,im=\mu_{p,i}m=μp,i​ enters QmQ_mQm​ at time tint_{\mathrm{in}}tin​ and its subsequent processing run is completed at tcompletet_{\mathrm{complete}}tcomplete​. With the backlog βp,i(t)=∑j=1iτp,ixp,j(t)\beta_{p,i}(t)=\sum_{j=1}^{i}\tau_{p,i}x_{p,j}(t)βp,i​(t)=∑j=1i​τp,i​xp,j​(t),

xp,i(tin)≥γmdp ⟹ βp,i(tcomplete)≤βp,i(tin)−ζmdpτp,i.x_{p,i}(t_{\mathrm{in}})\ge \gamma_m d_p\ \Longrightarrow\ \beta_{p,i}(t_{\mathrm{complete}})\le \beta_{p,i}(t_{\mathrm{in}})-\zeta_m d_p\tau_{p,i}.xp,i​(tin​)≥γm​dp​ ⟹ βp,i​(tcomplete​)≤βp,i​(tin​)−ζm​dp​τp,i​.

The backlog is the Lyapunov-type quantity of the stability proof: each service of a large queued buffer removes a fixed amount of it.

Formalization Note The subsequent run is the first run on bp,ib_{p,i}bp,i​ that starts at or after tint_{\mathrm{in}}tin​ and ends after it; its existence is Lemma 1 1). The weight τp,i\tau_{p,i}τp,i​ multiplies every term of the backlog, as printed.

Preamble
import Mathlib
import Definitions.Def_KumarSeidman_Supervisor_System
import Definitions.Def_KumarSeidman_Supervisor_Trajectory
import Definitions.Def_KumarSeidman_Supervisor_Mechanism
Formal statement
namespace KumarSeidman.Supervisor

/-- Lemma 1 2) (Kumar–Seidman 1990, p. 296). If buffer `b = b_{p,i}` enters `Q_m` at
`t_in` with `x_{p,i}(t_in) ≥ γ_m d_p`, then at the completion `t_complete` of its subsequent
processing run the backlog has dropped by at least `ζ_m d_p τ_{p,i}`. -/
theorem lemma1_backlog_decrease {P M : ℕ} (S : System P M) (hcap : S.CapacityCondition)
    (γ : Fin M → ℝ) (hγ : GammaCondition S γ) (z : Buffer S → ℝ) (hz : ∀ b, 0 ≤ z b)
    (T : Trajectory S) (hT : T.Supervised γ z) (b : Buffer S) (tIn : ℝ)
    (hin : T.EntersQ z b tIn) (k : ℕ) (hk : T.IsNextRun b tIn k)
    (hnext : T.HasNext (S.mach b) k)
    (hlevel : γ (S.mach b) * S.d b.1 ≤ T.x b tIn) :
    backlog T b (T.s (S.mach b) (k + 1)) ≤
      backlog T b tIn - zeta S γ (S.mach b) * S.d b.1 * S.tau b := by sorry

end KumarSeidman.Supervisor
Source
Kumar & Seidman, Dynamic Instabilities and Stabilization Methods in Distributed Real-Time Scheduling of Manufacturing Systems, IEEE Trans. Automat. Control 35(3), 1990, p. 296, Lemma 1 2)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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