AFTD Auto-Formalizing Theoretical Domains

leximin_profile

def

The leximin profile of a utility vector: its entries sorted in increasing order.

Statement

noncomputable def leximin_profile {n : ℕ} (x : Fin n → ℝ) : List ℝ
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
Used by 2
  • leximin_lty is strictly leximin-better than x: the sorted profile of x is lexicographically smaller than that of y.
  • 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

/-- The leximin profile of a utility vector: its entries sorted in increasing order. -/
noncomputable def leximin_profile {n : ℕ} (x : Fin n → ℝ) : List ℝ :=
  (List.ofFn x).insertionSort (· ≤ ·)
See it in the graphDiscuss this resultChallenge it