Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.1, p. 14 — KKT: g(p*) = Σ wᵢ g(pᵢ) + λ1ₙ + µ with µ ≥ 0 and µⱼ = 0 where p*ⱼ > 0

Proved
QAPooling.MaxMin.kkt_display

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

convex-optimizationkkt-conditionsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quasi-arithmetic-pooling

Let sss be a regular proper scoring rule with exposure function ggg, such that s(⋅ ;j)s(\cdot\,;j)s(⋅;j) is continuous on Δn\Delta^nΔn for every jjj and the expected reward GGG is continuous on Δn\Delta^nΔn. Let p1,…,pm∈Dp_1,\dots,p_m\in\mathcal Dp1​,…,pm​∈D with non-negative weights wiw_iwi​ adding to 111, and let p∗p^*p∗ be their QA pool. Then there are λ∈R\lambda\in\mathbb Rλ∈R and μ∈Rn\mu\in\mathbb R^nμ∈Rn with

g(p∗)=∑i=1mwi g(pi)+λ1n+μ,g(p^*)=\sum_{i=1}^m w_i\,g(p_i)+\lambda\mathbf 1_n+\mu,g(p∗)=i=1∑m​wi​g(pi​)+λ1n​+μ,

such that μj≥0\mu_j\ge 0μj​≥0 for every jjj and μj=0\mu_j=0μj​=0 whenever pj∗>0p^*_j>0pj∗​>0.

These are the Karush–Kuhn–Tucker conditions for minimizing G(x)−⟨x,∑iwig(pi)⟩G(x)-\langle x,\sum_i w_i g(p_i)\rangleG(x)−⟨x,∑i​wi​g(pi​)⟩ over the simplex at its minimizer p∗p^*p∗, valid even when p∗p^*p∗ lies on the boundary of Δn\Delta^nΔn. They are the step of the proof of Theorem 4.1 that ties the pool's own exposure to the experts' exposures.

Formalization Note g(p∗)g(p^*)g(p∗) is meaningful because p∗∈Dp^*\in\mathcal Dp∗∈D (Claim 3.10). The continuity hypotheses are the paper's standing assumptions of p. 10.

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

/-- KKT display in the proof of Theorem 4.1 (p. 14): `g(p*) = Σ_i w_i g(p_i) + λ 1_n + μ` for some
`λ ∈ ℝ` and `μ ∈ ℝⁿ` with `μ_j ≥ 0` and `μ_j = 0` whenever `p*_j > 0`. -/
theorem kkt_display {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)))
    (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 : Fin n → ℝ) (hpstar : IsQAPool s g p w pstar) :
    ∃ (lam : ℝ) (mu : Fin n → ℝ),
      (∀ j, g pstar j = ∑ i, w i * g (p i) j + lam + mu j) ∧
      (∀ j, 0 ≤ mu j) ∧ (∀ j, 0 < pstar j → mu j = 0) := by sorry

end QAPooling.MaxMin
Source
Neyman & Roughgarden, From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation, arXiv:2102.07081v2, p. 14, proof of Theorem 4.1 (KKT display, footnote 14)
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