Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A local minimum of a convex function is global

Proved
VectorSpaceOpt.convex_local_min_global

by wenxinzhang · Aug 25, 2026 · Mathlib c5ea003 (Lean v4.30.0)

convex-functionglobal-minimumlocal-minimumoptimization

Let CCC be a convex subset of a real normed space and let f:C→Rf:C\to\mathbb Rf:C→R be convex, represented by ConvexOn ℝ C f. If x0∈Cx_0\in Cx0​∈C is a local minimum relative to CCC, then

∀x∈C,f(x0)≤f(x).\forall x\in C,\qquad f(x_0)\le f(x).∀x∈C,f(x0​)≤f(x).

The local-minimum hypothesis uses the subspace neighborhood filter, so no openness of CCC is assumed and boundary minimizers are included. This is the first global consequence of convexity in Luenberger's chapter. As a mission milestone it establishes the local-to-global optimization interface that later lets dual certificates be interpreted as certificates for the entire feasible domain.

Preamble
import Mathlib
Formal statement
namespace VectorSpaceOpt

/-- Luenberger, Chapter 7, §7.8, Proposition 1. -/
theorem convex_local_min_global
    {X : Type*} [NormedAddCommGroup X] [NormedSpace ℝ X]
    (C : Set X) (f : X → ℝ) (x₀ : X)
    (hf : ConvexOn ℝ C f) (hx₀ : x₀ ∈ C)
    (hlocal : IsLocalMinOn f C x₀) :
    ∀ x ∈ C, f x₀ ≤ f x := by sorry

end VectorSpaceOpt
Source
David G. Luenberger, Optimization by Vector Space Methods, Wiley, 1969, public scan https://sites.science.oregonstate.edu/~show/old/142_Luenberger.pdf, Chapter 7, §7.8, Proposition 1, printed p. 191; physical PDF p. 211.
Read-back

What the Lean code literally says, in plain math · gpt-5

For every real normed vector space XXX, set C⊆XC⊆XC⊆X, function f:X→Rf : X → ℝf:X→R, and point x0∈Xx₀∈Xx0​∈X, if fff is convex on CCC, x0∈Cx₀∈Cx0​∈C, and x0x₀x0​ is a local minimum of fff relative to CCC, then f(x0)≤f(x)f(x₀)≤f(x)f(x0​)≤f(x) for every x∈Cx∈Cx∈C. The membership hypothesis makes CCC nonempty; no closedness, openness, finite-dimensionality, or attainment statement for any other point is assumed.

Human review
  • Endorsed by Shuze Chen · Aug 25, 2026

  • Endorsed by wenxinzhang · Aug 25, 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