Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1(d), p. 3 — ∂F is bounded by K and uppersemicontinuous on B

Proved
MifflinSemismooth.Extremal.prop1_d

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

generalized-gradientnonsmooth-analysisp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1upper-semicontinuity

Let B⊆RnB\subseteq\mathbb R^nB⊆Rn be open, let F:Rn→RF:\mathbb R^n\to\mathbb RF:Rn→R be Lipschitz on BBB with constant KKK, and let x∈Bx\in Bx∈B. Suppose {xk}⊆B\{x_k\}\subseteq B{xk​}⊆B converges to xxx and gk∈∂F(xk)g_k\in\partial F(x_k)gk​∈∂F(xk​) for each kkk. Then

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

In words: ∂F\partial F∂F is bounded on bounded subsets of BBB and upper semicontinuous on BBB. This is the property that, in the proof of Theorem 2, turns accumulation points of generalized gradients of EEE near xxx into elements of ∂E(x)\partial E(x)∂E(x).

Formalization Note. KKK is the Lipschitz constant of FFF on BBB, as on the page. "Accumulation point" is a cluster point of the sequence (MapClusterPt).

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(d), p. 3: if `{x_k} ⊂ B` converges to `x` and
`g_k ∈ ∂F(x_k)`, then `|g_k| ≤ K` and every accumulation point of `{g_k}` lies in `∂F(x)`. -/
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 ∈ genGrad F (xs k)) →
      (∀ k, ‖gs k‖ ≤ K) ∧ ∀ g, MapClusterPt g atTop gs → g ∈ 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(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