Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.4 — bounds in probability on solutions of a generalized equation with random data

Proved
KingRockAsymp.Distribution.theorem_2_4

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

asymptotic-statisticsgeneralized-equationsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let ZZZ be a separable Banach space, f:Z×Rn→Rmf : Z \times \mathbb R^n \to \mathbb R^mf:Z×Rn→Rm, N:Rn⇉RmN : \mathbb R^n \rightrightarrows \mathbb R^mN:Rn⇉Rm, z∗∈Zz^* \in Zz∗∈Z and x∗∈Rnx^* \in \mathbb R^nx∗∈Rn. Suppose that, for some α\alphaα, fff satisfies the Lipschitz condition

∣f(z∗,x)−f(z,x)∣≤α∥z∗−z∥for all z∈Z|f(z^*,x) - f(z,x)| \le \alpha \|z^* - z\| \qquad \text{for all } z \in Z∣f(z∗,x)−f(z,x)∣≤α∥z∗−z∥for all z∈Z

uniformly for all xxx in a neighborhood of x∗x^*x∗. Let F=f(z∗,⋅)+NF = f(z^*,\cdot) + NF=f(z∗,⋅)+N, assume 0∈F(x∗)0 \in F(x^*)0∈F(x∗), and suppose that

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

Then there exist a neighborhood UUU of x∗x^*x∗, a constant λ≥0\lambda \ge 0λ≥0 and a threshold δ0>0\delta_0 > 0δ0​>0 with the following property. For every probability space (Ω,P)(\Omega, P)(Ω,P) and all measurable random elements xν:Ω→Rnx^\nu : \Omega \to \mathbb R^nxν:Ω→Rn, zν:Ω→Zz^\nu : \Omega \to Zzν:Ω→Z such that, for every ω\omegaω, xν(ω)x^\nu(\omega)xν(ω) solves the generalized equation 0∈f(zν(ω),x)+N(x)0 \in f(z^\nu(\omega), x) + N(x)0∈f(zν(ω),x)+N(x) and lies in UUU,

P{∣xν−x∗∣>δ}≤P{αλ∥zν−z∗∥>δ}for all 0<δ<δ0.P\{|x^\nu - x^*| > \delta\} \le P\{\alpha\lambda\|z^\nu - z^*\| > \delta\} \qquad \text{for all } 0 < \delta < \delta_0.P{∣xν−x∗∣>δ}≤P{αλ∥zν−z∗∥>δ}for all 0<δ<δ0​.

The theorem converts a bound on the data error ∥zν−z∗∥\|z^\nu - z^*\|∥zν−z∗∥ into a bound in probability on the solution error, under the sole condition that the contingent derivative of F−1F^{-1}F−1 is single-valued at 000.

Formalization Note The hypothesis 0∈F(x∗)0 \in F(x^*)0∈F(x∗) is presupposed by the paper's notation DF−1(0∣x∗)DF^{-1}(0|x^*)DF−1(0∣x∗) and is stated explicitly. "For all sufficiently small δ>0\delta > 0δ>0" is read with the threshold δ0\delta_0δ0​ chosen together with UUU and λ\lambdaλ, before the random elements, which is what the paper's order ("there exist UUU and λ\lambdaλ such that if xνx^\nuxν … one has … for all sufficiently small δ\deltaδ") says. The random elements are measurable and live in an arbitrary universe-polymorphic probability space; ZZZ carries its Borel sigma-algebra.

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

open Set Filter Topology Metric MeasureTheory ProbabilityTheory

universe u in
theorem theorem_2_4 {Z : Type*} [NormedAddCommGroup Z] [NormedSpace ℝ Z] [CompleteSpace Z]
    [TopologicalSpace.SeparableSpace Z] [MeasurableSpace Z] [BorelSpace Z] {n m : ℕ}
    (f : Z → Rn n → Rn m) (N : Rn n → Set (Rn m)) (z₀ : Z) (x₀ : Rn n) (α : ℝ)
    (hlip : ∃ V ∈ 𝓝 x₀, ∀ x ∈ V, ∀ z : Z, ‖f z₀ x - f z x‖ ≤ α * ‖z₀ - z‖)
    (h0 : (0 : Rn m) ∈ fPlusN f N z₀ x₀)
    (hD : contingentDeriv (svInv (fPlusN f N z₀)) 0 x₀ 0 = {0}) :
    ∃ U ∈ 𝓝 x₀, ∃ lam : ℝ, 0 ≤ lam ∧ ∃ δ₀ > (0 : ℝ),
      ∀ {Ω : Type u} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
        (xν : Ω → Rn n) (zν : Ω → Z), Measurable xν → Measurable zν →
        (∀ ω, xν ω ∈ solMap f N (zν ω) ∩ U) →
        ∀ δ : ℝ, 0 < δ → δ < δ₀ →
          P {ω | δ < ‖xν ω - x₀‖} ≤ P {ω | δ < α * lam * ‖zν ω - z₀‖} := by sorry

end KingRockAsymp.Distribution
Source
King & Rockafellar, Asymptotic Theory for Solutions in Statistical Estimation and Stochastic Programming, Math. Oper. Res. 18(1) (1993), Theorem 2.4, p. 6 (authors' manuscript pagination)
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