Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(14), Sect. 5.1.1, p. 14 — ℙᴺ{S_k} = C(N,k) ℙᴺ{A} by exchangeability

Proved
WaitJudge.Convex.prob_Sk_eq_choose_mul

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

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

Let δ(1),…,δ(N)\delta^{(1)},\dots,\delta^{(N)}δ(1),…,δ(N) be i.i.d. with law P\mathbb PP, and let the measurability conditions hold. Fix k≤Nk\le Nk≤N and a threshold ϵ(k)\epsilon(k)ϵ(k). Let

Sk={V(xN∗)>ϵ(k) ∧ sN∗=k}S_k=\{V(x^*_N)>\epsilon(k)\ \wedge\ s^*_N=k\}Sk​={V(xN∗​)>ϵ(k) ∧ sN∗​=k}

and let A⊆SkA\subseteq S_kA⊆Sk​ be the event (15) where, in addition, the first kkk constraints are of support. Then

PN{Sk}=(Nk) PN{A}.\mathbb P^N\{S_k\}=\binom Nk\,\mathbb P^N\{A\}.PN{Sk​}=(kN​)PN{A}.

The identity groups the samples of SkS_kSk​ by the index set of their kkk support constraints; the (Nk)\binom Nk(kN​) groups have the same probability because the sample is i.i.d. and the solution does not depend on the order of the constraints.

Formalization Note "The first kkk constraints" are those with indices 0,…,k−10,\dots,k-10,…,k−1. The measurability hypotheses (joint measurability of {(x,δ):x∈Xδ}\{(x,\delta):x\in\mathcal X_\delta\}{(x,δ):x∈Xδ​} and of the solution maps) make both events measurable; the paper takes measurability for granted. No convexity and no Assumption 1 or 2 is needed.

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_Sk_eq_choose_mul {d p : ℕ} {Δ : Type*} [MeasurableSpace Δ] (P : Measure Δ) [IsProbabilityMeasure P]
    (c : E d) (X : Set (E d)) (Xδ : Δ → Set (E d)) (tb : Fin p → E d → ℝ)
    (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} =
      ((N.choose k : ℕ) : ENNReal) * (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 ω} := 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 pp. 13–14, Sect. 5.1.1, (14) and (15)
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