Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.6, p. 233 — near a strongly BD-regular point every V ∈ ∂_B F(y) is nonsingular with ‖V⁻¹‖ ≤ c, and ‖h‖ ≤ c‖F′(y; h)‖ at semismooth y

Proved
QiNonsmoothEq.Local.lemma_2_6

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

b-subdifferentialbd-regularitynonsmooth-equationsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let F:Rn→RnF:\mathbb R^n\to\mathbb R^nF:Rn→Rn be locally Lipschitz and let FFF be strongly BD-regular at xxx, i.e. every element of the B-subdifferential ∂BF(x)\partial_B F(x)∂B​F(x) is nonsingular. Then there are a neighbourhood NNN of xxx and a constant ccc such that:

  1. for every y∈Ny\in Ny∈N and every V∈∂BF(y)V\in\partial_B F(y)V∈∂B​F(y), VVV is nonsingular and
∥V−1∥≤c;(2.13)\|V^{-1}\|\le c; \tag{2.13}∥V−1∥≤c;(2.13)
  1. if moreover FFF is semismooth at y∈Ny\in Ny∈N, then for every h∈Rnh\in\mathbb R^nh∈Rn
∥h∥≤c ∥F′(y;h)∥.(2.14)\|h\|\le c\,\|F'(y;h)\|. \tag{2.14}∥h∥≤c∥F′(y;h)∥.(2.14)

The lemma propagates nonsingularity from the single point xxx to a whole neighbourhood, with a uniform bound on the inverses; this is what makes the Newton step (3.2) well defined and controls its length near a strongly BD-regular zero.

Formalization Note "VVV nonsingular with ∥V−1∥≤c\|V^{-1}\|\le c∥V−1∥≤c" is the existence of a two-sided inverse WWW of VVV with ∥W∥≤c\|W\|\le c∥W∥≤c. The same NNN and ccc serve both parts, as in the paper. Local Lipschitz continuity of FFF is the paper's standing assumption (§1).

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

/-- Qi (1993), Lemma 2.6, p. 233. If `F` is strongly BD-regular at `x`, there are a
neighbourhood `N` of `x` and a constant `c` such that for every `y ∈ N` and `V ∈ ∂_B F(y)`,
`V` is nonsingular with `‖V⁻¹‖ ≤ c` (2.13); if `F` is also semismooth at `y ∈ N`, then
`‖h‖ ≤ c ‖F'(y; h)‖` for every `h` (2.14). -/
theorem lemma_2_6 {n : ℕ} (F : EuclideanSpace ℝ (Fin n) → EuclideanSpace ℝ (Fin n))
    (hF : LocallyLipschitz F) (x : EuclideanSpace ℝ (Fin n))
    (hreg : StronglyBDRegularAt F x) :
    ∃ N ∈ 𝓝 x, ∃ c : ℝ,
      (∀ y ∈ N, ∀ V ∈ NonsmoothNewton.Shared.bJac F y,
        ∃ W : EuclideanSpace ℝ (Fin n) →L[ℝ] EuclideanSpace ℝ (Fin n), IsInverse V W ∧ ‖W‖ ≤ c) ∧
      (∀ y ∈ N, NonsmoothNewton.Local.SemismoothAt F y →
        ∀ h : EuclideanSpace ℝ (Fin n), ‖h‖ ≤ c * ‖NonsmoothNewton.Local.dirDeriv F y h‖) := by sorry

end QiNonsmoothEq.Local
Source
Qi, Convergence analysis of some algorithms for solving nonsmooth equations, Math. Oper. Res. 18 (1993), p. 233, Lemma 2.6, (2.13)–(2.14)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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