Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Ξ′≤Ξ\Xi'\le\XiΞ′≤Ξ and Ξ′\Xi'Ξ′ is convex

Proved
Sherbrooke.lowerHull_le_and_convex

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

discrete-convexityinventorymarginal-analysismetric

Let Ξ:N→R\Xi:\mathbb N\to\mathbb RΞ:N→R be bounded below and let Ξ′\Xi'Ξ′ be its convexified function (the lower boundary of the convex hull of Ξ\XiΞ). Then

  1. Ξ′(m)≤Ξ(m)\Xi'(m)\le\Xi(m)Ξ′(m)≤Ξ(m) for every m∈Nm\in\mathbb Nm∈N, and
  2. Ξ′\Xi'Ξ′ is convex on N\mathbb NN: for every mmm,
Ξ′(m+1)−Ξ′(m) ≤ Ξ′(m+2)−Ξ′(m+1).\Xi'(m+1)-\Xi'(m)\ \le\ \Xi'(m+2)-\Xi'(m+1).Ξ′(m+1)−Ξ′(m) ≤ Ξ′(m+2)−Ξ′(m+1).

These are the two properties Sherbrooke's definition of Ξi′\Xi_i'Ξi′​ asserts ("lies on the boundary of the convex hull", "decreased to the point of convexity", "Ξi′(mi)≤Ξi(mi)\Xi_i'(m_i)\le\Xi_i(m_i)Ξi′​(mi​)≤Ξi​(mi​)") and that the proof of the Appendix Theorem uses ("Since the function Ξi′\Xi_i'Ξi′​ is convex").

Differences from the source:

  • generalization: Ξ_i monotonic decreasing (standing hypothesis) → hypothesis dropped; reason: this step does not use it; the statement specializes to the source's setting by adding it
  • encoding: Ξ_i′ defined on the boundary of the convex hull of Ξ_i with Ξ_i′ ≤ Ξ_i → lowerHull Ξ m, the supremum of a m + b over all affine minorants k ↦ a k + b of Ξ on ℕ; reason: on ℕ this is the same function: the lower boundary of the convex hull of the points (k, Ξ(k)), equal to the greatest discretely convex minorant
  • encoding: finite lower bound → BddBelow (Set.range Ξ); reason: same instances
  • encoding: Ξ_i′ convex → forward differences of Ξ′ nondecreasing on ℕ; reason: discrete convexity of a sequence; same instances
Preamble
import Mathlib
import Definitions.Def_Sherbrooke_lowerHull
Formal statement
namespace Sherbrooke

/-- **M1: `Ξ′` lies below `Ξ` and is convex.** Sherbrooke, *METRIC*, Operations Research 16
(1968), unnumbered, pp. 135–136: "Let us define a new function Ξ_i′(m) which lies on the boundary
of the convex hull of Ξ_i(m). In other words at any point where Ξ_i(m) is not convex the function
is decreased to the point of convexity in forming the new function Ξ_i′(m)." Used in the proof of
the Appendix Theorem, p. 140: "Since the function Ξ_i′ is convex".

If `Ξ : ℕ → ℝ` is bounded below, then `lowerHull Ξ ≤ Ξ` pointwise and `lowerHull Ξ` is
discretely convex: its forward differences are nondecreasing.

**Formalization Note.** Discrete convexity on `ℕ` is
`Ξ′(m+1) − Ξ′(m) ≤ Ξ′(m+2) − Ξ′(m+1)` for all `m`. The paper's standing hypothesis that `Ξ` is
monotonic decreasing is not needed for this step and is dropped (a generalization). -/
theorem lowerHull_le_and_convex (Ξ : ℕ → ℝ) (hbdd : BddBelow (Set.range Ξ)) :
    (∀ m : ℕ, lowerHull Ξ m ≤ Ξ m) ∧
      ∀ m : ℕ, lowerHull Ξ (m + 1) - lowerHull Ξ m ≤
        lowerHull Ξ (m + 2) - lowerHull Ξ (m + 1) := by sorry

end Sherbrooke
Source
Sherbrooke, METRIC: A Multi-Echelon Technique for Recoverable Item Control, Operations Research 16 (1968), doi:10.1287/opre.16.1.122, unnumbered, pp. 135–136 (Ξ_i′ on the boundary of the convex hull, decreased to the point of convexity); used in the Appendix, proof of the Theorem, p. 140

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