Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2.4, display (p. 7) — upper-Lipschitz inverse (cited from [12], Prop. 2.1)

Proved
KingRockAsymp.Distribution.thm_2_4_display_upper_lipschitz

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

generalized-equationsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1set-valued-analysis

Let F:Rn⇉RmF : \mathbb R^n \rightrightarrows \mathbb R^mF:Rn⇉Rm be a multifunction with 0∈F(x∗)0 \in F(x^*)0∈F(x∗), and suppose that the contingent derivative of F−1F^{-1}F−1 at (0,x∗)(0,x^*)(0,x∗) satisfies

DF−1(0∣x∗)(0)={0}.DF^{-1}(0|x^*)(0) = \{0\}.DF−1(0∣x∗)(0)={0}.

Then there are a neighborhood UUU of x∗x^*x∗ and a constant λ≥0\lambda \ge 0λ≥0 such that

U∩F−1(y)⊆x∗+λ∣y∣BU \cap F^{-1}(y) \subseteq x^* + \lambda |y| BU∩F−1(y)⊆x∗+λ∣y∣B

for all yyy sufficiently close to 000 in Rm\mathbb R^mRm, where BBB is the closed unit ball of Rn\mathbb R^nRn.

This is the upper-Lipschitz property of F−1F^{-1}F−1 at (0,x∗)(0, x^*)(0,x∗). The paper cites it from King and Rockafellar's Sensitivity analysis for nonsmooth generalized equations ([12], Proposition 2.1) in the proof of Theorem 2.4; it turns the single-valuedness of the contingent derivative at 000 into bounds in probability on solutions.

Formalization Note DF−1(0∣x∗)DF^{-1}(0|x^*)DF−1(0∣x∗) is the contingent derivative (2.2) of the inverse multifunction. "For all yyy sufficiently close to 000" is ∀ᶠ y in 𝓝 0; UUU and λ\lambdaλ are chosen before yyy.

Preamble
import Mathlib
import Definitions.Def_KingRockAsymp_Distribution_Basic
Formal statement
namespace KingRockAsymp.Distribution

open Set Filter Topology Metric MeasureTheory ProbabilityTheory

theorem thm_2_4_display_upper_lipschitz {n m : ℕ} (F : Rn n → Set (Rn m)) (x₀ : Rn n)
    (h0 : (0 : Rn m) ∈ F x₀)
    (hD : contingentDeriv (svInv F) 0 x₀ 0 = {0}) :
    ∃ U ∈ 𝓝 x₀, ∃ lam : ℝ, 0 ≤ lam ∧
      ∀ᶠ y in 𝓝 (0 : Rn m), U ∩ svInv F y ⊆ closedBall x₀ (lam * ‖y‖) := by sorry

end KingRockAsymp.Distribution
Source
King & Rockafellar, Asymptotic Theory for Solutions in Statistical Estimation and Stochastic Programming, Math. Oper. Res. 18(1) (1993), proof of Theorem 2.4, display, p. 7 (authors' manuscript pagination); cited from [12], Proposition 2.1
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