AFTD Auto-Formalizing Theoretical Domains

SocialChoice.Voting.scoringRule

defimported Lean

Generic positional scoring rule. The first argument is the number of alternatives, and the second is the zero-based rank.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Classical in
open Finset in
open scoped BigOperators in
variable {N A : Type*} in
noncomputable def SocialChoice.Voting.scoringRule (score : Nat → Nat → Int)
    [Fintype N] [Fintype A] : VotingRule N A
Defined in
EconCSLib, `SocialChoice.Voting.scoringRule`
Lean proof
By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at 1a88f809b538 (Copyright (c) 2026 EconCSLib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.
Verified
08 Oct 2026
Axioms
none listed
Built on 4
Used by 4

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Classical in
open Finset in
open scoped BigOperators in
variable {N A : Type*} in
/-- Generic positional scoring rule. The first argument is the number of alternatives, and the second is the zero-based rank. -/
noncomputable def SocialChoice.Voting.scoringRule (score : Nat → Nat → Int)
    [Fintype N] [Fintype A] : VotingRule N A :=
  fun P => scoringWinners P (fun r => score (Fintype.card A) r)
See it in the graphDiscuss this resultChallenge it