Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (3) — the unique bounded two-state Bellman value

Proved
RossQC.AlwaysProduce.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

Let 0<β<10<\beta<10<β<1, 0≤π≤10\le\pi\le10≤π≤1, and 0<C<I<R0<C<I<R0<C<I<R in the two-state model. On the belief interval [0,1][0,1][0,1], finite-horizon value iteration converges to a bounded value VβV_\betaVβ​. 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 P V_\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β​(π)}.

Any other bounded function on [0,1][0,1][0,1] satisfying this equation there agrees with VβV_\betaVβ​ throughout the interval. This identifies the value against which the always-produce policy is compared.

Formalization Note The uniqueness clause is the two-state specialization of the assertion following equation (1) on p. 588. Boundedness and convergence are explicit because the Lean limit operator has a total value even on a divergent sequence.

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

/-- Ross, *Quality Control under Markovian Deterioration*, §3, equation (3),
p. 590, specialized from the uniqueness assertion following equation (1), p. 588.
Formalization Note: `value` is the limit of (4). Convergence and boundedness
are explicit, and uniqueness ranges over bounded functions on the state space
`[0,1]`. The good-state cost is zero, while `C` is the bad-state cost. -/
theorem equation_3 (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,
      Tendsto (fun n : ℕ => M.valueIter n P) atTop (nhds (M.value P))) ∧
    (∃ B : ℝ, ∀ P ∈ Set.Icc (0 : ℝ) 1, |M.value P| ≤ B) ∧
    (∀ P ∈ Set.Icc (0 : ℝ) 1,
      M.value P = min (M.rhs3 M.value P .produce)
        (min (M.rhs3 M.value P .inspect) (M.rhs3 M.value P .revise))) ∧
    (∀ W : ℝ → ℝ,
      (∃ B : ℝ, ∀ P ∈ Set.Icc (0 : ℝ) 1, |W P| ≤ B) →
      (∀ P ∈ Set.Icc (0 : ℝ) 1,
        W P = min (M.rhs3 W P .produce)
          (min (M.rhs3 W P .inspect) (M.rhs3 W P .revise))) →
      ∀ P ∈ Set.Icc (0 : ℝ) 1, W P = M.value P) := 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. 590, §3 equation (3); p. 588, §2 equation (1) and following uniqueness assertion
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