Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2 — one voter, three alternatives: strategy-proof implies fully dictatorial or strong alternative-excluding

Proved
StrategyProofArrow.Dictatorship.lemma_2

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

dictatorshipp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1social-choicestrategy-proofness

Consider a strict committee with a single individual and three alternatives, ⟨I1,S3,v1,3,T=Tp⟩\langle I_1,S_3,v^{1,3},T=T_p\rangle⟨I1​,S3​,v1,3,T=Tp​⟩ with 1≤p≤31\le p\le 31≤p≤3. If v1,3v^{1,3}v1,3 is strategy-proof, then

v1,3 is fully dictatorialorv1,3 is strong alternative-excluding.v^{1,3}\ \text{is fully dictatorial}\quad\text{or}\quad v^{1,3}\ \text{is strong alternative-excluding.}v1,3 is fully dictatorialorv1,3 is strong alternative-excluding.

This is the base case of the paper's induction on the number of individuals for three alternatives.

Formalization Note One individual is Fintype.card ι = 1, three alternatives Fintype.card A = 3. The hypothesis p≥1p\ge 1p≥1 is kept as printed; p≤3p\le 3p≤3 holds automatically and is not stated.

Preamble
import Mathlib
import Definitions.Def_StrategyProofArrow_Dictatorship_Basic
Formal statement
namespace StrategyProofArrow.Dictatorship

open AGT

/-- **Lemma 2** (Satterthwaite, p. 15). For a strict committee with one individual and three
alternatives, and `1 ≤ p ≤ 3`, a strategy-proof strict voting procedure is either fully
dictatorial or strong alternative-excluding. -/
theorem lemma_2 {ι A : Type*} [Fintype ι] [Fintype A] [DecidableEq ι]
    (hn : Fintype.card ι = 1) (hm : Fintype.card A = 3)
    (f : (ι → A → A → Prop) → A) (hp : 1 ≤ (range f).ncard)
    (hsp : IncentiveCompatible f) :
    FullyDictatorial f ∨ StrongAltExcluding f := by sorry

end StrategyProofArrow.Dictatorship
Source
Satterthwaite, Strategy-proofness and Arrow's Conditions, Northwestern Discussion Paper No. 122 (rev. Dec. 12, 1974), Lemma 2, p. 15
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me