Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1, p. 163 — minimizing a convex function over one block of variables leaves a convex function

Proved
TopkisRation.Levels.lemma_1

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

convexityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1partial-minimization

Let EEE and FFF be real vector spaces, A⊆E×FA\subseteq E\times FA⊆E×F a convex set and φ:A→R\varphi:A\to\mathbb Rφ:A→R a convex function. Suppose that for every u∈Eu\in Eu∈E the values φ(u,w)\varphi(u,w)φ(u,w), (u,w)∈A(u,w)\in A(u,w)∈A, are bounded below. Then the function

ψ(u)=inf⁡w: (u,w)∈Aφ(u,w)\psi(u)=\inf_{w:\,(u,w)\in A}\varphi(u,w)ψ(u)=w:(u,w)∈Ainf​φ(u,w)

is convex on the projection {u: ∃w, (u,w)∈A}\{u:\ \exists w,\ (u,w)\in A\}{u: ∃w, (u,w)∈A}.

In the paper this well-known fact gives convexity of ftf_tft​ and gtg_tgt​ from the recursion (1): the infimum over the decision uuu of a jointly convex function of the state and the decision is convex in the state.

Formalization Note. The paper calls the function fff and the infimum ggg; they are renamed φ\varphiφ and ψ\psiψ here to avoid a clash with the model's ftf_tft​, gtg_tgt​. The boundedness hypothesis is added: the paper's infimum may be −∞-\infty−∞, which is not a real number, and a real sInf of a set unbounded below is the junk value 000, for which the conclusion can fail. With the hypothesis every infimum is the real number the paper means.

Preamble
import Mathlib
Formal statement
namespace TopkisRation.Levels

theorem lemma_1 {E F : Type*} [AddCommGroup E] [Module ℝ E] [AddCommGroup F] [Module ℝ F]
    (A : Set (E × F)) (hA : Convex ℝ A) (φ : E × F → ℝ) (hφ : ConvexOn ℝ A φ)
    (hbdd : ∀ u, BddBelow (φ '' {q | q ∈ A ∧ q.1 = u})) :
    ConvexOn ℝ (Prod.fst '' A) (fun u => sInf (φ '' {q | q ∈ A ∧ q.1 = 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), p. 163, Lemma 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