Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, (3) — the two-state optimality equation V_β(P) = min{CP + βV_β(TP); I + βPV_β(1) + β(1 − P)V_β(π); R + βV_β(π)}

Proved
RossQC.Regions.equation_3

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

bellman-equationdynamic-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quality-control

In Ross's two-state production process the good state 000 turns bad with probability π\piπ per period and the bad state 111 stays bad until revised; producing costs 000 in the good state and CCC in the bad one, inspecting costs III and revising RRR; and 0<C<I<R0<C<I<R0<C<I<R, 0≤π≤10\le\pi\le10≤π≤1, 0<β<10<\beta<10<β<1. Write P∈[0,1]P\in[0,1]P∈[0,1] for the probability of the bad state, Vβ(P)V_\beta(P)Vβ​(P) for the optimal discounted cost of the general model at the belief (1−P,P)(1-P,P)(1−P,P), and TP=P+π−πPTP=P+\pi-\pi PTP=P+π−πP. Then for every P∈[0,1]P\in[0,1]P∈[0,1],

Vβ(P)=min⁡{CP+βVβ(TP); I+βPVβ(1)+β(1−P)Vβ(π); R+βVβ(π)}.V_\beta(P)=\min\{CP+\beta V_\beta(TP);\ I+\beta PV_\beta(1)+\beta(1-P)V_\beta(\pi);\ R+\beta V_\beta(\pi)\}.Vβ​(P)=min{CP+βVβ​(TP); I+βPVβ​(1)+β(1−P)Vβ​(π); R+βVβ​(π)}.

This is the specialization of the general optimality equation (1) to two states, and every later argument of §3 runs on it.

Formalization Note 0<C0<C0<C is implicit in the paper (the bad state costs CCC, the good state 000).

Preamble
import Mathlib
import Definitions.Def_RossQC_Regions_Model
import Definitions.Def_RossQC_Regions_TwoState
Formal statement
namespace RossQC.Regions

/-- Ross, *Quality Control under Markovian Deterioration*, Management Science 17(9):587–596 (1971),
DOI 10.1287/mnsc.17.9.587, §3, (3), p. 590 (unnumbered statement): in the two-state specialization of
the general model, `TP = P + π − πP` and
`V_β(P) = min{CP + βV_β(TP); I + βPV_β(1) + β(1 − P)V_β(π); R + βV_β(π)}`, `P ∈ [0, 1]`.

Here `V_β(P)` is `V2 β π C I R P`, the general `V_β` of the two-state instance `twoState` at
the belief `(1 − P, P)`.

**Formalization Note.** Standing hypotheses of §3: `0 < β < 1`, `0 ≤ π ≤ 1` (so that `1 − π`,
`π` are transition probabilities) and `C < I < R` ("It shall be assumed throughout that
`C < I < R`"); `0 < C` is implicit in the paper (the bad state costs `C`, the good state `0`).
-/
theorem equation_3 (β π C I R : ℝ) (hβ0 : 0 < β) (hβ1 : β < 1) (hπ0 : 0 ≤ π) (hπ1 : π ≤ 1)
    (hC : 0 < C) (hCI : C < I) (hIR : I < R) :
    ∀ P ∈ Set.Icc (0 : ℝ) 1,
      V2 β π C I R P =
        min (rhs3 β π C I R (V2 β π C I R) P .produce)
          (min (rhs3 β π C I R (V2 β π C I R) P .inspect)
            (rhs3 β π C I R (V2 β π C I R) P .revise)) := by sorry

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