Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4, (6)–(7) — the law of the terminal stock in terms of the joint probabilities xᵢⱼ

Proved
ManneLP.Equilibrium.terminal_law_eq_7

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

inventorymarkov-chainsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider Manne's inventory model with stock levels 0,…,T0,\dots,T0,…,T, admissible pairs AAA and demand law (pn)(p_n)(pn​). Let q(j∣i)q(j\mid i)q(j∣i) be any assignment of production probabilities and y=(y0,…,yT)y=(y_0,\dots,y_T)y=(y0​,…,yT​) any weights on the initial stock, and put xij=yi q(j∣i)x_{ij}=y_i\,q(j\mid i)xij​=yi​q(j∣i). If the chain of qqq moves from iii to ttt with probability Pq(i,t)=∑jq(j∣i)Pr⁡(max⁡(0,i+j−n)=t)P_q(i,t)=\sum_{j}q(j\mid i)\Pr(\max(0,i+j-n)=t)Pq​(i,t)=∑j​q(j∣i)Pr(max(0,i+j−n)=t), then the law yt′=∑iyiPq(i,t)y'_t=\sum_i y_iP_q(i,t)yt′​=∑i​yi​Pq​(i,t) of the terminal stock is given by (7):

y0′=∑i,j,n:i+j−n≤0pnxij,yt′=∑i,j,n:i+j−n=tpnxij(t=1,2,…,T).y'_0=\sum_{\substack{i,j,n:\\ i+j-n\le 0}}p_nx_{ij},\qquad y'_t=\sum_{\substack{i,j,n:\\ i+j-n=t}}p_nx_{ij}\quad(t=1,2,\dots,T).y0′​=i,j,n:i+j−n≤0​∑​pn​xij​,yt′​=i,j,n:i+j−n=t​∑​pn​xij​(t=1,2,…,T).

This identifies the right-hand sides of the equilibrium equations (8.0)–(8.T) with the one-step law of the controlled Markov chain, which is the link between the decision problem and the linear program.

Formalization Note The identity holds for every qqq and yyy, with no normalization, and is stated that way. Sums over (i,j)(i,j)(i,j) run over the admissible pairs; sums over nnn are tsums.

Preamble
import Mathlib
import Definitions.Def_ManneLP_Equilibrium_Model
import Definitions.Def_ManneLP_Equilibrium_Chain
import Definitions.Def_ManneLP_Equilibrium_LP
Formal statement
namespace ManneLP.Equilibrium

theorem terminal_law_eq_7 (M : Model) (q : ℕ → ℕ → ℝ) (y : ℕ → ℝ) :
    ∑ i ∈ states M, y i * trans M q i 0 = rhsZero M (jointLaw y q) ∧
    ∀ t : ℕ, 1 ≤ t → t ≤ M.T →
      ∑ i ∈ states M, y i * trans M q i t = rhsPos M (jointLaw y q) t := by sorry

end ManneLP.Equilibrium
Source
Manne, Linear Programming and Sequential Decisions, Management Science 6 (1960), pp. 261–262 (PDF pp. 4–5), §4, (6) and (7)
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