AFTD Auto-Formalizing Theoretical Domains

efx_intact_obstruction_charity_strict

theoremverified

Each agent strictly prefers her assigned bundle in the explicit six-good partial allocation to the unallocated seventh good.

Statement

theorem efx_intact_obstruction_charity_strict : ∀ i : Fin 4, (efx_intact_obstruction_values i 6 : ℝ) <
    additive_valuation (fun g : Fin 6 => (efx_intact_obstruction_values i g.castSucc : ℝ))
      (bundle_of ![(1 : Fin 4),1,2,2,3,0] i)
Source
Helper for efx_four_agents_additive_exists (OP-7), campaign session IN-404, 2026-11-01. Explicit route obstruction found in experiment 10980; it does not refute EFX existence and carries no research-level advance claim.
Verified
01 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3
  • efx_intact_obstruction_valuesThe explicit strictly positive four-agent seven-good valuation matrix used to test completion by keeping old bundles intact: rows…
  • bundle_ofUnder an allocation that gives each item x to agent s(x), agent i's bundle is the set of items given to i.
  • additive_valuationThe additive valuation with item values u: a bundle is worth the sum of its items' values.

The proof, explained

The theorem states that under an explicit partial allocation of six goods to four agents, every agent strictly prefers her assigned bundle to the unallocated seventh good (good 6). The proof introduces an arbitrary agent, unfolds the additive valuation into a sum over the bundle, and completes the proof by using `decide +kernel` to verify the strict inequality for all four agents by finite evaluation, casting the result from $\\mathbb{N}$ to $\\mathbb{R}$.

  1. Fix an arbitrary agent $i$.

    We introduce an arbitrary agent $i \\in \\{0, 1, 2, 3\\}$ to prove the universal claim.

    line 6

      intro i
  2. The bundle valuation expands to the explicit sum of the valuations of its goods.

    Definitional simplification of `additive_valuation` rewrites the valuation of agent $i$'s assigned bundle into the sum $\\sum_{g \\in B_i} v_i(g)$, where $B_i$ is the bundle assigned to $i$ by the allocation vector $\\sigma = (1, 1, 2, 2, 3, 0)$.

    line 7

      dsimp [additive_valuation]
  3. Agent $i$'s valuation of good 6 is strictly less than her valuation of her assigned bundle. automation

    The universal claim over natural numbers that every agent $j \\in \\{0, 1, 2, 3\\}$ strictly prefers her assigned bundle to good 6 is proved by exhaustive kernel computation (`decide +kernel`). Specializing this fact to agent $i$ and casting the inequality from $\\mathbb{N}$ to $\\mathbb{R}$ via `exact_mod_cast` closes the goal.

    lines 8–11

      exact_mod_cast (show efx_intact_obstruction_values i 6 <
        ∑ g ∈ bundle_of ![(1 : Fin 4),1,2,2,3,0] i, efx_intact_obstruction_values i g.castSucc from
        (by decide +kernel : ∀ j : Fin 4, efx_intact_obstruction_values j 6 <
          ∑ g ∈ bundle_of ![(1 : Fin 4),1,2,2,3,0] j, efx_intact_obstruction_values j g.castSucc) i)

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

open Function Finsettheorem efx_intact_obstruction_charity_strict : ∀ i : Fin 4, (efx_intact_obstruction_values i 6 : ℝ) <    additive_valuation (fun g : Fin 6 => (efx_intact_obstruction_values i g.castSucc : ℝ))      (bundle_of ![(1 : Fin 4),1,2,2,3,0] i) := by  intro i  dsimp [additive_valuation]  exact_mod_cast (show efx_intact_obstruction_values i 6 <    ∑ g ∈ bundle_of ![(1 : Fin 4),1,2,2,3,0] i, efx_intact_obstruction_values i g.castSucc from    (by decide +kernel : ∀ j : Fin 4, efx_intact_obstruction_values j 6 <      ∑ g ∈ bundle_of ![(1 : Fin 4),1,2,2,3,0] j, efx_intact_obstruction_values j g.castSucc) i)
See it in the graphDiscuss this resultChallenge it