Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 3.6 — Lipschitz bound for the discounted value

Proved
RossQC.AlwaysProduce.corollary_3_6

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

dynamic-programminglipschitz-boundp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quality-control

Under 0<β<10<\beta<10<β<1, 0≤π≤10\le\pi\le10≤π≤1, and 0<C<I<R0<C<I<R0<C<I<R, for any beliefs P1,P2∈[0,1]P_1,P_2\in[0,1]P1​,P2​∈[0,1] the infinite-horizon value satisfies

∣Vβ(P1)−Vβ(P2)∣≤C∣P1−P2∣1−β(1−π).|V_\beta(P_1)-V_\beta(P_2)|\le\frac{C|P_1-P_2|}{1-\beta(1-\pi)}.∣Vβ​(P1​)−Vβ​(P2​)∣≤1−β(1−π)C∣P1​−P2​∣​.

When π>0\pi>0π>0, the right-hand side is at most C∣P1−P2∣/πC|P_1-P_2|/\piC∣P1​−P2​∣/π. This gives continuity of VβV_\betaVβ​ on the belief interval, needed to interpret the strict conclusion near P=1P=1P=1 in Theorem 3.4(b).

Formalization Note The extra condition π>0\pi>0π>0 applies only to the second inequality; division by zero in Lean otherwise produces a total value that is not the paper's bound.

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

/-- Ross, *Quality Control under Markovian Deterioration*, Corollary 3.6,
p. 592. Formalization Note: the second bound requires `π > 0` because
division by zero in Lean is total; the first bound also covers `π = 0`. -/
theorem corollary_3_6 (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₁ P₂ : ℝ), P₁ ∈ Set.Icc (0 : ℝ) 1 → P₂ ∈ Set.Icc (0 : ℝ) 1 →
      |M.value P₁ - M.value P₂| ≤
        M.C * |P₁ - P₂| / (1 - M.β * (1 - M.π)) ∧
      (0 < M.π →
        M.C * |P₁ - P₂| / (1 - M.β * (1 - M.π)) ≤
          M.C * |P₁ - P₂| / 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. 592, Corollary 3.6
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