Proposition 3.1: is the -th binomial moment of
ProvedKallMayerSLP.Bonferroni.proposition_3_1bonferroni-inequalitiesp2o-gran-per-chapterp2o-plan-bookp2o-v1probabilitystochastic-programming
For events , , on a probability space, and ,
This identity explains the term binomial moment.
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 - encoding: →
Nat.choose, which is for ; reason: the factorial formula is undefined for , and the book's proof uses the value there
Preamble
import Mathlib import Definitions.Def_KallMayerSLP_Bonferroni_binomialMoment import Definitions.Def_KallMayerSLP_Bonferroni_occurrenceCount open MeasureTheory
Formal statement
namespace KallMayerSLP.Bonferroni
/-- Proposition 3.1: `𝔼[(ν choose k)] = S_k` for `k = 0, …, r`.
Kall & Mayer, *Stochastic Linear Programming* (2005), Chapter 4, Proposition 3.1, p.286 (PDF 295). -/
theorem proposition_3_1 {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω) [IsProbabilityMeasure μ]
{r : ℕ} (hr : 1 ≤ r) (B : Fin r → Set Ω) (hB : ∀ i, MeasurableSet (B i)) (k : ℕ) (hk : k ≤ r) :
∫ ω, ((occurrenceCount B ω).choose k : ℝ) ∂μ = binomialMoment μ B k := by sorry
end KallMayerSLP.Bonferroni
Source
Kall & Mayer, Stochastic Linear Programming (2005), Chapter 4, Proposition 3.1, p.286 (PDF 295)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.