AFTD Auto-Formalizing Theoretical Domains

SocialChoice.Voting.condorcetCycleProfile

defimported Lean

The standard Condorcet cycle profile: voter 0 ranks 0 > 1 > 2, voter 1 ranks 1 > 2 > 0, and voter 2 ranks 2 > 0 > 1.

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.condorcetCycleProfile : Profile (Fin 3) (Fin 3)
Defined in
EconCSLib, `SocialChoice.Voting.condorcetCycleProfile`
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 3

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
/-- The standard Condorcet cycle profile: voter 0 ranks `0 > 1 > 2`, voter 1 ranks `1 > 2 > 0`, and voter 2 ranks `2 > 0 > 1`. -/
noncomputable def SocialChoice.Voting.condorcetCycleProfile : Profile (Fin 3) (Fin 3) where
  pref
    | 0 => finThreeRankOrder
        (fun a => if a = 0 then 0 else if a = 1 then 1 else 2)
        (by intro a b h; fin_cases a <;> fin_cases b <;> simp at h ⊢)
    | 1 => finThreeRankOrder
        (fun a => if a = 1 then 0 else if a = 2 then 1 else 2)
        (by intro a b h; fin_cases a <;> fin_cases b <;> simp at h ⊢)
    | 2 => finThreeRankOrder
        (fun a => if a = 2 then 0 else if a = 0 then 1 else 2)
        (by intro a b h; fin_cases a <;> fin_cases b <;> simp at h ⊢)
See it in the graphDiscuss this resultChallenge it