Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1(d) — boundedness and upper semicontinuity of generalized gradients

Proved
MifflinSemismooth.Composition.prop1_d

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

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

Let FFF be Lipschitz with constant KKK on an open set BBB, and let xk∈Bx_k\in Bxk​∈B converge to x∈Bx\in Bx∈B. If gk∈∂F(xk)g_k\in\partial F(x_k)gk​∈∂F(xk​) for every kkk, then

∥gk∥≤Kfor every k,g∈∂F(x)for every accumulation point g of (gk).\|g_k\|\le K\quad\text{for every }k,\qquad g\in\partial F(x)\quad\text{for every accumulation point }g\text{ of }(g_k).∥gk​∥≤Kfor every k,g∈∂F(x)for every accumulation point g of (gk​).

Thus the generalized-gradient map is locally bounded and upper semicontinuous in the sequence sense used in the paper.

Formalization Note The paper's positive Lipschitz constant is represented by NNReal, which can always be enlarged to a positive one.

Preamble
import Mathlib
import Definitions.Def_MifflinSemismooth_Extremal_Basic

open Filter Topology
Formal statement
namespace MifflinSemismooth.Composition

theorem prop1_d {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) :
    ∀ (xs gs : ℕ → EuclideanSpace ℝ (Fin n)),
      (∀ k, xs k ∈ B) → Tendsto xs atTop (𝓝 x) →
      (∀ k, gs k ∈ MifflinSemismooth.Extremal.genGrad F (xs k)) →
      (∀ k, ‖gs k‖ ≤ K) ∧
        ∀ g, MapClusterPt g atTop gs → g ∈ MifflinSemismooth.Extremal.genGrad F x := by sorry

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