Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(11) on x > 0 — sampling the residual-life normalization

Proved
BalkemaDeHaan.ExpDomain.equation_11_positive

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

extreme-value-theoryp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1residual-lifetail-asymptotics

If FFF belongs to Dr(Π)D_r(\Pi)Dr​(Π), there are sequences an>0a_n>0an​>0 and bnb_nbn​ for which the scaled survival probabilities satisfy equation (11) on the positive half-line:

nR(bn+xan)⟶e−x(x>0).nR(b_n+xa_n)\longrightarrow e^{-x}\qquad(x>0).nR(bn​+xan​)⟶e−x(x>0).

This passes from real thresholds in the residual-life domain to integer sample sizes in the maxima domain. The next milestone extends the same limit to every real xxx.

Formalization Note The article prints R(b(t)+xa(t))/(t)R(b(t)+xa(t))/(t)R(b(t)+xa(t))/(t) immediately before (11); the denominator must be R(t)R(t)R(t), as confirmed by its preceding tail-quotient formula and by the meaning of conditional probability. The Lean statement uses equation (11) as printed.

Preamble
import Definitions.Def_BalkemaDeHaan_ExpDomain_Domains
Formal statement
namespace BalkemaDeHaan.ExpDomain

open MeasureTheory

/-- Equation (11) on `x > 0`, p. 799. -/
theorem equation_11_positive (μ : Measure ℝ) [IsProbabilityMeasure μ]
    (h : InDr μ piLaw) :
    ∃ a b : ℕ → ℝ, (∀ n, 0 < a n) ∧
      TailScaledConvergence μ a b (Set.Ioi 0) := by sorry

end BalkemaDeHaan.ExpDomain
Source
Balkema, de Haan, Residual Life Time at Great Age, Ann. Probab. 2 (1974), p. 799 (PDF 8), proof of Theorem 3, (11) on x > 0
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