Theorem LL.1 (Little's Law), p. 537 — L = λW for a sample path observed over [0, T] that is empty at 0 and T
ProvedLittleLaw50.FiniteWindow.theorem_LL1Consider one sample path of a queuing system observed over with . Items arrive at times and leave at times , and the system is empty at and : every item arrives and leaves within the window,
Let be the number of items in the system at time , , the number of items arriving in , the average number in the system, the average arrival rate, and the average wait of an item. Then
The result holds for every sample path: no stationarity, no queue discipline and no service mechanism is assumed. It is the special case of Theorem LL.2 in which no item is present at either end of the window, and the case the paper motivates by a supermarket that is empty at opening and closing time.
Formalization Note The phrase "empty at and " is read as for every item of the family, the hypothesis of the published cycle identity KellyStochasticNetworks.littles_law_cycle_identity; under it . Presence is the half-open interval , so an item arriving exactly at is in the system at time ; the reading therefore also admits such paths (with ), a slightly more permissive hypothesis than under which the same identity holds. is the average of the individual waits, not . If the paper's is undefined; Lean's is and both sides equal , so no hypothesis is needed.
import Mathlib import Definitions.Def_KellyStochasticNetworks_Migration import Definitions.Def_LittleLaw50_FiniteWindow_EmptyWindow
namespace LittleLaw50.FiniteWindow
/-- **Theorem LL.1** (Little 2011, p. 537). A sample path observed over `[0, T]`, `0 < T`, that is
empty at `0` and `T`: every item arrives and leaves within `[0, T]`. Then `L = λ W`, with `L = A/T`
the time average of `n(t)`, `λ = N/T` and `W` the average of the waits `Wᵢ = dᵢ − aᵢ`. -/
theorem theorem_LL1 {M : ℕ} (a d : Fin M → ℝ) (T : ℝ) (hT : 0 < T)
(hempty : ∀ i, 0 ≤ a i ∧ a i ≤ d i ∧ d i ≤ T) :
L_LL1 a d T = lam_LL1 a T * W_LL1 a d T := by sorry
end LittleLaw50.FiniteWindow
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.