Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5 — F ∈ D_r(Π_{p,c}) iff F is tail equivalent to a discrete law satisfying (12a) and (12b)

Proved
BalkemaDeHaan.DiscreteDomain.theorem_5

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

discrete-distributionextreme-value-theorylimit-theoremp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1residual-life

Let p>0p > 0p>0 and c≥0c \ge 0c≥0, and let FFF be a distribution function on R\mathbb RR. Then FFF lies in the domain of residual life time attraction of the discrete limit law Πp,c\Pi_{p,c}Πp,c​,

Ft(b(t)+x a(t))→Πp,c(x)weakly as t→∞ for some a(t)>0, b(t),F_t\big(b(t) + x\,a(t)\big) \to \Pi_{p,c}(x) \quad \text{weakly as } t \to \infty \text{ for some } a(t) > 0,\ b(t),Ft​(b(t)+xa(t))→Πp,c​(x)weakly as t→∞ for some a(t)>0, b(t),

if and only if FFF is tail equivalent to a discrete distribution function F0=1−R0F_0 = 1 - R_0F0​=1−R0​ whose discontinuity points form an unbounded increasing sequence t0<t1<⋯t_0 < t_1 < \cdotst0​<t1​<⋯ with

tn+1−tntn−tn−1→epc  (12a),R0(tn+1)R0(tn)→e−p  (12b).\frac{t_{n+1}-t_n}{t_n - t_{n-1}} \to e^{pc} \ \ \text{(12a)}, \qquad \frac{R_0(t_{n+1})}{R_0(t_n)} \to e^{-p} \ \ \text{(12b)}.tn​−tn−1​tn+1​−tn​​→epc  (12a),R0​(tn​)R0​(tn+1​)​→e−p  (12b).

Theorem 5 identifies the domains of attraction of all discrete residual-life limit laws: up to tail equivalence, they are exactly the laws whose atoms spread out at a geometric rate epce^{pc}epc while the tail drops by the factor e−pe^{-p}e−p from atom to atom.

Formalization Note "Weakly" is convergence at the continuity points of Πp,c\Pi_{p,c}Πp,c​ only; Πp,c\Pi_{p,c}Πp,c​ is a step function and convergence at its jumps generally fails. Tail equivalence includes F(x)<1F(x) < 1F(x)<1 and F0(x)<1F_0(x) < 1F0​(x)<1 for all xxx; for FFF this also follows from F∈DrF \in D_rF∈Dr​.

Preamble
import Mathlib
import Definitions.Def_BalkemaDeHaan_DiscreteDomain_ResidualLife
import Definitions.Def_BalkemaDeHaan_DiscreteDomain_PiPC
import Definitions.Def_BalkemaDeHaan_DiscreteDomain_DiscreteLaw

open MeasureTheory Filter Topology
Formal statement
namespace BalkemaDeHaan.DiscreteDomain

/-- Theorem 5, p. 800 (PDF 9): for `p > 0` and `c ≥ 0`, `F ∈ D_r(Π_{p,c})` iff `F` is BalkemaDeHaan.LimitTypes.tail
equivalent to a discrete distribution function `F₀` whose jumps `t₀ < t₁ < ⋯ → ∞` satisfy
(12a) and (12b). -/
theorem theorem_5 (p c : ℝ) (hp : 0 < p) (hc : 0 ≤ c)
    (μ : Measure ℝ) [IsProbabilityMeasure μ] :
    InDr μ (piPC p c) ↔
      ∃ ν₀ : Measure ℝ, IsProbabilityMeasure ν₀ ∧ ∃ t : ℕ → ℝ,
        IsDiscreteWithJumps ν₀ t ∧ GapRatio t p c ∧ TailRatio ν₀ t p ∧ TailEquiv μ ν₀ := by sorry

end BalkemaDeHaan.DiscreteDomain
Source
Balkema, de Haan, Residual Life Time at Great Age, Ann. Probab. 2 (1974), p. 800 (PDF 9), Theorem 5
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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