Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.2.3, Corollary (3)(a), p. 539 — L_k = λ_k W_k for every class k of items

Proved
LittleLaw50.FiniteWindow.corollary_3a

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 0<T<∞0 < T < \infty0<T<∞, items i=1,…,Mi = 1, \dots, Mi=1,…,M with arrival times aia_iai​ and departure times di≥aid_i \ge a_idi​≥ai​, possibly present at 000 and at TTT. The items are divided into mutually exclusive classes k=1,…,Kk = 1, \dots, Kk=1,…,K by a class assignment ccc. For a class kkk, let LkL_kLk​, λk\lambda_kλk​, WkW_kWk​ be the LL parameters computed from the class-kkk items alone: Lk=Ak/TL_k = A_k/TLk​=Ak​/T with Ak=∫0Tnk(t) dtA_k = \int_0^T n_k(t)\,dtAk​=∫0T​nk​(t)dt and nk(t)n_k(t)nk​(t) the number of class-kkk items in the system at ttt; λk=Sk(T)/T\lambda_k = S_k(T)/Tλk​=Sk​(T)/T with Sk(T)S_k(T)Sk​(T) the number of class-kkk items in the system over [0,T][0, T][0,T]; and WkW_kWk​ the average over those Sk(T)S_k(T)Sk​(T) items of their time in the system during [0,T][0, T][0,T]. Then for every class kkk,

Lk=λkWk.L_k = \lambda_k W_k.Lk​=λk​Wk​.

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 {1,…,K}\{1, \dots, K\}{1,…,K}, 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 000 for WkW_kWk​ when Sk(T)=0S_k(T) = 0Sk​(T)=0 (then both sides are 000).

Preamble
import Mathlib
import Definitions.Def_KellyStochasticNetworks_Migration
import Definitions.Def_LittleLaw50_FiniteWindow_Window
Formal statement
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
Source
Little, Little's Law as Viewed on Its 50th Anniversary, Oper. Res. 59(3) (2011), DOI 10.1287/opre.1110.0940, p. 539, §2.2.3, Corollary (3)(a)
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