Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1: under CAF and (14), the buffers of machines in minimal classes are bounded

Proved
KumarSeidman.CAF.minimal_class_bounded

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

clear-a-fractionmanufacturing-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′​, from any initial state. If the class of machine mmm is minimal for the partial order on diconnected classes (no other class has a path into it), then every buffer of mmm is bounded over all time:

sup⁡0≤t<∞xp,i(t)<+∞for every (p,i) with μp,i=m.\sup_{0\le t<\infty}x_{p,i}(t)<+\infty\qquad\text{for every } (p,i)\text{ with } \mu_{p,i}=m .0≤t<∞sup​xp,i​(t)<+∞for every (p,i) with μp,i​=m.

This is the base case of the induction over the classes of machines that proves Theorem 1.

Formalization Note The bound may depend on the trajectory. Minimality is stated as: every machine from which mmm is reachable is reachable from mmm.

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

/-- Boundedness on the minimal classes (p. 295): under (14) and a CAF policy, the levels of
the buffers of every machine `m` whose class is minimal are bounded on `[0, ∞)`. -/
theorem minimal_class_bounded {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) :
    ∀ b ∈ S.B m, ∃ C : ℝ, ∀ t : ℝ, 0 ≤ t → T.x b t ≤ C := 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, boundedness on the minimal elements G_1, …, G_l
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