AFTD Auto-Formalizing Theoretical Domains

fse_leftmost_anonymous

lemmaverified

The leftmost mechanism is anonymous.

Statement

lemma fse_leftmost_anonymous {n : ℕ} [NeZero n] : fse_Anonymous (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_AnonymousAnonymity: permuting the agents' labels does not change the outcome.
  • fse_leftmostThe leftmost mechanism: place the facility at the leftmost reported location.
  • fse_leftmost_leThe leftmost location is at most every agent's location.
  • fse_leftmost_attainedThe leftmost location is attained by some agent.
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

/-- The leftmost mechanism is anonymous. -/lemma fse_leftmost_anonymous {n : ℕ} [NeZero n] : fse_Anonymous (fse_leftmost (n := n)) := by  intro σ x  apply le_antisymm  · obtain ⟨j, hj⟩ := fse_leftmost_attained x    rw [hj]    have := fse_leftmost_le (x ∘ σ) (σ.symm j)    simpa using this  · obtain ⟨j, hj⟩ := fse_leftmost_attained (x ∘ σ)    rw [hj]    exact fse_leftmost_le x (σ j)
See it in the graphDiscuss this resultChallenge it