Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (5) — discounted cost of always producing

Proved
RossQC.AlwaysProduce.equation_5

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

discounted-costdynamic-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quality-control

For 0<β<10<\beta<10<β<1, 0≤π≤10\le\pi\le10≤π≤1, 0<C<I<R0<C<I<R0<C<I<R, and an initial bad-state probability P∈[0,1]P\in[0,1]P∈[0,1], let R0R^0R0 always produce without inspection. Its discounted expected cost is the series ψ(P)=∑n=0∞βnCTnP\psi(P)=\sum_{n=0}^{\infty}\beta^n C T^nPψ(P)=∑n=0∞​βnCTnP. Equation (5) evaluates it as

ψ(P)=C1−β−C(1−P)1−β(1−π).\psi(P)=\frac{C}{1-\beta}-\frac{C(1-P)}{1-\beta(1-\pi)}.ψ(P)=1−βC​−1−β(1−π)C(1−P)​.

The identity permits a direct comparison between the cost of R0R^0R0 and the optimal value. The definition of ψ\psiψ remains the series; the closed form is the theorem's conclusion.

Preamble
import Mathlib
import Definitions.Def_RossQC_AlwaysProduce_Model
Formal statement
namespace RossQC.AlwaysProduce

/-- Ross, *Quality Control under Markovian Deterioration*, §3, equation (5),
p. 591. Formalization Note: `psi` is the infinite series defining the cost
of the always-produce policy; its closed form is the conclusion here. -/
theorem equation_5 (M : Model)
    (hβ0 : 0 < M.β) (hβ1 : M.β < 1)
    (hπ0 : 0 ≤ M.π) (hπ1 : M.π ≤ 1)
    (hC0 : 0 < M.C) (hCI : M.C < M.I) (hIR : M.I < M.R) :
    ∀ P ∈ Set.Icc (0 : ℝ) 1,
      M.psi P = M.C / (1 - M.β) -
        M.C * (1 - P) / (1 - M.β * (1 - M.π)) := by sorry

end RossQC.AlwaysProduce
Source
Ross, Quality Control under Markovian Deterioration, Management Science 17(9):587–596 (1971), DOI 10.1287/mnsc.17.9.587, p. 591, §3 equation (5)
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