Distribution function as one minus the probability of a union
ProvedKallMayerSLP.Bonferroni.eq_3_8_3_9_distribution_functionbonferroni-inequalitiesp2o-gran-per-chapterp2o-plan-bookp2o-v1probabilitystochastic-programming
Let , , be a random vector on a probability space, let , and let , . Then
and, with the number of events out of which occur,
This turns bounds on the probability of a union into bounds on the distribution function.
Differences from the source:
- encoding: events (or variables ) indexed by → indexed by
Fin r, that is by ; reason: Lean convention; same instances - encoding: the number of events (the dimension of with values in ) is left implicit → hypothesis
1 ≤ r; reason: the family starts at , so the book has ; the hypothesis excludes only the empty family
Preamble
import Mathlib import Definitions.Def_KallMayerSLP_Bonferroni_jointCDF import Definitions.Def_KallMayerSLP_Bonferroni_lowerEvent import Definitions.Def_KallMayerSLP_Bonferroni_exceedanceEvent import Definitions.Def_KallMayerSLP_Bonferroni_occurrenceCount open MeasureTheory
Formal statement
namespace KallMayerSLP.Bonferroni
/-- The distribution function as the complement of a union:
`F(x) = ℙ(A₁ ∩ ⋯ ∩ A_r) = ℙ((B₁ ∪ ⋯ ∪ B_r)^c) = 1 - ℙ(B₁ ∪ ⋯ ∪ B_r)` and
`F(x) = 1 - ℙ(ν ≥ 1)`.
Kall & Mayer, *Stochastic Linear Programming* (2005), Chapter 4, eq. (3.8) and (3.9), p.285 (PDF 294). -/
theorem eq_3_8_3_9_distribution_function {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω) [IsProbabilityMeasure μ]
{r : ℕ} (hr : 1 ≤ r) (ξ : Ω → Fin r → ℝ) (hξ : Measurable ξ) (x : Fin r → ℝ) :
jointCDF μ ξ x = μ.real (⋂ i, lowerEvent ξ x i) ∧
μ.real (⋂ i, lowerEvent ξ x i) = μ.real (⋃ i, exceedanceEvent ξ x i)ᶜ ∧
μ.real (⋃ i, exceedanceEvent ξ x i)ᶜ = 1 - μ.real (⋃ i, exceedanceEvent ξ x i) ∧
jointCDF μ ξ x = 1 - μ.real {ω | 1 ≤ occurrenceCount (exceedanceEvent ξ x) ω} := by sorry
end KallMayerSLP.Bonferroni
Source
Kall & Mayer, Stochastic Linear Programming (2005), Chapter 4, §3.4, eq. (3.8) and (3.9), p.285 (PDF 294)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.