Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1 — a prize allocation rule satisfies order preservation, endowment monotonicity and consistency iff it is an interval rule

Proved
PrizeAlloc.Interval.theorem_1

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

axiomatic-characterizationconsistencyfair-allocationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1prize-allocation

Let UUU be a countable set of at least three potential competitors and φ\varphiφ a prize allocation rule on the competitions over UUU. Then

φ satisfies order preservation, endowment monotonicity and consistency  ⟺  φ is an interval rule.\varphi \text{ satisfies order preservation, endowment monotonicity and consistency} \iff \varphi \text{ is an interval rule.}φ satisfies order preservation, endowment monotonicity and consistency⟺φ is an interval rule.

The theorem describes every rule that rewards rank weakly, never takes prize money away when the endowment grows, and allocates coherently across subgroups: there are disjoint intervals (ak,bk)(a_k, b_k)(ak​,bk​) on which prizes are raised from aka_kak​ to bkb_kbk​ one competitor at a time from the top, and equal division elsewhere. Equal Division, Winner-Takes-All and the rule of Example 1 are special cases; Corollaries 1–4 single out ED, WTA and the Winner-Takes-Surplus rules inside this family.

Formalization Note The standing assumption that UUU is countable with at least three elements (p. 8) is carried as [Countable U] and three distinct elements. Competitions range over all nonempty finite rankings of elements of UUU and all endowments E≥0E \ge 0E≥0; anonymity is not assumed (Lemma 2 derives it). Interval rules allow bk=+∞b_k = +\inftybk​=+∞ (extended reals).

Preamble
import Mathlib
import Definitions.Def_PrizeAlloc_Interval_Setting
Formal statement
namespace PrizeAlloc.Interval

theorem theorem_1 {U : Type*} [DecidableEq U] [Countable U]
    (hU : ∃ a b c : U, a ≠ b ∧ a ≠ c ∧ b ≠ c)
    (φ : List U → ℝ → U → ℝ) (hφ : IsPrizeRule φ) :
    (OrderPreserving φ ∧ EndowmentMonotone φ ∧ Consistent φ) ↔ IsIntervalRule φ := by sorry

end PrizeAlloc.Interval
Source
Dietzenbacher and Kondratev, Fair and Consistent Prize Allocation in Competitions, arXiv:2008.08985v2, p. 13, Theorem 1 (proof pp. 27–30)
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

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