efx_pair_binary_no_one_split_two_nat
For the explicit binary nine-good matrix, every one-split allocation allowing only the old pair indexed 2 to split fails a natural-number total-value EFX inequality.
Statement
theorem efx_pair_binary_no_one_split_two_nat : ∀ (a b c d e f : Fin 4), ¬ (∀ i j : Fin 4, i ≠ j → ∀ g : Fin 9, efx_pair_binary_one_split 2 a b c d e f g = j → (∑ h : Fin 9, if efx_pair_binary_one_split 2 a b c d e f h = j then efx_pair_binary_values i h else 0) ≤ (∑ h : Fin 9, if efx_pair_binary_one_split 2 a b c d e f h = i then efx_pair_binary_values i h else 0) + efx_pair_binary_values i g)
- Source
- Structural helper for efx_four_agents_additive_exists (OP-7), campaign IN-404, 2026-11-01. Exact route obstruction from experiment 10993, not a counterexample to EFX existence; no novelty claim.
- Verified
- 01 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- efx_pair_binary_valuesA positive four-agent nine-good valuation matrix: the first two rows are (2,1,2,1,2,1,2,1,2), and the last two rows are (1,2,1,2,1,2,1,2,2).
- efx_pair_binary_one_splitAssign the four old adjacent pairs among goods 0 through 7 and the new good 8 to arbitrary agents, except the pair indexed r may have its…
- Used by 1
- efx_pair_binary_no_one_split_natFor the explicit binary nine-good matrix, every allocation encoded by the one-split construction fails a natural-number total-value EFX…
The proof, explained
The theorem states that in the given four-agent, nine-good fair division setting, no allocation in which only pair 2 (goods 4 and 5) is split can satisfy the EFX condition. The proof introduces the agent $a \in \{0, 1, 2, 3\}$ who receives the first pair, splitting the problem into four subcases. For each case, the remaining search space of $4^5 = 1024$ allocations is verified exhaustively by the Lean kernel using computational reduction (`decide +kernel`).
Fix the agent $a \in \mathrm{Fin}\; 4$ who receives the first pair of goods (goods 0 and 1).
Introducing the variable $a$ reduces the universal claim over all six allocation parameters to showing that for any fixed choice of $a$, no choice of $(b, c, d, e, f)$ yields an allocation satisfying the EFX condition.
intro aFor each of the four possible values of $a$, exhaustive evaluation shows that none of the remaining $4^5 = 1024$ allocations satisfy the EFX inequalities. automation
The tactic `fin_cases a` splits the goal into four subgoals corresponding to $a = 0, 1, 2, 3$. In each branch, the goal is a decidable universal statement over $b, c, d, e, f \in \mathrm{Fin}\; 4$ asserting the failure of the EFX condition, which itself is a finite conjunction of comparisons between natural-number sums over the 4 agents and 9 goods. The `decide +kernel` tactic discharges all four cases by finite computational reduction directly within the Lean kernel.
fin_cases a <;> decide +kernel
- The proof relies on Lean's kernel reduction (`decide +kernel`) to exhaustively verify all $4^6 = 4096$ possible allocations. On paper, this corresponds to an exhaustive finite case check or computer-assisted search rather than a symbolic pencil-and-paper argument.
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.
open Function Finsettheorem efx_pair_binary_no_one_split_two_nat : ∀ (a b c d e f : Fin 4), ¬ (∀ i j : Fin 4, i ≠ j → ∀ g : Fin 9, efx_pair_binary_one_split 2 a b c d e f g = j → (∑ h : Fin 9, if efx_pair_binary_one_split 2 a b c d e f h = j then efx_pair_binary_values i h else 0) ≤ (∑ h : Fin 9, if efx_pair_binary_one_split 2 a b c d e f h = i then efx_pair_binary_values i h else 0) + efx_pair_binary_values i g) := by intro a fin_cases a <;> decide +kernel