Theorem 1 — a prize allocation rule satisfies order preservation, endowment monotonicity and consistency iff it is an interval rule
ProvedPrizeAlloc.Interval.theorem_1Let be a countable set of at least three potential competitors and a prize allocation rule on the competitions over . Then
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 on which prizes are raised from to 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 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 and all endowments ; anonymity is not assumed (Lemma 2 derives it). Interval rules allow (extended reals).
import Mathlib import Definitions.Def_PrizeAlloc_Interval_Setting
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.