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)
ProvedLittleLaw50.FiniteWindow.area_eq_sum_timeInWindowConsider one sample path observed over with : items arrive at and leave at , items may be present at time and at time , and is the number of items in the system at time . Let be the number of items in the system over (those present at plus those arriving in ), let be the time item spends in the system during , and let be the average of the over the counted items. Then
This is the step "" of the paper's proof of Theorem LL.2: the area under is used once to compute and once to compute , because an item in the system during accumulates time in system exactly while it is counted by . 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, . Items that leave by time or arrive after are in the family but are not counted in and contribute . When , both and Lean's value of are .
import Mathlib import Definitions.Def_KellyStochasticNetworks_Migration import Definitions.Def_LittleLaw50_FiniteWindow_Window
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.