Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

LEMMA 1 (18) — Λ_j, F_j, p_j and r_j for a linear rate with a > 0

Proved
NHPPArrivals.LinearRate.linear_pieces_pos

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

conditional-cdflinear-arrival-ratep2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let λ(t)=a+bt\lambda(t) = a + btλ(t)=a+bt on [0,T][0,T][0,T] with T>0T > 0T>0, a>0a > 0a>0, b≥0b \ge 0b≥0, and r=b/ar = b/ar=b/a. Divide [0,T][0,T][0,T] into k≥1k \ge 1k≥1 subintervals of length T/kT/kT/k and let 1≤j≤k1 \le j \le k1≤j≤k. Then

  1. Λj(t)=at(k(2+rt)+2(j−1)rT)2k\displaystyle \Lambda_j(t) = \frac{at\big(k(2 + rt) + 2(j-1)rT\big)}{2k}Λj​(t)=2kat(k(2+rt)+2(j−1)rT)​ for 0≤t≤T/k0 \le t \le T/k0≤t≤T/k;
  2. Fj(t)=t(2k+(2j−2+t)rT)2k+(2j−1)rT\displaystyle F_j(t) = \frac{t\big(2k + (2j - 2 + t)rT\big)}{2k + (2j-1)rT}Fj​(t)=2k+(2j−1)rTt(2k+(2j−2+t)rT)​ for 0≤t≤10 \le t \le 10≤t≤1;
  3. pj=2k+(2j−1)rTk2(2+rT)\displaystyle p_j = \frac{2k + (2j-1)rT}{k^2(2 + rT)}pj​=k2(2+rT)2k+(2j−1)rT​;
  4. rj=bλ((j−1)T/k)=bka(k+(j−1)rT)\displaystyle r_j = \frac{b}{\lambda((j-1)T/k)} = \frac{bk}{a\big(k + (j-1)rT\big)}rj​=λ((j−1)T/k)b​=a(k+(j−1)rT)bk​.

Here Λj\Lambda_jΛj​, FjF_jFj​, pjp_jpj​ are the subinterval cumulative rate, conditional cdf and weight of LEMMA 1, (17), and rjr_jrj​ is the relative slope of the rate on the jjj-th subinterval. These closed forms make THEOREM 5's formula (21) explicit.

Formalization Note b≥0b \ge 0b≥0 is §3.3's standing assumption. Λj\Lambda_jΛj​, FjF_jFj​, pjp_jpj​ and rjr_jrj​ are the general definitions of (17) and (18) applied to λ(t)=a+bt\lambda(t) = a + btλ(t)=a+bt; the theorem asserts that they equal the closed forms.

Preamble
import Mathlib
import Definitions.Def_NHPPArrivals_LinearRate_ConditionalCdf
Formal statement
namespace NHPPArrivals.LinearRate

theorem linear_pieces_pos (a b T : ℝ) (k : ℕ) (hT : 0 < T) (ha : 0 < a) (hb : 0 ≤ b)
    (hk : 1 ≤ k) (j : ℕ) (hj : j ∈ Finset.Icc 1 k) :
    (∀ t ∈ Set.Icc (0:ℝ) (T / k), subCum (linRate a b) T k j t =
      a * t * ((k:ℝ) * (2 + (b / a) * t) + 2 * ((j:ℝ) - 1) * (b / a) * T) / (2 * k)) ∧
    (∀ t ∈ Set.Icc (0:ℝ) 1, subCdf (linRate a b) T k j t =
      t * (2 * k + (2 * (j:ℝ) - 2 + t) * (b / a) * T) / (2 * k + (2 * (j:ℝ) - 1) * (b / a) * T)) ∧
    weight (linRate a b) T k j =
      (2 * k + (2 * (j:ℝ) - 1) * (b / a) * T) / ((k:ℝ) ^ 2 * (2 + (b / a) * T)) ∧
    subSlope a b T k j = b * k / (a * (k + ((j:ℝ) - 1) * (b / a) * T)) := by sorry

end NHPPArrivals.LinearRate
Source
Kim and Whitt, Are call center and hospital arrivals well modeled by nonhomogeneous Poisson processes?, Manufacturing Service Oper. Management 16(3), 2014, p. 472, LEMMA 1, (18)
Human review
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 27, 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