Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2.6, p. 8 — ϕ(x) = ℙ(S^h_Φ(x, ξ) ≤ h(x)) (12)

Proved
MoreauChance.Consistency.proposition_2_6

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

chance-constraintsconic-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-programming

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 on a probability space (Ω,P)(\Omega,\mathbb P)(Ω,P), and let K\mathcal KK, C\mathcal CC, hhh and Φ\PhiΦ satisfy the conic setting (9)–(10) of §2.4, with K\mathcal KK a nonempty closed convex cone. Then the probability function φ(x)=P(Φ(x,ξ)∈−K)\varphi(x)=\mathbb P(\Phi(x,\xi)\in-\mathcal K)φ(x)=P(Φ(x,ξ)∈−K) is expressed through the supremum function SΦhS^h_\PhiSΦh​ of (11):

φ(x)=P(ω∈Ω:SΦh(x,ξ(ω))≤h(x))for all x∈H.(12)\varphi(x)=\mathbb P\big(\omega\in\Omega: S^h_\Phi(x,\xi(\omega))\le h(x)\big)\quad\text{for all }x\in\mathcal H. \tag{12}φ(x)=P(ω∈Ω:SΦh​(x,ξ(ω))≤h(x))for all x∈H.(12)

This scalarization is what makes the inner Moreau regularization (13) possible: it replaces the conic constraint by a real inequality whose left-hand side is jointly convex.

Formalization Note The page assumes only that K\mathcal KK is a nonempty convex cone; the formalization adds that K\mathcal KK is closed. The proof's first step Φ∈−K  ⟺  −Φ∈(K−)−\Phi\in-\mathcal K\iff-\Phi\in(\mathcal K^-)^-Φ∈−K⟺−Φ∈(K−)− is the bipolar theorem, which returns the closure of K\mathcal KK; without closedness (12) can fail. No continuity of Φ\PhiΦ and no density of ξ\xiξ is assumed, as on the page.

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_2_6
    {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 ξ)
    (K : Set Y) (C : Set (StrongDual ℝ Y)) (h : H → ℝ) (Φ : H → EuclideanSpace ℝ (Fin m) → Y)
    (hset : IsConicSetting K C h Φ) :
    ∀ x : H, probFun K Φ μ ξ x =
      μ {ω | supFun C h Φ (WithLp.toLp 2 (x, ξ ω)) ≤ (h 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. 8, Proposition 2.6, Equation (12)
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