Eq. (5.11) — the event is covered by the events
ProvedScenarioApproach.Removal.violation_event_subset_iUnionLet be a sample and let a removal procedure select, as a function of the sample, a set of exactly indexes. Let be the solution of the scenario program without the constraints with index in this set, and suppose that, with probability one, violates each of these removed constraints. For every set of indexes let be the solution of the program without the constraints in , and let
Under Assumption 3.6, for every ,
up to a zero probability set, where is the collection of all choices of indexes from .
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 ), and the inclusion holds up to a zero probability set: for -almost every sample, membership in the left-hand event implies membership in the union. (Requiring the violation for every sample would be unsatisfiable for : on a sample with all equal, a kept constraint coincides with a removed one.) The removal rule and the solution maps , are arbitrary functions of the sample satisfying the stated solution properties; Assumption 3.6 (applied to the kept constraints) makes unique.
import Mathlib import Definitions.Def_ScenarioApproach_Generalization_violation import Definitions.Def_ScenarioApproach_Removal_scenarioProgram open MeasureTheory
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.