AFTD Auto-Formalizing Theoretical Domains

efx_three_bonus_distinct_feasible_nat

def

A seven-good allocation gives the four old goods to distinct agents and the three bonuses to distinct agents, gives each agent natural utility at least 38, and satisfies all natural EFX inequalities.

Statement

def efx_three_bonus_distinct_feasible_nat (σ : Fin 7 → Fin 4) : Prop
Source
Finite obstruction to the distinct-recipient exchange route for OP-7, experiments 11403, 11405 and 11406.
Verified
01 Nov 2026
Axioms
none listed
Built on 1
  • efx_three_bonus_distinct_valuesThe natural-valued four-agent, seven-good matrix whose rows are (38,36,58,56,1,1,17), (18,38,54,36,1,1,17), (18,38,38,36,17,1,1), and…
Used by 6

Lean source view module on GitHub

def efx_three_bonus_distinct_feasible_nat (σ : Fin 7 → Fin 4) : Prop := (∀ (a b : Fin 4), a ≠ b → σ (Fin.castAdd 3 a) ≠ σ (Fin.castAdd 3 b)) ∧
(∀ (a b : Fin 3), a ≠ b → σ (Fin.natAdd 4 a) ≠ σ (Fin.natAdd 4 b)) ∧
(∀ i : Fin 4, 38 ≤ ∑ g : Fin 7, if σ g = i then efx_three_bonus_distinct_values i g else 0) ∧
(∀ i j : Fin 4, i ≠ j → ∀ g : Fin 7, σ g = j →
  (∑ h : Fin 7, if σ h = j then efx_three_bonus_distinct_values i h else 0) ≤
  (∑ h : Fin 7, if σ h = i then efx_three_bonus_distinct_values i h else 0) + efx_three_bonus_distinct_values i g)
See it in the graphDiscuss this resultChallenge it