rankings_of_empty
lemmaverified
The empty set has exactly one ranking, the empty list.
Statement
lemma rankings_of_empty : rankings_of ∅ = {[]}- Source
- step towards plackett_luce_geometric_entropy_linear (Preference Elicitation as Average-Case Sorting, AAAI 2021, Sec. 5 conjecture (entropy O(m) for every phi in (0,1)))
- Verified
- 06 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- rankings_ofThe rankings of a finite set S of alternatives: all orderings of S as duplicate-free lists.
- mem_rankings_of_iffA list is a ranking of S iff it has no duplicates and its set of entries is S.
- Used by 2
- plackett_luce_entropy_geometric_leFor geometric weights phi^a with 0 < phi < 1, the Plackett-Luce entropy on any set of n alternatives is at most C(phi) * n with C(phi) =…
- sum_plackett_luce_probWith positive weights, the Plackett-Luce probabilities of the rankings of S sum to 1.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
lemma rankings_of_empty : rankings_of ∅ = {[]} := by ext l rw [mem_rankings_of_iff, Finset.mem_singleton] constructor · rintro ⟨-, h⟩; simpa using h · rintro rfl; simp