Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(6), p. 165 — f_t(z, B) is the minimum of f_t(w; z, B) over w ∈ [(z − B^{(1)})⁺, z]

Proved
TopkisRation.Levels.eq_6

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, and write B(1)=∑jBjB^{(1)}=\sum_jB^jB(1)=∑j​Bj. Then

ft(z,B)=min⁡w∈[(z−B(1))+, z]ft(w;z,B),(6)f_t(z,B)=\min_{w\in[(z-B^{(1)})^+,\,z]}f_t(w;z,B), \tag{6}ft​(z,B)=w∈[(z−B(1))+,z]min​ft​(w;z,B),(6)

where ft(w;z,B)f_t(w;z,B)ft​(w;z,B) is the cost (4) of issuing exactly z−wz-wz−w units in interval ttt: the infimum over www equals ft(z,B)f_t(z,B)ft​(z,B) and is attained.

Together with Lemma 4 this reduces the choice of the optimal vector uuu in (1) to the choice of the single number www, the stock level after rationing.

Formalization Note. The statement asserts both the equality with the real sInf and the existence of a minimizing www, which is what "min" means.

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

theorem eq_6 {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) :
    M.f t z B = sInf ((fun w => M.fw t w z B) '' Set.Icc (max (z - ∑ j, B j) 0) z) ∧
    ∃ w ∈ Set.Icc (max (z - ∑ j, B j) 0) z, M.fw t w z B = M.f 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. 165, (6)
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