Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1: V_m(T_n) ≥ Γ_m implies V_m(T_{n+1}) ≤ V_m(T_n) − δ̄ on minimal classes

Proved
KumarSeidman.CAF.gamma_implication

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

clear-a-fractionlyapunov-functionmanufacturing-systemsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stability

Let the system satisfy (14) and consider a trajectory under a CAF policy with constants εm′>0\varepsilon_{m'}>0εm′​>0, Km′K_{m'}Km′​. Let mmm be a machine whose class is minimal, with Bm≠∅B_m\neq\emptysetBm​=∅, and let Tn,Tn+1T_n,T_{n+1}Tn​,Tn+1​ be consecutive set-up commencements of mmm. With

Γm=max⁡(2δˉτˉεmτ‾(1−ρm′)+Kmτˉεm, δˉ),\Gamma_m=\max\Big(\frac{2\bar\delta\bar\tau}{\varepsilon_m\underline\tau(1-\rho'_m)}+\frac{K_m\bar\tau}{\varepsilon_m},\ \bar\delta\Big),Γm​=max(εm​τ​(1−ρm′​)2δˉτˉ​+εm​Km​τˉ​, δˉ),

where τˉ\bar\tauτˉ is the largest remaining work at mmm of a part in a buffer of mmm and τ‾\underline\tauτ​ the smallest processing time at mmm, one has

Vm(Tn) ≥ Γm⟹Vm(Tn+1) ≤ Vm(Tn)−δˉ.V_m(T_n)\ \ge\ \Gamma_m\quad\Longrightarrow\quad V_m(T_{n+1})\ \le\ V_m(T_n)-\bar\delta .Vm​(Tn​) ≥ Γm​⟹Vm​(Tn+1​) ≤ Vm​(Tn​)−δˉ.

This is the step that yields ultimate boundedness of VmV_mVm​ at set-up epochs: above the explicit level Γm\Gamma_mΓm​, VmV_mVm​ cannot increase from one set-up commencement to the next.

Formalization Note Tn=skT_n=s_kTn​=sk​, Tn+1=sk+1T_{n+1}=s_{k+1}Tn+1​=sk+1​ with k≥1k\ge1k≥1. All divisions are by positive quantities: εm>0\varepsilon_m>0εm​>0 (CAF), τ‾>0\underline\tau>0τ​>0, 1−ρm′>01-\rho'_m>01−ρm′​>0 (14). KmK_mKm​ is any real. When δˉ=0\bar\delta=0δˉ=0 the conclusion reads Vm(Tn+1)≤Vm(Tn)V_m(T_{n+1})\le V_m(T_n)Vm​(Tn+1​)≤Vm​(Tn​).

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 `Γ_m` implication (p. 295, after (22)): under (14) and a CAF policy with constants
`ε, K`, for a machine `m` whose class is minimal and two consecutive set-up commencements
`T_n = s_k`, `T_{n+1} = s_{k+1}` (`k ≥ 1`) at `m`,
`V_m(T_n) ≥ Γ_m ⇒ V_m(T_{n+1}) ≤ V_m(T_n) − δ̄`, where
`Γ_m = max (2 δ̄ τ̄ / (ε_m τ̲ (1 − ρ'_m)) + K_m τ̄ / ε_m, δ̄)`. -/
theorem gamma_implication {P M : ℕ} (S : System P M) (h14 : S.StringentCapacityCondition)
    (ε K : Fin M → ℝ) (T : Trajectory S) (hT : T.IsCAF ε K) (m : Fin M)
    (hmin : S.IsMinimal m) (hB : (S.B m).Nonempty) (k : ℕ) (hk : 1 ≤ k)
    (hnext : T.HasNext m k) (hV : S.Gamma m hB ε K ≤ T.V m (T.s m k)) :
    T.V m (T.s m (k + 1)) ≤ T.V m (T.s m k) - S.deltaBar 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, display after (22) with Γ_m
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