Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proof of Theorem 4.1: η∈C1\eta \in C^1η∈C1, the formula for ∇η\nabla\eta∇η, and ∇η\nabla\eta∇η locally Lipschitz

Proved
NonsmoothNewton.AugLagrangian.eta_C1_grad_locLip

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

augmented-lagrangiannonsmooth-analysisp2o-batch-p100ap2o-gran-per-chapterp2o-plan-paperp2o-v1

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

η(x,s)={s g(x)+12rg(x)2,s+rg(x)≥0,−12rs2,s+rg(x)≤0.\eta(x,s) = \begin{cases} s\, g(x) + \tfrac12 r g(x)^2, & s + r g(x) \ge 0,\\ -\tfrac{1}{2r} s^2, & s + r g(x) \le 0.\end{cases}η(x,s)={sg(x)+21​rg(x)2,−2r1​s2,​s+rg(x)≥0,s+rg(x)≤0.​

Then:

  1. η\etaη is continuously differentiable on Rn×R\mathbb{R}^n \times \mathbb{R}Rn×R;
  2. its gradient is
∇η(x,s)={((s+rg(x))∇g(x)g(x)),s+rg(x)≥0,(0−s/r),s+rg(x)≤0;\nabla \eta(x, s) = \begin{cases} \begin{pmatrix} (s + r g(x)) \nabla g(x) \\ g(x) \end{pmatrix}, & s + r g(x) \ge 0,\\[6pt] \begin{pmatrix} 0 \\ -s/r \end{pmatrix}, & s + r g(x) \le 0; \end{cases}∇η(x,s)=⎩⎨⎧​((s+rg(x))∇g(x)g(x)​),(0−s/r​),​s+rg(x)≥0,s+rg(x)≤0;​
  1. ∇η\nabla \eta∇η is locally Lipschitz.

This is the first step of the proof of Theorem 4.1: it establishes that each inequality term of the augmented Lagrangian is C1C^1C1 and that its gradient is regular enough (locally Lipschitz) for semismoothness to make sense.

Formalization Note The gradient is represented by the Fréchet derivative, a continuous linear functional on Rn×R\mathbb{R}^n \times \mathbb{R}Rn×R: in the first case (h,α)↦(s+rg(x)) Dg(x)h+g(x) α(h, \alpha) \mapsto (s + r g(x))\, Dg(x) h + g(x)\, \alpha(h,α)↦(s+rg(x))Dg(x)h+g(x)α, in the second (h,α)↦−(s/r) α(h, \alpha) \mapsto -(s/r)\, \alpha(h,α)↦−(s/r)α. It corresponds to the gradient vector through the Riesz isometry.

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. 363–364. For `r > 0` and `g ∈ C²`,
`η(x, s) = φ(r, g(x), s)` is `C¹`, its gradient is
`∇η(x, s) = ((s + r g(x)) ∇g(x), g(x))` if `s + r g(x) ≥ 0` and `(0, -s/r)` if
`s + r g(x) ≤ 0` (here as the Fréchet derivative, a linear functional on `ℝⁿ × ℝ`),
and `∇η` is locally Lipschitz. -/
theorem eta_C1_grad_locLip {n : ℕ} (r : ℝ) (hr : 0 < r) (g : EuclideanSpace ℝ (Fin n) → ℝ)
    (hg : ContDiff ℝ 2 g) :
    ContDiff ℝ 1 (eta r g) ∧
    (∀ z : EuclideanSpace ℝ (Fin n) × ℝ, 0 ≤ z.2 + r * g z.1 →
      fderiv ℝ (eta r g) z =
        (z.2 + r * g z.1) • (fderiv ℝ g z.1).comp
            (ContinuousLinearMap.fst ℝ (EuclideanSpace ℝ (Fin n)) ℝ)
          + g z.1 • ContinuousLinearMap.snd ℝ (EuclideanSpace ℝ (Fin n)) ℝ) ∧
    (∀ z : EuclideanSpace ℝ (Fin n) × ℝ, z.2 + r * g z.1 ≤ 0 →
      fderiv ℝ (eta r g) z =
        (-(z.2 / r)) • ContinuousLinearMap.snd ℝ (EuclideanSpace ℝ (Fin n)) ℝ) ∧
    LocallyLipschitz (fun z => fderiv ℝ (eta r g) z) := by sorry

end NonsmoothNewton.AugLagrangian
Source
Qi, Sun, A nonsmooth version of Newton's method, Math. Programming 58 (1993), pp. 363–364, Section 4, proof of Theorem 4.1 (display of ∇η and the sentence after it)
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 twice continuously differentiable (C2C^2C2) on all of Rn\mathbb{R}^nRn, which has its Euclidean structure. 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. The domain of η\etaη is Rn×R\mathbb{R}^n \times \mathbb{R}Rn×R. Write Dη(x,s)D\eta(x, s)Dη(x,s) for its derivative, a linear map from Rn×R\mathbb{R}^n \times \mathbb{R}Rn×R to R\mathbb{R}R, and Dg(x)Dg(x)Dg(x) for the derivative of ggg.

Conclusion. The statement asserts all four of the following.

  1. η\etaη is continuously differentiable (C1C^1C1) on all of Rn×R\mathbb{R}^n \times \mathbb{R}Rn×R.
  2. At every (x,s)(x, s)(x,s) with s+rg(x)≥0s + r g(x) \ge 0s+rg(x)≥0, and for every direction (h,α)∈Rn×R(h, \alpha) \in \mathbb{R}^n \times \mathbb{R}(h,α)∈Rn×R:
Dη(x,s)(h,α)=(s+rg(x)) Dg(x) h+g(x) α.D\eta(x, s)(h, \alpha) = \big(s + r g(x)\big)\, Dg(x)\,h + g(x)\,\alpha.Dη(x,s)(h,α)=(s+rg(x))Dg(x)h+g(x)α.
  1. At every (x,s)(x, s)(x,s) with s+rg(x)≤0s + r g(x) \le 0s+rg(x)≤0, and for every direction (h,α)(h, \alpha)(h,α):
Dη(x,s)(h,α)=−sr α.D\eta(x, s)(h, \alpha) = -\frac{s}{r}\,\alpha.Dη(x,s)(h,α)=−rs​α.
  1. The map z↦Dη(z)z \mapsto D\eta(z)z↦Dη(z) is locally Lipschitz. Here Dη(z)D\eta(z)Dη(z) is viewed as a linear functional, measured in operator norm. Every point of Rn×R\mathbb{R}^n \times \mathbb{R}Rn×R has a neighbourhood on which this map is Lipschitz with some constant.

Items 2 and 3 both use non-strict inequalities. At points with s+rg(x)=0s + r g(x) = 0s+rg(x)=0 both apply, so the statement also asserts that the two formulas give the same functional there.

Degenerate cases:

  • The hypothesis r>0r > 0r>0 rules out the case 12r\frac{1}{2r}2r1​ with r=0r = 0r=0.
  • By default the derivative of a non-differentiable function is taken to be 000. That convention never applies here, because item 1 asserts that η\etaη is differentiable everywhere.
  • n=0n = 0n=0. ggg is a constant ccc, and Dg=0Dg = 0Dg=0. The formulas become Dη(x,s)(h,α)=c αD\eta(x, s)(h, \alpha) = c\,\alphaDη(x,s)(h,α)=cα where s+rc≥0s + r c \ge 0s+rc≥0, and −srα-\frac{s}{r}\alpha−rs​α where s+rc≤0s + r c \le 0s+rc≤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