Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.1 — [F(k)(x)]1/k[F^{(k)}(x)]^{1/k}[F(k)(x)]1/k is decreasing in kkk for every distribution FFF on [0,∞)[0, \infty)[0,∞)

Proved
ShockWear.CumDamage.lemma41

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

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

Let FFF be a distribution function with F(z)=0F(z) = 0F(z)=0 for all z<0z < 0z<0, and let F(k)F^{(k)}F(k) be its kkk-fold convolution. Then for every real xxx,

[F(k)(x)]1/k is decreasing in k=1,2,… .[F^{(k)}(x)]^{1/k} \text{ is decreasing in } k = 1, 2, \dots.[F(k)(x)]1/k is decreasing in k=1,2,….

The paper calls this its principal tool (p. 628): it says that under i.i.d. nonnegative damages the probabilities of surviving kkk shocks, Pˉk=F(k)(x)\bar P_k = F^{(k)}(x)Pˉk​=F(k)(x), satisfy the hypothesis of Theorem 3.1 (3.4).

Formalization Note FFF is a probability measure μ\muμ on R\mathbb RR with μ(−∞,0)=0\mu(-\infty, 0) = 0μ(−∞,0)=0 and F(k)(x)F^{(k)}(x)F(k)(x) is the mass of (−∞,x](-\infty, x](−∞,x] under the kkk-fold convolution of μ\muμ. No other hypothesis is placed on FFF: atoms, no density and infinite mean are all allowed. Powers are real powers.

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

open MeasureTheory ProbabilityTheory

theorem lemma41 (μ : Measure ℝ) [IsProbabilityMeasure μ] (hμ : μ (Set.Iio 0) = 0) :
    ∀ (x : ℝ) (j k : ℕ), 1 ≤ j → j ≤ k →
      cdfPow μ k x ^ (1 / (k : ℝ)) ≤ cdfPow μ j x ^ (1 / (j : ℝ)) := by sorry

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