Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1, induction step: V_m(T_{n+1}) ≤ max{Γ̄, V_m(T_n) − (1 − ρ′_m)(T_{n+1} − T_n) + δ̄ + Γ̄}

Proved
KumarSeidman.CAF.induction_recurrence

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

clearing-policylyapunov-functionmanufacturing-systemsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stability

Let the system satisfy (14) and consider a trajectory under a clearing policy. Let UUU be a set of machines closed upstream (a machine with an arc into UUU lies in UUU) such that the total content of the buffers of the machines in UUU never exceeds Γ\GammaΓ:

∑(p,i): μp,i∈Uxp,i(t)≤Γfor all t≥0.\sum_{(p,i):\,\mu_{p,i}\in U}x_{p,i}(t)\le\Gamma\qquad\text{for all } t\ge0 .(p,i):μp,i​∈U∑​xp,i​(t)≤Γfor all t≥0.

Let m∉Um\notin Um∈/U be a machine whose class is minimal among the machines outside UUU, and let Tn,Tn+1T_n,T_{n+1}Tn​,Tn+1​ be consecutive set-up commencements of mmm. Then

Vm(Tn+1) ≤ max⁡{Γˉ, Vm(Tn)−(1−ρm′)(Tn+1−Tn)+δˉ+Γˉ},Γˉ=∑(p,i): μp,i=m, μp,i−1≠mΓ [τp,i+⋯+τp,i+ηp,i−1].V_m(T_{n+1})\ \le\ \max\big\{\bar\Gamma,\ V_m(T_n)-(1-\rho'_m)(T_{n+1}-T_n)+\bar\delta+\bar\Gamma\big\}, \qquad \bar\Gamma=\sum_{(p,i):\,\mu_{p,i}=m,\ \mu_{p,i-1}\ne m}\Gamma\,\big[\tau_{p,i}+\dots+\tau_{p,i+\eta_{p,i}-1}\big].Vm​(Tn+1​) ≤ max{Γˉ, Vm​(Tn​)−(1−ρm′​)(Tn+1​−Tn​)+δˉ+Γˉ},Γˉ=(p,i):μp,i​=m, μp,i−1​=m∑​Γ[τp,i​+⋯+τp,i+ηp,i​−1​].

This generalizes (17)–(18) to the machines of the next layer of classes, once the upstream layers are known to be bounded, and carries the induction of the proof of Theorem 1.

Formalization Note Three readings. (i) The paper's Γ\GammaΓ is "a bound on the buffers of such machines"; the inflow bound (23) it is used in requires a bound on their total content, which is what is assumed (a bound on each buffer separately would give (i−1)Γ(i-1)\Gamma(i−1)Γ in (23)). (ii) The printed bound has the set-up time δbpn∗,in∗\delta_{b_{p^*_n,i^*_n}}δbpn∗​,in∗​​​ with an index missing; the statement uses δˉ\bar\deltaδˉ, which dominates the set-up time actually paid at TnT_nTn​, as in (18). (iii) Only the outer (simplified) inequality of the printed chain is stated. The classes already shown bounded are represented by an upstream-closed set UUU. Tn=skT_n=s_kTn​=sk​, Tn+1=sk+1T_{n+1}=s_{k+1}Tn+1​=sk+1​ with k≥1k\ge1k≥1.

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

/-- The recurrence of the induction step of the proof of Theorem 1 (p. 295, generalizing
(17)). Let `U` be an upstream-closed set of machines whose buffers have total content at most
`Γ` at all times `t ≥ 0`, and let `m ∉ U` be a machine whose class is minimal among the
machines outside `U`. Under (14) and a clearing policy, for two consecutive set-up
commencements `T_n = s_k`, `T_{n+1} = s_{k+1}` (`k ≥ 1`) at `m`,
`V_m(T_{n+1}) ≤ max {Γ̄, V_m(T_n) − (1 − ρ'_m)(T_{n+1} − T_n) + δ̄ + Γ̄}`,
with `Γ̄ = Σ_{(p,i): μ_{p,i} = m, μ_{p,i−1} ≠ m} Γ [τ_{p,i} + ⋯ + τ_{p,i+η_{p,i}−1}]`. -/
theorem induction_recurrence {P M : ℕ} (S : System P M) (h14 : S.StringentCapacityCondition)
    (T : Trajectory S) (hT : T.IsClearing) (U : Finset (Fin M)) (hU : S.UpstreamClosed U)
    (Γ : ℝ) (hΓ : ∀ t : ℝ, 0 ≤ t →
      ∑ b ∈ Finset.univ.filter (fun b : Buffer S => S.mach b ∈ U), T.x b t ≤ Γ)
    (m : Fin M) (hmU : m ∉ U) (hmin : ∀ m' : Fin M, m' ∉ U → S.Reach m' m → S.Reach m m')
    (k : ℕ) (hk : 1 ≤ k) (hnext : T.HasNext m k) :
    T.V m (T.s m (k + 1)) ≤
      max (S.GammaBar m Γ) (T.V m (T.s m k) - (1 - S.rhoPrime m) * (T.s m (k + 1) - T.s m k)
        + S.deltaBar m + S.GammaBar m Γ) := 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, induction step, (23) and the display after it
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