Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1(b), p. 3 — F⁰(x;d) = max [⟨g,d⟩ : g ∈ ∂F(x)]

Proved
MifflinSemismooth.Extremal.prop1_b

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

generalized-gradientnonsmooth-analysisp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1support-function

Let B⊆RnB\subseteq\mathbb R^nB⊆Rn be open and let F:Rn→RF:\mathbb R^n\to\mathbb RF:Rn→R be Lipschitz on BBB with constant KKK. Let x∈Bx\in Bx∈B. Then for every direction d∈Rnd\in\mathbb R^nd∈Rn the generalized directional derivative is the largest value of ⟨g,d⟩\langle g,d\rangle⟨g,d⟩ over the generalized gradient, and this largest value is attained:

F0(x;d)=max⁡{⟨g,d⟩: g∈∂F(x)}.F^0(x;d)=\max\{\langle g,d\rangle:\ g\in\partial F(x)\}.F0(x;d)=max{⟨g,d⟩: g∈∂F(x)}.

So F0(x;⋅)F^0(x;\cdot)F0(x;⋅) is the support function of ∂F(x)\partial F(x)∂F(x). In the proof of Theorem 2 this identity is applied to the extremal function EEE.

Formalization Note. "max" is IsGreatest of the image of ∂F(x)\partial F(x)∂F(x) under g↦⟨g,d⟩g\mapsto\langle g,d\rangleg↦⟨g,d⟩, asserting both the bound and its attainment. The Lipschitz hypothesis also ensures that the real limsup defining F0F^0F0 is not a default value.

Preamble
import Mathlib
import Definitions.Def_ClarkeGradients_Shared_genDirDeriv
import Definitions.Def_MifflinSemismooth_Extremal_Basic

open Filter Topology
Formal statement
namespace MifflinSemismooth.Extremal

/-- Mifflin (1976), Proposition 1(b), p. 3: for `F` Lipschitz on the open set `B` and `x ∈ B`,
`F⁰(x; d) = max [⟨g, d⟩ : g ∈ ∂F(x)]` for every `d`. -/
theorem prop1_b {n : ℕ} (F : EuclideanSpace ℝ (Fin n) → ℝ) (B : Set (EuclideanSpace ℝ (Fin n)))
    (hB : IsOpen B) (K : NNReal) (hFB : LipschitzOnWith K F B) (x : EuclideanSpace ℝ (Fin n))
    (hx : x ∈ B) :
    ∀ d, IsGreatest ((fun g => inner ℝ g d) '' genGrad F x)
      (ClarkeGradients.Shared.genDirDeriv F x d) := by sorry

end MifflinSemismooth.Extremal
Source
Mifflin, Semismooth and semiconvex functions in constrained optimization, IIASA Research Report RR-76-21 (December 1976), p. 3, Proposition 1(b)
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