Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(16), Sect. 5.1.1, p. 14 — ℙᴺ{A} = ∫_(ε(k),1] (1−v)^(N−k) dF_k(v)

Proved
WaitJudge.Convex.prob_A_eq_integral

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

fubinip2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1scenario-optimizationsupport-constraints

Let P\mathbb PP be a probability measure, let Assumptions 1 and 2 and the measurability conditions hold, and fix k≤Nk\le Nk≤N and a threshold ϵ(k)\epsilon(k)ϵ(k). For the event $$A={V(x^_N)>\epsilon(k)\ \wedge\ s^_N=k\ \wedge\ \text{the first kkk constraints are of support}}

of(15),of (15),of(15),

\mathbb P^N{A}=\int_{(\epsilon(k),1]}(1-v)^{N-k},\mathrm dF_k(v),$$ where Fk(v)=Pk{V(xk∗)≤v∧sk∗=k}F_k(v)=\mathbb P^k\{V(x^*_k)\le v\wedge s^*_k=k\}Fk​(v)=Pk{V(xk∗​)≤v∧sk∗​=k} is the generalized distribution function (12).

Given V(xk∗)=vV(x^*_k)=vV(xk∗​)=v, the probability that the other N−kN-kN−k independent constraints are all satisfied by xk∗x^*_kxk∗​ is (1−v)N−k(1-v)^{N-k}(1−v)N−k; combined with A=BA=BA=B almost surely, this gives the formula.

Formalization Note FkF_kFk​ is the (non-normalised) finite measure on R\mathbb RR whose distribution function is FkF_kFk​, and the integral is the Lebesgue integral over (ϵ(k),1](\epsilon(k),1](ϵ(k),1] against it. The probability is an extended nonnegative real, compared with the real integral through ofReal\mathrm{ofReal}ofReal.

Preamble
import Mathlib
import Definitions.Def_ScenarioApproach_Generalization_violation
import Definitions.Def_WaitJudge_Convex_Setting

open MeasureTheory ScenarioApproach.Generalization
Formal statement
namespace WaitJudge.Convex

theorem prob_A_eq_integral {d p : ℕ} {Δ : Type*} [MeasurableSpace Δ] (P : Measure Δ) [IsProbabilityMeasure P]
    (c : E d) (X : Set (E d)) (Xδ : Δ → Set (E d)) (tb : Fin p → E d → ℝ)
    (hA1 : Assumption1 c X Xδ tb) (hA2 : Assumption2 c X Xδ tb P)
    (hmeas : MeasurabilityPins c X Xδ tb)
    (ε : ℕ → ℝ) (N k : ℕ) (hk : k ≤ N) :
    (Measure.pi fun _ : Fin N => P) {ω | ε k < violation P Xδ (xstar c X Xδ tb ω) ∧ sstar c X Xδ tb ω = k ∧
        ∀ i : Fin N, i.val < k → i ∈ supportSet c X Xδ tb ω} =
      ENNReal.ofReal (∫ v in Set.Ioc (ε k) 1, (1 - v) ^ (N - k) ∂(Fk P c X Xδ tb k)) := by sorry

end WaitJudge.Convex
Source
Campi & Garatti, Wait-and-judge scenario optimization, Math. Program. (2018), doi:10.1007/s10107-016-1056-9 (accepted manuscript), PDF p. 14, Sect. 5.1.1, (16) (with (12), p. 13)
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