AFTD Auto-Formalizing Theoretical Domains

rankings_of

def

The rankings of a finite set S of alternatives: all orderings of S as duplicate-free lists.

Statement

noncomputable def rankings_of (S : Finset ℕ) : Finset (List ℕ)
Defined in
Preference Elicitation as Average-Case Sorting, AAAI 2021, Sec. 5 (Plackett-Luce model D_w and its entropy H(D_w)); formalized by the operator (Claude), 2026-10-03
Verified
03 Oct 2026
Axioms
none listed
Used by 9
  • rankings_of_emptyThe empty set has exactly one ranking, the empty list.
  • plackett_luce_surprisal_measureFor weights w : ℕ → ℝ and number of items n : ℕ, the pushforward measure on ℝ of the standardized surprisal (-log P(l) - H) / sqrt(n)…
  • mem_rankings_of_iffA list is a ranking of S iff it has no duplicates and its set of entries is S.
  • rankings_of_eq_biUnionFor nonempty S, the rankings of S are obtained by choosing a top alternative a in S and then a ranking of S minus a.
  • sum_rankings_of_nonemptyFor nonempty S, a sum over rankings of S splits as a sum over the top alternative a and the rankings of S minus a.
  • sum_plackett_luce_probWith positive weights, the Plackett-Luce probabilities of the rankings of S sum to 1.
  • plackett_luce_prob_consIf a is in S and t ranks S minus a, the Plackett-Luce probability of a followed by t is w(a)/w(S) times that of t.
  • map_sum_of_mem_rankings_ofThe total weight of the entries of a ranking of S is the total weight of S.
  • plackett_luce_entropyShannon entropy (natural logarithm) of the Plackett-Luce distribution over the rankings of S.

Lean source view module on GitHub

/-- The rankings of a finite set `S` of alternatives: all orderings of `S` as lists. -/
noncomputable def rankings_of (S : Finset ℕ) : Finset (List ℕ) :=
  S.toList.permutations.toFinset
See it in the graphDiscuss this resultChallenge it