Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1, closing display — each limit law G = 1 − S satisfies min(1, S(B(t) + xA(t))/S(t)) = S(x) for t > 0

Proved
BalkemaDeHaan.LimitTypes.closing_display

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

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

For each of the four limit laws G=ΠG = \PiG=Π, Πγ\Pi_\gammaΠγ​ (γ>0\gamma > 0γ>0), Γα\Gamma_\alphaΓα​ (α>0\alpha > 0α>0) and Γγ,α\Gamma_{\gamma,\alpha}Γγ,α​ (γ,α>0\gamma, \alpha > 0γ,α>0), write S=1−GS = 1 - GS=1−G. Then for every t>0t > 0t>0 there are A(t)>0A(t) > 0A(t)>0 and B(t)B(t)B(t) such that

min⁡(1,S(B(t)+xA(t))S(t))=S(x)for all x∈R.\min\Big(1, \frac{S(B(t) + xA(t))}{S(t)}\Big) = S(x) \qquad \text{for all } x \in \mathbb R.min(1,S(t)S(B(t)+xA(t))​)=S(x)for all x∈R.

Comparing with (3), this says that if XXX has tail SSS itself, then its normed residual life at every age t>0t > 0t>0 has exactly the law GGG; so each of the four types does occur as a limit, and Theorem 1 lists exactly the possible limit laws.

Formalization Note The four families are those of the introduction, each defined as 000 for x<0x < 0x<0, so S=1S = 1S=1 there. The scale A(t)A(t)A(t) is required to be positive, as a scale transformation is.

Preamble
import Mathlib
import Definitions.Def_BalkemaDeHaan_LimitTypes_ResidualLife
import Definitions.Def_BalkemaDeHaan_LimitTypes_LimitLaws

open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
namespace BalkemaDeHaan.LimitTypes

/-- Proof of Theorem 1, closing display, p. 797 (PDF 6): each limit law `G = 1 - S` of the four
families satisfies `min(1, S(B(t) + x A(t)) / S(t)) = S(x)` for every `t > 0`, with some
`A(t) > 0` and `B(t)`. -/
theorem closing_display :
    (∀ t : ℝ, 0 < t → ∃ A : ℝ, 0 < A ∧ ∃ B : ℝ, ∀ x : ℝ,
      min 1 ((1 - PiLaw (B + x * A)) / (1 - PiLaw t)) = 1 - PiLaw x) ∧
    (∀ γ : ℝ, 0 < γ → ∀ t : ℝ, 0 < t → ∃ A : ℝ, 0 < A ∧ ∃ B : ℝ, ∀ x : ℝ,
      min 1 ((1 - PiDiscreteLaw γ (B + x * A)) / (1 - PiDiscreteLaw γ t)) =
        1 - PiDiscreteLaw γ x) ∧
    (∀ α : ℝ, 0 < α → ∀ t : ℝ, 0 < t → ∃ A : ℝ, 0 < A ∧ ∃ B : ℝ, ∀ x : ℝ,
      min 1 ((1 - GammaLaw α (B + x * A)) / (1 - GammaLaw α t)) = 1 - GammaLaw α x) ∧
    (∀ γ : ℝ, 0 < γ → ∀ α : ℝ, 0 < α → ∀ t : ℝ, 0 < t → ∃ A : ℝ, 0 < A ∧ ∃ B : ℝ, ∀ x : ℝ,
      min 1 ((1 - GammaDiscreteLaw γ α (B + x * A)) / (1 - GammaDiscreteLaw γ α t)) =
        1 - GammaDiscreteLaw γ α x) := by sorry

end BalkemaDeHaan.LimitTypes
Source
Balkema, de Haan, Residual Life Time at Great Age, Ann. Probab. 2 (1974), p. 797 (PDF 6), proof of Theorem 1, closing display
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