Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.5 — finite-horizon Lipschitz bound

Proved
RossQC.Sufficient.lemma_3_5

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

dynamic-programminglipschitz-boundp2o-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. For any n≥0n\ge0n≥0 and beliefs P1,P2∈[0,1]P_1,P_2\in[0,1]P1​,P2​∈[0,1], finite-horizon value iteration obeys

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

The estimate controls how a change in the initial belief changes finite-horizon cost and yields the limiting estimate of Corollary 3.6.

Formalization Note Stage zero is V0=0V^0=0V0=0 and satisfies the displayed bound. The paper's beliefs range over [0,1][0,1][0,1] even though the lemma says “all P1,P2P_1,P_2P1​,P2​.”

Preamble
import Definitions.Def_RossQC_Sufficient_Model
Formal statement
namespace RossQC.Sufficient

/-- Ross, Lemma 3.5, p. 592. The finite-horizon value has the stated
Lipschitz bound for beliefs `P₁`, `P₂` in `[0,1]` and every `n`, including
the zero-stage value. -/
theorem lemma_3_5 (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)
    (n : ℕ) (P₁ P₂ : ℝ) (hP₁ : P₁ ∈ Set.Icc (0 : ℝ) 1)
    (hP₂ : P₂ ∈ Set.Icc (0 : ℝ) 1) :
    |M.valueIter n P₁ - M.valueIter n P₂| ≤
      M.C * |P₁ - P₂| *
        (1 - (M.β * (1 - M.π)) ^ n) / (1 - M.β * (1 - M.π)) := 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, p. 592, Lemma 3.5
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