Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of (3.4), p. 633 — if Pˉk1/k\bar P_k^{1/k}Pˉk1/k​ decreases, Pˉk−ζk\bar P_k - \zeta^kPˉk​−ζk has at most one sign change, +++ to −-−

Proved
ShockWear.CumDamage.proof34_seqSign

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

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1reliabilityshock-modelssign-changes

Let 1=Pˉ0≥Pˉ1≥⋯≥01 = \bar P_0 \ge \bar P_1 \ge \dots \ge 01=Pˉ0​≥Pˉ1​≥⋯≥0 and suppose Pˉk1/k\bar P_k^{1/k}Pˉk1/k​ is decreasing in k=1,2,…k = 1, 2, \dotsk=1,2,…. Then for every ζ\zetaζ with 0≤ζ≤10 \le \zeta \le 10≤ζ≤1 the sequence

k↦Pˉk−ζk,k=0,1,2,…,k \mapsto \bar P_k - \zeta^k, \qquad k = 0, 1, 2, \dots,k↦Pˉk​−ζk,k=0,1,2,…,

has at most one sign change, from +++ to −-− if one occurs: there are no j<kj < kj<k with Pˉj−ζj<0<Pˉk−ζk\bar P_j - \zeta^j < 0 < \bar P_k - \zeta^kPˉj​−ζj<0<Pˉk​−ζk.

This is the first step of the paper's proof of Theorem 3.1 (3.4): it is the input to the variation diminishing property of the Poisson kernel.

Formalization Note ζ0=1\zeta^0 = 1ζ0=1, so the k=0k = 0k=0 term is Pˉ0−1=0\bar P_0 - 1 = 0Pˉ0​−1=0. The hypothesis 1=Pˉ0≥Pˉ1≥…1 = \bar P_0 \ge \bar P_1 \ge \dots1=Pˉ0​≥Pˉ1​≥… is the standing hypothesis of Theorem 3.1; Pˉk≥0\bar P_k \ge 0Pˉk​≥0 is stated explicitly. Pˉk1/k\bar P_k^{1/k}Pˉk1/k​ is a real power.

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

open MeasureTheory ProbabilityTheory

theorem proof34_seqSign (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 : ℝ))) :
    ∀ ζ : ℝ, 0 ≤ ζ → ζ ≤ 1 → SignPMSeq (fun k => P k - ζ ^ k) := by sorry

end ShockWear.CumDamage
Source
Esary, Marshall and Proschan, Shock Models and Wear Processes, Ann. Probability 1 (1973), p. 633, proof of (3.4), first sentence
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