Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 9, p. 20 — F semiconvex at x̄ w.r.t. Rⁿ and 0 ∈ ∂F(x̄) imply x̄ minimizes F over Rⁿ

Proved
MifflinSemismooth.Optimality.minimizer_of_zero_mem

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

global-minimizernonsmooth-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1semiconvex

Let F:Rn→RF:\mathbb R^n\to\mathbb RF:Rn→R be semiconvex at xˉ\bar xxˉ with respect to X=RnX=\mathbb R^nX=Rn, and suppose 0∈∂F(xˉ)0\in\partial F(\bar x)0∈∂F(xˉ). Then xˉ\bar xxˉ is a global minimizer of FFF:

F(xˉ)≤F(x)for all x∈Rn.F(\bar x)\le F(x)\qquad\text{for all } x\in\mathbb R^n.F(xˉ)≤F(x)for all x∈Rn.

In the proof of Theorem 9 this is applied to hhh when h(xˉ)>0h(\bar x)>0h(xˉ)>0 (giving part (a)), to fff when h(xˉ)<0h(\bar x)<0h(xˉ)<0 (giving part (b)(i)), and to hhh when h(xˉ)=0h(\bar x)=0h(xˉ)=0 and λ=0\lambda=0λ=0 (giving part (b)(ii)).

Formalization Note The page states the step separately for hhh and for fff; it is stated once here for a generic FFF. Semiconvexity is assumed only at xˉ\bar xxˉ (with respect to Rn\mathbb R^nRn), which is all the step uses.

Preamble
import Mathlib
import Definitions.Def_MifflinSemismooth_Optimality_Setting
Formal statement
namespace MifflinSemismooth.Optimality

/-- Mifflin (1976), §5, proof of Theorem 9, p. 20: if `F` is semiconvex at `x̄` with respect to
`ℝⁿ` and `0 ∈ ∂F(x̄)`, then `x̄` minimizes `F` over `ℝⁿ`. -/
theorem minimizer_of_zero_mem {n : ℕ} (F : EuclideanSpace ℝ (Fin n) → ℝ)
    (xbar : EuclideanSpace ℝ (Fin n)) (hF : MifflinSemismooth.Extremal.SemiconvexAt Set.univ F xbar)
    (h0 : (0 : EuclideanSpace ℝ (Fin n)) ∈ MifflinSemismooth.Extremal.genGrad F xbar) :
    ∀ x, F xbar ≤ F x := by sorry

end MifflinSemismooth.Optimality
Source
Mifflin, Semismooth and semiconvex functions in constrained optimization, IIASA Research Report RR-76-21 (December 1976), p. 20, §5, proof of Theorem 9, first two sentences
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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