Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (5.11) — the event V(θk∗)>εV(\theta^*_k) > \varepsilonV(θk∗​)>ε is covered by the events ΔIN∩{V(θI∗)>ε}\Delta^N_I \cap \{V(\theta^*_I) > \varepsilon\}ΔIN​∩{V(θI∗​)>ε}

Proved
ScenarioApproach.Removal.violation_event_subset_iUnion

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

chance-constraintsp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1scenario-approach

Let (δ1,…,δN)(\delta_1,\dots,\delta_N)(δ1​,…,δN​) be a sample and let a removal procedure select, as a function of the sample, a set I(δ1,…,δN)I(\delta_1,\dots,\delta_N)I(δ1​,…,δN​) of exactly kkk indexes. Let θk∗\theta^*_kθk∗​ be the solution of the scenario program without the constraints with index in this set, and suppose that, with probability one, θk∗\theta^*_kθk∗​ violates each of these kkk removed constraints. For every set III of kkk indexes let θI∗\theta^*_IθI∗​ be the solution of the program without the constraints in III, and let

ΔIN={(δ1,…,δN)∈ΔN:θI∗ violates the constraints θ∈Θδi, i∈I}.\Delta^N_I = \{(\delta_1,\dots,\delta_N) \in \Delta^N : \theta^*_I \text{ violates the constraints } \theta \in \Theta_{\delta_{i}},\ i \in I\}.ΔIN​={(δ1​,…,δN​)∈ΔN:θI∗​ violates the constraints θ∈Θδi​​, i∈I}.

Under Assumption 3.6, for every ε\varepsilonε,

{(δ1,…,δN)∈ΔN:V(θk∗)>ε}⊆⋃I∈I{(δ1,…,δN)∈ΔIN:V(θI∗)>ε}\{(\delta_1,\dots,\delta_N) \in \Delta^N : V(\theta^*_k) > \varepsilon\} \subseteq \bigcup_{I \in \mathcal I} \{(\delta_1,\dots,\delta_N) \in \Delta^N_I : V(\theta^*_I) > \varepsilon\}{(δ1​,…,δN​)∈ΔN:V(θk∗​)>ε}⊆I∈I⋃​{(δ1​,…,δN​)∈ΔIN​:V(θI∗​)>ε}

up to a zero probability set, where I\mathcal II is the collection of all choices of kkk indexes from {1,…,N}\{1,\dots,N\}{1,…,N}.

This inclusion reduces the analysis of an arbitrary removal procedure to the analysis of finitely many fixed index sets, which is the first step of the proof of Theorem 3.9.

Formalization Note As on the page, the removed constraints are assumed violated with probability one (∀ᵐ under PN\mathbb P^NPN), and the inclusion holds up to a zero probability set: for PN\mathbb P^NPN-almost every sample, membership in the left-hand event implies membership in the union. (Requiring the violation for every sample would be unsatisfiable for 1≤k<N1 \le k < N1≤k<N: on a sample with all δi\delta_iδi​ equal, a kept constraint coincides with a removed one.) The removal rule and the solution maps θk∗\theta^*_kθk∗​, θI∗\theta^*_IθI∗​ are arbitrary functions of the sample satisfying the stated solution properties; Assumption 3.6 (applied to the N−kN-kN−k kept constraints) makes θI∗\theta^*_IθI∗​ unique.

Preamble
import Mathlib
import Definitions.Def_ScenarioApproach_Generalization_violation
import Definitions.Def_ScenarioApproach_Removal_scenarioProgram

open MeasureTheory
Formal statement
namespace ScenarioApproach.Removal

theorem violation_event_subset_iUnion {d N k : ℕ} {Δ : Type*} [MeasurableSpace Δ]
    (P : Measure Δ) [IsProbabilityMeasure P]
    (Θ : Set (EuclideanSpace ℝ (Fin d))) (Θδ : Δ → Set (EuclideanSpace ℝ (Fin d)))
    (c : EuclideanSpace ℝ (Fin d))
    (hexu : ExistsUniqueSolution Θ Θδ c)
    (I : (Fin N → Δ) → Finset (Fin N)) (hIcard : ∀ ω, (I ω).card = k)
    (θk : (Fin N → Δ) → EuclideanSpace ℝ (Fin d))
    (hθk : ∀ ω, IsSolutionWithout Θ Θδ c ω (I ω) (θk ω))
    (hviol : ∀ᵐ ω ∂(Measure.pi (fun _ : Fin N => P)), ∀ i ∈ I ω, θk ω ∉ Θδ (ω i))
    (θI : Finset (Fin N) → (Fin N → Δ) → EuclideanSpace ℝ (Fin d))
    (hθI : ∀ J ω, IsSolutionWithout Θ Θδ c ω J (θI J ω))
    (ε : ℝ) :
    ∀ᵐ ω ∂(Measure.pi (fun _ : Fin N => P)),
      ω ∈ {ω : Fin N → Δ | ε < ScenarioApproach.Generalization.violation P Θδ (θk ω)} →
        ω ∈ ⋃ J ∈ (Finset.univ : Finset (Fin N)).powersetCard k,
          {ω : Fin N → Δ | (∀ i ∈ J, θI J ω ∉ Θδ (ω i)) ∧ ε < ScenarioApproach.Generalization.violation P Θδ (θI J ω)} := by sorry

end ScenarioApproach.Removal
Source
Campi & Garatti, Introduction to the Scenario Approach, SIAM/MOS 2018, DOI 10.1137/1.9781611975444, p. 65, Eq. (5.11); p. 64, Eqs. (5.9)–(5.10)
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 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