Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1 — cluster points of difference quotients come from generalized gradients

Proved
MifflinSemismooth.Composition.lemma1

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 on an open set BBB containing xxx. For a direction ddd, positive numbers tk→0t_k\to0tk​→0, and shifts hk→0h_k\to0hk​→0, every accumulation point F∗F^*F∗ of the difference quotients has the form

F∗=⟨g,d⟩for some g∈∂F(x),F(x+hk+tkd)−F(x+hk)tk.F^*=\langle g,d\rangle\quad\text{for some }g\in\partial F(x),\qquad \frac{F(x+h_k+t_kd)-F(x+h_k)}{t_k}.F∗=⟨g,d⟩for some g∈∂F(x),tk​F(x+hk​+tk​d)−F(x+hk​)​.

The lemma connects directional limiting values to the generalized gradient at the base point.

Formalization Note The accumulation point is a MapClusterPt; no existence of a full quotient limit is assumed. The paper uses tk↓0t_k\downarrow0tk​↓0 for positive convergence to zero.

Preamble
import Mathlib
import Definitions.Def_MifflinSemismooth_Extremal_Basic

open Filter Topology
Formal statement
namespace MifflinSemismooth.Composition

theorem lemma1 {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 : EuclideanSpace ℝ (Fin n)) (t : ℕ → ℝ)
    (htpos : ∀ k, 0 < t k) (htlim : Tendsto t atTop (𝓝 0))
    (h : ℕ → EuclideanSpace ℝ (Fin n))
    (hhlim : Tendsto h atTop (𝓝 0)) (Fstar : ℝ)
    (hcluster : MapClusterPt Fstar atTop
      (fun k => (F (x + h k + t k • d) - F (x + h k)) / t k)) :
    ∃ g ∈ MifflinSemismooth.Extremal.genGrad F x, Fstar = inner ℝ g d := by sorry

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