Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 5, p. 800 — F ∈ D_r(Π_{p,c}) is tail equivalent to a discrete F₀ taking only the values F(b_n)

Proved
BalkemaDeHaan.DiscreteDomain.tailEquiv_discrete_levels

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

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

Let p>0p > 0p>0, c≥0c \ge 0c≥0 and F=1−R∈Dr(Πp,c)F = 1 - R \in D_r(\Pi_{p,c})F=1−R∈Dr​(Πp,c​). Then there is a strictly increasing sequence bn↑∞b_n \uparrow \inftybn​↑∞ with

R(bn+1)R(bn)→e−p,\frac{R(b_{n+1})}{R(b_n)} \to e^{-p},R(bn​)R(bn+1​)​→e−p,

and a discrete distribution function F0=1−R0F_0 = 1 - R_0F0​=1−R0​ with jumps at an unbounded increasing sequence t0<t1<⋯t_0 < t_1 < \cdotst0​<t1​<⋯, such that F0F_0F0​ only takes the values F(bn)F(b_n)F(bn​) (besides 000),

F0(s)=F(bn)for tn≤s<tn+1,i.e. R0(tn)=R(bn),F_0(s) = F(b_n) \quad \text{for } t_n \le s < t_{n+1}, \quad\text{i.e. } R_0(t_n) = R(b_n),F0​(s)=F(bn​)for tn​≤s<tn+1​,i.e. R0​(tn​)=R(bn​),

and FFF is tail equivalent to F0F_0F0​.

This is the first step of the "only if" half of Theorem 5: it produces the discrete law F0F_0F0​ of the theorem.

Formalization Note In the proof, bnb_nbn​ is built by iterating the shift of the normalization in the convention (2)–(3) of p. 794 (where b(t)b(t)b(t) shifts XXX, not X−tX - tX−t): bn+1=b(bn)b_{n+1} = b(b_n)bn+1​=b(bn​). The statement only asserts the existence of such a sequence, together with its tail-ratio property, which is what the rest of the proof uses. The page leaves the construction of F0F_0F0​ implicit ("a distribution F0F_0F0​ which only takes the values F(bn)F(b_n)F(bn​)"); it is formalized with the level identity R0(tn)=R(bn)R_0(t_n) = R(b_n)R0​(tn​)=R(bn​) for every n≥0n \ge 0n≥0, which is how the next paragraph of the page uses F0F_0F0​ ("F0(t)=F(bn)F_0(t) = F(b_n)F0​(t)=F(bn​) for tn≤t<tn+1t_n \le t < t_{n+1}tn​≤t<tn+1​"). Indexing from n=0n = 0n=0 rather than the page's n=1n = 1n=1 is immaterial because bbb is existential.

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

/-- Proof of Theorem 5, p. 800 (PDF 9): if `F = 1 - R ∈ D_r(Π_{p,c})`, there is a sequence
`b_n ↑ ∞` with `R(b_{n+1})/R(b_n) → e^{-p}`, and `F` is BalkemaDeHaan.LimitTypes.tail equivalent to a discrete law `F₀`
with jumps `t₀ < t₁ < ⋯ → ∞` taking only the values `F(b_n)`: `F₀(s) = F(b_n)` for
`t_n ≤ s < t_{n+1}`, i.e. `R₀(t_n) = R(b_n)`. -/
theorem tailEquiv_discrete_levels (p c : ℝ) (hp : 0 < p) (hc : 0 ≤ c)
    (μ : Measure ℝ) [IsProbabilityMeasure μ] (hμ : InDr μ (piPC p c)) :
    ∃ b : ℕ → ℝ, StrictMono b ∧ Tendsto b atTop atTop ∧
      Tendsto (fun n : ℕ => (μ (Set.Ioi (b (n + 1)))).toReal / (μ (Set.Ioi (b n))).toReal)
        atTop (𝓝 (Real.exp (-p))) ∧
      ∃ ν₀ : Measure ℝ, IsProbabilityMeasure ν₀ ∧ ∃ t : ℕ → ℝ,
        IsDiscreteWithJumps ν₀ t ∧ (∀ n, ν₀ (Set.Ioi (t n)) = μ (Set.Ioi (b n))) ∧
        TailEquiv μ ν₀ := by sorry

end BalkemaDeHaan.DiscreteDomain
Source
Balkema, de Haan, Residual Life Time at Great Age, Ann. Probab. 2 (1974), p. 800 (PDF 9), proof of Theorem 5, second and third paragraphs
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