AFTD Auto-Formalizing Theoretical Domains

fse_leftmost_mapsTo

lemmaverified

The leftmost mechanism maps [0,1]^n into [0,1].

Statement

lemma fse_leftmost_mapsTo {n : ℕ} [NeZero n] : fse_MapsToDomain (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 3
  • fse_MapsToDomainA deterministic mechanism maps every profile in [0,1]^n to a facility location in [0,1].
  • fse_leftmostThe leftmost mechanism: place the facility at the leftmost reported location.
  • fse_leftmost_attainedThe leftmost location is attained by some agent.
Used by 3
  • fse_leftmost_SP_of_antitoneKey lemma: for every scaling function that is non-negative and non-increasing on [0,1], the leftmost mechanism is strategyproof.
  • 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 maps `[0,1]^n` into `[0,1]`. -/lemma fse_leftmost_mapsTo {n : ℕ} [NeZero n] : fse_MapsToDomain (fse_leftmost (n := n)) := by  intro x hx  obtain ⟨j, hj⟩ := fse_leftmost_attained x  rw [hj]; exact hx j
See it in the graphDiscuss this resultChallenge it