Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (9), p. 35 — expected event wins differ by m(R(y_i,θ) − R(y_j,θ))/(n−1)

Proved
ForecastComp.IELF.eq_9

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

forecasting-competitionlimit-accuracyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let n≥2n\ge2n≥2, let the outcomes of mmm events be independent with Pr⁡(Xk=1)=θk∈[0,1]\Pr(X_k=1)=\theta_k\in[0,1]Pr(Xk​=1)=θk​∈[0,1], and let ZiZ_iZi​ be the number of event lotteries of I-ELF won by forecaster iii. For any reports yyy and any two forecasters i≠ji\ne ji=j,

EX∼θ[Zi]−EX∼θ[Zj]=m(R(yi,θ)−R(yj,θ))n−1,\mathbb E_{X\sim\theta}[Z_i]-\mathbb E_{X\sim\theta}[Z_j]=\frac{m\big(R(y_i,\theta)-R(y_j,\theta)\big)}{n-1},EX∼θ​[Zi​]−EX∼θ​[Zj​]=n−1m(R(yi​,θ)−R(yj​,θ))​,

and consequently, whenever R(yi,θ)−R(yj,θ)≥ΔR(y_i,\theta)-R(y_j,\theta)\ge\DeltaR(yi​,θ)−R(yj​,θ)≥Δ,

EX∼θ[Zi]−EX∼θ[Zj]≥mΔn−1.\mathbb E_{X\sim\theta}[Z_i]-\mathbb E_{X\sim\theta}[Z_j]\ge\frac{m\Delta}{n-1}.EX∼θ​[Zi​]−EX∼θ​[Zj​]≥n−1mΔ​.

The more accurate forecaster wins more event lotteries in expectation, by an amount growing linearly in mmm.

Formalization Note The identity holds for every real-valued RRR and all real reports (it only uses that each ELF lottery sums to one); no bound on RRR is assumed.

Preamble
import Mathlib
import Definitions.Def_ForecastComp_IELF_Model
Formal statement
namespace ForecastComp.IELF

/-- Eq. (9), p. 35: under independent outcomes with marginals `θ`, the expected numbers of event
wins of forecasters `i` and `j` differ by `m (R(y_i,θ) − R(y_j,θ))/(n−1)`; in particular the
difference is at least `mΔ/(n−1)` when `R(y_i,θ) − R(y_j,θ) ≥ Δ`. -/
theorem eq_9 {m n : ℕ} (hn : 2 ≤ n) (R : ℝ → Bool → ℝ)
    (θ : Fin m → ℝ) (hθ : ∀ k, θ k ∈ Set.Icc (0:ℝ) 1)
    (y : Fin n → Fin m → ℝ) (i j : Fin n) (hij : i ≠ j) :
    expWins R θ y i - expWins R θ y j =
        (m:ℝ) * (avgScore R θ (y i) - avgScore R θ (y j)) / ((n:ℝ) - 1) ∧
    ∀ Δ : ℝ, Δ ≤ avgScore R θ (y i) - avgScore R θ (y j) →
      (m:ℝ) * Δ / ((n:ℝ) - 1) ≤ expWins R θ y i - expWins R θ y j := by sorry

end ForecastComp.IELF
Source
Witkowski et al., arXiv:2101.01816v2, p. 35, eq. (9), proof of Theorem 7 (Appendix M)
Human review
  • Endorsed by Shuze Chen · Oct 23, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 23, 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