Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2, p. 163 — g_t and f_t are convex and continuous on the orthant, and the infimum in (1) is a minimum

Proved
TopkisRation.Levels.lemma_2

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

convexitydynamic-programminginventoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

In the model of Topkis (1968, §1) under Assumptions (A)–(C), let 0≤t≤k0\le t\le k0≤t≤k and let D=[0,∞)×[0,∞)nD=[0,\infty)\times[0,\infty)^nD=[0,∞)×[0,∞)n. Then:

  1. gt(z,b)g_t(z,b)gt​(z,b) is convex and continuous on DDD;
  2. if t≥1t\ge1t≥1, ft(z,B)f_t(z,B)ft​(z,B) is convex and continuous on DDD;
  3. if t≥1t\ge1t≥1, for every z≥0z\ge0z≥0 and B≥0B\ge0B≥0 the infimum in (1) is attained: there is a feasible uuu with
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 the bracket of (1) at uuu is no larger than at any other feasible vector; 4. if t≥1t\ge1t≥1, for every z≥0z\ge0z≥0 and b≥0b\ge0b≥0 the function x↦ft(z,b+x)x\mapsto f_t(z,b+x)x↦ft​(z,b+x) is integrable with respect to the law μt\mu_tμt​ of dtd_tdt​.

This is the regularity on which the rest of the analysis rests: the infimum in (1) can be replaced by a minimum, and gtg_tgt​ is a genuine expectation.

Formalization Note. The page writes "gt(z,b)g_t(z,b)gt​(z,b) and ht(z,B)h_t(z,B)ht​(z,B)"; the second function is ft(z,B)f_t(z,B)ft​(z,B) (a misprint: hth_tht​ has one argument and the next sentence speaks of ftf_tft​). Item 4 makes explicit what the paper's proof derives from "the Lebesgue Convergence Theorem and the finite means of the demands"; it is what makes the Bochner integral defining gtg_tgt​ the paper's expectation rather than a junk value. Item 3 is the paper's "the infimum can be replaced by minimum", which makes the real sInf defining ftf_tft​ the paper's value.

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

open MeasureTheory

theorem lemma_2 {n : ℕ} (M : Model n) (hM : M.Standing) (t : ℕ) (ht : t ≤ M.k) :
    (ConvexOn ℝ (Set.Ici (0 : ℝ) ×ˢ Set.Ici (0 : Fin n → ℝ)) (fun q => M.g t q.1 q.2) ∧
      ContinuousOn (fun q => M.g t q.1 q.2) (Set.Ici (0 : ℝ) ×ˢ Set.Ici (0 : Fin n → ℝ))) ∧
    (1 ≤ t →
      ConvexOn ℝ (Set.Ici (0 : ℝ) ×ˢ Set.Ici (0 : Fin n → ℝ)) (fun q => M.f t q.1 q.2) ∧
      ContinuousOn (fun q => M.f t q.1 q.2) (Set.Ici (0 : ℝ) ×ˢ Set.Ici (0 : Fin n → ℝ))) ∧
    (1 ≤ t → ∀ z, 0 ≤ z → ∀ B : Fin n → ℝ, 0 ≤ B →
      ∃ u ∈ feasible z B, M.f t z B = M.obj t (M.g (t - 1)) z B u ∧
        ∀ u' ∈ feasible z B, M.obj t (M.g (t - 1)) z B u ≤ M.obj t (M.g (t - 1)) z B u') ∧
    (1 ≤ t → ∀ z, 0 ≤ z → ∀ b : Fin n → ℝ, 0 ≤ b →
      Integrable (fun x => M.f t z (b + x)) (M.μ t)) := 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. 163, Lemma 2
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