THEOREM 2, p. 986 — under (i), (ii), (v), 0 < λ < ∞ and finite G⁺, G⁻: G and H exist and H = λG
ProvedHeymanStidham.HLG.theorem_2Let be the arrival epochs of customers , and the number of with . Customer carries a real-valued (possibly negative) function on . Write , , , and . Assume that for each there is such that
- (i) for ;
- (ii) ;
- (v) .
If , and exist, with , and , then exists and equals , exists, and
This is the main result of the paper: a sample-path relation between the time average of and the customer average of the , valid for signed under the mild support condition (i)–(ii). It contains Theorem 1 () and Little's law .
Formalization Note The statement is about one fixed sample path; the paper's "with probability one" is this statement applied to almost every path. Customers are 0-based in Lean, so (ii) reads ; ties between arrival epochs are allowed. (v) is integrability of on . The page's (1) speaks of , which the hypotheses do not give directly; its existence and value (shown in the proof, display (6)) are the first part of the conclusion. " exists" includes integrability of on every , so a non-integrable cannot have "time average" . is the full infinite sum over all customers. is the cardinality of , finite because .
import Mathlib import Definitions.Def_HeymanStidham_HLG_Setting open Filter Topology MeasureTheory
namespace HeymanStidham.HLG
/-- THEOREM 2, p. 986: under (i), (ii) and (v) `∫₀^∞ |fₙ| < ∞`, if `λ`, `G⁺`, `G⁻` exist
with `0 < λ < ∞` and `G⁺, G⁻ < ∞`, then `G = G⁺ − G⁻` exists, `H` exists, and
`H = λG` (1). -/
theorem theorem_2 (t : ℕ → ℝ) (ht : Monotone t) (ht0 : 0 ≤ t 0)
(f : ℕ → ℝ → ℝ) (s : ℕ → ℝ) (hI : CondI t f s) (hII : CondII s)
(lam : ℝ) (hlam : 0 < lam) (hrate : IsArrivalRate t lam)
(hv : ∀ n, IntegrableOn (f n) (Set.Ici 0))
(Gp Gm : ℝ)
(hGp : IsCustomerAverage (custTotal (posPartFn f)) Gp)
(hGm : IsCustomerAverage (custTotal (negPartFn f)) Gm) :
IsCustomerAverage (custTotal f) (Gp - Gm) ∧
IsTimeAverage (rate f) (lam * (Gp - Gm)) := by sorry
end HeymanStidham.HLG
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.