efx_partial_nat
def
Natural EFX inequalities for a partial allocation whose last owner label denotes unallocated goods.
Statement
def efx_partial_nat {n m : ℕ} (v : Fin n → Fin m → ℕ) (σ : Fin m → Fin (n+1)) : Prop
- Source
- Arbitrary source-bundle padding of the OP-7 Pareto-maximal locked-good obstruction, experiments 11497 and 11498.
- Verified
- 01 Nov 2026
- Axioms
- none listed
- Built on 1
- efx_partial_nat_utilityNatural utility in a partial allocation whose last owner label denotes unallocated goods.
- Used by 4
- efx_pareto_lock_padded_sanityFor every k the padded starting allocation is partial EFX and has the claimed baseline utilities.
- efx_nondeg_cycle_sanityAll values are positive, the old allocation with good 12 unallocated is EFX with the stated baselines, and the only envy edges are 0→3 and…
- efx_three_pair_anchor_sanityThe starting allocation is envy-free with r+2 goods per bundle and one charity good; the lifted complete witness is EFX.
- efx_anchor_lock_start_sanityAll values are positive, the starting allocation is EFX with the specified utilities, and every tested EFX inequality is strict.
Lean source view module on GitHub
def efx_partial_nat {n m : ℕ} (v : Fin n → Fin m → ℕ) (σ : Fin m → Fin (n+1)) : Prop := ∀ i j : Fin n, i ≠ j → ∀ g : Fin m, σ g = j.castSucc → (∑ h : Fin m, if σ h = j.castSucc then v i h else 0) ≤ efx_partial_nat_utility v σ i + v i g