Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.4 — exactly when always producing is optimal

Proved
RossQC.AlwaysProduce.theorem_3_4

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

dynamic-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quality-controlthreshold-policy

Consider the two-state deterioration model with 0<β<10<\beta<10<β<1, 0≤π≤10\le\pi\le10≤π≤1, and 0<C<I<R0<C<I<R0<C<I<R. Write R0R^0R0 for the policy that always produces without inspection, ψ(P)\psi(P)ψ(P) for its discounted cost, and Vβ(P)V_\beta(P)Vβ​(P) for the optimal discounted value. Then R0R^0R0 is optimal from every initial belief P∈[0,1]P\in[0,1]P∈[0,1] exactly when

R≥C1−β(1−π).R\ge\frac{C}{1-\beta(1-\pi)}.R≥1−β(1−π)C​.

If R<C/[1−β(1−π)]R<C/[1-\beta(1-\pi)]R<C/[1−β(1−π)], there is a one-sided neighborhood of P=1P=1P=1 within [0,1][0,1][0,1] on which revision is strictly cheaper in the Bellman equation than either production or inspection. Thus every discounted-optimal policy revises there.

This gives an exact parameter boundary for when inspection and revision can both be omitted, and it identifies forced revision when the boundary fails.

Formalization Note “R0R^0R0 is optimal” means ψ(P)=Vβ(P)\psi(P)=V_\beta(P)ψ(P)=Vβ​(P) for every P∈[0,1]P\in[0,1]P∈[0,1]. “Every optimal policy revises” is stated as revision being the unique minimizing action. The positive bad-state cost C>0C>0C>0 is implicit in the model and explicit here.

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

/-- Ross, *Quality Control under Markovian Deterioration*, Theorem 3.4(a,b),
p. 592. Formalization Note: `psi` is the discounted series cost of `R⁰`;
`R⁰` is β-optimal exactly when it equals `value` throughout `[0,1]`.
“Every β-optimal policy revises” is represented by revision being the unique
minimizer of equation (3). “Near 1” is a one-sided neighborhood in `[0,1]`.
`0 < C` makes explicit the positive bad-state cost implicit in the model. -/
theorem theorem_3_4 (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.value P) ↔
      M.C / (1 - M.β * (1 - M.π)) ≤ M.R) ∧
    (M.R < M.C / (1 - M.β * (1 - M.π)) →
      ∃ ε : ℝ, 0 < ε ∧
        ∀ P ∈ Set.Icc (0 : ℝ) 1, 1 - ε < P →
          M.rhs3 M.value P .revise < M.rhs3 M.value P .produce ∧
          M.rhs3 M.value P .revise < M.rhs3 M.value P .inspect) := 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. 592, Theorem 3.4(a,b)
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