Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.1 a), p. 9 — ϕλ is monotone in λ and inf_{λ>0} ϕλ = ϕ

Proved
MoreauChance.Consistency.theorem_3_1_a

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

chance-constraintsmoreau-envelopep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1variational-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. Let φ\varphiφ be the probability function (1) and φλ\varphi_\lambdaφλ​ its inner regularization (13). Then for every x∈Hx\in\mathcal Hx∈H:

  1. φλ1(x)≥φλ2(x)\varphi_{\lambda_1}(x)\ge\varphi_{\lambda_2}(x)φλ1​​(x)≥φλ2​​(x) whenever λ1>λ2>0\lambda_1>\lambda_2>0λ1​>λ2​>0;
inf⁡λ>0φλ(x)=φ(x).\inf_{\lambda>0}\varphi_\lambda(x)=\varphi(x).λ>0inf​φλ​(x)=φ(x).

So φλ\varphi_\lambdaφλ​ approximates φ\varphiφ from above, monotonically. In particular M(p)⊆Mλ(p)M(p)\subseteq M_\lambda(p)M(p)⊆Mλ​(p) for every λ>0\lambda>0λ>0, which Proposition 5.1 and Theorem 5.4 use.

Formalization Note Probabilities take values in [0,∞][0,\infty][0,∞]; the infimum is over λ>0\lambda>0λ>0. Closedness of K\mathcal KK is part of the conic-setting bundle (an addition, see Proposition 2.6).

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_3_1_a
    {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)) (x : H) :
    (∀ l1 l2 : ℝ, 0 < l2 → l2 < l1 → probFunReg C h Φ μ ξ l2 x ≤ probFunReg C h Φ μ ξ l1 x) ∧
      (⨅ (l : ℝ) (_ : 0 < l), probFunReg C h Φ μ ξ l x) = probFun K Φ μ ξ x := 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. 9, Theorem 3.1 a)
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