AFTD Auto-Formalizing Theoretical Domains

lxv_profile

def

Integer leximin profile (sorted own-bundle values) of an allocation in the instance lxv_values.

Statement

def lxv_profile (a : Fin 6 → Fin 4) : List ℕ
Source
step towards leximin_ef1_not_pareto_optimal (conjecture of The Unreasonable Fairness of Maximum Nash Welfare, ACM TEAC 7(3), 2019, App. B)
Verified
06 Oct 2026
Axioms
none listed
Built on 1
  • lxv_valAgent i's integer value for agent j's bundle under an allocation, in the instance lxv_values.
Used by 3
  • lxv_leximin_lt_iffIn the instance, the real leximin comparison is equivalent to the lexicographic comparison of integer profiles.
  • lxv_checkThe finite check over all 4^6 allocations: lxv_opt is EF1, no EF1 allocation has a strictly better leximin profile, and any EF1 allocation…
  • lxv_check_specUnpacked finite check: lxv_opt is EF1, no EF1 allocation is strictly leximin-better, and every EF1 allocation not strictly leximin-worse…

Lean source view module on GitHub

/-- Integer leximin profile for the instance `lxv_values`. -/
def lxv_profile (a : Fin 6 → Fin 4) : List ℕ :=
  (List.ofFn fun i => lxv_val a i i).insertionSort (· ≤ ·)
See it in the graphDiscuss this resultChallenge it