Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3 — Gnedenko's tail criterion for the Gumbel law

Proved
BalkemaDeHaan.ExpDomain.gnedenko_criterion

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

extreme-value-theorygumbel-lawp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1tail-asymptotics

Let F=1−RF=1-RF=1−R be a probability distribution function and let an>0a_n>0an​>0, bn∈Rb_n\in\mathbb Rbn​∈R. For these same normalizations, weak convergence of normalized maxima to the Gumbel law is equivalent to convergence of scaled tails:

F(anx+bn)n⟶Λ(x)=e−e−x⟺nR(bn+xan)⟶e−x(x∈R).F(a_nx+b_n)^n\longrightarrow \Lambda(x)=e^{-e^{-x}}\quad\Longleftrightarrow\quad nR(b_n+xa_n)\longrightarrow e^{-x}\qquad(x\in\mathbb R).F(an​x+bn​)n⟶Λ(x)=e−e−x⟺nR(bn​+xan​)⟶e−x(x∈R).

The forward implication is the criterion attributed to Gnedenko in the article. The reverse implication is used at the end of Theorem 3's proof to recover the maxima domain from equation (11).

Formalization Note The printed sentence gives the forward implication. The milestone also states the converse because the article invokes it after extending (11) to all real xxx. The limit law is continuous, so weak convergence is pointwise convergence at every real xxx.

Preamble
import Definitions.Def_BalkemaDeHaan_ExpDomain_Domains
Formal statement
namespace BalkemaDeHaan.ExpDomain

open Filter MeasureTheory ProbabilityTheory

/-- Gnedenko's criterion, used in the proof of Theorem 3, p. 798. -/
theorem gnedenko_criterion (μ : Measure ℝ) [IsProbabilityMeasure μ]
    (a b : ℕ → ℝ) (ha : ∀ n, 0 < a n) :
    WeakConvergenceNat (fun n x => (cdf μ (a n * x + b n)) ^ n) lambdaLaw ↔
      TailScaledConvergence μ a b Set.univ := by sorry

end BalkemaDeHaan.ExpDomain
Source
Balkema, de Haan, Residual Life Time at Great Age, Ann. Probab. 2 (1974), p. 798 (PDF 7), proof of Theorems 3 and 4, citing Gnedenko (1943), Theorem 6; p. 799 (PDF 8), (11)
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