efx_no_self_three_split_no_self_champion
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
- efx_no_self_three_split_valuesThe positive natural-valued matrix with rows (3,23,43,1,38,30,35,1,33,2,47,20,3), (1,25,44,40,9,21,1,41,28,34,1,35,3),…
- efx_no_self_three_split_valueThe natural additive value to i of the goods in S.
- efx_no_self_three_split_oldThe old partial allocation consists of four consecutive triples; good 12 is unallocated.
- efx_no_self_three_split_baselineEach agent’s value of every old triple, and hence her initial utility.
- efx_no_self_three_split_sanityThe matrix is positive; each agent values every old triple equally at her baseline, values every good in her own triple at least as much…
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`.
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.
revert i T decide
- Reverting the variables (line 6) is a Lean-specific formal necessity: it transforms the goal into a closed universally quantified proposition, enabling Lean to synthesize a `Decidable` instance and evaluate it computationally via `decide` (line 7).
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
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
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