Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4, last paragraph — (8.0) is redundant: Σxᵢⱼ = 1 and (8.1)–(8.T) imply (8.0)

Proved
ManneLP.Equilibrium.eq_8_0_redundant

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

linear-programmingmarkov-chainsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider Manne's inventory model with admissible pairs AAA (so i+j≤Ti+j\le Ti+j≤T for every (i,j)∈A(i,j)\in A(i,j)∈A) and demand law (pn)(p_n)(pn​), ∑npn=1\sum_np_n=1∑n​pn​=1. Let (xij)(i,j)∈A(x_{ij})_{(i,j)\in A}(xij​)(i,j)∈A​ be real numbers with

∑(i,j)∈Axij=1\sum_{(i,j)\in A}x_{ij}=1(i,j)∈A∑​xij​=1

that satisfy the equations (8.t), ∑jxtj=∑i+j−n=tpnxij\sum_j x_{tj}=\sum_{i+j-n=t}p_nx_{ij}∑j​xtj​=∑i+j−n=t​pn​xij​, for t=1,…,Tt=1,\dots,Tt=1,…,T. Then xxx also satisfies (8.0):

∑jx0j=∑i,j,n:i+j−n≤0pnxij.\sum_j x_{0j}=\sum_{\substack{i,j,n:\\ i+j-n\le 0}}p_nx_{ij}.j∑​x0j​=i,j,n:i+j−n≤0​∑​pn​xij​.

This is why the linear program's constraint set consists of the non-negativity conditions, (4) and (8.1)–(8.T) only.

Formalization Note Non-negativity of xxx is not assumed; the statement is the stronger one, and the paper's claim is its special case.

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

theorem eq_8_0_redundant (M : Model) (x : ℕ × ℕ → ℝ)
    (h4 : ∑ a ∈ M.A, x a = 1) (h8 : ∀ t : ℕ, 1 ≤ t → t ≤ M.T → Eq8t M x t) :
    Eq80 M x := by sorry

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