Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Example 1, Case 1, p. 292 — from (ξ, 0, 0, 0) the clearing policy returns to (λξ + β, 0, 0, 0) at T₁ = (λ + τ₂/(1 − τ₂))ξ + α

Proved
KumarSeidman.Reentrant.case1_cycle_map

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 the critical condition and the capacity conditions

τ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 positive set-up times δ1,δ2,δ3,δ4>0\delta_1, \delta_2, \delta_3, \delta_4 > 0δ1​,δ2​,δ3​,δ4​>0. Let λ,α,β\lambda, \alpha, \betaλ,α,β be as in Example 1.

Then there is ξ0\xi_0ξ0​ such that for every ξ>0\xi > 0ξ>0 with ξ≥ξ0\xi \ge \xi_0ξ≥ξ0​ the following holds. 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

T1:=(λ+τ21−τ2)ξ+αT_1 := \Bigl(\lambda + \frac{\tau_2}{1-\tau_2}\Bigr)\xi + \alphaT1​:=(λ+1−τ2​τ2​​)ξ+α

one has

x(T1)=(λξ+β, 0, 0, 0),x(T_1) = (\lambda\xi + \beta,\ 0,\ 0,\ 0),x(T1​)=(λξ+β, 0, 0, 0),

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

This is one full cycle of the clearing policy: the system returns to a state of the same shape with buffer 1 multiplied by λ>1\lambda > 1λ>1 and increased by β\betaβ, which drives the instability of Example 1.

Formalization Note The paper states the cycle from an arbitrary start time T0T_0T0​; it is stated here from T0=0T_0 = 0T0​=0, the initial state of Case 1 (t1=0t_1 = 0t1​=0). "Set up for" at T1T_1T1​ means the run of the machine that started before T1T_1T1​ and has not been replaced before T1T_1T1​: at T1T_1T1​ machine 1 is commencing its set-up for buffer 1. The threshold ξ0\xi_0ξ0​ may depend on τ\tauτ and δ\deltaδ ("ξ>0\xi > 0ξ>0 is large enough").

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: the cycle map** (§III, p. 292). With `τ₁, …, τ₄ > 0` satisfying
(3)–(5) and set-up times `δ₁, …, δ₄ > 0`, there is `ξ₀` such that for every `ξ > 0` with
`ξ ≥ ξ₀` 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)` and machines 1 and 2 are again set up for buffers 4 and 3, where
`λ = τ₄/(1 - τ₂)`, `α = (τ₄ + 1)(δ₁ + δ₂)/(1 - τ₂) + δ₃(τ₄ + 1) + δ₄` and
`β = τ₄(δ₁ + δ₂)/(1 - τ₂) + τ₄δ₃ + δ₄`. -/
theorem case1_cycle_map (τ : 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 ξ →
          let T₁ := (ex1Lambda τ + τ 1 / (1 - τ 1)) * ξ + ex1Alpha τ δ
          T.x (ex1Buf 0) T₁ = ex1Lambda τ * ξ + ex1Beta τ δ ∧
          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 1 (t₁₃, λ, α, β and the paragraph 'The important feature to note …')
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