Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 7 (Appendix M), p. 36 — I-ELF selects i with probability ≥ 1 − 2(n−1)e^{−mΔ²/(2(n−1)²)}

Proved
ForecastComp.IELF.ielf_select_lower_bound

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 RRR take values in [0,1][0,1][0,1] on [0,1][0,1][0,1], let the outcomes be independent with marginals θ∈[0,1]m\theta\in[0,1]^mθ∈[0,1]m, and let all reports lie in [0,1][0,1][0,1]. If forecaster iii's expected score exceeds every other forecaster's by at least Δ>0\Delta>0Δ>0, i.e. R(yi,θ)−R(yj,θ)≥ΔR(y_i,\theta)-R(y_j,\theta)\ge\DeltaR(yi​,θ)−R(yj​,θ)≥Δ for all j≠ij\ne ij=i, then

Pr⁡X∼θ(MI-ELFR(y1,…,yn,X)=i)≥1−2(n−1) e−mΔ22(n−1)2.\Pr_{X\sim\theta}\big(M_{\text{I-ELF}^R}(y_1,\dots,y_n,X)=i\big)\ge1-2(n-1)\,e^{-\frac{m\Delta^2}{2(n-1)^2}}.X∼θPr​(MI-ELFR​(y1​,…,yn​,X)=i)≥1−2(n−1)e−2(n−1)2mΔ2​.

In particular, the probability is at least π∈[0,1)\pi\in[0,1)π∈[0,1) once m≥2(n−1)2Δ2ln⁡2(n−1)1−πm\ge\frac{2(n-1)^2}{\Delta^2}\ln\frac{2(n-1)}{1-\pi}m≥Δ22(n−1)2​ln1−π2(n−1)​, which yields limit accuracy.

Formalization Note The paper writes MELFRM_{\text{ELF}^R}MELFR​ in this display; the mechanism meant (and formalized) is I-ELF.

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

/-- Proof of Theorem 7 (Appendix M), p. 36: if forecaster `i`'s expected score exceeds every
other forecaster's by at least `Δ > 0`, then under independent outcomes I-ELF selects `i` with
probability at least `1 − 2(n−1) e^{−mΔ²/(2(n−1)²)}`. -/
theorem ielf_select_lower_bound {m n : ℕ} (hn : 2 ≤ n) (R : ℝ → Bool → ℝ)
    (hbdd : IsUnitBounded R)
    (θ : Fin m → ℝ) (hθ : ∀ k, θ k ∈ Set.Icc (0:ℝ) 1)
    (y : Fin n → Fin m → ℝ) (hy : ∀ j k, y j k ∈ Set.Icc (0:ℝ) 1)
    (i : Fin n) (Δ : ℝ) (hΔ : 0 < Δ)
    (hgap : ∀ j, j ≠ i → Δ ≤ avgScore R θ (y i) - avgScore R θ (y j)) :
    1 - 2 * ((n:ℝ) - 1) * Real.exp (-((m:ℝ) * Δ ^ 2) / (2 * ((n:ℝ) - 1) ^ 2)) ≤
      ielfSelProbIndep R θ y i := by sorry

end ForecastComp.IELF
Source
Witkowski et al., arXiv:2101.01816v2, p. 36, proof of Theorem 7 (Appendix M), final display
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