AFTD Auto-Formalizing Theoretical Domains

fse_leftmost_not_dictatorship

lemmaverified

With at least two agents the leftmost mechanism is not a dictatorship.

Statement

lemma fse_leftmost_not_dictatorship {n : ℕ} [NeZero n] (hn : 2 ≤ n) :
    ¬ fse_Dictatorship (fse_leftmost (n := n))
Source
step towards fse_scaling_oblivious_dictatorship / fse_dictatorship_conjecture_false (dictatorship conjecture of Facility Location Games with Scaling Effects (arXiv:2402.18908v3), Conclusion)
Verified
06 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 4
  • fse_InDomainA location profile of n agents lies in the domain [0,1].
  • fse_Dictatorshipf is a dictatorship: some fixed agent always gets her own location.
  • fse_leftmostThe leftmost mechanism: place the facility at the leftmost reported location.
  • fse_leftmost_leThe leftmost location is at most every agent's location.
Used by 2
  • fse_conjecture_false_qdepRefutation in the model with the scaling function as input. The mechanism fse_F (which receives q) is strategyproof and surjective for…
  • fse_dictatorship_conjecture_falseRefutation of the dictatorship conjecture of arXiv 2402.18908 (Section 8). For every number n ≥ 2 of agents there is a scaling function…

Lean source view module on GitHub

/-- With at least two agents the leftmost mechanism is not a dictatorship. -/lemma fse_leftmost_not_dictatorship {n : ℕ} [NeZero n] (hn : 2 ≤ n) :    ¬ fse_Dictatorship (fse_leftmost (n := n)) := by  rintro ⟨i, hi⟩  -- another agent `j ≠ i`  obtain ⟨j, hji⟩ : ∃ j : Fin n, j ≠ i := by    by_cases h : i.val = 0    · refine ⟨⟨1, by omega⟩, ?_⟩      intro hc; rw [← hc] at h; simp at h    · refine ⟨⟨0, by omega⟩, ?_⟩      intro hc; rw [← hc] at h; simp at h  let x : Fin n → ℝ := fun k => if k = i then 1 else 0  have hx : fse_InDomain x := by    intro k; by_cases hk : k = i <;> simp [x, hk]  have h1 := hi x hx  have h2 := fse_leftmost_le x j  simp only [x, if_neg hji, if_pos rfl] at h1 h2  linarith
See it in the graphDiscuss this resultChallenge it