Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, p. 7 — F is slantly differentiable on ℝⁿ × ℝⁿ with slanting function G_F, the system matrix of (2.4)

Proved
PDASNewton.Local.F_slantly_differentiable

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

complementarityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1semismooth-newtonslant-differentiability

Let A∈Rn×nA \in \mathbb{R}^{n \times n}A∈Rn×n, f,ψ∈Rnf, \psi \in \mathbb{R}^nf,ψ∈Rn and c>0c > 0c>0, and let

F(y,λ)=(Ay+λ−f, λ−max⁡(0,λ+c(y−ψ))).F(y, \lambda) = \bigl(Ay + \lambda - f,\ \lambda - \max(0, \lambda + c(y - \psi))\bigr).F(y,λ)=(Ay+λ−f, λ−max(0,λ+c(y−ψ))).

Then FFF is slantly differentiable on Rn×Rn\mathbb{R}^n \times \mathbb{R}^nRn×Rn and the system matrix GFG_FGF​ of (2.4), built from GmG_mGm​ with δ=0\delta = 0δ=0, is a slanting function for FFF: for every x∈Rn×Rnx \in \mathbb{R}^n \times \mathbb{R}^nx∈Rn×Rn,

lim⁡h→01∥h∥ ∥F(x+h)−F(x)−GF(x+h)h∥=0.\lim_{h \to 0} \frac{1}{\|h\|}\,\|F(x+h) - F(x) - G_F(x+h)h\| = 0.h→0lim​∥h∥1​∥F(x+h)−F(x)−GF​(x+h)h∥=0.

This is the hypothesis of Theorem 1.1 that the paper derives from Lemma 3.1.

Formalization Note No matrix hypothesis is needed; c>0c > 0c>0 is the paper's standing assumption. Pairs carry the product of sup norms.

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

/-- §3, p. 7: as a consequence of Lemma 3.1, `F` is slantly differentiable on `ℝⁿ × ℝⁿ` and the
system matrix `G_F` of (2.4) is a slanting function for `F`. -/
theorem F_slantly_differentiable {n : ℕ} (A : Matrix (Fin n) (Fin n) ℝ) (f ψ : Fin n → ℝ)
    (c : ℝ) (hc : 0 < c) :
    IsSlantingFunction (Fmap A f ψ c) (GF A ψ c) 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. 7, paragraph after the definition of F
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