Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 5.1, p. 19 — Mλ(p) → M(p) in the Painlevé–Kuratowski sense, and in the Mosco sense if h is weakly continuous

Proved
MoreauChance.Consistency.proposition_5_1

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

chance-constraintsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-programmingvariational-convergence

In the setting of Theorem 3.1 (separable Hilbert H\mathcal HH, Banach Y\mathcal YY, ξ\xiξ with a Lebesgue density, conic setting (9)–(10) with K\mathcal KK closed, Φ\PhiΦ continuous), fix p∈[0,1]p\in[0,1]p∈[0,1] and let M(p)={x:φ(x)≥p}M(p)=\{x:\varphi(x)\ge p\}M(p)={x:φ(x)≥p}, Mλ(p)={x:φλ(x)≥p}M_\lambda(p)=\{x:\varphi_\lambda(x)\ge p\}Mλ​(p)={x:φλ​(x)≥p}. Then for every sequence of positive numbers λk→0\lambda_k\to0λk​→0:

  1. the sets Mλk(p)M_{\lambda_k}(p)Mλk​​(p) Painlevé–Kuratowski converge to M(p)M(p)M(p);
  2. if the function hhh of (10) is sequentially weakly continuous, the sets Mλk(p)M_{\lambda_k}(p)Mλk​​(p) Mosco converge to M(p)M(p)M(p).

This is the convergence of feasible sets on which the consistency of the regularized problems (Theorem 5.4) rests.

Formalization Note The page writes "the sets Mλ(p)M_\lambda(p)Mλ​(p) converge to M(p)M(p)M(p)" as λ→0\lambda\to0λ→0; the formalization states it along every positive sequence λk→0\lambda_k\to0λk​→0, which is the form the proof and Theorem 5.4 use.

Preamble
import Mathlib
import Definitions.Def_MoreauChance_Consistency_Basic
import Definitions.Def_MoreauChance_Consistency_Setting

open MeasureTheory Filter Topology
open scoped InnerProductSpace ENNReal
Formal statement
namespace MoreauChance.Consistency

theorem proposition_5_1
    {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H] [CompleteSpace H]
    [TopologicalSpace.SeparableSpace H]
    {Y : Type*} [NormedAddCommGroup Y] [NormedSpace ℝ Y] [CompleteSpace Y]
    {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω) [IsProbabilityMeasure μ]
    {m : ℕ} (ξ : Ω → EuclideanSpace ℝ (Fin m)) (hξ : Measurable ξ)
    (hdens : Measure.map ξ μ ≪ volume)
    (K : Set Y) (C : Set (StrongDual ℝ Y)) (h : H → ℝ) (Φ : H → EuclideanSpace ℝ (Fin m) → Y)
    (hset : IsConicSetting K C h Φ)
    (hΦ : Continuous (fun q : H × EuclideanSpace ℝ (Fin m) => Φ q.1 q.2))
    (p : ℝ) (hp : p ∈ Set.Icc (0 : ℝ) 1)
    (lamk : ℕ → ℝ) (hlam_pos : ∀ k, 0 < lamk k) (hlam_lim : Tendsto lamk atTop (𝓝 0)) :
    PKConv (fun k => feasSetReg C h Φ μ ξ (lamk k) p) (feasSet K Φ μ ξ p) ∧
      (SeqWeakCont h →
        MoscoConv (fun k => feasSetReg C h Φ μ ξ (lamk k) p) (feasSet K Φ μ ξ p)) := by sorry

end MoreauChance.Consistency
Source
van Ackooij, Pérez-Aros, Soto & Vilches, Inner Moreau envelope of nonsmooth conic chance constrained optimization problems, arXiv:2301.09803v1, p. 19, Proposition 5.1
Human review
  • Endorsed by Shuze Chen · Oct 23, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 23, 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