Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 1, p. 165 — some optimal u leaves no demand of class i > j unsatisfied whenever u^j < B^j

Proved
TopkisRation.Levels.corollary_1

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 and B≥0B\ge0B≥0. There is a feasible vector uuu (0≤u≤B0\le u\le B0≤u≤B, 1⋅(B−u)≤z\mathbf 1\cdot(B-u)\le z1⋅(B−u)≤z) that attains the minimum in (1),

ft(z,B)=pt⋅u+ht(z−1⋅(B−u))+gt−1(z−1⋅(B−u), atu),f_t(z,B)=p_t\cdot u+h_t\big(z-\mathbf 1\cdot(B-u)\big)+g_{t-1}\big(z-\mathbf 1\cdot(B-u),\,a_tu\big),ft​(z,B)=pt​⋅u+ht​(z−1⋅(B−u))+gt−1​(z−1⋅(B−u),at​u),

and satisfies: uj<Bju^j<B^juj<Bj implies ui=0u^i=0ui=0 for all i>ji>ji>j.

So some optimal rationing decision serves a class only after every more important class has been fully served.

Formalization Note. "Optimal feasible" is read as attaining ft(z,B)f_t(z,B)ft​(z,B) in (1); by Lemma 2 that value is the minimum of the bracket.

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

theorem corollary_1 {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) :
    ∃ u ∈ feasible z B, M.f t z B = M.obj t (M.g (t - 1)) z B u ∧
      ∀ j i : Fin n, u j < B j → j < i → u i = 0 := 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. 165, Corollary 1
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