AFTD Auto-Formalizing Theoretical Domains

tfx_round3_2

lemmaverified

Round 3 of the counterexample after rounds 1–2 allocations 1, 1, 0 and 0, 0, 1: every allocation of the third round violates α-EFX.

Statement

open Finset in
lemma tfx_round3_2 (α x : ℝ) (hα0 : 0 < α) (hx0 : 0 < x) (h1 : 2 < α * x)
    (h2 : 2 + x < 2 * (α * x)) (h3 : x < 2 * α + α * x)
    (a20 a21 a22 : Fin 2)
    (d2 : tfx_alphaEFXAt α (tfx_val x) (![![1, 1, 0], ![0, 0, 1], ![a20, a21, a22]] : Fin 3 → Fin 3 → Fin 2) 2) : False
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_bvalTemporal fair division under the identical-days setting (arXiv 2607.17224, arXiv 2601.12835): two agents, T rounds, and in every round one…
  • tfx_alphaEFXAtα-EFX of the cumulative allocation after round t: for all agents i ≠ j and every good (copy of type g from round s ≤ t) in j's bundle,…
  • tfx_valThe identical valuation used in the counterexample: good types z, a, b worth 0, 1, x.
Used by 1
  • 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…

Lean source view module on GitHub

open Finset in/-- Round 3 of the counterexample after rounds 1–2 allocations `1, 1, 0` and `0, 0, 1`: every allocation of the third round violates `α`-EFX. -/lemma tfx_round3_2 (α x : ℝ) (hα0 : 0 < α) (hx0 : 0 < x) (h1 : 2 < α * x)    (h2 : 2 + x < 2 * (α * x)) (h3 : x < 2 * α + α * x)    (a20 a21 a22 : Fin 2)    (d2 : tfx_alphaEFXAt α (tfx_val x) (![![1, 1, 0], ![0, 0, 1], ![a20, a21, a22]] : Fin 3 → Fin 3 → Fin 2) 2) : False := by  unfold tfx_alphaEFXAt at d2  simp only [Fin.forall_fin_two, Fin.forall_fin_succ, Fin.forall_fin_one] at d2  fin_cases a20 <;> fin_cases a21 <;> fin_cases a22 <;>  (simp [tfx_bval, tfx_val, Fin.sum_univ_three] at d2 <;> linarith)
See it in the graphDiscuss this resultChallenge it