AFTD Auto-Formalizing Theoretical Domains

efx_no_self_three_split_no_self_champion

theoremverified

No owner self-champions even under inclusion-minimality: every subset of her old triple plus charity that she prefers is strongly envied by some agent.

Statement

theorem efx_no_self_three_split_no_self_champion (i : Fin 4) (T : Finset (Fin 13))
  (hT : T ⊆ insert 12 (efx_no_self_three_split_old i))
  (hprefer : efx_no_self_three_split_baseline i < efx_no_self_three_split_value i T) :
  ∃ (j : Fin 4) (g : Fin 13), g ∈ T ∧
    efx_no_self_three_split_baseline j < efx_no_self_three_split_value j (T.erase g)
Source
Positive equal-triple no-self-champion obstruction to the OP-7 two-bundle exchange route, experiments 11462–11471.
Verified
01 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 5

The proof, explained

The theorem asserts that no agent can self-champion: any sub-bundle of their original three items plus the charity item that they strictly prefer to their baseline allocation causes some agent to strictly prefer the sub-bundle even after the removal of one item. Because there are only 4 agents and 4 available items per agent, the claim reduces to checking 64 finite cases. The proof universalizes the statement and discharges it by exhaustive computation via `decide`.

  1. Every preferred sub-bundle of an agent's initial goods plus charity is strongly envied by some agent upon removing an item. automation

    Reverting the agent $i$, candidate bundle $T$, and the hypotheses converts the goal into a closed universal statement over finite domains. With 4 agents and each candidate bundle drawn from a 4-item set (the agent's 3 initial items plus item 12), there are only $4 \times 2^4 = 64$ agent-subset pairs in total. The `decide` tactic verifies all cases by exhaustive finite computation.

    lines 6–7

      revert i T
      decide

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

theorem efx_no_self_three_split_no_self_champion (i : Fin 4) (T : Finset (Fin 13))  (hT : T ⊆ insert 12 (efx_no_self_three_split_old i))  (hprefer : efx_no_self_three_split_baseline i < efx_no_self_three_split_value i T) :  ∃ (j : Fin 4) (g : Fin 13), g ∈ T ∧    efx_no_self_three_split_baseline j < efx_no_self_three_split_value j (T.erase g) := by  revert i T  decide
See it in the graphDiscuss this resultChallenge it