Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.4, p. 232 — at a BD-regular point, ‖h‖ ≤ c‖F′(x; h)‖ for all h

Proved
QiNonsmoothEq.Attraction.lemma_2_4

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

bd-regularitydirectional-derivativenonsmooth-equationsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let F:Rn→RmF:\mathbb R^n\to\mathbb R^mF:Rn→Rm be locally Lipschitz and BD-regular at xxx, that is, directionally differentiable at xxx with F′(x;h)≠0F'(x;h)\neq 0F′(x;h)=0 for all h≠0h\neq 0h=0. Then there is a constant ccc such that for every h∈Rnh\in\mathbb R^nh∈Rn,

∥h∥ ≤ c ∥F′(x;h)∥.(2.11)\|h\|\ \le\ c\,\|F'(x;h)\|. \tag{2.11}∥h∥ ≤ c∥F′(x;h)∥.(2.11)

BD-regularity says the directional derivative does not vanish off the origin; this lemma upgrades it to a quantitative lower bound, which is the form used in the attraction theorem (Theorem 5.1) as (5.3).

Formalization Note Rn\mathbb R^nRn and Rm\mathbb R^mRm are Euclidean spaces with the 2-norm. Local Lipschitz continuity is the paper's standing assumption (§1).

Preamble
import Mathlib
import Definitions.Def_NonsmoothNewton_Local_dirDeriv
import Definitions.Def_QiNonsmoothEq_Attraction_Setting
open Filter Topology NonsmoothNewton.Local
Formal statement
namespace QiNonsmoothEq.Attraction

/-- Qi 1993, Lemma 2.4, p. 232: if the locally Lipschitz `F : ℝⁿ → ℝᵐ` is BD-regular at `x`,
there is a constant `c` with `‖h‖ ≤ c ‖F'(x; h)‖` for every `h` (2.11). -/
theorem lemma_2_4 {n m : ℕ}
    (F : EuclideanSpace ℝ (Fin n) → EuclideanSpace ℝ (Fin m)) (hF : LocallyLipschitz F)
    (x : EuclideanSpace ℝ (Fin n)) (hreg : BDRegularAt F x) :
    ∃ c : ℝ, ∀ h : EuclideanSpace ℝ (Fin n), ‖h‖ ≤ c * ‖dirDeriv F x h‖ := by sorry

end QiNonsmoothEq.Attraction
Source
Qi, Convergence analysis of some algorithms for solving nonsmooth equations, Math. Oper. Res. 18 (1993), p. 232, Lemma 2.4, (2.11)
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