Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Example 1, Case 2, p. 292 — with zero set-up times, x(t₅) = (λξ, 0, 0, 0): a magnified copy of the initial state

Proved
KumarSeidman.Reentrant.case2_magnification

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

instabilitymanufacturing-systemsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1scheduling

Consider the re-entrant line of Example 1 with processing times τ1,…,τ4>0\tau_1, \dots, \tau_4 > 0τ1​,…,τ4​>0 satisfying

τ2+τ4>1,τ1+τ4<1,τ2+τ3<1,(3–5)\tau_2 + \tau_4 > 1, \qquad \tau_1 + \tau_4 < 1, \qquad \tau_2 + \tau_3 < 1, \tag{3–5}τ2​+τ4​>1,τ1​+τ4​<1,τ2​+τ3​<1,(3–5)

and with all set-up times zero, δ1=δ2=δ3=δ4=0\delta_1 = \delta_2 = \delta_3 = \delta_4 = 0δ1​=δ2​=δ3​=δ4​=0. Let ξ>0\xi > 0ξ>0, and let λ=τ4/(1−τ2)\lambda = \tau_4/(1-\tau_2)λ=τ4​/(1−τ2​).

Along every clearing trajectory started at x(0)=(ξ,0,0,0)x(0) = (\xi, 0, 0, 0)x(0)=(ξ,0,0,0) with machines 1 and 2 set up for buffers 4 and 3, at the time

t5=(τ2+τ4) ξ1−τ2t_5 = \frac{(\tau_2 + \tau_4)\,\xi}{1 - \tau_2}t5​=1−τ2​(τ2​+τ4​)ξ​

one has

x(t5)=(λξ, 0, 0, 0),x(t_5) = (\lambda\xi,\ 0,\ 0,\ 0),x(t5​)=(λξ, 0, 0, 0),

and machines 1 and 2 are again set up for buffers 4 and 3.

Since λ>1\lambda > 1λ>1, the state at t5t_5t5​ is a magnified version of the initial state; this is the mechanism of the purely starvation-induced instability of Example 1, Case 2.

Formalization Note The paper defines t5t_5t5​ through its stages: t2=t1+ξ/(τ1−1−1)t_2 = t_1 + \xi/(\tau_1^{-1} - 1)t2​=t1​+ξ/(τ1−1​−1), t3=t2+x2(t2)/(τ2−1−1)t_3 = t_2 + x_2(t_2)/(\tau_2^{-1} - 1)t3​=t2​+x2​(t2​)/(τ2−1​−1), t4=t3+τ3x3(t3)t_4 = t_3 + \tau_3 x_3(t_3)t4​=t3​+τ3​x3​(t3​), t5=t4+τ4x4(t4)t_5 = t_4 + \tau_4 x_4(t_4)t5​=t4​+τ4​x4​(t4​), with t1=0t_1 = 0t1​=0. The closed form t5=(τ2+τ4)ξ/(1−τ2)t_5 = (\tau_2+\tau_4)\xi/(1-\tau_2)t5​=(τ2​+τ4​)ξ/(1−τ2​) is computed from those stage definitions and is not printed in the paper; it equals Case 1's T1T_1T1​ with every δk=0\delta_k = 0δk​=0. The set-up conditions at t5t_5t5​ are the paper's "the state of the system is a magnified version of that at time t1t_1t1​".

Preamble
import Mathlib
import Definitions.Def_KumarSeidman_Reentrant_System
import Definitions.Def_KumarSeidman_Reentrant_Trajectory
import Definitions.Def_KumarSeidman_Reentrant_Clearing
import Definitions.Def_KumarSeidman_Reentrant_Example1
Formal statement
namespace KumarSeidman.Reentrant

/-- **Example 1, Case 2: magnification** (§III, p. 292). With `τ₁, …, τ₄ > 0` satisfying
(3)–(5) and all set-up times zero, for every `ξ > 0` and every clearing trajectory started at
`x(0) = (ξ, 0, 0, 0)` with machines 1 and 2 set up for buffers 4 and 3, at the time
`t₅ = (τ₂ + τ₄)ξ/(1 - τ₂)` one has `x(t₅) = (λξ, 0, 0, 0)` with `λ = τ₄/(1 - τ₂)`, and machines
1 and 2 are again set up for buffers 4 and 3. -/
theorem case2_magnification (τ : Fin 4 → ℝ) (hτ : ∀ k, 0 < τ k)
    (h3 : 1 < τ 1 + τ 3) (h4 : τ 0 + τ 3 < 1) (h5 : τ 1 + τ 2 < 1) (ξ : ℝ) (hξ : 0 < ξ)
    (T : Trajectory (ex1 τ hτ (fun _ => 0) (fun _ => le_refl 0)))
    (hT : IsClearing (ex1 τ hτ (fun _ => 0) (fun _ => le_refl 0)) T) (h0 : Ex1Initial T ξ) :
    let t₅ := (τ 1 + τ 3) * ξ / (1 - τ 1)
    T.x (ex1Buf 0) t₅ = ex1Lambda τ * ξ ∧
    T.x (ex1Buf 1) t₅ = 0 ∧ T.x (ex1Buf 2) t₅ = 0 ∧ T.x (ex1Buf 3) t₅ = 0 ∧
    T.IsSetUpFor 0 t₅ (ex1Buf 3) ∧ T.IsSetUpFor 1 t₅ (ex1Buf 2) := by sorry

end KumarSeidman.Reentrant
Source
Kumar & Seidman, Dynamic Instabilities and Stabilization Methods in Distributed Real-Time Scheduling of Manufacturing Systems, IEEE Trans. Automat. Control 35(3), 1990, p. 292, §III Example 1, Case 2, Stages 1–4 and 'A computation shows that x₁(t₅) = λξ …'
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