SocialChoice.Voting.HasCondorcetWinner
defimported Lean
A profile has at least one Condorcet winner.
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 def SocialChoice.Voting.HasCondorcetWinner [Fintype N] [Fintype A] (P : Profile N A) : Prop
- Defined in
- EconCSLib, `SocialChoice.Voting.HasCondorcetWinner`
- 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.SocialChoice.Voting.HasCondorcetWinner← SocialChoice.Voting.HasCondorcetWinner (EconCSLib/SocialChoice/Voting/VotingRules.lean:161): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 3
- SocialChoice.Voting.BallotPrefers_ballotFromInjectiveSocialChoice.Voting.BallotPrefers_ballotFromInjective
- SocialChoice.Voting.CondorcetWinner
ais a Condorcet winner if it beats every other alternative by strict pairwise majority. - SocialChoice.Voting.ProfileA voting profile assigns each voter a strict linear order over alternatives.
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 /-- A profile has at least one Condorcet winner. -/ def SocialChoice.Voting.HasCondorcetWinner [Fintype N] [Fintype A] (P : Profile N A) : Prop := ∃ a : A, CondorcetWinner P a