Equation (2.6) — the cycle identity behind Little's law
ProvedKellyStochasticNetworks.littles_law_cycle_identityLittle's law, , relates the mean number of customers in a system, the mean arrival rate and the mean time a customer spends in the system. Given the three defining limits, the book's proof reduces it to a single pathwise identity over one regeneration cycle , equation (2.6):
where is the number of customers present at time , is the number of customers arriving in the cycle, and is the time customer spends in the system. That identity is what is asserted here.
Let customers have arrival times and departure times satisfying , and let
be the number present at time . Then
Both sides compute the shaded area of Figure 2.7: the left as an integral over time, the right as a sum over customers. Equivalently, if each customer pays at rate per unit time while in the system, the two sides are the total paid during the cycle, computed in two ways.
Formalization Note The count is written as a finite sum of indicator functions of the half-open intervals , which is exactly the number of customers present. The hypothesis says every customer who arrives in the cycle also departs within it, which is the assumption of the book's regeneration point; the hypothesis excludes a customer departing before arriving. Nothing probabilistic is involved: this is the pathwise half of Little's law, and the three limit statements the book quotes from renewal theory are not part of it.
import Mathlib import Definitions.Def_KellyStochasticNetworks_Migration
namespace KellyStochasticNetworks
theorem littles_law_cycle_identity {N : ℕ} (T : ℝ) (a d : Fin N → ℝ)
(ha : ∀ i, 0 ≤ a i) (had : ∀ i, a i ≤ d i) (hd : ∀ i, d i ≤ T) :
(∫ s in (0:ℝ)..T, occupancy a d s) = ∑ i, (d i - a i) := by sorry
end KellyStochasticNetworksConfirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.