Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proof of Theorem 4.1: ∇η\nabla\eta∇η is semismooth at every point of the surface s+rg(x)=0s + r g(x) = 0s+rg(x)=0

Proved
NonsmoothNewton.AugLagrangian.eta_grad_semismooth_on_surface

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

augmented-lagrangianp2o-batch-p100ap2o-gran-per-chapterp2o-plan-paperp2o-v1semismooth

Let r>0r > 0r>0, let g:Rn→Rg : \mathbb{R}^n \to \mathbb{R}g:Rn→R be of class C2C^2C2, and let η(x,s)=ϕ(r,g(x),s)\eta(x, s) = \phi(r, g(x), s)η(x,s)=ϕ(r,g(x),s). If (xˉ,sˉ)(\bar x, \bar s)(xˉ,sˉ) satisfies

sˉ+rg(xˉ)=0,(4.3)\bar s + r g(\bar x) = 0, \tag{4.3}sˉ+rg(xˉ)=0,(4.3)

then ∇η\nabla \eta∇η, as a map of (x,s)∈Rn+1(x, s) \in \mathbb{R}^{n+1}(x,s)∈Rn+1, is semismooth at (xˉ,sˉ)(\bar x, \bar s)(xˉ,sˉ): it is locally Lipschitz there and, for every (h,α)∈Rn+1(h, \alpha) \in \mathbb{R}^{n+1}(h,α)∈Rn+1, the limit

lim⁡h′→h, α′→αt↓0{V(h′α′):V∈∂∇η(xˉ+th′,sˉ+tα′)}(4.4)\lim_{\substack{h' \to h,\ \alpha' \to \alpha \\ t \downarrow 0}} \Big\{ V \begin{pmatrix} h' \\ \alpha' \end{pmatrix} : V \in \partial \nabla \eta(\bar x + t h', \bar s + t \alpha') \Big\} \tag{4.4}h′→h, α′→αt↓0​lim​{V(h′α′​):V∈∂∇η(xˉ+th′,sˉ+tα′)}(4.4)

exists.

This is the nonsmooth heart of Theorem 4.1: on the surface where the two formulas for ϕ\phiϕ meet, ∇η\nabla\eta∇η is not differentiable, yet it is semismooth, which is what the nonsmooth Newton method requires.

