Lemma 2 (3.4), slow part, p. 31 — under Condition 1, λT² F̄_on(T)/b(λT) → 0
ProvedNetTraffic.PoissonStable.lemma_2_slowgrowth-conditionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1regular-variation
Throughout, is a probability law on satisfying (2.8): for with and slowly varying; ; is the quantile function (2.9); the connection rate is a non-decreasing function of (§3.1), and means evaluated at .
If Condition 1 holds, then
This is the estimate that makes every remainder term of order negligible against the stable normalisation .
Formalization Note Only the Condition 1 half of Lemma 2 is stated here; the Condition 2 half belongs to the companion mission on fast growth.
Preamble
import Mathlib import Definitions.Def_NetTraffic_PoissonStable_Setting
Formal statement
namespace NetTraffic.PoissonStable
open MeasureTheory ProbabilityTheory Filter Topology
theorem lemma_2_slow
{Fon : Measure ℝ} [IsProbabilityMeasure Fon] {α : ℝ} (hF : HeavyTail Fon α)
{lam : ℝ → ℝ} (hlam : ∀ T, 0 < lam T) (hmono : Monotone lam)
(hC1 : Condition1 Fon lam) :
Tendsto (fun T => lam T * T ^ 2 * Fbar Fon T / b Fon (lam T * T)) atTop (𝓝 0) := by sorry
end NetTraffic.PoissonStable
Source
Mikosch, Resnick, Rootzén and Stegeman, Is network traffic approximated by stable Lévy motion or fractional Brownian motion?, Ann. Appl. Probab. 12 (2002), p. 31, Lemma 2 (3.4), Condition 1 part
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.