Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix, p. 872 — f is continuous and D compact, so f achieves its minimum on D

Proved
SimpsonInv.Vertex.exists_isMinOn

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

compactnessexistence-of-minimuminventoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let n=m+1n = m + 1n=m+1, let c,S0,Snc, S_0, S_nc,S0​,Sn​ and ri,Tir_i, T_iri​,Ti​ (1≤i≤n1 \le i \le n1≤i≤n) be real constants, and suppose the domain DDD (all Si≥0S_i \ge 0Si​≥0 and all radicands Si−1−Si+Ti≥0S_{i-1} - S_i + T_i \ge 0Si−1​−Si​+Ti​≥0) is nonempty. Then the cost function

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​​

attains its minimum on DDD: there is v∈Dv \in Dv∈D with f(v)≤f(S)f(v) \le f(S)f(v)≤f(S) for every S∈DS \in DS∈D.

This is the first step of the Appendix's proof of THEOREM I; the rest of the proof locates the minimizer.

Formalization Note The nonemptiness of DDD is added: "the function does achieve its minimum" presupposes it. No sign condition on rir_iri​ is needed. Lean index jjj of Fin m → ℝ 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 exists_isMinOn {m : ℕ} (c S0 Sn : ℝ) (r T : ℕ → ℝ)
    (hD : (dom (m := m) T S0 Sn).Nonempty) :
    ∃ v ∈ dom (m := m) T S0 Sn, IsMinOn (cost 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. 872, Appendix. Proof of Theorem I (opening paragraph)
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