lxv_check
def
The finite check over all 4^6 allocations: lxv_opt is EF1, no EF1 allocation has a strictly better leximin profile, and any EF1 allocation not strictly leximin-worse equals lxv_opt.
Statement
def lxv_check : Bool- 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 3
- lxv_ef1Boolean EF1 check for allocations in the instance lxv_values.
- lxv_profileInteger leximin profile (sorted own-bundle values) of an allocation in the instance lxv_values.
- lxv_optThe allocation with bundles {g2,g3}, {g4}, {g1,g5}, {g6}.
- Used by 2
- lxv_check_eq_trueThe finite check lxv_check evaluates to true (kernel computation).
- 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
/-- The finite check run by the kernel, over all `4^6` allocations. -/ def lxv_check : Bool := lxv_ef1 lxv_opt && (List.finRange 4).all fun a0 => (List.finRange 4).all fun a1 => (List.finRange 4).all fun a2 => (List.finRange 4).all fun a3 => (List.finRange 4).all fun a4 => (List.finRange 4).all fun a5 => let τ : Fin 6 → Fin 4 := ![a0, a1, a2, a3, a4, a5] !lxv_ef1 τ || (!decide (List.Lex (· < ·) (lxv_profile lxv_opt) (lxv_profile τ)) && (decide (List.Lex (· < ·) (lxv_profile τ) (lxv_profile lxv_opt)) || (List.finRange 6).all fun g => decide (τ g = lxv_opt g)))