Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sect. 7.1, p. 24 — violation probability as an F_k integral sum

Proved
WaitJudge.Generic.prob_violation_eq_sum_integral

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1scenario-optimizationsupport-constraintswait-and-judge

For a generic scenario program satisfying Assumptions 1–2 and the stated measurability convention, let N≥1 and let ε(k) lie in [0,1] for 0≤k≤N. Then the chance that the N-sample solution violates a new constraint with probability greater than ε(s*_N) is

PN{V(xN∗)>ε(sN∗)}=∑k=0N(Nk)∫(ε(k),1](1−v)N−k dFk(v).\mathbb P^N\{V(x^*_N)>\varepsilon(s^*_N)\} =\sum_{k=0}^{N}{N\choose k}\int_{(\varepsilon(k),1]}(1-v)^{N-k}\,dF_k(v).PN{V(xN∗​)>ε(sN∗​)}=k=0∑N​(kN​)∫(ε(k),1]​(1−v)N−kdFk​(v).

This identity expresses the tail event using the generalized distribution functions F_k, which are the inputs to the moment problem.

Formalization Note The integral is a Lebesgue integral against the finite measure F_k, and the probability on the left is converted from an extended nonnegative real to a real. The interval is open at ε(k) and closed at 1. Samples use zero-based indices; the hypotheses include the paper's Assumptions 1–2 and footnote-1 measurability pins.

Preamble
import Mathlib
import Definitions.Def_WaitJudge_Generic_Setting
Formal statement
namespace WaitJudge.Generic

open MeasureTheory

theorem prob_violation_eq_sum_integral
    {S Δ : Type*} [Nonempty S] [MeasurableSpace S] [MeasurableSpace Δ]
    (P : Measure Δ) [IsProbabilityMeasure P]
    (f : S → ℝ) (X : Set S) (Xδ : Δ → Set S)
    {p : ℕ} (tb : Fin p → S → ℝ)
    (hA1 : Assumption1 f X Xδ tb)
    (hA2 : Assumption2 f X Xδ tb P)
    (hmeas : MeasurabilityPins f X Xδ tb)
    (N : ℕ) (hN : 0 < N) (ε : ℕ → ℝ)
    (hε : ∀ k ≤ N, 0 ≤ ε k ∧ ε k ≤ 1) :
    ((Measure.pi fun _ : Fin N => P)
      {ω : Fin N → Δ | ε (sstar f X Xδ tb ω) <
        ScenarioApproach.Nonconvex.violation P Xδ (xstar f X Xδ tb ω)}).toReal =
    ∑ k ∈ Finset.range (N + 1), (N.choose k : ℝ) *
      ∫ v in Set.Ioc (ε k) 1, (1 - v) ^ (N - k) ∂(Fk f X Xδ tb P k) := by sorry

end WaitJudge.Generic
Source
Campi & Garatti, Wait-and-judge scenario optimization, Math. Program. (2018), doi:10.1007/s10107-016-1056-9 (accepted manuscript), PDF p. 24, Sect. 7.1, decomposition following (13) and (17)
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