AFTD Auto-Formalizing Theoretical Domains

efx_intact_obstruction_positive

theoremverified

Every entry of the explicit four-agent seven-good valuation matrix is strictly positive after casting to the reals.

Statement

theorem efx_intact_obstruction_positive : ∀ (i : Fin 4) (g : Fin 7), 0 < (efx_intact_obstruction_values i g : ℝ)
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 1
  • efx_intact_obstruction_valuesThe explicit strictly positive four-agent seven-good valuation matrix used to test completion by keeping old bundles intact: rows…

The proof, explained

To show that every entry of the $4 \times 7$ valuation matrix is strictly positive when cast to $\mathbb{R}$, we fix an arbitrary agent and good. Lean's kernel verifies by exhaustive finite computation that all 28 entries of the matrix are strictly positive natural numbers. The resulting inequality for the given agent and good is then cast from $\mathbb{N}$ to $\mathbb{R}$.

  1. Fix an arbitrary agent $i$ and good $g$.

    We introduce the universally quantified agent $i : \mathrm{Fin}\; 4$ and good $g : \mathrm{Fin}\; 7$ into the context. The remaining goal is to show that the matrix entry for this pair is strictly positive in $\mathbb{R}$.

    line 4

      intro i g
  2. The valuation entry $0 < (\mathrm{efx\_intact\_obstruction\_values}(i, g) : \mathbb{R})$ is strictly positive. automation

    Lean's kernel evaluates all $4 \times 7 = 28$ entries of the matrix via `decide +kernel`, establishing that $\mathrm{efx\_intact\_obstruction\_values}(j, h) > 0$ for every agent $j$ and good $h$ in $\mathbb{N}$. Specializing this universal statement to $i$ and $g$ yields $0 < \mathrm{efx\_intact\_obstruction\_values}(i, g)$ in $\mathbb{N}$, and `exact_mod_cast` casts this strict inequality from $\mathbb{N}$ to $\mathbb{R}$ to close the goal.

    lines 5–6

      exact_mod_cast (show 0 < efx_intact_obstruction_values i g from (by decide +kernel :
        ∀ (j : Fin 4) (h : Fin 7), 0 < efx_intact_obstruction_values j h) i g)

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_positive : ∀ (i : Fin 4) (g : Fin 7), 0 < (efx_intact_obstruction_values i g : ℝ) := by  intro i g  exact_mod_cast (show 0 < efx_intact_obstruction_values i g from (by decide +kernel :    ∀ (j : Fin 4) (h : Fin 7), 0 < efx_intact_obstruction_values j h) i g)
See it in the graphDiscuss this resultChallenge it