Proposition 2.6, p. 8 — ϕ(x) = ℙ(S^h_Φ(x, ξ) ≤ h(x)) (12)
ProvedMoreauChance.Consistency.proposition_2_6Let be a separable Hilbert space, a Banach space, a random vector on a probability space , and let , , and satisfy the conic setting (9)–(10) of §2.4, with a nonempty closed convex cone. Then the probability function is expressed through the supremum function of (11):
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 is a nonempty convex cone; the formalization adds that is closed. The proof's first step is the bipolar theorem, which returns the closure of ; without closedness (12) can fail. No continuity of and no density of is assumed, as on the page.
import Mathlib import Definitions.Def_MoreauChance_Consistency_Basic import Definitions.Def_MoreauChance_Consistency_Setting open MeasureTheory Filter Topology open scoped InnerProductSpace ENNReal
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.