Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.1 Part I — scaled cycles

Proved
DaiWeissFluid.LuKumar.scaled_cycles

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

fluid-modellu-kumarp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1priority-scheduling

Under positive service times, (5.1), and m2+m4≥1m_2+m_4\ge1m2​+m4​≥1, put r=m4/(1−m2)r=m_4/(1-m_2)r=m4​/(1−m2​) and s0=0s_0=0s0​=0, with

sn=∑j=0n−1rjm2+m41−m2.s_n=\sum_{j=0}^{n-1}r^j\frac{m_2+m_4}{1-m_2}.sn​=j=0∑n−1​rj1−m2​m2​+m4​​.

There is one Lu–Kumar priority fluid solution starting from (1,0,0,0)(1,0,0,0)(1,0,0,0) such that, for every natural number nnn,

Q(sn)=(rn,0,0,0).Q(s_n)=(r^n,0,0,0).Q(sn​)=(rn,0,0,0).

The same solution realizes every successive cycle, including the periodic boundary case r=1r=1r=1.

Formalization Note The sum is empty and equals zero at n=0n=0n=0; classes use zero-based Lean indices.

Preamble
import Mathlib
import Definitions.Def_DaiWeissFluid_LuKumar_FluidModel
import Definitions.Def_DaiWeissFluid_LuKumar_Network
Formal statement
namespace DaiWeissFluid.LuKumar

/-- The one solution realizing all scaled Lu–Kumar cycles, p. 127. -/
theorem scaled_cycles (m : Fin 4 → ℝ) (hm : ∀ k, 0 < m k)
    (h51₁ : m 0 + m 3 < 1) (h51₂ : m 1 + m 2 < 1)
    (h52 : 1 ≤ m 1 + m 3) :
    let r : ℝ := m 3 / (1 - m 1)
    let s : ℕ → ℝ := fun n => ∑ j ∈ Finset.range n,
      r ^ j * ((m 1 + m 3) / (1 - m 1))
    ∃ Q T, (luKumar m).IsPrioritySolution piLK Q T ∧
      Q 0 = ![1, 0, 0, 0] ∧
      ∀ n : ℕ, Q (s n) = ![r ^ n, 0, 0, 0] := by sorry

end DaiWeissFluid.LuKumar
Source
Dai and Weiss, Stability and instability of fluid models for reentrant lines, Math. Oper. Res. 21(1) (1996), p. 127, proof of Theorem 5.1, Part I, scaled-cycle display
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