Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.1 (3.4) — HHH is IHRA if Pˉk1/k\bar P_k^{1/k}Pˉk1/k​ is decreasing in kkk

Proved
ShockWear.CumDamage.theorem31_4

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

ihrap2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1reliabilityshock-models

Let λ>0\lambda > 0λ>0 and let

Hˉ(t)=∑k=0∞Pˉk e−λt(λt)kk!,t≥0,\bar H(t) = \sum_{k=0}^\infty \bar P_k\, e^{-\lambda t}\frac{(\lambda t)^k}{k!}, \qquad t \ge 0,Hˉ(t)=k=0∑∞​Pˉk​e−λtk!(λt)k​,t≥0,

where 1=Pˉ0≥Pˉ1≥⋯≥01 = \bar P_0 \ge \bar P_1 \ge \dots \ge 01=Pˉ0​≥Pˉ1​≥⋯≥0. If Pˉk1/k\bar P_k^{1/k}Pˉk1/k​ is decreasing in k=1,2,…k = 1, 2, \dotsk=1,2,…, then HHH is IHRA:

[Hˉ(t)]1/t is decreasing in t>0.[\bar H(t)]^{1/t} \text{ is decreasing in } t > 0.[Hˉ(t)]1/t is decreasing in t>0.

This is the discrete-to-continuous inheritance of the IHRA property under Poisson shocks: the condition on the Pˉk\bar P_kPˉk​ is the discrete analogue of the conclusion for Hˉ\bar HHˉ.

Formalization Note Pˉk≥0\bar P_k \ge 0Pˉk​≥0 (the Pˉk\bar P_kPˉk​ are probabilities) is stated explicitly. Powers are real powers. "Decreasing" is the weak sense.

Preamble
import Mathlib
import Definitions.Def_ShockWear_CumDamage_Model
Formal statement
namespace ShockWear.CumDamage

open MeasureTheory ProbabilityTheory

theorem theorem31_4 (lam : ℝ) (hlam : 0 < lam) (P : ℕ → ℝ) (hP0 : P 0 = 1)
    (hanti : Antitone P) (hnn : ∀ k, 0 ≤ P k)
    (hroot : ∀ j k : ℕ, 1 ≤ j → j ≤ k → P k ^ (1 / (k : ℝ)) ≤ P j ^ (1 / (j : ℝ))) :
    IsIHRA (shockSurv lam P) := by sorry

end ShockWear.CumDamage
Source
Esary, Marshall and Proschan, Shock Models and Wear Processes, Ann. Probability 1 (1973), p. 632, Theorem 3.1 (3.4)
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