Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.2, p. 12 — the QA pool is well-defined: exactly one p* ∈ Δⁿ has Σᵢ wᵢ g(pᵢ) as a subgradient of G

Proved
QAPooling.MaxMin.qaPool_existsUnique

by mikedeng1 · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1proper-scoring-rulequasi-arithmetic-pooling

Let sss be a regular proper scoring rule whose expected reward GGG is continuous on Δn\Delta^nΔn, and let ggg be an exposure function of sss. Let p1,…,pm∈Dp_1,\dots,p_m\in\mathcal Dp1​,…,pm​∈D be forecasts with non-negative weights w1,…,wmw_1,\dots,w_mw1​,…,wm​ adding to 111. Then there is exactly one p∗∈Δnp^*\in\Delta^np∗∈Δn such that

G(y) ≥ G(p∗)+⟨∑i=1mwig(pi), y−p∗⟩for all y∈Δn,G(y)\ \ge\ G(p^*)+\Big\langle \sum_{i=1}^m w_i g(p_i),\ y-p^*\Big\rangle\qquad\text{for all }y\in\Delta^n,G(y) ≥ G(p∗)+⟨i=1∑m​wi​g(pi​), y−p∗⟩for all y∈Δn,

i.e. exactly one quasi-arithmetic pool p∗=⨁gi=1..m(pi,wi)p^*=\bigoplus_{\mathbf g}^{i=1..m}(p_i,w_i)p∗=⨁gi=1..m​(pi​,wi​).

This is the well-definedness claim following Definition 3.6: it turns "the unique p∗p^*p∗" of the definition into a theorem, and it is what makes the QA-pool hypothesis of Theorem 4.1 satisfiable.

Formalization Note Continuity of GGG is the paper's standing assumption of p. 10. Subgradients are relative to Δn\Delta^nΔn (footnote 10).

Preamble
import Mathlib
import Definitions.Def_QAPooling_MaxMin_Model
Formal statement
namespace QAPooling.MaxMin

/-- The QA pool is well-defined (§3.2, p. 12): for forecasts in `D` with non-negative weights adding
to 1, there is exactly one `p* ∈ Δⁿ` at which `Σ_i w_i g(p_i)` is a subgradient of `G`. -/
theorem qaPool_existsUnique {n m : ℕ} (s : ScoringRule n) (g : (Fin n → ℝ) → Fin n → ℝ)
    (hreg : IsRegular s) (hprop : IsProper s)
    (hGcont : ContinuousOn (expectedReward s) (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, IsQAPool s g p w pstar := by sorry

end QAPooling.MaxMin
Source
Neyman & Roughgarden, From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation, arXiv:2102.07081v2, p. 12, §3.2, paragraph after Remark 3.7 ('The QA-pool is well-defined, i.e. exists and is unique'), Definition 3.6
Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 22, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me