§2.2.3, Corollary (3)(a), p. 539 — L_k = λ_k W_k for every class k of items
ProvedLittleLaw50.FiniteWindow.corollary_3aConsider one sample path observed over with , items with arrival times and departure times , possibly present at and at . The items are divided into mutually exclusive classes by a class assignment . For a class , let , , be the LL parameters computed from the class- items alone: with and the number of class- items in the system at ; with the number of class- items in the system over ; and the average over those items of their time in the system during . Then for every class ,
Little's Law therefore holds for each market segment separately, which is how it is applied to multiclass systems in practice.
Formalization Note The class assignment is a function from items to , which makes the classes disjoint and exhaustive. The conventions are those of Theorem LL.2: half-open presence, truncated times in window, and Lean's value for when (then both sides are ).
import Mathlib import Definitions.Def_KellyStochasticNetworks_Migration import Definitions.Def_LittleLaw50_FiniteWindow_Window
namespace LittleLaw50.FiniteWindow
/-- **§2.2.3, Corollary (3)(a)** (Little 2011, p. 539). Items are split into `K` mutually
exclusive classes by `c`. For every class `k`, the LL parameters computed from the class-`k`
items alone satisfy `L_k = λ_k W_k`. -/
theorem corollary_3a {M K : ℕ} (a d : Fin M → ℝ) (c : Fin M → Fin K) (T : ℝ) (hT : 0 < T)
(had : ∀ i, a i ≤ d i) (k : Fin K) :
Lw (classItems c k) a d T
= lamw (classItems c k) a d T * Ww (classItems c k) a d T := by sorry
end LittleLaw50.FiniteWindow
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.