AFTD Auto-Formalizing Theoretical Domains

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

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)
See it in the graphDiscuss this resultChallenge it