Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1(a), p. 3 — ∂F(x) is a nonempty convex compact set

Proved
MifflinSemismooth.Extremal.prop1_a

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

generalized-gradientnonsmooth-analysisp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

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 and let ∂F(x)={g:⟨g,d⟩≤F0(x;d) ∀d}\partial F(x)=\{g:\langle g,d\rangle\le F^0(x;d)\ \forall d\}∂F(x)={g:⟨g,d⟩≤F0(x;d) ∀d} be the generalized gradient. Then

∂F(x) is a nonempty, convex, compact subset of Rn.\partial F(x)\ \text{is a nonempty, convex, compact subset of}\ \mathbb R^n.∂F(x) is a nonempty, convex, compact subset of Rn.

This is the basic regularity property of the generalized gradient, collected in the paper from Clarke; it makes maxima over ∂F(x)\partial F(x)∂F(x) attained and is used throughout the theory of semismooth functions.

Formalization Note. ∂F\partial F∂F is the support-set definition of the mission's Basic file. The Lipschitz constant is a nonnegative real; the page's positive KKK is equivalent.

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(a), p. 3: for `F` Lipschitz on the open set `B` and `x ∈ B`,
`∂F(x)` is a nonempty convex compact subset of `ℝⁿ`. -/
theorem prop1_a {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) :
    (genGrad F x).Nonempty ∧ Convex ℝ (genGrad F x) ∧ IsCompact (genGrad F x) := 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(a)
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