Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem LL.2, p. 539 — the area A under n(t) over [0, T] is the total time in system during [0, T] of the S(T) items, so W = A/S(T)

Proved
LittleLaw50.FiniteWindow.area_eq_sum_timeInWindow

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

littles-lawp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1queueing-theory

Consider one sample path observed over [0,T][0, T][0,T] with T>0T > 0T>0: items i=1,…,Mi = 1, \dots, Mi=1,…,M arrive at aia_iai​ and leave at di≥aid_i \ge a_idi​≥ai​, items may be present at time 000 and at time TTT, and n(t)n(t)n(t) is the number of items in the system at time ttt. Let S(T)S(T)S(T) be the number of items in the system over [0,T][0, T][0,T] (those present at 000 plus those arriving in [0,T][0, T][0,T]), let wi(T)=max⁡(0,min⁡(di,T)−max⁡(ai,0))w_i(T) = \max(0, \min(d_i, T) - \max(a_i, 0))wi​(T)=max(0,min(di​,T)−max(ai​,0)) be the time item iii spends in the system during [0,T][0, T][0,T], and let W(T)W(T)W(T) be the average of the wi(T)w_i(T)wi​(T) over the S(T)S(T)S(T) counted items. Then

A=∫0Tn(t) dt=∑i counted in S(T)wi(T),and henceW(T)=AS(T).A = \int_0^T n(t)\,dt = \sum_{i \text{ counted in } S(T)} w_i(T), \qquad\text{and hence}\qquad W(T) = \frac{A}{S(T)}.A=∫0T​n(t)dt=i counted in S(T)∑​wi​(T),and henceW(T)=S(T)A​.

This is the step "W=A/S(T)W = A/S(T)W=A/S(T)" of the paper's proof of Theorem LL.2: the area under n(t)n(t)n(t) is used once to compute LLL and once to compute WWW, because an item in the system during [0,T][0, T][0,T] accumulates time in system exactly while it is counted by n(t)n(t)n(t). Truncation at the window's edges is what makes the identity exact even with nonzero starting and ending queues.

Formalization Note Presence is half-open, [ai,di)[a_i, d_i)[ai​,di​). Items that leave by time 000 or arrive after TTT are in the family but are not counted in S(T)S(T)S(T) and contribute wi(T)=0w_i(T) = 0wi​(T)=0. When S(T)=0S(T) = 0S(T)=0, both AAA and Lean's value of W(T)W(T)W(T) are 000.

Preamble
import Mathlib
import Definitions.Def_KellyStochasticNetworks_Migration
import Definitions.Def_LittleLaw50_FiniteWindow_Window
Formal statement
namespace LittleLaw50.FiniteWindow

/-- **Proof of Theorem LL.2** (Little 2011, p. 539), display `W = A/S(T)`. The area
`A = ∫₀ᵀ n(t) dt` equals the total time that the `S(T)` counted items spend in the system during
`[0, T]`, and hence `W(T) = A / S(T)`. -/
theorem area_eq_sum_timeInWindow {M : ℕ} (a d : Fin M → ℝ) (T : ℝ) (hT : 0 < T)
    (had : ∀ i, a i ≤ d i) :
    area Finset.univ a d T
        = ∑ i ∈ countedItems Finset.univ a d T, timeInWindow a d T i ∧
      Ww Finset.univ a d T = area Finset.univ a d T / cumCount Finset.univ a d T := by sorry

end LittleLaw50.FiniteWindow
Source
Little, Little's Law as Viewed on Its 50th Anniversary, Oper. Res. 59(3) (2011), DOI 10.1287/opre.1110.0940, p. 539, proof of Theorem LL.2, display W = A/S(T)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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