Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3, p. 164 — moving ε of demand from class i to a less important class j does not raise f_t or g_t

Proved
TopkisRation.Levels.lemma_3

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

dynamic-programminginventoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1rationing

In the model of Topkis (1968, §1) under Assumptions (A)–(C), let i>ji>ji>j be two demand classes, δi,δj\delta_i,\delta_jδi​,δj​ the corresponding unit vectors, and ε>0\varepsilon>0ε>0. Then:

  1. for 1≤t≤k1\le t\le k1≤t≤k, z≥0z\ge0z≥0 and B≥0B\ge0B≥0 with Bi≥εB^i\ge\varepsilonBi≥ε,
ft(z,B) ≥ ft(z, B−ε(δi−δj));(2)f_t(z,B)\ \ge\ f_t\big(z,\,B-\varepsilon(\delta_i-\delta_j)\big); \tag{2}ft​(z,B) ≥ ft​(z,B−ε(δi​−δj​));(2)
  1. for 0≤t≤k0\le t\le k0≤t≤k, z≥0z\ge0z≥0 and b≥0b\ge0b≥0 with bi≥εb^i\ge\varepsilonbi≥ε,
gt(z,b) ≥ gt(z, b−ε(δi−δj)).(3)g_t(z,b)\ \ge\ g_t\big(z,\,b-\varepsilon(\delta_i-\delta_j)\big). \tag{3}gt​(z,b) ≥ gt​(z,b−ε(δi​−δj​)).(3)

Demand of a more important class is never cheaper to face than the same amount of a less important class. The lemma relies on the backlog relation bt−1=atutb_{t-1}=a_tu_tbt−1​=at​ut​, and it is used to show that the priority vector (5) is optimal (Lemma 4).

Formalization Note. The page states the single hypothesis bi∧Bi≥ε>0b^i\wedge B^i\ge\varepsilon>0bi∧Bi≥ε>0 for both displays; each display carries here the part that concerns its own vector, which is the same claim.

Preamble
import Mathlib
import Definitions.Def_TopkisRation_Levels_Model
Formal statement
namespace TopkisRation.Levels

theorem lemma_3 {n : ℕ} (M : Model n) (hM : M.Standing) (i j : Fin n) (hij : j < i)
    (ε : ℝ) (hε : 0 < ε) :
    (∀ t ∈ Finset.Icc 1 M.k, ∀ z, 0 ≤ z → ∀ B : Fin n → ℝ, 0 ≤ B → ε ≤ B i →
      M.f t z (B - ε • (Pi.single i 1 - Pi.single j 1)) ≤ M.f t z B) ∧
    (∀ t ≤ M.k, ∀ z, 0 ≤ z → ∀ b : Fin n → ℝ, 0 ≤ b → ε ≤ b i →
      M.g t z (b - ε • (Pi.single i 1 - Pi.single j 1)) ≤ M.g t z b) := by sorry

end TopkisRation.Levels
Source
Topkis, Optimal ordering and rationing policies in a nonstationary dynamic inventory model with n demand classes, Management Science 15 (1968), p. 164, Lemma 3, (2) and (3)
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