Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 7.6.3 — the bold strategy is optimal in an unfavorable game

Proved
MDPFinance.InfiniteHorizonApplications.theorem_7_6_3

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

gambling-theorymarkov-decision-processoptimal-control

When the win probability is at most 1/21/21/2, betting everything needed to reach BBB in the fewest possible steps (the bold strategy) is optimal: the game is unfavorable, so minimizing the number of bets — rather than grinding out a long sequence of small ones — maximizes the chance of reaching the target before ruin.

Moderation note. Optimality is now among all Markov policies (the draft's J∞J_\inftyJ∞​ ranged over stationary rules only).

Preamble
import Mathlib
import Definitions.Def_MDPFinance_InfiniteHorizonApplications_Casino

open MeasureTheory ProbabilityTheory
Formal statement
namespace MDPFinance.InfiniteHorizonApplications

/-- Theorem 7.6.3 (Bäuerle–Rieder, p. 228, PDF 239). If `p \le 1/2`, the bold strategy is
optimal, i.e. it maximizes the probability that the player will reach `B` before going bankrupt. -/
theorem theorem_7_6_3 (Mk : CasinoMarket) (hp : Mk.p ≤ 1 / 2) :
    ∀ x, Mk.Jinfpi Mk.bold x = Mk.Jinf x := by sorry

end MDPFinance.InfiniteHorizonApplications
Source
Bäuerle and Rieder, Markov Decision Processes with Applications to Finance, Universitext, Springer 2011, DOI 10.1007/978-3-642-18324-9, p. 228, Theorem 7.6.3
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