Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.1, p. 6 — y ↦ max(0, y) is slantly differentiable on ℝⁿ with slanting function G_m for every δ

Proved
PDASNewton.Local.lemma_3_1

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

max-functionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1semismooth-newtonslant-differentiability

Fix δ∈Rn\delta \in \mathbb{R}^nδ∈Rn and let Gm(y)=diag⁡(g1(y1),…,gn(yn))G_m(y) = \operatorname{diag}(g_1(y_1), \dots, g_n(y_n))Gm​(y)=diag(g1​(y1​),…,gn​(yn​)) as in (3.2), where gi(z)=0g_i(z) = 0gi​(z)=0 for z<0z < 0z<0, gi(z)=1g_i(z) = 1gi​(z)=1 for z>0z > 0z>0 and gi(0)=δig_i(0) = \delta_igi​(0)=δi​. Then the componentwise maximum y↦max⁡(0,y)y \mapsto \max(0, y)y↦max(0,y) from Rn\mathbb{R}^nRn to Rn\mathbb{R}^nRn is slantly differentiable on Rn\mathbb{R}^nRn with slanting function GmG_mGm​: for every y∈Rny \in \mathbb{R}^ny∈Rn,

lim⁡h→01∥h∥ ∥max⁡(0,y+h)−max⁡(0,y)−Gm(y+h)h∥=0.\lim_{h \to 0} \frac{1}{\|h\|}\,\bigl\|\max(0, y + h) - \max(0, y) - G_m(y + h)h\bigr\| = 0.h→0lim​∥h∥1​​max(0,y+h)−max(0,y)−Gm​(y+h)h​=0.

The value of GmG_mGm​ where a coordinate vanishes is arbitrary; the semismooth Newton method of the paper uses δ=0\delta = 0δ=0.

Formalization Note Rn\mathbb{R}^nRn is Fin n → ℝ with the sup norm; the limit is stated as a little-o relation.

Preamble
import Mathlib
import Definitions.Def_PDASNewton_Local_Setting
Formal statement
namespace PDASNewton.Local

/-- Lemma 3.1, p. 6: the map `y ↦ max(0, y)` from `ℝⁿ` to `ℝⁿ` (componentwise) is slantly
differentiable on `ℝⁿ`, and `G_m` of (3.2) is a slanting function for every `δ ∈ ℝⁿ`. -/
theorem lemma_3_1 {n : ℕ} (δ : Fin n → ℝ) :
    IsSlantingFunction (fun y : Fin n → ℝ => fun i => max 0 (y i)) (Gm δ) Set.univ := by sorry

end PDASNewton.Local
Source
Hintermüller, Ito, Kunisch, The primal-dual active set strategy as a semismooth Newton method, HAL hal-01660511v1, p. 6, (3.2) and Lemma 3.1
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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