Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4, p. 165 — the priority vector u(z − w, B) of (5) is feasible for (4) and minimizes it

Proved
TopkisRation.Levels.lemma_4

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 1≤t≤k1\le t\le k1≤t≤k, z≥0z\ge0z≥0, B≥0B\ge0B≥0 and w∈[(z−B(1))+,z]w\in[(z-B^{(1)})^+,z]w∈[(z−B(1))+,z]. Let U={u: 0≤u≤B, 1⋅(B−u)=z−w}U=\{u:\ 0\le u\le B,\ \mathbf 1\cdot(B-u)=z-w\}U={u: 0≤u≤B, 1⋅(B−u)=z−w} be the constraint set of (4), and let u(z−w,B)u(z-w,B)u(z−w,B) be the vector (5), uj(z−w,B)=(B(j)−z+w)+∧Bju^j(z-w,B)=(B^{(j)}-z+w)^+\wedge B^juj(z−w,B)=(B(j)−z+w)+∧Bj. Then u(z−w,B)∈Uu(z-w,B)\in Uu(z−w,B)∈U and

pt⋅u(z−w,B)+gt−1(w,atu(z−w,B)) ≤ pt⋅u+gt−1(w,atu)for all u∈U.p_t\cdot u(z-w,B)+g_{t-1}\big(w,a_tu(z-w,B)\big)\ \le\ p_t\cdot u+g_{t-1}(w,a_tu)\qquad\text{for all } u\in U .pt​⋅u(z−w,B)+gt−1​(w,at​u(z−w,B)) ≤ pt​⋅u+gt−1​(w,at​u)for all u∈U.

Whatever amount of stock is issued in an interval, it is optimal to issue it to the classes in order of importance.

Formalization Note. Minimality is stated directly against every u∈Uu\in Uu∈U, not through the infimum defining ft(w;z,B)f_t(w;z,B)ft​(w;z,B).

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

theorem lemma_4 {n : ℕ} (M : Model n) (hM : M.Standing) (t : ℕ) (ht : t ∈ Finset.Icc 1 M.k)
    (z : ℝ) (hz : 0 ≤ z) (B : Fin n → ℝ) (hB : 0 ≤ B)
    (w : ℝ) (hw : w ∈ Set.Icc (max (z - ∑ j, B j) 0) z) :
    uVec (z - w) B ∈ {u : Fin n → ℝ | 0 ≤ u ∧ u ≤ B ∧ ∑ j, (B j - u j) = z - w} ∧
    ∀ u ∈ {u : Fin n → ℝ | 0 ≤ u ∧ u ≤ B ∧ ∑ j, (B j - u j) = z - w},
      M.p t ⬝ᵥ uVec (z - w) B + M.g (t - 1) w (M.a t • uVec (z - w) B) ≤
        M.p t ⬝ᵥ u + M.g (t - 1) w (M.a t • u) := 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), pp. 164–165, Lemma 4 with (4) and (5)
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