Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Extension of the main theorem, p. 871 — with √· replaced by t^k, ½ ≤ k ≤ 1, the minimum still occurs at a vertex of D

Proved
SimpsonInv.Vertex.theorem_I_rpow

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

concave-minimizationextreme-pointinventoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let n=m+1n = m + 1n=m+1, let c,S0,Sn,T1,…,Tnc, S_0, S_n, T_1, \dots, T_nc,S0​,Sn​,T1​,…,Tn​ be real constants, r1,…,rn>0r_1, \dots, r_n > 0r1​,…,rn​>0, and let kkk be a constant with 12≤k≤1\tfrac12 \le k \le 121​≤k≤1. Let DDD be the domain of THEOREM I (Si≥0S_i \ge 0Si​≥0 and Si−1−Si+Ti≥0S_{i-1} - S_i + T_i \ge 0Si−1​−Si​+Ti​≥0) and assume D≠∅D \neq \emptysetD=∅. Then the function

fk(S1,…,Sn−1)=c+∑i=1nri (Si−1−Si+Ti)kf_k(S_1, \dots, S_{n-1}) = c + \sum_{i=1}^{n} r_i \,(S_{i-1} - S_i + T_i)^kfk​(S1​,…,Sn−1​)=c+i=1∑n​ri​(Si−1​−Si​+Ti​)k

attains its minimum over DDD at a vertex of DDD.

This covers correlated demand, where the standard deviation of demand over a time ttt grows like tkt^ktk instead of t\sqrt tt​; k=1k = 1k=1 is the linear-programming case.

Formalization Note Vertex means extreme point. ri>0r_i > 0ri​>0 (equation (8)) and D≠∅D \ne \emptysetD=∅ are added as for THEOREM I. The power is Real.rpow; on DDD its base is nonnegative. The range 12≤k≤1\tfrac12 \le k \le 121​≤k≤1 is the page's "between ½ and 1", endpoints included because the page treats k=1k = 1k=1 as the limiting case where "the result is known".

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

theorem theorem_I_rpow {m : ℕ} (k c S0 Sn : ℝ) (r T : ℕ → ℝ)
    (hk : 1 / 2 ≤ k) (hk1 : k ≤ 1)
    (hr : ∀ i ∈ Finset.Icc 1 (m + 1), 0 < r i)
    (hD : (dom (m := m) T S0 Sn).Nonempty) :
    ∃ v ∈ Set.extremePoints ℝ (dom (m := m) T S0 Sn),
      IsMinOn (costPow k c r T S0 Sn) (dom (m := m) T S0 Sn) v := by sorry

end SimpsonInv.Vertex
Source
Simpson, In-Process Inventories, Operations Research 6 (1958), p. 871, Extension of the main theorem, Correlated demand
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