leximin_lt
def
y is strictly leximin-better than x: the sorted profile of x is lexicographically smaller than that of y.
Statement
def leximin_lt {n : ℕ} (x y : Fin n → ℝ) : Prop
- Defined in
- The Unreasonable Fairness of Maximum Nash Welfare, ACM TEAC 7(3), 2019, Defs. 2.1-2.2 and App. B; formalized by the operator (Claude), 2026-10-03
- Verified
- 03 Oct 2026
- Axioms
- none listed
- Built on 1
- leximin_profileThe leximin profile of a utility vector: its entries sorted in increasing order.
- Used by 2
- is_leximin_ef1An allocation is leximin-optimal among EF1 allocations: it is EF1 and no EF1 allocation is strictly leximin-better.
- lxv_leximin_lt_iffIn the instance, the real leximin comparison is equivalent to the lexicographic comparison of integer profiles.
Lean source view module on GitHub
/-- `y` is strictly leximin-better than `x`: the sorted profile of `x` is lexicographically smaller. -/ def leximin_lt {n : ℕ} (x y : Fin n → ℝ) : Prop := List.Lex (· < ·) (leximin_profile x) (leximin_profile y)