is_positional_scoring_vector
def
A scoring vector s in Q^m is a non-increasing vector of non-negative rational numbers normalized with s_1 = 1.
Statement
def is_positional_scoring_vector (m : ℕ) (s : Fin m → ℚ) : Prop
- Defined in
- arXiv:2610.26535 Definition 1
- Verified
- 22 Oct 2026
- Axioms
- none listed
- Used by 4
- rank_score_veto_core_distortion_lower_boundFor any natural number m with 2 ≤ m and any positional scoring vector s : Fin m → ℚ, there exist positive natural numbers n1 and n2 such…
- rank_score_veto_core_score_norm_sub_last_ge_oneFor a positional scoring vector s on Fin m with m at least 3, the 1-norm of s minus the last-place score is at least 1 (hence nonnegative).
- rank_score_candidate_weight_pos_of_last_posIf s is a positional scoring vector whose last-place score is positive then every candidate has strictly positive rank-score weight.
- not_rank_score_veto_core_side_count_boundThe statement
rank_score_veto_core_side_count_boundis false: The conclusion has its two cardinalities swapped with respect to the…
Read back from the Lean
Given a natural number m and a vector s : Fin m → ℚ, is_positional_scoring_vector m s asserts that:
1. s is weakly decreasing: for all i, j : Fin m, if i ≤ j, then s j ≤ s i;
2. All entries of s are non-negative: for all i : Fin m, 0 ≤ s i;
3. m > 0 and the first entry of s is 1: there exists a proof h : 0 < m such that s ⟨0, h⟩ = 1.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- A positional scoring vector is non-increasing, non-negative, and normalized so the first place receives 1 point. -/ def is_positional_scoring_vector (m : ℕ) (s : Fin m → ℚ) : Prop := (∀ i j : Fin m, i ≤ j → s j ≤ s i) ∧ (∀ i : Fin m, 0 ≤ s i) ∧ (∃ h : 0 < m, s ⟨0, h⟩ = 1)