Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.4, pp. 37–38 — λT P(j₁ > b(λT)x) → x^{−α} for every x > 0

Disproved
NetTraffic.PoissonStable.tail_j1

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

heavy-tailsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1point-processesregular-variation

Throughout, FonF_{\mathrm{on}}Fon​ is a probability law on [0,∞)[0,\infty)[0,∞) satisfying (2.8): Fˉon(x)=x−αL(x)\bar F_{\mathrm{on}}(x)=x^{-\alpha}L(x)Fˉon​(x)=x−αL(x) for x>0x>0x>0 with 1<α<21<\alpha<21<α<2 and LLL slowly varying; μon=∫x Fon(dx)\mu_{\mathrm{on}}=\int x\,F_{\mathrm{on}}(dx)μon​=∫xFon​(dx); b=(1/Fˉon)←b=(1/\bar F_{\mathrm{on}})^{\leftarrow}b=(1/Fˉon​)← is the quantile function (2.9); the connection rate λ=λ(T)>0\lambda=\lambda(T)>0λ=λ(T)>0 is a non-decreasing function of TTT (§3.1), and b(λT)b(\lambda T)b(λT) means bbb evaluated at λ(T) T\lambda(T)\,Tλ(T)T. Let m1=(L×Fon)(R1)m_1=(\mathbb L\times F_{\mathrm{on}})(R_1)m1​=(L×Fon​)(R1​) with R1={(s,y):0<s≤T, y>0, s+y≤T}R_1=\{(s,y):0<s\le T,\ y>0,\ s+y\le T\}R1​={(s,y):0<s≤T, y>0, s+y≤T} and let j1j_1j1​ have the law (4.4): the second marginal of L(ds)Fon(dy)/m1\mathbb L(ds)F_{\mathrm{on}}(dy)/m_1L(ds)Fon​(dy)/m1​ restricted to R1R_1R1​.

If Condition 1 holds, then for every x>0x>0x>0

λT P(j1>b(λT) x)⟶x−α(T→∞).\lambda T\,P\big(j_1>b(\lambda T)\,x\big)\longrightarrow x^{-\alpha}\qquad(T\to\infty).λTP(j1​>b(λT)x)⟶x−α(T→∞).

This tail limit identifies the Lévy measure αx−α−1dx\alpha x^{-\alpha-1}dxαx−α−1dx on (0,∞)(0,\infty)(0,∞) of the limiting totally skewed stable law.

Formalization Note The statement is deterministic: it concerns FonF_{\mathrm{on}}Fon​, λ\lambdaλ and the law (4.4) only.

Preamble
import Mathlib
import Definitions.Def_NetTraffic_PoissonStable_Setting
Formal statement
namespace NetTraffic.PoissonStable

open MeasureTheory ProbabilityTheory Filter Topology

theorem tail_j1
    {Fon : Measure ℝ} [IsProbabilityMeasure Fon] {α : ℝ} (hF : HeavyTail Fon α)
    {lam : ℝ → ℝ} (hlam : ∀ T, 0 < lam T) (hmono : Monotone lam)
    (hC1 : Condition1 Fon lam) :
    ∀ x : ℝ, 0 < x →
      Tendsto (fun T => lam T * T * (j1Law Fon T).real (Set.Ioi (b Fon (lam T * T) * x)))
        atTop (𝓝 (x ^ (-α))) := 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), pp. 37–38, §4.4, display "λT P(j₁ > b(λT)x) … ∼ x^{−α}"
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