Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 8, p. 19 — semiconvex F on a convex X: F(x+d) ≦ F(x) implies F'(x;d) ≦ 0

Proved
MifflinSemismooth.Optimality.theorem8

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

directional-derivativenonsmooth-analysisp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1semiconvex

Let X⊆RnX\subseteq\mathbb R^nX⊆Rn be convex and let F:Rn→RF:\mathbb R^n\to\mathbb RF:Rn→R be semiconvex on XXX (at each point of XXX, with respect to XXX). Let x∈Xx\in Xx∈X and d∈Rnd\in\mathbb R^nd∈Rn with x+d∈Xx+d\in Xx+d∈X. Then the directional derivative F′(x;d)F'(x;d)F′(x;d) exists, and

F(x+d)≤F(x)⟹F′(x;d)≤0.F(x+d)\le F(x)\quad\Longrightarrow\quad F'(x;d)\le 0.F(x+d)≤F(x)⟹F′(x;d)≤0.

This is a nonsmooth analogue of the fact that a pseudoconvex function cannot increase infinitesimally in a direction along which it does not increase overall. In the proof of Theorem 9 it is applied to the constraint function hhh at a point with h(xˉ)=0h(\bar x)=0h(xˉ)=0.

Formalization Note F′(x;d)F'(x;d)F′(x;d) is the relation HasDirDeriv; the conclusion states that the limit exists and that every value it has is ≤0\le 0≤0. Existence is part of Definition 2(b) at xxx, so the conjunct adds nothing beyond the page.

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

/-- Mifflin (1976), §5, Theorem 8, p. 19: if `F` is semiconvex on a convex set `X`, `x ∈ X` and
`x + d ∈ X`, then `F(x + d) ≤ F(x)` implies `F'(x; d) ≤ 0`. -/
theorem theorem8 {n : ℕ} (F : EuclideanSpace ℝ (Fin n) → ℝ) (X : Set (EuclideanSpace ℝ (Fin n)))
    (hX : Convex ℝ X) (hF : MifflinSemismooth.Extremal.SemiconvexOn X F) (x d : EuclideanSpace ℝ (Fin n)) (hx : x ∈ X)
    (hxd : x + d ∈ X) (hle : F (x + d) ≤ F x) :
    (∃ L, MifflinSemismooth.Extremal.HasDirDeriv F x d L) ∧ ∀ L, MifflinSemismooth.Extremal.HasDirDeriv F x d L → L ≤ 0 := by sorry

end MifflinSemismooth.Optimality
Source
Mifflin, Semismooth and semiconvex functions in constrained optimization, IIASA Research Report RR-76-21 (December 1976), p. 19, Theorem 8
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