Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 10.2.6 — three sufficient conditions for optimality of τ_{f*}

Disproved
MDPFinance.OptimalStopping.corollary_10_2_6

by Shuze Chen · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

dynamic-programmingoperations-researchoptimal-stoppingoptimizationprobability

Corollary 10.2.6 (p. 315). Suppose a stopping problem with unbounded horizon is given and f∗f^*f∗ is a maximizer of JJJ. Then it holds:

a) If the corresponding Markov Decision Problem has a bounding function bbb with βαb<1\beta\alpha_b < 1βαb​<1, then Gf∗=JG_{f^*} = JGf∗​=J. Moreover, if Px(τf∗<∞)=1\mathbb{P}_x(\tau_{f^*} < \infty) = 1Px​(τf∗​<∞)=1 for all x∈Ex \in Ex∈E then τf∗\tau_{f^*}τf∗​ is an optimal stopping time. b) If sup⁡x∈Ec(x)<0\sup_{x \in E} c(x) < 0supx∈E​c(x)<0, β=1\beta = 1β=1 and Gf∗=JG_{f^*} = JGf∗​=J, then Px(τf∗<∞)=1\mathbb{P}_x(\tau_{f^*} < \infty) = 1Px​(τf∗​<∞)=1 for all x∈Ex \in Ex∈E and τf∗\tau_{f^*}τf∗​ is an optimal stopping time. c) If J−gJ - gJ−g is bounded from above and Px(τf∗<∞)=1\mathbb{P}_x(\tau_{f^*} < \infty) = 1Px​(τf∗​<∞)=1 for all x∈Ex \in Ex∈E, then τf∗\tau_{f^*}τf∗​ is an optimal stopping time and Gf∗=JG_{f^*} = JGf∗​=J.

Theorem 10.2.3 b) needs two things — that the rule's value is ccc-superharmonic and that the rule stops almost surely — and neither is free. This corollary is the practical entry point: three separately checkable conditions, each of which delivers one or both.

The three are genuinely different and none subsumes another. a) is a contraction argument (βαb<1\beta\alpha_b < 1βαb​<1); b) buys almost sure finiteness from a strictly negative running reward, so waiting forever costs infinitely much, and it is the undiscounted case β=1\beta = 1β=1 where a) is unavailable; c) assumes finiteness instead and buys Gf∗=JG_{f^*} = JGf∗​=J from a one-sided bound on J−gJ - gJ−g.

Note the direction of each implication. In a) and c) almost sure finiteness is a hypothesis; in b) it is a conclusion. Stating b)'s finiteness as a hypothesis would lose the sharpest part of the corollary.

Moderation note. The bounding function is Chapter 7's (b ≥ 0, constant c_r, Lebesgue drift bound); J − g bounded above is stated in [-∞,∞]; optimality via IsOptimal.

Preamble
import Mathlib
import Definitions.Def_MDPFinance_OptimalStopping_Stationary

open MeasureTheory Filter Topology
Formal statement
namespace MDPFinance.OptimalStopping

/-- **Corollary 10.2.6** (p. 314), under (B), for a maximizer `f^* = 1_S` of `J`. a) If the
Markov Decision Model has a bounding function `b` with `βα_b < 1`, then `G_{f^*} = J`; if moreover
`ℙ_x(τ_{f^*} < ∞) = 1` for all `x`, `τ_{f^*}` is optimal. b) If `sup c < 0`, `β = 1` and
`G_{f^*} = J`, then `ℙ_x(τ_{f^*} < ∞) = 1` for all `x` and `τ_{f^*}` is optimal. c) If `J − g` is
bounded above and `ℙ_x(τ_{f^*} < ∞) = 1` for all `x`, then `τ_{f^*}` is optimal and
`G_{f^*} = J`. -/
theorem corollary_10_2_6 {E : Type*} [MeasurableSpace E] (P : StationaryProblem E)
    (Pr : E → Measure (ℕ → E)) (hPr : P.IsPathLaw Pr) (hB : P.AssumptionB Pr)
    (S : Set E) (hS : P.IsMaximizer S P.Jlim) :
    (∀ B : P.BoundingFunction, P.beta * B.alpha < 1 →
      (∀ x : E, P.Gf Pr S x = P.Jlim x) ∧
      ((∀ x : E, Pr x {w | P.ruleTime S w = ⊤} = 0) → P.IsOptimal Pr (P.ruleTime S))) ∧
    ((∃ s : ℝ, s < 0 ∧ ∀ x : E, P.c x ≤ s) → P.beta = 1 → (∀ x : E, P.Gf Pr S x = P.Jlim x) →
      (∀ x : E, Pr x {w | P.ruleTime S w = ⊤} = 0) ∧ P.IsOptimal Pr (P.ruleTime S)) ∧
    ((∃ C : ℝ, ∀ x : E, P.Jlim x ≤ (P.g x : EReal) + (C : EReal)) →
      (∀ x : E, Pr x {w | P.ruleTime S w = ⊤} = 0) →
      P.IsOptimal Pr (P.ruleTime S) ∧ ∀ x : E, P.Gf Pr S x = P.Jlim x) := by sorry

end MDPFinance.OptimalStopping
Source
Bäuerle and Rieder, Markov Decision Processes with Applications to Finance, Universitext, Springer 2011, DOI 10.1007/978-3-642-18324-9, p. 315 (PDF 322), Corollary 10.2.6
Human review
  • Endorsed by Community (Bot) · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Oct 1, 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