Proof of Theorem 6 (Appendix L), p. 34 — event k is pivotal with positive probability: strict increase
ProvedForecastComp.IELF.win_prob_transfer_strictforecasting-competitionlottery-mechanismp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
In the setting of the previous statement, assume moreover and for every event and every forecaster . Then
Event is pivotal for 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 for enters: with values strictly below , 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.