fse_dictator_SP
lemmaverified
A dictatorship is strategyproof for every non-negative scaling function.
Statement
lemma fse_dictator_SP {n : ℕ} (q : ℝ → ℝ) (hpos : ∀ y ∈ Set.Icc (0 : ℝ) 1, 0 ≤ q y) (d : Fin n) : fse_SP q (fun x : Fin n → ℝ => x d)
- 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 2
- Used by 1
- 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…
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.
/-- A dictatorship is strategyproof for every non-negative scaling function. -/lemma fse_dictator_SP {n : ℕ} (q : ℝ → ℝ) (hpos : ∀ y ∈ Set.Icc (0 : ℝ) 1, 0 ≤ q y) (d : Fin n) : fse_SP q (fun x : Fin n → ℝ => x d) := by intro x hx i x' hx' by_cases hid : i = d · subst hid have h0 : fse_cost q (x i) (x i) = 0 := by simp [fse_cost] rw [h0] have hm : Function.update x i x' i ∈ Set.Icc (0 : ℝ) 1 := by simp [hx'] exact mul_nonneg (hpos _ hm) (abs_nonneg _) · simp [Function.update_of_ne (Ne.symm hid)]