Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, PART 1, pp. 8–9 — PN{V(xN∗)>ε}=(Nd)∫ε1(1−α)N−dF(dα)\mathbb P^N\{V(x^*_N)>\varepsilon\}=\binom Nd\int_\varepsilon^1(1-\alpha)^{N-d}F(\mathrm d\alpha)PN{V(xN∗​)>ε}=(dN​)∫ε1​(1−α)N−dF(dα)

Proved
ScenarioExact.PartOne.tail_eq_choose_mul_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, d≥1d\ge1d≥1, 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 FFF be the distribution (3.1) of the violation of xd∗x^*_dxd∗​ and VVV the violation probability (Definition 1.1). Then for every N≥dN\ge dN≥d and every ε∈[0,1]\varepsilon\in[0,1]ε∈[0,1],

PN{V(xN∗)>ε}=(Nd)∫(ε,1](1−α)N−d F(dα).\mathbb P^N\{V(x^*_N)>\varepsilon\}=\binom Nd\int_{(\varepsilon,1]}(1-\alpha)^{N-d}\,F(\mathrm d\alpha).PN{V(xN∗​)>ε}=(dN​)∫(ε,1]​(1−α)N−dF(dα).

The paper partitions the event {V(xN∗)>ε}\{V(x^*_N)>\varepsilon\}{V(xN∗​)>ε} according to the indexes of the ddd support constraints. Combined with (3.2) and the integration-by-parts identity, this yields (2.3).

Formalization Note. The paper's ∫ε1⋯F(dα)\int_\varepsilon^1\cdots F(\mathrm d\alpha)∫ε1​⋯F(dα) comes from the indicator of {α>ε}\{\alpha>\varepsilon\}{α>ε}, so it is taken over the half-open interval (ε,1](\varepsilon,1](ε,1]; FFF may have an atom at ε\varepsilonε in this generality. The integral is the lower Lebesgue integral against violationLaw, and the identity is an equality of extended nonnegative reals. The solution of the program with NNN constraints is θs N, which under existence and uniqueness is the goal theorem's θstar. Measurability of the event is not assumed; it follows from the joint measurability of the constraint relation and the measurability of the solution maps, which are assumed.

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, PART 1, pp. 8–9: for a fully-supported problem,
`ℙ^N{V(x*_N) > ε} = binom(N, d) ∫_ε^1 (1 − α)^{N−d} F(dα)`, the integral over `(ε, 1]`. -/
theorem tail_eq_choose_mul_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)
    {N : ℕ} (hd : 1 ≤ d) (hN : d ≤ N) (ε : ℝ) (hε0 : 0 ≤ ε) (hε1 : ε ≤ 1) :
    Measure.pi (fun _ : Fin N => P) {ω | ε < violation P Θδ (θs N ω)} =
      (N.choose d : ℝ≥0∞) *
        ∫⁻ α in Set.Ioc ε 1, ENNReal.ofReal ((1 - α) ^ (N - 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, pp. 8–9, §3, PART 1, 'To conclude the proof of PART 1', first four lines of the display
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