Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2.1 a), p. 5 — monotone convergence: e_λg ↗ g as λ ↘ 0

Proved
MoreauChance.Consistency.proposition_2_1_a

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

convex-analysismoreau-envelopep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let H\mathcal HH be a separable real Hilbert space and g:H→Rg:\mathcal H\to\mathbb Rg:H→R a convex, lower semicontinuous (real-valued) function. Write eλg(x)=inf⁡z{g(z)+12λ∥x−z∥2}\mathrm e_\lambda g(x)=\inf_z\{g(z)+\frac1{2\lambda}\|x-z\|^2\}eλ​g(x)=infz​{g(z)+2λ1​∥x−z∥2} for its Moreau envelope. Then for every x∈Hx\in\mathcal Hx∈H:

  1. λ↦eλg(x)\lambda\mapsto\mathrm e_\lambda g(x)λ↦eλ​g(x) is nonincreasing on (0,∞)(0,\infty)(0,∞): eλ1g(x)≤eλ2g(x)\mathrm e_{\lambda_1}g(x)\le\mathrm e_{\lambda_2}g(x)eλ1​​g(x)≤eλ2​​g(x) whenever λ1>λ2>0\lambda_1>\lambda_2>0λ1​>λ2​>0;
  2. eλg(x)≤g(x)\mathrm e_\lambda g(x)\le g(x)eλ​g(x)≤g(x) for every λ>0\lambda>0λ>0;
lim⁡λ→0+eλg(x)=g(x).\lim_{\lambda\to0^+}\mathrm e_\lambda g(x)=g(x).λ→0+lim​eλ​g(x)=g(x).

Together these say eλg(x)↗g(x)\mathrm e_\lambda g(x)\nearrow g(x)eλ​g(x)↗g(x) as λ↘0\lambda\searrow0λ↘0. This is the basic approximation property that the paper transfers to the probability function and to the objective of the regularized problems.

Formalization Note The envelope is computed as an extended-real infimum; the limit is along λ→0\lambda\to0λ→0 with λ>0\lambda>0λ>0. Separability is the paper's standing assumption on H\mathcal HH (§2.1).

Preamble
import Mathlib
import Definitions.Def_MoreauChance_Consistency_Basic

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

theorem proposition_2_1_a
    {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H] [CompleteSpace H]
    [TopologicalSpace.SeparableSpace H]
    (g : H → ℝ) (hg_convex : ConvexOn ℝ Set.univ g) (hg_lsc : LowerSemicontinuous g) (x : H) :
    (∀ l1 l2 : ℝ, 0 < l2 → l2 < l1 →
        moreauEnv (fun z => (g z : EReal)) l1 x ≤ moreauEnv (fun z => (g z : EReal)) l2 x) ∧
      (∀ l : ℝ, 0 < l → moreauEnv (fun z => (g z : EReal)) l x ≤ (g x : EReal)) ∧
      Tendsto (fun l => moreauEnv (fun z => (g z : EReal)) l x) (𝓝[>] 0) (𝓝 (g x : EReal)) := 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. 5, Proposition 2.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