Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Corollary 2.5 — a strong Fréchet derivative implies semismoothness

Proved
NonsmoothNewton.Local.cor_2_5

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

nonsmooth-analysisp2o-batch-p100ap2o-gran-per-chapterp2o-plan-paperp2o-v1semismooth

Let EEE, GGG be finite-dimensional real normed spaces, F:E→GF : E \to GF:E→G locally Lipschitz, and x∈Ex \in Ex∈E. Suppose FFF has a strong Fréchet derivative F′(x)F'(x)F′(x) at xxx, i.e.

lim⁡y→xz→xF(z)−F(y)−F′(x)(z−y)∥z−y∥=0.\lim_{\substack{y \to x \\ z \to x}} \frac{F(z) - F(y) - F'(x)(z-y)}{\|z-y\|} = 0 .y→xz→x​lim​∥z−y∥F(z)−F(y)−F′(x)(z−y)​=0.

Then FFF is semismooth at xxx.

This shows that the class of semismooth maps contains every map that is strictly differentiable at the point, in particular every continuously differentiable map.

Formalization Note The paper's display (2.16) prints F(x)F(x)F(x) in the numerator where F(z)F(z)F(z) is meant; as printed the limit fails for every nonconstant FFF. The proof of the corollary (taking z=y+thz = y + thz=y+th) and the cited definition of Ortega–Rheinboldt use F(z)F(z)F(z), and the corrected form is stated. It is Mathlib's HasStrictFDerivAt, which reads the quotient as ∥F(z)−F(y)−F′(x)(z−y)∥=o(∥z−y∥)\|F(z)-F(y)-F'(x)(z-y)\| = o(\|z-y\|)∥F(z)−F(y)−F′(x)(z−y)∥=o(∥z−y∥) as (y,z)→(x,x)(y,z) \to (x,x)(y,z)→(x,x).

Preamble
import Mathlib
import Definitions.Def_NonsmoothNewton_Local_dirDeriv
import Definitions.Def_NonsmoothNewton_Shared_clarkeJac
import Definitions.Def_NonsmoothNewton_Local_SemismoothAt
open Filter Topology
Formal statement
namespace NonsmoothNewton.Local

/-- Qi–Sun (1993), Corollary 2.5, p. 358. If the locally Lipschitz map `F` has a strong
Fréchet derivative `F'` at `x` (Mathlib's `HasStrictFDerivAt`: the corrected (2.16),
`(F z - F y - F'(z - y)) / ‖z - y‖ → 0` as `y, z → x`), then `F` is semismooth at `x`. -/
theorem cor_2_5 {E G : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E]
    [NormedAddCommGroup G] [NormedSpace ℝ G] [FiniteDimensional ℝ G]
    (F : E → G) (hF : LocallyLipschitz F) (x : E) (F' : E →L[ℝ] G)
    (hstrong : HasStrictFDerivAt F F' x) :
    SemismoothAt F x := by sorry

end NonsmoothNewton.Local
Source
Qi, Sun, A nonsmooth version of Newton's method, Math. Programming 58 (1993), p. 358, Corollary 2.5 (definition (2.16), same page)
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Setting. EEE and GGG are finite-dimensional real normed spaces. F:E→GF : E \to GF:E→G is locally Lipschitz on all of EEE. x∈Ex \in Ex∈E, and F′:E→GF' : E \to GF′:E→G is a continuous linear map.

Hypothesis. FFF has strict (strong) Fréchet derivative F′F'F′ at xxx:

F(z)−F(y)−F′(z−y)=o(∥z−y∥)as (y,z)→(x,x),F(z) - F(y) - F'(z - y) = o(\|z - y\|) \quad \text{as } (y, z) \to (x, x),F(z)−F(y)−F′(z−y)=o(∥z−y∥)as (y,z)→(x,x),

with yyy and zzz varying independently.

Conclusion. FFF is semismooth at xxx, which means both of the following:

  1. There are K≥0K \ge 0K≥0 and a neighbourhood UUU of xxx on which FFF is KKK-Lipschitz.
  2. For every direction h∈Eh \in Eh∈E there is Lh∈GL_h \in GLh​∈G such that for every ε>0\varepsilon > 0ε>0 there is a δ>0\delta > 0δ>0 with
∥Vh′−Lh∥<ε\|V h' - L_h\| < \varepsilon∥Vh′−Lh​∥<ε

for all reals 0<t<δ0 < t < \delta0<t<δ, all h′h'h′ with ∥h′−h∥<δ\|h' - h\| < \delta∥h′−h∥<δ, and all V∈JF(x+th′)V \in \mathcal{J}_F(x + t h')V∈JF​(x+th′).

Here JF(y)\mathcal{J}_F(y)JF​(y) is the set of continuous linear maps E→GE \to GE→G given by the external definition clarkeJac, which is not shown here. The conclusion does not state that LhL_hLh​ equals F′hF' hF′h.

Degenerate cases.

  • Empty JF\mathcal{J}_FJF​. If JF(x+th′)\mathcal{J}_F(x + th')JF​(x+th′) is empty near xxx, part 2 is vacuous.
  • Zero spaces. If EEE or GGG is the zero space, both the hypothesis and the conclusion hold trivially: in part 2, Lh=0L_h = 0Lh​=0 works because h′=0h' = 0h′=0 or G={0}G = \{0\}G={0}.
Human review
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 27, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me