is_line_distance_preference_profile_of_const_items
Sanity check: when all items sit at one point, every profile of rankings is a distance-ranking profile.
Statement
theorem is_line_distance_preference_profile_of_const_items {n : ℕ} (a : Fin n → ℝ) (c : ℝ) (pref : Fin n → Equiv.Perm (Fin n)) : is_line_distance_preference_profile a (fun _ => c) pref
- Source
- sanity lemma for is_line_distance_ranking (OP-1158)
- Verified
- 05 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- is_line_distance_preference_profileThere are n agents and n items, both indexed by {0, ..., n-1}; agent i sits at the real position a_i and item j at b_j. Each agent's…
The proof, explained
Because every item is placed at the exact same position c, the distance from any agent a(i) to an item is identical regardless of which item is chosen: both |a(i) - b(pref i k)| and |a(i) - b(pref i k')| simplify to |a(i) - c|. Thus the preference condition |a(i) - c| ≤ |a(i) - c| holds trivially by the reflexivity of the inequality relation on the reals.
For any agent i and any ranking indices k < k', the distance from a(i) to the item at rank k is at most the distance to the item at rank k'.
By definition of `is_line_distance_preference_profile`, we must show that for any agent i and rank indices k, k' with k < k', |a i - b (pref i k)| ≤ |a i - b (pref i k')|. Since all items are located at the constant position c (that is, b is the constant function `fun _ => c`), both sides evaluate definitionally to |a i - c|. Introducing the four universal parameters (agent i, indices k and k', and the hypothesis k < k') reduces the requirement to |a i - c| ≤ |a i - c|, which holds by reflexivity of the order (`le_rfl`).
uses
le_rflfun _ _ _ _ => le_rfl
le_rfl- In any preorder, every element is less than or equal to itself: a ≤ a.
Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
theorem is_line_distance_preference_profile_of_const_items {n : ℕ} (a : Fin n → ℝ) (c : ℝ) (pref : Fin n → Equiv.Perm (Fin n)) : is_line_distance_preference_profile a (fun _ => c) pref := fun _ _ _ _ => le_rfl