Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.4, p. 21 — values and optimal solutions of the Moreau-regularized problems (Pλ) converge to those of (P)

Proved
MoreauChance.Consistency.theorem_5_4

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

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

Let H\mathcal HH be a separable Hilbert space, Y\mathcal YY a Banach space, ξ:Ω→Rm\xi:\Omega\to\mathbb R^mξ:Ω→Rm a random vector whose law has a density with respect to Lebesgue measure, and let K\mathcal KK (a nonempty closed convex cone), C\mathcal CC, hhh satisfy the conic setting (9)–(10) with Φ:H×Rm→Y\Phi:\mathcal H\times\mathbb R^m\to\mathcal YΦ:H×Rm→Y continuous and hhh sequentially weakly continuous. Fix p∈[0,1]p\in[0,1]p∈[0,1] and let ψ:H→R∞\psi:\mathcal H\to\mathbb R_\inftyψ:H→R∞​ be proper, convex, coercive and lower semicontinuous with M(p)∩dom⁡ψ≠∅M(p)\cap\operatorname{dom}\psi\ne\emptysetM(p)∩domψ=∅. Consider

(P)  min⁡{ψ(x):x∈M(p)},(Pλ)  min⁡{eλψ(x):x∈Mλ(p)},(P)\ \ \min\{\psi(x):x\in M(p)\},\qquad (P_\lambda)\ \ \min\{\mathrm e_\lambda\psi(x):x\in M_\lambda(p)\},(P)  min{ψ(x):x∈M(p)},(Pλ​)  min{eλ​ψ(x):x∈Mλ​(p)},

with values v(P)v(P)v(P), v(Pλ)v(P_\lambda)v(Pλ​). Then:

  1. v(P)∈Rv(P)\in\mathbb Rv(P)∈R and v(Pλ)∈Rv(P_\lambda)\in\mathbb Rv(Pλ​)∈R for every λ>0\lambda>0λ>0, and v(Pλ)→v(P)v(P_\lambda)\to v(P)v(Pλ​)→v(P) as λ→0+\lambda\to0^+λ→0+.
  2. Let λk→0+\lambda_k\to0^+λk​→0+ and let xkx_kxk​ be an optimal solution of (Pλk)(P_{\lambda_k})(Pλk​​) for every kkk. If xk⇀x0x_k\rightharpoonup x_0xk​⇀x0​, then x0x_0x0​ is an optimal solution of (P). If furthermore dom⁡ψ=H\operatorname{dom}\psi=\mathcal Hdomψ=H and ψ∗\psi^*ψ∗ is Fréchet differentiable at every point of dom⁡∂ψ∗\operatorname{dom}\partial\psi^*dom∂ψ∗, then xk→x0x_k\to x_0xk​→x0​ in norm.

This is the consistency result of the paper: the doubly regularized problems, whose data are smooth, recover both the optimal value and the optimal solutions of the original nonsmooth chance-constrained problem.

Formalization Note Two hypotheses are added to the page. (i) K\mathcal KK is closed, used through Proposition 2.6. (ii) Sequential weak continuity of hhh is assumed for the whole theorem; the page states it only in item 2, but the proof of item 1 uses the weak closedness of M(p)M(p)M(p) (Theorem 3.1 d), whose proof needs it) and the Mosco convergence of Proposition 5.1 b). With H\mathcal HH finite-dimensional the hypothesis is automatic. "∈R\in\mathbb R∈R" is stated as "neither −∞-\infty−∞ nor +∞+\infty+∞". Item 2 is vacuous when some (Pλk)(P_{\lambda_k})(Pλk​​) has no optimal solution, exactly as on the page ("let (xλk)(x_{\lambda_k})(xλk​​) be any sequence of optimal solutions"). Fréchet differentiability of the extended-valued ψ∗\psi^*ψ∗ at uuu includes finiteness of ψ∗\psi^*ψ∗ near uuu.

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 theorem_5_4
    {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))
    (h_weak : SeqWeakCont h)
    (p : ℝ) (hp : p ∈ Set.Icc (0 : ℝ) 1)
    (ψ : H → EReal) (hψ : IsGammaZero ψ) (hψ_coercive : IsCoercive ψ)
    (hfeas : (feasSet K Φ μ ξ p ∩ {x | ψ x ≠ ⊤}).Nonempty) :
    (valP ψ K Φ μ ξ p ≠ ⊥ ∧ valP ψ K Φ μ ξ p ≠ ⊤ ∧
        (∀ lam : ℝ, 0 < lam →
          valPReg ψ C h Φ μ ξ lam p ≠ ⊥ ∧ valPReg ψ C h Φ μ ξ lam p ≠ ⊤) ∧
        Tendsto (fun lam => valPReg ψ C h Φ μ ξ lam p) (𝓝[>] 0) (𝓝 (valP ψ K Φ μ ξ p))) ∧
      (∀ (lamk : ℕ → ℝ) (xk : ℕ → H) (x0 : H), (∀ k, 0 < lamk k) →
        Tendsto lamk atTop (𝓝 0) →
        (∀ k, IsOptimalPReg ψ C h Φ μ ξ (lamk k) p (xk k)) → WeakConv xk x0 →
        IsOptimalP ψ K Φ μ ξ p x0 ∧
          ((∀ x, ψ x ≠ ⊤) →
            (∀ u, (subdiff (conj ψ) u).Nonempty → FrechetDiffAtE (conj ψ) u) →
            Tendsto xk atTop (𝓝 x0))) := 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. 21, Theorem 5.4
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