Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Example 1, Case 1, pp. 291–292 — with positive set-up times, clearing is unstable on the re-entrant line for large initial backlog

Proved
KumarSeidman.Reentrant.example1_case1_unstable

by tianyipeng · Nov 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

instabilitymanufacturing-systemsscheduling

Consider the re-entrant line of Example 1: one part type arriving at rate 111 visits machine 1, machine 2, machine 2 and machine 1, through buffers 1,2,3,41,2,3,41,2,3,4, 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,\tau_2+\tau_4>1,\qquad \tau_1+\tau_4<1,\qquad \tau_2+\tau_3<1,τ2​+τ4​>1,τ1​+τ4​<1,τ2​+τ3​<1,

and with positive set-up times δ1,…,δ4>0\delta_1,\dots,\delta_4>0δ1​,…,δ4​>0 (δk\delta_kδk​ is the time to set a machine up for buffer kkk).

Case 1. There is ξ0\xi_0ξ0​ such that for every ξ>0\xi>0ξ>0 with ξ≥ξ0\xi\ge\xi_0ξ≥ξ0​, a clearing trajectory starting from x(0)=(ξ,0,0,0)x(0)=(\xi,0,0,0)x(0)=(ξ,0,0,0), with machine 1 set up for buffer 4 and machine 2 set up for buffer 3, exists. Moreover, along every such trajectory

sup⁡0≤t<∞x1(t)=+∞.\sup_{0\le t<\infty} x_1(t)=+\infty .0≤t<∞sup​x1​(t)=+∞.

This is the first half (Case 1) of the mission's goal theorem example1_clearing_unstable. The paper proves it through the cycle map x(T0)=(ξ,0,0,0)↦x(T1)=(λξ+β,0,0,0)x(T_0)=(\xi,0,0,0)\mapsto x(T_1)=(\lambda\xi+\beta,0,0,0)x(T0​)=(ξ,0,0,0)↦x(T1​)=(λξ+β,0,0,0) with λ=τ4/(1−τ2)>1\lambda=\tau_4/(1-\tau_2)>1λ=τ4​/(1−τ2​)>1. Unboundedness is formalized as: for every CCC there is t≥0t\ge 0t≥0 with x1(t)>Cx_1(t)>Cx1​(t)>C. The existence half makes the universal half non-vacuous.

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 1** (Kumar–Seidman 1990, §III, pp. 291–292). On the re-entrant line of
Example 1 with processing times `τ₁, …, τ₄ > 0` (Lean `τ 0, …, τ 3`) satisfying (3)
`τ₂ + τ₄ > 1`, (4) `τ₁ + τ₄ < 1` and (5) `τ₂ + τ₃ < 1`, and positive set-up times
`δ₁, …, δ₄ > 0`, there is `ξ₀` such that for every `ξ > 0` with `ξ ≥ ξ₀` a clearing trajectory
from `x(0) = (ξ, 0, 0, 0)` (machine 1 set up for buffer 4, machine 2 for buffer 3) exists, and
along every such trajectory the level `x₁` of buffer 1 is unbounded on `[0, ∞)`. -/
theorem example1_case1_unstable (τ : Fin 4 → ℝ) (hτ : ∀ k, 0 < τ k)
    (h3 : 1 < τ 1 + τ 3) (h4 : τ 0 + τ 3 < 1) (h5 : τ 1 + τ 2 < 1)
    (δ : Fin 4 → ℝ) (hδ : ∀ k, 0 < δ k) :
    ∃ ξ₀ : ℝ, ∀ ξ : ℝ, 0 < ξ → ξ₀ ≤ ξ →
      (∃ T : Trajectory (ex1 τ hτ δ (fun k => (hδ k).le)),
        IsClearing (ex1 τ hτ δ (fun k => (hδ k).le)) T ∧ Ex1Initial T ξ) ∧
      ∀ T : Trajectory (ex1 τ hτ δ (fun k => (hδ k).le)),
        IsClearing (ex1 τ hτ δ (fun k => (hδ k).le)) T → Ex1Initial T ξ →
          ∀ C : ℝ, ∃ t : ℝ, 0 ≤ t ∧ C < T.x (ex1Buf 0) t := 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, pp. 291–292, §III Example 1, Case 1

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