Formalization Note ∇η\nabla\eta∇η is the Fréchet derivative map (x,s)↦Dη(x,s)(x,s) \mapsto D\eta(x,s)(x,s)↦Dη(x,s), valued in linear functionals on Rn×R\mathbb{R}^n \times \mathbb{R}Rn×R; semismoothness is invariant under the Riesz isometry between functionals and gradient vectors and under the choice of equivalent norm on Rn×R\mathbb{R}^n \times \mathbb{R}Rn×R (Mathlib's product carries the sup norm). The semismoothness is joint in (x,s)(x, s)(x,s).

Preamble
import Mathlib
import Definitions.Def_NonsmoothNewton_Shared_clarkeJac
import Definitions.Def_NonsmoothNewton_AugLagrangian_SemismoothAt
import Definitions.Def_NonsmoothNewton_AugLagrangian_augLagrangian
open Filter Topology
Formal statement
namespace NonsmoothNewton.AugLagrangian

/-- Qi–Sun (1993), Section 4, proof of Theorem 4.1, pp. 364–365. For `r > 0` and `g ∈ C²`, the
gradient of `η(x, s) = φ(r, g(x), s)` is semismooth (jointly in `(x, s)`) at every point
`(x̄, s̄)` of the surface `s̄ + r g(x̄) = 0`. -/
theorem eta_grad_semismooth_on_surface {n : ℕ} (r : ℝ) (hr : 0 < r)
    (g : EuclideanSpace ℝ (Fin n) → ℝ) (hg : ContDiff ℝ 2 g)
    (xbar : EuclideanSpace ℝ (Fin n)) (sbar : ℝ) (h43 : sbar + r * g xbar = 0) :
    SemismoothAt (fun w => fderiv ℝ (eta r g) w) (xbar, sbar) := by sorry

end NonsmoothNewton.AugLagrangian
Source
Qi, Sun, A nonsmooth version of Newton's method, Math. Programming 58 (1993), pp. 364–365, Section 4, proof of Theorem 4.1, Eqs. (4.3)–(4.4) and the conclusion on p. 365
Read-back

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

Setting. Let n∈Nn \in \mathbb{N}n∈N, let rrr be a real number with r>0r > 0r>0, and let g:Rn→Rg : \mathbb{R}^n \to \mathbb{R}g:Rn→R be C2C^2C2, with Rn\mathbb{R}^nRn Euclidean. Let

η(x,s)=φ(r,g(x),s),\eta(x, s) = \varphi(r, g(x), s),η(x,s)=φ(r,g(x),s),

where φ(r,a,s)=sa+r2a2\varphi(r, a, s) = s a + \frac{r}{2} a^2φ(r,a,s)=sa+2r​a2 if s+ra≥0s + r a \ge 0s+ra≥0, and φ(r,a,s)=−12rs2\varphi(r, a, s) = -\frac{1}{2r} s^2φ(r,a,s)=−2r1​s2 otherwise.

Let Γ:z↦Dη(z)\Gamma : z \mapsto D\eta(z)Γ:z↦Dη(z) be the map sending each point z∈Rn×Rz \in \mathbb{R}^n \times \mathbb{R}z∈Rn×R to the derivative of η\etaη at zzz. This is a linear functional on Rn×R\mathbb{R}^n \times \mathbb{R}Rn×R, measured in operator norm; by convention it is 000 wherever η\etaη is not differentiable. The space Rn×R\mathbb{R}^n \times \mathbb{R}Rn×R carries the norm ∥(h,α)∥=max⁡(∥h∥2,∣α∣)\|(h, \alpha)\| = \max(\|h\|_2, |\alpha|)∥(h,α)∥=max(∥h∥2​,∣α∣).

Let (xˉ,sˉ)(\bar{x}, \bar{s})(xˉ,sˉ) be any point with

sˉ+r g(xˉ)=0.\bar{s} + r\, g(\bar{x}) = 0.sˉ+rg(xˉ)=0.

Conclusion. Γ\GammaΓ is "semismooth at (xˉ,sˉ)(\bar{x}, \bar{s})(xˉ,sˉ)" in the sense defined in this bundle. Unfolded, this means both of the following hold.

  1. There are K≥0K \ge 0K≥0 and a neighbourhood UUU of (xˉ,sˉ)(\bar{x}, \bar{s})(xˉ,sˉ) on which Γ\GammaΓ is KKK-Lipschitz.
  2. For every direction v∈Rn×Rv \in \mathbb{R}^n \times \mathbb{R}v∈Rn×R there is a linear functional Λ\LambdaΛ on Rn×R\mathbb{R}^n \times \mathbb{R}Rn×R with the following property. For every ε>0\varepsilon > 0ε>0 there is a δ>0\delta > 0δ>0 such that
∥Vv′−Λ∥<ε\|V v' - \Lambda\| < \varepsilon∥Vv′−Λ∥<ε

for every ttt with 0<t<δ0 < t < \delta0<t<δ, every v′v'v′ with ∥v′−v∥<δ\|v' - v\| < \delta∥v′−v∥<δ, and every V∈∂Γ((xˉ,sˉ)+tv′)V \in \partial\Gamma\big((\bar{x}, \bar{s}) + t v'\big)V∈∂Γ((xˉ,sˉ)+tv′).

Here ∂Γ(y)\partial\Gamma(y)∂Γ(y) is the set given by the imported definition clarkeJac applied to Γ\GammaΓ at yyy. That definition is not included in the code given here, so its contents cannot be spelled out. The code only uses that each VVV in it can be applied to v′v'v′ to give a linear functional Vv′V v'Vv′.

Degenerate cases:

  • If the sets ∂Γ\partial\Gamma∂Γ are empty near (xˉ,sˉ)(\bar{x}, \bar{s})(xˉ,sˉ) along a direction vvv, condition 2 holds for that vvv with any Λ\LambdaΛ, and the conclusion reduces to condition 1.
  • n=0n = 0n=0. ggg is a constant ccc, and the hypothesis fixes sˉ=−rc\bar{s} = -rcsˉ=−rc.
  • The hypothesis r>0r > 0r>0 rules out the case 12r\frac{1}{2r}2r1​ with r=0r = 0r=0.
Human review
  • Endorsed by Shuze Chen · Sep 28, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 28, 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