Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 5 — if every PJP_JPJ​ is indecomposable, u∗u^*u∗ is a strict vectorial maximum of AAA

Proved
DEpenoux.LinearProgram.strict_vectorial_maximum

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

dynamic-programmingirreducible-matrixlinear-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

In d'Epenoux's production–inventory model with stock levels 0,…,σ0,\dots,\sigma0,…,σ, a stochastic kernel pjsp_{js}pjs​, real costs dijd_{ij}dij​ and discount 0<λ<10 < \lambda < 10<λ<1, assume that for every strategy JJJ (every map with i≤J(i)i \le J(i)i≤J(i)) the transition matrix (PJ)is=pJ(i)s(P_J)_{is} = p_{J(i)s}(PJ​)is​=pJ(i)s​ is indecomposable: for all i,ki, ki,k there is n≥0n \ge 0n≥0 with (PJn)ik>0(P_J^n)_{ik} > 0(PJn​)ik​>0. Let u∗u^*u∗ be a solution of (7),

ui∗=min⁡j≥i(dij+λ∑spjsus∗).u^*_i = \min_{j \ge i}\Big( d_{ij} + \lambda \sum_s p_{js} u^*_s \Big).ui∗​=j≥imin​(dij​+λs∑​pjs​us∗​).

Then u∗u^*u∗ is a strict vectorial maximum of the constraint set AAA of (9): for every u∈Au \in Au∈A with u≠u∗u \ne u^*u=u∗,

ui<ui∗for every i.u_i < u^*_i \qquad \text{for every } i.ui​<ui∗​for every i.

This is the sufficient condition stated at the end of the strict-maximum paragraph of Section 5.

Formalization Note Only the sufficient condition ("it is sufficient that they form an indecomposable group with respect to all the transition matrices PJP_JPJ​") is formalized; the paper's necessary and sufficient condition in terms of PJ∗P_{J^*}PJ∗​ is not, because it comes with no argument and its meaning when several strategies are optimal is unclear. "Indecomposable group" is read as irreducibility of the matrix, as in (5).

Preamble
import Mathlib
import Definitions.Def_DEpenoux_LinearProgram_Model
Formal statement
namespace DEpenoux.LinearProgram

theorem strict_vectorial_maximum (σ : ℕ) (p d : Fin (σ + 1) → Fin (σ + 1) → ℝ)
    (hp0 : ∀ j s, 0 ≤ p j s) (hp1 : ∀ j, ∑ s, p j s = 1)
    (lam : ℝ) (hlam0 : 0 < lam) (hlam1 : lam < 1)
    (hirr : ∀ J : Fin (σ + 1) → Fin (σ + 1), IsStrategy J →
      ∀ i k, ∃ n : ℕ, 0 < (stratMatrix p J ^ n) i k)
    (uStar : Fin (σ + 1) → ℝ)
    (huStar : BertsekasDiscountedBellmanOp (model σ p d hp0 hp1) lam uStar = uStar)
    (u : Fin (σ + 1) → ℝ) (hu : u ∈ setA p d lam) (hne : u ≠ uStar) :
    ∀ i, u i < uStar i := by sorry

end DEpenoux.LinearProgram
Source
d'Epenoux, A Probabilistic Production and Inventory Problem, Management Sci. 10 (1963), p. 104, Section 5 (strict vectorial maximum), using Eq. (5), p. 100
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