AFTD Auto-Formalizing Theoretical Domains

fse_follow

lemmaverified

Moving the coordinate of agent i when i's location is not shared and the outcome is at i's location: the outcome follows agent i.

Statement

lemma fse_follow {n : ℕ} (f : (Fin n → ℝ) → ℝ) (hSP : fse_SPAll f) (hsurj : fse_Surjective f)
    (c : Fin n → ℝ) (hc : fse_InDomain c) (i : Fin n) (hfc : f c = c i)
    (huniq : ∀ k, k ≠ i → c k ≠ c i) (t : ℝ) (ht : t ∈ Set.Icc (0 : ℝ) 1) :
    f (Function.update c i t) = t
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 5
  • fse_InDomainA location profile of n agents lies in the domain [0,1].
  • fse_SurjectiveSurjectivity (onto [0,1]).
  • fse_SPAllA scaling-oblivious mechanism is strategyproof for *every* scaling function: the mechanism does not know q, and no agent can gain under…
  • fse_lemmaCKey consequence of strategyproofness for all scaling functions: a unilateral deviation can change the outcome only if the outcome was at…
  • fse_mem_rangeA surjective mechanism that is strategyproof for all scaling functions always outputs some agent's reported location.
Used by 1
  • fse_scaling_oblivious_dictatorshipThe dictatorship conjecture holds for scaling-oblivious mechanisms. If a mechanism into [0,1] does not depend on the scaling function and…

Lean source view module on GitHub

/-- Moving the coordinate of agent `i` when `i`'s location is not shared and the outcome is at `i`'s location: the outcome follows agent `i`. -/lemma fse_follow {n : ℕ} (f : (Fin n → ℝ) → ℝ) (hSP : fse_SPAll f) (hsurj : fse_Surjective f)    (c : Fin n → ℝ) (hc : fse_InDomain c) (i : Fin n) (hfc : f c = c i)    (huniq : ∀ k, k ≠ i → c k ≠ c i) (t : ℝ) (ht : t ∈ Set.Icc (0 : ℝ) 1) :    f (Function.update c i t) = t := by  have hc' : fse_InDomain (Function.update c i t) := by    intro k    by_cases hk : k = i    · subst hk; simp [ht]    · simp [Function.update_of_ne hk, hc k]  by_contra hne  obtain ⟨k, hk⟩ := fse_mem_range f hSP hsurj _ hc'  have hki : k ≠ i := by    intro h; subst h; simp at hk; exact hne hk  rcases fse_lemmaC f hSP _ hc' i (c i) (hc i) with h | h  · simp at h; exact hne h  · rw [Function.update_idem, Function.update_eq_self] at h    rw [Function.update_of_ne hki] at hk    exact huniq k hki (by rw [← hk, ← h, hfc])
See it in the graphDiscuss this resultChallenge it