Claim 3.10, p. 12 — the QA pool p* lies in the forecast domain D
ProvedQAPooling.MaxMin.claim_3_10p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1proper-scoring-rulequasi-arithmetic-pooling
Let be a regular proper scoring rule with exposure function , such that is continuous on (as a map into ) for every outcome . Let be forecasts with non-negative weights adding to , and let be a point at which is a subgradient of . Then
that is, is finite for every outcome .
Definition 3.6 only places the QA pool in ; this claim shows the pool never sits at a forecast that some outcome would score , so the agent's profit at in Theorem 4.1 is finite.
Formalization Note The continuity of each is the paper's standing assumption of p. 10, with the topology of footnote 11 (the order topology on the extended reals).
Preamble
import Mathlib import Definitions.Def_QAPooling_MaxMin_Model
Formal statement
namespace QAPooling.MaxMin
/-- Claim 3.10 (p. 12): the QA pool `p*` of forecasts in `D` lies in `D`. -/
theorem claim_3_10 {n m : ℕ} (s : ScoringRule n) (g : (Fin n → ℝ) → Fin n → ℝ)
(hreg : IsRegular s) (hprop : IsProper s)
(hcont : ∀ j, ContinuousOn (fun p => s p j) (stdSimplex ℝ (Fin n)))
(hg : IsExposure s g)
(p : Fin m → Fin n → ℝ) (hp : ∀ i, p i ∈ forecastDomain s)
(w : Fin m → ℝ) (hw0 : ∀ i, 0 ≤ w i) (hw1 : ∑ i, w i = 1)
(pstar : Fin n → ℝ) (hpstar : IsQAPool s g p w pstar) :
pstar ∈ forecastDomain s := by sorry
end QAPooling.MaxMin
Source
Neyman & Roughgarden, From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation, arXiv:2102.07081v2, p. 12, Claim 3.10 (proof p. 13)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.