Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3 preamble, p. 603 — the Pareto law has g(ξ) = k for ξ ≥ S

Proved
LariviereIGFR.Moments.pareto_genFailureRate

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

generalized-failure-ratep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pareto

Let S>0S>0S>0 and k>0k>0k>0, and let XkX_kXk​ be a Pareto random variable with scale SSS and parameter kkk, i.e. with density

ϕ(ξ)=kSkξ−k−1(ξ≥S),ϕ(ξ)=0(ξ<S).\phi(\xi)=kS^k\xi^{-k-1}\quad(\xi\ge S),\qquad \phi(\xi)=0\quad(\xi<S).ϕ(ξ)=kSkξ−k−1(ξ≥S),ϕ(ξ)=0(ξ<S).

Its generalized failure rate g(ξ)=ξϕ(ξ)/Φˉ(ξ)g(\xi)=\xi\phi(\xi)/\bar\Phi(\xi)g(ξ)=ξϕ(ξ)/Φˉ(ξ) is constant:

g(ξ)=kfor all ξ≥S.g(\xi)=k\qquad\text{for all }\xi\ge S.g(ξ)=kfor all ξ≥S.

The Pareto plays for IGFR laws the role the exponential plays for IFR laws: it is the law with constant generalized failure rate, and the paper's moment theorem is proved by comparison with it.

Formalization Note The law is Mathlib's paretoMeasure S k with density paretoPDFReal S k (scale S, rate k), whose value at ξ=S\xi=Sξ=S is k/Sk/Sk/S, as in the printed formula.

Preamble
import Mathlib
import Definitions.Def_LariviereIGFR_Moments_Setting
Formal statement
namespace LariviereIGFR.Moments

open MeasureTheory ProbabilityTheory

/-- §3 preamble, p. 603: the Pareto law with density `k S^k ξ^(-k-1)` on `ξ ≥ S > 0` has constant
generalized failure rate `g(ξ) = k` for `ξ ≥ S`. -/
theorem pareto_genFailureRate (S k : ℝ) (hS : 0 < S) (hk : 0 < k) :
    ∀ ξ, S ≤ ξ → LariviereIGFR.Char.genFailureRate (paretoMeasure S k) (paretoPDFReal S k) ξ = k := by sorry

end LariviereIGFR.Moments
Source
Lariviere, A note on probability distributions with increasing generalized failure rates, Oper. Res. 54(3) (2006), p. 603, §3 preamble
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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