tfx_no_alphaTEFX
theoremverified
For the explicit instance with values 0, 1, x and three identical rounds, no allocation is α-TEFX whenever α x > 2, 2αx > x + 2 and α(x + 2) > x.
Statement
theorem tfx_no_alphaTEFX (α x : ℝ) (hα0 : 0 < α) (hx0 : 0 < x) (h1 : 2 < α * x)
(h2 : 2 + x < 2 * (α * x)) (h3 : x < 2 * α + α * x) (σ : Fin 3 → Fin 3 → Fin 2) :
¬ tfx_alphaTEFX α (tfx_val x) σ- Source
- step towards tfx_identical_days_upper_bound (approximation ratio of TEFX on identical days, open in arXiv:2607.17224, Sec. 7)
- Verified
- 06 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- tfx_alphaTEFXα-TEFX: the cumulative allocation is α-EFX after every round.
- tfx_valThe identical valuation used in the counterexample: good types z, a, b worth 0, 1, x.
- tfx_coreCore case analysis: with three rounds of the goods {z, a, b} (values 0, 1, x), no allocation (given by its nine entries) is α-TEFX as soon…
- Used by 1
- tfx_identical_days_upper_boundIdentical days, two agents: no α-TEFX guarantee beyond 1/√2. For every α > √2/2 there is an identical-days instance with two agents having…
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.
/-- For the explicit instance with values `0, 1, x` and three identical rounds, no allocation is `α`-TEFX whenever `α x > 2`, `2αx > x + 2` and `α(x + 2) > x`. -/theorem tfx_no_alphaTEFX (α x : ℝ) (hα0 : 0 < α) (hx0 : 0 < x) (h1 : 2 < α * x) (h2 : 2 + x < 2 * (α * x)) (h3 : x < 2 * α + α * x) (σ : Fin 3 → Fin 3 → Fin 2) : ¬ tfx_alphaTEFX α (tfx_val x) σ := by intro h have hσ : σ = ![![σ 0 0, σ 0 1, σ 0 2], ![σ 1 0, σ 1 1, σ 1 2], ![σ 2 0, σ 2 1, σ 2 2]] := by funext s g fin_cases s <;> fin_cases g <;> rfl rw [hσ] at h exact tfx_core α x hα0 hx0 h1 h2 h3 _ _ _ _ _ _ _ _ _ h