Lemma 3 —
ProvedForecastAggLearn.lemma_3forecast-aggregationonline-learningp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1probability
Let be a probability space carrying a state and, for each expert , an information -algebra and a forecast that is -measurable and a version of , i.e. for every . This is an arbitrary information structure (not necessarily a partial evidence one): in the paper , is generated by and . For let
be the events that some expert's forecast is extreme low, resp. extreme high.
Lemma 3. For every ,
i.e. . It is the mirror image of Lemma 2 for an extreme high forecast.
Differences from the source:
- generalization: information structure I ∈ Δ(Ω × S_1 × … × S_n) with F_i = I(ω = 1, s_i)/(I(ω = 1, s_i) + I(ω = 0, s_i)) → any probability space with forecasts F_i that are 𝓖_i-measurable versions of P(ω = 1 | 𝓖_i) for sub-σ-algebras 𝓖_i; reason: the paper's structure is the case 𝓖_i = σ(s_i)
- reading: ζ_1(α): "at least one expert's forecast is in [1, 1 − α]" → ∃ i, F_i ≥ 1 − α; reason: [1, 1 − α] is empty for α > 0; [1 − α, 1] is the only nonempty reading and the one used on pp.20–21
- encoding: I(ω = 0 | ζ_1(α)) ≤ nα, with α > 0 from Lemma 2 → ν({ω = 0} ∩ ζ_1(α)) ≤ nα · ν(ζ_1(α)) for α > 0; reason: product form of the conditional probability; Lemma 3 is stated as the analogue of Lemma 2 and inherits its quantifier
Preamble
import Mathlib
Formal statement
namespace ForecastAggLearn
open MeasureTheory
/-- **Lemma 3: an extreme high forecast caps the probability of ω = 0.**
Babichenko, Garber, arXiv:1802.07107v1, Lemma 3, p.20: with `ζ_1(α)` the event "where at least
one expert's forecast is in [1, 1 − α]", "I(ω = 0 | ζ_1(α)) ≤ nα."
**Formalization Note.** "[1, 1 − α]" is read as `[1 − α, 1]`, the only nonempty reading and the
one used on pp.20–21. The setting is that of `lemma_2`: a probability space with the state `ω`
and each forecast `F i` a `𝓖 i`-measurable version of `P(ω = 1 | 𝓖 i)`. The conditional
probability is stated in product form `ν({ω = 0} ∩ ζ_1) ≤ nα · ν(ζ_1)`; the paper's
"for every α > 0" (Lemma 2) is kept. -/
theorem lemma_3 {X : Type*} [mX : MeasurableSpace X] (ν : Measure X) [IsProbabilityMeasure ν]
(ω : X → Bool) (hω : Measurable ω) {n : ℕ} (𝓖 : Fin n → MeasurableSpace X)
(h𝓖 : ∀ i, 𝓖 i ≤ mX) (F : Fin n → X → ℝ) (hFm : ∀ i, Measurable[𝓖 i] (F i))
(hF : ∀ i, ∀ E, MeasurableSet[𝓖 i] E →
ν ({x | ω x = true} ∩ E) = ∫⁻ x in E, ENNReal.ofReal (F i x) ∂ν)
(α : ℝ) (hα : 0 < α) :
ν ({x | ω x = false} ∩ {x | ∃ i, 1 - α ≤ F i x}) ≤
ENNReal.ofReal (n * α) * ν {x | ∃ i, 1 - α ≤ F i x} := by sorry
end ForecastAggLearn
Source
Babichenko, Garber, Learning of Optimal Forecast Aggregation in Partial Evidence Environments, arXiv:1802.07107v1, Lemma 3, p.20
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.