Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proposition 3.1 — uniform bound on ∥V−1∥\|V^{-1}\|∥V−1∥ near a point where ∂F\partial F∂F is nonsingular

Proved
NonsmoothNewton.Local.prop_3_1

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

newton-methodnonsmooth-analysisp2o-batch-p100ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let F:Rn→RnF : \mathbb R^n \to \mathbb R^nF:Rn→Rn be locally Lipschitz and x∈Rnx \in \mathbb R^nx∈Rn. If every V∈∂F(x)V \in \partial F(x)V∈∂F(x) is nonsingular, then there are a neighbourhood N(x)N(x)N(x) of xxx and a constant CCC such that for every y∈N(x)y \in N(x)y∈N(x) and every V∈∂F(y)V \in \partial F(y)V∈∂F(y), VVV is nonsingular and

∥V−1∥≤C.\|V^{-1}\| \le C .∥V−1∥≤C.

This is the uniform invertibility that makes every Newton step near a regular root well defined and controls its size.

Formalization Note Rn\mathbb R^nRn is EuclideanSpace ℝ (Fin n) with the Euclidean norm, and ∥V−1∥\|V^{-1}\|∥V−1∥ is the corresponding operator norm; "nonsingular with inverse of norm at most CCC" is written as the existence of a two-sided inverse WWW with ∥W∥≤C\|W\| \le C∥W∥≤C. Section 3's standing assumption "FFF locally Lipschitzian" is a hypothesis, although the proposition's sentence does not repeat it.

Preamble
import Mathlib
import Definitions.Def_NonsmoothNewton_Shared_clarkeJac
open Filter Topology
Formal statement
namespace NonsmoothNewton.Local

/-- Qi–Sun (1993), Proposition 3.1, p. 359 (Section 3 standing assumption: `F : ℝⁿ → ℝⁿ`
locally Lipschitz). If every `V ∈ ∂F(x)` is nonsingular, there are a neighbourhood `N(x)`
and a constant `C` such that every `V ∈ ∂F(y)`, `y ∈ N(x)`, is nonsingular with
`‖V⁻¹‖ ≤ C`. -/
theorem prop_3_1 {n : ℕ}
    (F : EuclideanSpace ℝ (Fin n) → EuclideanSpace ℝ (Fin n)) (hF : LocallyLipschitz F)
    (x : EuclideanSpace ℝ (Fin n)) (hns : ∀ V ∈ NonsmoothNewton.Shared.clarkeJac F x, IsUnit V) :
    ∃ N ∈ 𝓝 x, ∃ C : ℝ, ∀ y ∈ N, ∀ V ∈ NonsmoothNewton.Shared.clarkeJac F y,
      ∃ W : EuclideanSpace ℝ (Fin n) →L[ℝ] EuclideanSpace ℝ (Fin n),
        V.comp W = ContinuousLinearMap.id ℝ _ ∧ W.comp V = ContinuousLinearMap.id ℝ _ ∧
        ‖W‖ ≤ C := by sorry

end NonsmoothNewton.Local
Source
Qi, Sun, A nonsmooth version of Newton's method, Math. Programming 58 (1993), p. 359, Proposition 3.1 (standing assumption p. 358)
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Setting. n∈Nn \in \mathbb{N}n∈N may be 000. Rn\mathbb{R}^nRn carries the Euclidean norm, and linear maps carry the corresponding operator norm. F:Rn→RnF : \mathbb{R}^n \to \mathbb{R}^nF:Rn→Rn is locally Lipschitz: every point has a neighbourhood on which FFF is Lipschitz. x∈Rnx \in \mathbb{R}^nx∈Rn. JF(y)\mathcal{J}_F(y)JF​(y) is the set of linear maps Rn→Rn\mathbb{R}^n \to \mathbb{R}^nRn→Rn given by the external definition clarkeJac, which is not shown here.

Hypothesis. Every V∈JF(x)V \in \mathcal{J}_F(x)V∈JF​(x) is invertible as a linear map of Rn\mathbb{R}^nRn.

Conclusion. There exist a neighbourhood NNN of xxx and a real constant CCC with the following property. For every y∈Ny \in Ny∈N and every V∈JF(y)V \in \mathcal{J}_F(y)V∈JF​(y) there is a linear map W:Rn→RnW : \mathbb{R}^n \to \mathbb{R}^nW:Rn→Rn with

VW=id,WV=id,∥W∥≤C.V W = \mathrm{id}, \qquad W V = \mathrm{id}, \qquad \|W\| \le C .VW=id,WV=id,∥W∥≤C.

In other words, every such VVV is invertible, and its inverse W=V−1W = V^{-1}W=V−1 has operator norm at most CCC. The constant CCC is uniform over all y∈Ny \in Ny∈N and all V∈JF(y)V \in \mathcal{J}_F(y)V∈JF​(y).

Degenerate cases.

  • Empty JF(x)\mathcal{J}_F(x)JF​(x). The hypothesis is vacuous, and the theorem still asserts the uniform-inverse property near xxx.
  • Empty JF(y)\mathcal{J}_F(y)JF​(y). If JF(y)\mathcal{J}_F(y)JF​(y) is empty for all yyy near xxx, the conclusion is vacuous.
  • n=0n = 0n=0. R0\mathbb{R}^0R0 is a single point, and the only linear map is 0=id0 = \mathrm{id}0=id. It is invertible with norm 000, so the statement holds trivially (for example with C=0C = 0C=0).
Human review
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

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