Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.7 — sufficient conditions for three-region and no-inspection policies

Proved
RossQC.Sufficient.theorem_3_7

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 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 VβV_\betaVβ​ for the discounted value of equation (3).

  1. If
(1−β)(R+βVβ(π))C≤R−Iβ(Vβ(1)−Vβ(π)),\frac{(1-\beta)(R+\beta V_\beta(\pi))}{C}\le\frac{R-I}{\beta(V_\beta(1)-V_\beta(\pi))},C(1−β)(R+βVβ​(π))​≤β(Vβ​(1)−Vβ​(π))R−I​,

then there are π≤P1≤P2\pi\le P_1\le P_2π≤P1​≤P2​ and an optimal stationary rule that produces for P<P1P<P_1P<P1​, inspects for P1≤P<P2P_1\le P<P_2P1​≤P<P2​, and revises for P≥P2P\ge P_2P≥P2​. When revision is optimal for at least one admissible belief, P2≤1P_2\le1P2​≤1. 2. If

I+β(Vβ(1)−Vβ(π))≥C1−β(1−π)orR−Iβ(Vβ(1)−Vβ(π))≤RC(1−β(1−π)),I+\beta(V_\beta(1)-V_\beta(\pi))\ge\frac{C}{1-\beta(1-\pi)} \quad\text{or}\quad \frac{R-I}{\beta(V_\beta(1)-V_\beta(\pi))}\le\frac{R}{C}(1-\beta(1-\pi)),I+β(Vβ​(1)−Vβ​(π))≥1−β(1−π)C​orβ(Vβ​(1)−Vβ​(π))R−I​≤CR​(1−β(1−π)),

then there is P1≥πP_1\ge\piP1​≥π and an optimal stationary rule that produces for P<P1P<P_1P<P1​ and revises for P≥P1P\ge P_1P≥P1​, with no inspection interval.

These conditions distinguish parameter regimes in which a single inspection interval can be selected from those admitting a rule that never inspects.

Formalization Note “Optimal” means that the rule attains the minimum in equation (3) at every P∈[0,1]P\in[0,1]P∈[0,1], including threshold points. Part (a)'s printed P2≤1P_2\le1P2​≤1 is false when revision is never optimal; the paper's proof allows an infinite threshold, represented here by P2>1P_2>1P2​>1. When π=1\pi=1π=1, Lean's quotient with denominator Vβ(1)−Vβ(π)=0V_\beta(1)-V_\beta(\pi)=0Vβ​(1)−Vβ​(π)=0 is zero; the implications are still valid in that boundary case.

Preamble
import Definitions.Def_RossQC_Sufficient_Model
Formal statement
namespace RossQC.Sufficient

/-- Ross, Theorem 3.7(a,b), pp. 592–593. A β-optimal stationary rule
selects a minimum of (3) at every admissible belief, including threshold
points. The printed bound `P₂ ≤ 1` in (a) is imposed when the optimal revise
region is nonempty; otherwise `P₂ > 1` allows that interval to be empty, as
the paper's proof explicitly permits. `0 < C` makes the displayed quotient
well-defined. Lean's zero-denominator convention applies when `π = 1`,
where `V_β(1) - V_β(π) = 0`; the two implications retain their intended
conclusions in that case. -/
theorem theorem_3_7 (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) :
    ((1 - M.β) * (M.R + M.β * M.value M.π) / M.C ≤
        (M.R - M.I) / (M.β * (M.value 1 - M.value M.π)) →
      ∃ P₁ P₂ : ℝ, M.π ≤ P₁ ∧ P₁ ≤ P₂ ∧
        ((∃ P ∈ Set.Icc (0 : ℝ) 1,
            M.rhs3 M.value P .revise = M.value P) → P₂ ≤ 1) ∧
        ∀ P ∈ Set.Icc (0 : ℝ) 1,
          M.rhs3 M.value P (M.threeRegion P₁ P₂ P) = M.value P) ∧
    ((M.I + M.β * (M.value 1 - M.value M.π) ≥
        M.C / (1 - M.β * (1 - M.π)) ∨
      (M.R - M.I) / (M.β * (M.value 1 - M.value M.π)) ≤
        (M.R / M.C) * (1 - M.β * (1 - M.π))) →
      ∃ P₁ : ℝ, M.π ≤ P₁ ∧
        ∀ P ∈ Set.Icc (0 : ℝ) 1,
          M.rhs3 M.value P (M.twoRegion P₁ P) = M.value P) := by sorry

end RossQC.Sufficient
Source
Ross, Quality Control under Markovian Deterioration, Management Science 17(9):587–596 (1971), DOI 10.1287/mnsc.17.9.587, pp. 592–593, Theorem 3.7(a,b) and proof
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