Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

LEMMA II, pp. 872–873 — every minimizer of f over D lies beyond the relative interior of a face

Proved
SimpsonInv.Vertex.lemma_II

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

concave-minimizationfacesinventoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let n=m+1n = m + 1n=m+1 with m≥2m \ge 2m≥2 variables, let c,S0,Sn,T1,…,Tnc, S_0, S_n, T_1, \dots, T_nc,S0​,Sn​,T1​,…,Tn​ be real constants and r1,…,rn>0r_1, \dots, r_n > 0r1​,…,rn​>0, and let DDD and

f(S1,…,Sn−1)=c+∑i=1nriSi−1−Si+Tif(S_1, \dots, S_{n-1}) = c + \sum_{i=1}^{n} r_i \sqrt{S_{i-1} - S_i + T_i}f(S1​,…,Sn−1​)=c+i=1∑n​ri​Si−1​−Si​+Ti​​

be as in THEOREM I. DDD is defined by the 2n−12n - 12n−1 inequalities Si≥0S_i \ge 0Si​≥0 (1≤i≤n−11 \le i \le n-11≤i≤n−1) and Si−1−Si+Ti≥0S_{i-1} - S_i + T_i \ge 0Si−1​−Si​+Ti​≥0 (1≤i≤n1 \le i \le n1≤i≤n). If v∈Dv \in Dv∈D minimizes fff over DDD, then the normals of the inequalities that hold with equality at vvv span a space of dimension at least two.

In the paper's words, the minimum lies on the boundary of the faces of DDD, not in the relative interior of a single face; iterating this is the induction that proves THEOREM I.

Formalization Note "On the boundary of the 'faces'" is encoded by tightRank ≥ 2: at least two independent active boundary normals. This excludes a point on just one facet even when two listed inequalities define that same facet. The hypothesis m≥2m \ge 2m≥2 is added: with one variable the faces are points and the statement degenerates. ri>0r_i > 0ri​>0 is from equation (8). Lean index jjj is the paper's Sj+1S_{j+1}Sj+1​.

Preamble
import Mathlib
import Definitions.Def_SimpsonInv_Vertex_Setting
Formal statement
namespace SimpsonInv.Vertex

theorem lemma_II {m : ℕ} (c S0 Sn : ℝ) (r T : ℕ → ℝ) (hm : 2 ≤ m)
    (hr : ∀ i ∈ Finset.Icc 1 (m + 1), 0 < r i) :
    ∀ v ∈ dom (m := m) T S0 Sn,
      IsMinOn (cost c r T S0 Sn) (dom (m := m) T S0 Sn) v → 2 ≤ tightRank T S0 Sn v := by sorry

end SimpsonInv.Vertex
Source
Simpson, In-Process Inventories, Operations Research 6 (1958), pp. 872–873, LEMMA II
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