Proof of Theorem 2.6, display (pp. 8–9) — Lipschitz bound on solutions near the true one (cited from [12], Thm 4.1)
ProvedKingRockAsymp.Distribution.thm_2_6_display_lipschitz_boundgeneralized-equationsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1set-valued-analysis
Let be a separable Banach space and assume the analytical assumptions M.1–M.4 at for and , and let . Then there are a compact neighborhood of and a constant such that, for all in a neighborhood of ,
In the proof of Theorem 2.6 the paper uses this bound at in the form , which makes the rescaled solution errors tight; it cites the bound from [12], Theorem 4.1.
Formalization Note The printed display is the instance of the deterministic bound stated here, with the common factor cancelled.
Preamble
import Mathlib import Definitions.Def_KingRockAsymp_Distribution_Basic
Formal statement
namespace KingRockAsymp.Distribution
open Set Filter Topology Metric MeasureTheory ProbabilityTheory
theorem thm_2_6_display_lipschitz_bound {Z : Type*} [NormedAddCommGroup Z]
[NormedSpace ℝ Z] [CompleteSpace Z] [TopologicalSpace.SeparableSpace Z] {n m : ℕ}
(f : Z → Rn n → Rn m) (N : Rn n → Set (Rn m)) (z₀ : Z) (x₀ : Rn n) (Dz : Z → Rn m)
(hM : AnalyticalAssumptions f N z₀ x₀ Dz) :
∃ U : Set (Rn n), IsCompact U ∧ U ∈ 𝓝 x₀ ∧ ∃ lam : ℝ, 0 ≤ lam ∧
∀ᶠ z in 𝓝 z₀, ∀ x ∈ U ∩ solMap f N z, ‖x - x₀‖ ≤ 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), proof of Theorem 2.6, display, pp. 8–9 (authors' manuscript pagination); cited from [12], Theorem 4.1
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.