Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.1, p. 45 — strong regularity gives locally unique solutions x(p) with ‖x(p) − x(q)‖ ≤ (λ + ε)‖f(p, x(q)) − f(q, x(q))‖

Proved
RobinsonSR.IFT.theorem_2_1

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

generalized-equationimplicit-function-theoremlipschitzp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1strong-regularity

Let XXX be a real normed linear space with dual X′X'X′, C⊆XC\subseteq XC⊆X a closed convex set, Ω⊆X\Omega\subseteq XΩ⊆X open with x0∈Ωx_0\in\Omegax0​∈Ω. Let PPP be a topological space, p0∈Pp_0\in Pp0​∈P, and f:P×Ω→X′f:P\times\Omega\to X'f:P×Ω→X′. Suppose that the partial Fréchet derivative f′(p,x)f'(p,x)f′(p,x) of fff in the second variable exists on P×ΩP\times\OmegaP×Ω, that fff and f′f'f′ (the latter in operator norm) are continuous at (p0,x0)(p_0,x_0)(p0​,x0​), and that x0x_0x0​ solves

0∈f(p0,x)+∂ψC(x).(2.2)0\in f(p_0,x)+\partial\psi_C(x). \tag{2.2}0∈f(p0​,x)+∂ψC​(x).(2.2)

If (2.2) is strongly regular at x0x_0x0​ with associated Lipschitz constant λ\lambdaλ, then for every ε>0\varepsilon>0ε>0 there are neighbourhoods NεN_\varepsilonNε​ of p0p_0p0​ and Wε⊆ΩW_\varepsilon\subseteq\OmegaWε​⊆Ω of x0x_0x0​, and a function x:Nε→Wεx:N_\varepsilon\to W_\varepsilonx:Nε​→Wε​, such that for every p∈Nεp\in N_\varepsilonp∈Nε​, x(p)x(p)x(p) is the unique solution in WεW_\varepsilonWε​ of

0∈f(p,x)+∂ψC(x),(2.3)0\in f(p,x)+\partial\psi_C(x), \tag{2.3}0∈f(p,x)+∂ψC​(x),(2.3)

and for all p,q∈Nεp,q\in N_\varepsilonp,q∈Nε​

∥x(p)−x(q)∥≤(λ+ε) ∥f(p,x(q))−f(q,x(q))∥.(2.4)\|x(p)-x(q)\|\le(\lambda+\varepsilon)\,\|f(p,x(q))-f(q,x(q))\|. \tag{2.4}∥x(p)−x(q)∥≤(λ+ε)∥f(p,x(q))−f(q,x(q))∥.(2.4)

This is an implicit-function theorem for generalized equations, which cover nonlinear equations (C=XC=XC=X), complementarity problems and variational inequalities. Strong regularity is a condition on f(p0,x0)f(p_0,x_0)f(p0​,x0​) and f′(p0,x0)f'(p_0,x_0)f′(p0​,x0​) alone, and the theorem transfers it to local existence, uniqueness and Lipschitz-type stability of solutions under perturbation.

Formalization Note fff is a total function P×X→X′P\times X\to X'P×X→X′; its values off P×ΩP\times\OmegaP×Ω carry no hypothesis, which is why Wε⊆ΩW_\varepsilon\subseteq\OmegaWε​⊆Ω is part of the conclusion. The solution function is x:P→Xx:P\to Xx:P→X, with x(p)∈Wεx(p)\in W_\varepsilonx(p)∈Wε​ required only for p∈Nεp\in N_\varepsilonp∈Nε​. Uniqueness is within WεW_\varepsilonWε​ only. NεN_\varepsilonNε​, WεW_\varepsilonWε​ and xxx depend on ε\varepsilonε. XXX is not assumed complete, as on the page; the result holds for normed XXX because X′X'X′ is always complete. Closedness and convexity of CCC are kept as on the page.

Preamble
import Mathlib
import Definitions.Def_RobinsonSR_IFT_Setting
Formal statement
namespace RobinsonSR.IFT

open scoped Topology

/-- Robinson 1980, Theorem 2.1 (p. 45): implicit-function theorem for strongly regular
generalized equations `0 ∈ f(p, x) + ∂ψ_C(x)`. -/
theorem theorem_2_1 {X : Type*} [NormedAddCommGroup X] [NormedSpace ℝ X]
    (C : Set X) (hC : IsClosed C) (hCc : Convex ℝ C)
    (Ω : Set X) (hΩ : IsOpen Ω) (x0 : X) (hx0 : x0 ∈ Ω)
    {P : Type*} [TopologicalSpace P] (p0 : P)
    (f : P → X → StrongDual ℝ X) (f' : P → X → (X →L[ℝ] StrongDual ℝ X))
    (hf' : ∀ p, ∀ x ∈ Ω, HasFDerivAt (f p) (f' p x) x)
    (hfc : ContinuousAt (fun z : P × X => f z.1 z.2) (p0, x0))
    (hf'c : ContinuousAt (fun z : P × X => f' z.1 z.2) (p0, x0))
    (hsol : -(f p0 x0) ∈ normalCone C x0)
    (lam : ℝ) (hreg : StronglyRegular C (f p0 x0) (f' p0 x0) x0 lam) :
    ∀ eps > 0, ∃ N ∈ 𝓝 p0, ∃ W ∈ 𝓝 x0, W ⊆ Ω ∧ ∃ x : P → X,
      (∀ p ∈ N, x p ∈ W ∧ -(f p (x p)) ∈ normalCone C (x p) ∧
          ∀ z ∈ W, -(f p z) ∈ normalCone C z → z = x p) ∧
      ∀ p ∈ N, ∀ q ∈ N, ‖x p - x q‖ ≤ (lam + eps) * ‖f p (x q) - f q (x q)‖ := by sorry

end RobinsonSR.IFT
Source
Robinson, Strongly regular generalized equations, Math. Oper. Res. 5 (1980), p. 45, Theorem 2.1, (2.2)–(2.4)
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