Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Cash balance: finite-horizon critical levels and their limiting value formula

Proved
MDPFinance.InfiniteHorizonApplications.cash_balance_critical_limit_formula

by fizzyinc3 · Oct 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

infinite-horizoninventory-theorymarkov-decision-process

Let a cash-balance market have positive transfer rates cu,cdc_u,c_dcu​,cd​, a nonnegative convex holding cost LLL with L(0)=0L(0)=0L(0)=0 and L(x)/∣x∣→∞L(x)/|x|\to\inftyL(x)/∣x∣→∞ in both directions, an integrable cash change ZZZ, and discount factor 0<β<10<\beta<10<β<1. Write JnJ_nJn​ for its minimal nnn-period cost and

J(x)=sup⁡n≥0Jn(x).J(x)=\sup_{n\ge0}J_n(x).J(x)=n≥0sup​Jn​(x).

The finite-horizon values, viewed as real functions, are convex. There are critical-level sequences Sn−≤Sn+S_n^-\le S_n^+Sn−​≤Sn+​ for every n≥1n\ge1n≥1 such that, with J0=0J_0=0J0​=0,

Jn(x)={(Sn−−x)cu+L(Sn−)+βE[Jn−1(Sn−−Z)],x<Sn−,L(x)+βE[Jn−1(x−Z)],Sn−≤x≤Sn+,(x−Sn+)cd+L(Sn+)+βE[Jn−1(Sn+−Z)],x>Sn+.J_n(x)=\begin{cases} (S_n^- -x)c_u+L(S_n^-)+\beta\mathbb E[J_{n-1}(S_n^- -Z)],&x<S_n^-,\\ L(x)+\beta\mathbb E[J_{n-1}(x-Z)],&S_n^-\le x\le S_n^+,\\ (x-S_n^+)c_d+L(S_n^+)+\beta\mathbb E[J_{n-1}(S_n^+ -Z)],&x>S_n^+. \end{cases}Jn​(x)=⎩⎨⎧​(Sn−​−x)cu​+L(Sn−​)+βE[Jn−1​(Sn−​−Z)],L(x)+βE[Jn−1​(x−Z)],(x−Sn+​)cd​+L(Sn+​)+βE[Jn−1​(Sn+​−Z)],​x<Sn−​,Sn−​≤x≤Sn+​,x>Sn+​.​

For every strictly increasing subsequence of horizons along which these two levels converge jointly to (s,t)(s,t)(s,t), the same three-region identity holds with Jn,Jn−1,Sn−,Sn+J_n,J_{n-1},S_n^-,S_n^+Jn​,Jn−1​,Sn−​,Sn+​ replaced by J,J,s,tJ,J,s,tJ,J,s,t.

This is the critical-level analysis in Theorems 2.6.2 and 7.6.1. It separates the finite-horizon formulas and their passage to the limit from infinite-horizon policy verification. The existence of a common convergent subsequence, finiteness of the values, equality of JJJ with the infinite-horizon minimum, and optimality of the limiting stationary rule are not conclusions of this lemma.

Formalization Note Costs and expectations use extended nonnegative reals. Real convexity uses their real-valued conversions. The limiting piecewise formula uses the conditions x<sx<sx<s, then x≤tx\le tx≤t, as in the finite-horizon formula.

Preamble
import Definitions.Def_MDPFinance_InfiniteHorizonApplications_CashBalance

open MeasureTheory ProbabilityTheory MDPFinance.InfiniteHorizonApplications
Formal statement
theorem MDPFinance.InfiniteHorizonApplications.cash_balance_critical_limit_formula (Mk : CashBalanceMarket) :
    (∀ n, ConvexOn ℝ Set.univ (fun x => (Mk.Jn n x).toReal)) ∧
      (∃ Sminus Splus : ℕ → ℝ,
        (∀ n, 1 ≤ n → Sminus n ≤ Splus n ∧ ∀ x, Mk.Jn n x =
          if x < Sminus n then
            ENNReal.ofReal ((Sminus n - x) * Mk.cu + Mk.L (Sminus n)) +
              ENNReal.ofReal Mk.β * ∫⁻ z, Mk.Jn (n - 1) (Sminus n - z) ∂Mk.μZ
          else if x ≤ Splus n then
            ENNReal.ofReal (Mk.L x) + ENNReal.ofReal Mk.β * ∫⁻ z, Mk.Jn (n - 1) (x - z) ∂Mk.μZ
          else
            ENNReal.ofReal ((x - Splus n) * Mk.cd + Mk.L (Splus n)) +
              ENNReal.ofReal Mk.β * ∫⁻ z, Mk.Jn (n - 1) (Splus n - z) ∂Mk.μZ) ∧
        ∀ (φ : ℕ → ℕ) (Sm Sp : ℝ), StrictMono φ →
          Filter.Tendsto (Sminus ∘ φ) Filter.atTop (nhds Sm) →
          Filter.Tendsto (Splus ∘ φ) Filter.atTop (nhds Sp) →
          (∀ x, Mk.Jlim x =
            if x < Sm then
              ENNReal.ofReal ((Sm - x) * Mk.cu + Mk.L Sm) +
                ENNReal.ofReal Mk.β * ∫⁻ z, Mk.Jlim (Sm - z) ∂Mk.μZ
            else if x ≤ Sp then
              ENNReal.ofReal (Mk.L x) + ENNReal.ofReal Mk.β * ∫⁻ z, Mk.Jlim (x - z) ∂Mk.μZ
            else
              ENNReal.ofReal ((x - Sp) * Mk.cd + Mk.L Sp) +
                ENNReal.ofReal Mk.β * ∫⁻ z, Mk.Jlim (Sp - z) ∂Mk.μZ)) := by sorry
Source
Bäuerle and Rieder, Markov Decision Processes with Applications to Finance, Springer 2011, DOI 10.1007/978-3-642-18324-9, §2.6.2, Theorem 2.6.2, and §7.6.2, Theorem 7.6.1 (p. 225), critical-level formulas and passage to the limit. https://link.springer.com/chapter/10.1007/978-3-642-18324-9_7

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me