Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 6.1 — an empty station has the smaller Lyapunov component (condition (b))

Proved
DaiWeissFluid.KellyType.condition_b

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

fluid-modelkelly-networklyapunov-methodsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let a two-station reentrant line have no immediate feedback (σ(k+1)≠σ(k)\sigma(k+1) \ne \sigma(k)σ(k+1)=σ(k)), positive mean service times, and any number KKK of classes; the route may start at either station. Let (Q,T)(Q,T)(Q,T) be a fluid model solution and Gi(t)=∑k∈CiQk+(t)G_i(t) = \sum_{k \in C_i} Q_k^+(t)Gi​(t)=∑k∈Ci​​Qk+​(t). For every t≥0t \ge 0t≥0 and the two stations i≠ji \ne ji=j,

Wi(t)=0 ⟹ Gi(t)≤Gj(t),W_i(t) = 0 \ \Longrightarrow\ G_i(t) \le G_j(t),Wi​(t)=0 ⟹ Gi​(t)≤Gj​(t),

with equality Gi(t)=Gj(t)G_i(t) = G_j(t)Gi​(t)=Gj​(t) when, in addition, the route starts at station jjj (σ(1)=j\sigma(1) = jσ(1)=j) and ends at station iii (σ(K)=i\sigma(K) = iσ(K)=i).

For K=2nK = 2nK=2n with the route starting at station 1, this is the paper's pair: when W1(t)=0W_1(t) = 0W1​(t)=0, G1(t)=∑l=2nQ2l−2+(t)≤∑l=1nQ2l+(t)=G2(t)G_1(t) = \sum_{l=2}^n Q^+_{2l-2}(t) \le \sum_{l=1}^n Q^+_{2l}(t) = G_2(t)G1​(t)=∑l=2n​Q2l−2+​(t)≤∑l=1n​Q2l+​(t)=G2​(t), and when W2(t)=0W_2(t) = 0W2​(t)=0, G2(t)=∑l=1nQ2l−1+(t)=G1(t)G_2(t) = \sum_{l=1}^n Q^+_{2l-1}(t) = G_1(t)G2​(t)=∑l=1n​Q2l−1+​(t)=G1​(t). It is condition (b) of Lemma 3.2 for the Lyapunov components of Theorem 6.1.

Formalization Note The statement covers both parities of KKK (the paper treats K=2nK = 2nK=2n and says K=2n+1K = 2n+1K=2n+1 "can be proved similarly") and both starting stations. Kelly type is not needed for this step. Indices are 0-based.

Preamble
import Mathlib
import Definitions.Def_DaiWeissFluid_KellyType_FluidModel
import Definitions.Def_DaiWeissFluid_KellyType_KellyLine
Formal statement
namespace DaiWeissFluid.KellyType

/-- Proof of Theorem 6.1, p. 130: in a two-station reentrant line without immediate feedback
(any number `K` of classes, the route starting at either station), along every fluid solution and
for `t ≥ 0`, if station `i` is empty (`W_i(t) = 0`) then `G_i(t) ≤ G_j(t)` for the other
station `j`, where `G_i(t) = ∑_{k ∈ C_i} Q_k⁺(t)`; and `G_i(t) = G_j(t)` when moreover the route
starts at `j` and ends at `i` (for `K = 2n` starting at station 1 this is the printed
`W₂(t) = 0 ⇒ G₂(t) = G₁(t)`). -/
theorem condition_b {K : ℕ} (L : ReentrantLine 2 K) (hm : ∀ k, 0 < L.m k)
    (hfb : L.NoImmediateFeedback)
    (Q T : ℝ → Fin K → ℝ) (hsol : L.IsFluidSolution Q T) (t : ℝ) (ht : 0 ≤ t)
    (i j : Fin 2) (hij : i ≠ j) :
    L.volume Q i t = 0 →
      L.kellyG Q i t ≤ L.kellyG Q j t ∧
        ((hK : 0 < K) → L.σ ⟨0, hK⟩ = j → L.σ ⟨K - 1, by omega⟩ = i →
          L.kellyG Q i t = L.kellyG Q j t) := by sorry

end DaiWeissFluid.KellyType
Source
Dai and Weiss, Stability and instability of fluid models for reentrant lines, Math. Oper. Res. 21(1) (1996), p. 130, proof of Theorem 6.1 ("When W₁(t) = 0, …")
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