Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(20): a large buffer at a set-up commencement forces a long clearing run

Proved
KumarSeidman.CAF.clearing_run_length

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

clearing-policymanufacturing-systemsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider a trajectory under a clearing policy and a machine mmm with ρm′<1\rho'_m<1ρm′​<1. Suppose mmm commences a set-up to buffer bpn∗,in∗b_{p^*_n,i^*_n}bpn∗​,in∗​​ at time TnT_nTn​, and its next set-up commencement is at Tn+1T_{n+1}Tn+1​. Then

xpn∗,in∗(Tn) ≥ 2δˉ(1−ρm′) τpn∗,in∗⟹Tn+1−Tn ≥ 2δˉ1−ρm′.x_{p^*_n,i^*_n}(T_n)\ \ge\ \frac{2\bar\delta}{(1-\rho'_m)\,\tau_{p^*_n,i^*_n}}\quad\Longrightarrow\quad T_{n+1}-T_n\ \ge\ \frac{2\bar\delta}{1-\rho'_m}.xpn∗​,in∗​​(Tn​) ≥ (1−ρm′​)τpn∗​,in∗​​2δˉ​⟹Tn+1​−Tn​ ≥ 1−ρm′​2δˉ​.

The machine may only leave bpn∗,in∗b_{p^*_n,i^*_n}bpn∗​,in∗​​ once it is empty, and it cannot empty it faster than at rate 1/τpn∗,in∗1/\tau_{p^*_n,i^*_n}1/τpn∗​,in∗​​; so long set-up-to-set-up cycles follow from large selected buffers, which is what amortizes the set-up time in the Lyapunov argument.

Formalization Note Tn=skT_n=s_kTn​=sk​ and Tn+1=sk+1T_{n+1}=s_{k+1}Tn+1​=sk+1​ for a run k≥1k\ge1k≥1 of mmm that is followed by run k+1k+1k+1. Only the clearing property and ρm′<1\rho'_m<1ρm′​<1 for this machine are assumed.

Preamble
import Mathlib
import Definitions.Def_KumarSeidman_CAF_System
import Definitions.Def_KumarSeidman_CAF_Trajectory
import Definitions.Def_KumarSeidman_CAF_Policy
import Definitions.Def_KumarSeidman_CAF_Lyapunov
Formal statement
namespace KumarSeidman.CAF

/-- (20) (p. 295): under a clearing policy, if machine `m` with `ρ'_m < 1` commences a set-up
to buffer `b* = β m k` at `T_n = s_k` (`k ≥ 1`) and its next set-up commencement is
`T_{n+1} = s_{k+1}`, then
`x_{b*}(T_n) ≥ 2 δ̄ / ((1 − ρ'_m) τ_{b*}) ⇒ T_{n+1} − T_n ≥ 2 δ̄ / (1 − ρ'_m)`. -/
theorem clearing_run_length {P M : ℕ} (S : System P M) (T : Trajectory S)
    (hT : T.IsClearing) (m : Fin M) (hρ : S.rhoPrime m < 1) (k : ℕ) (hk : 1 ≤ k)
    (hnext : T.HasNext m k)
    (hx : 2 * S.deltaBar m / ((1 - S.rhoPrime m) * S.tau (T.β m k)) ≤ T.x (T.β m k) (T.s m k)) :
    2 * S.deltaBar m / (1 - S.rhoPrime m) ≤ T.s m (k + 1) - T.s m k := by sorry

end KumarSeidman.CAF
Source
Kumar & Seidman, Dynamic Instabilities and Stabilization Methods in Distributed Real-Time Scheduling of Manufacturing Systems, IEEE Trans. Automat. Control 35(3), 1990, p. 295, proof of Theorem 1, (20)
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