Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sect. 5.1.1, pp. 14–15 — A = B up to a zero-probability set

Proved
WaitJudge.Convex.A_ae_eq_B

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

non-degeneracyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1scenario-optimizationsupport-constraints

Let Assumptions 1 and 2 hold, fix k≤Nk\le Nk≤N and a threshold ϵ(k)\epsilon(k)ϵ(k), and write xk∗x^*_kxk∗​, sk∗s^*_ksk∗​ for the solution and the number of support constraints of the program built on the first kkk scenarios only. Let $$A={V(x^_N)>\epsilon(k)\ \wedge\ s^_N=k\ \wedge\ \text{the first kkk constraints are of support}},

B={V(x^_k)>\epsilon(k)\ \wedge\ s^_k=k\ \wedge\ \text{the constraints with indexes k+1,…,Nk+1,\dots,Nk+1,…,N are satisfied by xk∗x^*_kxk∗​}}.$$ Then AAA and BBB differ by a PN\mathbb P^NPN-null set:

PN(A △ B)=0.\mathbb P^N\big(A\,\triangle\,B\big)=0.PN(A△B)=0.

This equality reduces the probability of AAA, which involves the full program, to that of BBB, which involves the first kkk scenarios and an independent check of the remaining N−kN-kN−k; that is the route to formula (16).

Formalization Note Indices are 000-based: the first kkk scenarios are δ(0),…,δ(k−1)\delta^{(0)},\dots,\delta^{(k-1)}δ(0),…,δ(k−1) and the remaining ones have index j≥kj\ge kj≥k. The statement is an almost-everywhere equality of sets and needs no measurability hypothesis.

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 A_ae_eq_B {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)
    (ε : ℕ → ℝ) (N k : ℕ) (hk : k ≤ N) :
    {ω : Fin N → Δ | ε 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 ω}
      =ᵐ[Measure.pi fun _ : Fin N => P]
    {ω : Fin N → Δ | ε k < violation P Xδ (xstar c X Xδ tb (firstK hk ω)) ∧
        sstar c X Xδ tb (firstK hk ω) = k ∧
        ∀ j : Fin N, k ≤ j.val → xstar c X Xδ tb (firstK hk ω) ∈ Xδ (ω j)} := 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. 14–15, Sect. 5.1.1, event B and 'Proof of the fact that A = B up to a zero probability set'
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