Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(3.3), p. 8 — Pm{SI}=∫01(1−α)m−dF(dα)\mathbb P^m\{S_{\mathcal I}\}=\int_0^1(1-\alpha)^{m-d}F(\mathrm d\alpha)Pm{SI​}=∫01​(1−α)m−dF(dα)

Proved
ScenarioExact.PartOne.prob_S_eq_integral

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

chance-constraintsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1probabilityscenario-approach

Let (Δ,D,P)(\Delta,\mathcal D,\mathbb P)(Δ,D,P) be a probability space and consider the uncertain program (1.1) with c∈Rdc\in\mathbb R^dc∈Rd, convex closed X\mathcal XX and convex closed Xδ\mathcal X_\deltaXδ​, such that every finite instance PkP_kPk​ has a unique solution xk∗x^*_kxk∗​, and assume the problem is fully-supported. Let F(α)=Pd{V(xd∗)≤α}F(\alpha)=\mathbb P^d\{V(x^*_d)\le\alpha\}F(α)=Pd{V(xd∗​)≤α} be the distribution of the violation of xd∗x^*_dxd∗​, as in (3.1). Then for every m≥dm\ge dm≥d and every set I⊆{1,…,m}\mathcal I\subseteq\{1,\dots,m\}I⊆{1,…,m} of cardinality ddd,

Pm{SI}=∫01(1−α)m−d F(dα),(3.3)\mathbb P^m\{S_{\mathcal I}\}=\int_0^1(1-\alpha)^{m-d}\,F(\mathrm d\alpha),\tag{3.3}Pm{SI​}=∫01​(1−α)m−dF(dα),(3.3)

where SIS_{\mathcal I}SI​ is the set of multi-extractions whose support constraints have exactly the indexes in I\mathcal II.

Since the (md)\binom md(dm​) sets SIS_{\mathcal I}SI​ partition Δm\Delta^mΔm up to a null set, (3.3) yields the moment identities (3.4) that determine FFF.

Formalization Note. The integral is the lower Lebesgue integral of α↦(1−α)m−d\alpha\mapsto(1-\alpha)^{m-d}α↦(1−α)m−d (as an extended nonnegative real) over [0,1][0,1][0,1] against the law FFF (violationLaw); FFF is concentrated on [0,1][0,1][0,1], so this is the paper's ∫01⋯F(dα)\int_0^1\cdots F(\mathrm d\alpha)∫01​⋯F(dα), atom at 000 included. The statement is for every I\mathcal II of cardinality ddd, as printed. No measurability of SIS_{\mathcal I}SI​ is assumed: the left side is the outer measure, and the paper's "measurability ... is assumed for granted" (p. 4) is replaced by the joint measurability of {(x,δ):x∈Xδ}\{(x,\delta): x\in\mathcal X_\delta\}{(x,δ):x∈Xδ​} and the measurability of the solution maps. Existence and uniqueness are assumed for every number of constraints, with the solution family θs; the nonempty-interior clause of Assumption 1 is not used and not assumed. Indexes are 0-based.

Preamble
import Mathlib
import Definitions.Def_ScenarioApproach_Generalization_violation
import Definitions.Def_ScenarioApproach_Generalization_scenarioProgram
import Definitions.Def_ScenarioApproach_Generalization_supportConstraint
import Definitions.Def_ScenarioExact_PartOne_Basic
open MeasureTheory ScenarioApproach.Generalization
open scoped ENNReal
Formal statement
namespace ScenarioExact.PartOne

/-- (3.3), p. 8: for a fully-supported problem, `m ≥ d` and every index set `𝓘` of
cardinality `d`, `ℙ^m{S_𝓘} = ∫_0^1 (1 − α)^{m−d} F(dα)`, with `F` the law (3.1). -/
theorem prob_S_eq_integral
    {d : ℕ} {Δ : Type*} [MeasurableSpace Δ]
    (P : Measure Δ) [IsProbabilityMeasure P]
    (c : EuclideanSpace ℝ (Fin d)) (Θ : Set (EuclideanSpace ℝ (Fin d)))
    (Θδ : Δ → Set (EuclideanSpace ℝ (Fin d)))
    -- Assumption 1 / (1.1): `𝒳` and every `𝒳_δ` are convex and closed
    (hΘ_convex : Convex ℝ Θ) (hΘ_closed : IsClosed Θ)
    (hΘδ_convex : ∀ δ, Convex ℝ (Θδ δ)) (hΘδ_closed : ∀ δ, IsClosed (Θδ δ))
    -- Assumption 1: for every number `k` of constraints and every sample, `P_k` has a unique solution
    (hexu : ∀ (k : ℕ) (ω : Fin k → Δ), ∃! θ, IsSolution c Θ Θδ ω θ)
    -- measurability ("assumed for granted", p. 4): the constraint relation is jointly measurable
    (hmeas : MeasurableSet {p : EuclideanSpace ℝ (Fin d) × Δ | p.1 ∈ Θδ p.2})
    -- `θs k ω` is the solution `x*_k` of `P_k` with the sampled constraints `ω`; measurable in `ω`
    (θs : (k : ℕ) → (Fin k → Δ) → EuclideanSpace ℝ (Fin d))
    (hθs : ∀ (k : ℕ) (ω : Fin k → Δ), IsSolution c Θ Θδ ω (θs k ω))
    (hθs_meas : ∀ k, Measurable (θs k))
    -- Definition 2.3: the problem is fully-supported
    (hfs : FullySupported c Θ Θδ P)
    {m : ℕ} (hm : d ≤ m) (I : Finset (Fin m)) (hI : I.card = d) :
    Measure.pi (fun _ : Fin m => P) (S c Θ Θδ θs I) =
      ∫⁻ α in Set.Icc (0 : ℝ) 1, ENNReal.ofReal ((1 - α) ^ (m - d)) ∂(violationLaw P Θδ θs) := by sorry

end ScenarioExact.PartOne
Source
Campi & Garatti, The exact feasibility of randomized solutions of uncertain convex programs, SIAM J. Optim. 19(3) (2008); authors' final manuscript, p. 8, eq. (3.3) (with (3.1), p. 7)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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