Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorems 6 and 7, p. 14 — I-ELF is strictly incentive compatible under belief independence and limit accurate for independent events

Proved
ForecastComp.IELF.ielf_ic_and_limit_accurate

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

forecasting-competitionincentive-compatibilitylimit-accuracyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let n≥2n\ge2n≥2 and let RRR be a strictly proper scoring rule with values in [0,1][0,1][0,1] on reports in [0,1][0,1][0,1], measurable in the report. Then the Independent-Event Lotteries mechanism MI-ELFRM_{\text{I-ELF}^R}MI-ELFR​ — run an ELF lottery (1) on every event, then select the forecaster with the most event wins, breaking ties uniformly at random — has both of the following properties.

  1. Strict incentive compatibility under belief independence (Theorem 6). For every number of events m≥1m\ge1m≥1 such that, if m≥2m\ge2m≥2, R(y,x)<1R(y,x)<1R(y,x)<1 for all y∈[0,1]y\in[0,1]y∈[0,1] and x∈{0,1}x\in\{0,1\}x∈{0,1}: for every forecaster iii, every belief-independent joint law DDD of the outcomes and the others' reports with ED[X]=pi\mathbb E_D[X]=p_iED​[X]=pi​, and every yi′∈[0,1]my_i'\in[0,1]^myi′​∈[0,1]m with yi′≠piy_i'\ne p_iyi′​=pi​,
Pr⁡D(MI-ELFR(Y1,…,pi,…,Yn,X)=i)>Pr⁡D(MI-ELFR(Y1,…,yi′,…,Yn,X)=i).\Pr_{D}\big(M_{\text{I-ELF}^R}(Y_1,\dots,p_i,\dots,Y_n,X)=i\big)>\Pr_{D}\big(M_{\text{I-ELF}^R}(Y_1,\dots,y_i',\dots,Y_n,X)=i\big).DPr​(MI-ELFR​(Y1​,…,pi​,…,Yn​,X)=i)>DPr​(MI-ELFR​(Y1​,…,yi′​,…,Yn​,X)=i).
  1. Limit accuracy for independent events (Theorem 7). For every Δ‾>0\underline\Delta>0Δ​>0 and π∈[0,1)\pi\in[0,1)π∈[0,1) there is m‾\underline mm​ such that for all m≥m‾m\ge\underline mm≥m​, all independent outcome laws with marginals θ∈[0,1]m\theta\in[0,1]^mθ∈[0,1]m, all reports y1,…,yn∈[0,1]my_1,\dots,y_n\in[0,1]^my1​,…,yn​∈[0,1]m and every forecaster iii whose expected score exceeds every other forecaster's by more than Δ‾\underline\DeltaΔ​,
Pr⁡X∼θ(MI-ELFR(y1,…,yn,X)=i)>π.\Pr_{X\sim\theta}\big(M_{\text{I-ELF}^R}(y_1,\dots,y_n,X)=i\big)>\pi.X∼θPr​(MI-ELFR​(y1​,…,yn​,X)=i)>π.

This is the paper's main result: a forecasting competition with a single prize that is both truthful and, as the number of events grows, selects the most accurate forecaster with probability tending to one.

Formalization Note The two theorems are stated as one conjunction. The condition R<1R<1R<1 for m≥2m\ge2m≥2 is part of the mechanism's definition (p. 14, footnote 10). Belief independence is a product of per-event joint laws, and independent outcome laws are given by their marginals.

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

/-- Theorems 6 and 7, p. 14: for a strictly proper scoring rule `R` with values in `[0,1]`
(measurable in the report), I-ELF is strictly incentive compatible under belief independence for
every `m ≥ 1` (when `R < 1` on reports in `[0,1]` for `m ≥ 2`, as the mechanism requires), and it
is limit accurate for independent events. -/
theorem ielf_ic_and_limit_accurate {n : ℕ} (hn : 2 ≤ n) (R : ℝ → Bool → ℝ)
    (hprop : IsStrictlyProper R) (hbdd : IsUnitBounded R)
    (hmeas : ∀ x, Measurable (fun y => R y x)) :
    (∀ m : ℕ, 1 ≤ m → (2 ≤ m → ∀ y ∈ Set.Icc (0:ℝ) 1, ∀ x, R y x < 1) →
        StrictlyICUnderBeliefIndep (ielfSelProb (m := m) (n := n) R)) ∧
    IsLimitAccurateIndep R (fun m θ y i => ielfSelProbIndep (m := m) (n := n) R θ y i) := by sorry

end ForecastComp.IELF
Source
Witkowski et al., arXiv:2101.01816v2, p. 14, Theorems 6–7 (proofs pp. 34–36, Appendices L–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