Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 6 (Appendix L), p. 34 — event k is pivotal with positive probability: strict increase

Proved
ForecastComp.IELF.win_prob_transfer_strict

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

forecasting-competitionlottery-mechanismp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

In the setting of the previous statement, assume moreover ε>0\varepsilon>0ε>0 and ql,j>0q_{l,j}>0ql,j​>0 for every event l≠k0l\ne k_0l=k0​ and every forecaster jjj. Then

winProb(q,i)<winProb(q′,i).\mathrm{winProb}(q,i)<\mathrm{winProb}(q',i).winProb(q,i)<winProb(q′,i).

Event k0k_0k0​ is pivotal for iii on some configuration of the other events' winners, and positivity of all other event-winner probabilities gives that configuration positive probability.

Positivity is where the requirement R∈[0,1)R\in[0,1)R∈[0,1) for m≥2m\ge2m≥2 enters: with values strictly below 111, every ELF winning probability is strictly positive (footnote 10 of the paper explains that strictness can fail otherwise).

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

/-- Proof of Theorem 6 (Appendix L), p. 34: if moreover `ε > 0` and every event winner
probability on the other events is strictly positive, the transfer toward `i` strictly increases
`i`'s probability of being selected (event `k₀` is pivotal with positive probability). -/
theorem win_prob_transfer_strict {m n : ℕ} (hn : 2 ≤ n) (q q' : Fin m → Fin n → ℝ)
    (k₀ : Fin m) (i : Fin n) (ε : ℝ) (hε : 0 < ε)
    (hother : ∀ l, l ≠ k₀ → q' l = q l)
    (hi : q' k₀ i = q k₀ i + ε)
    (hj : ∀ j, j ≠ i → q' k₀ j = q k₀ j - ε / ((n:ℝ) - 1))
    (hpos : ∀ l, l ≠ k₀ → ∀ j, 0 < q l j) :
    winProbOf q i < winProbOf q' i := by sorry

end ForecastComp.IELF
Source
Witkowski et al., arXiv:2101.01816v2, p. 34, proof of Theorem 6 (Appendix L), third paragraph
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