Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5 — a strategy-proof strict voting procedure is fully dictatorial or strong alternative-excluding

Proved
StrategyProofArrow.Dictatorship.lemma_5

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 ⟨In,Sm,vnm,Tp⟩\langle I_n,S_m,v^{nm},T_p\rangle⟨In​,Sm​,vnm,Tp​⟩ with n≥1n\ge 1n≥1, m≥3m\ge 3m≥3 and p≥1p\ge 1p≥1. If vnmv^{nm}vnm is strategy-proof, then

vnm is fully dictatorialorvnm is strong alternative-excluding.v^{nm}\ \text{is fully dictatorial}\quad\text{or}\quad v^{nm}\ \text{is strong alternative-excluding.}vnm is fully dictatorialorvnm is strong alternative-excluding.

When the range is all of SmS_mSm​ this is the classical Gibbard–Satterthwaite theorem; when the range is a proper subset, it asserts Condition U. The paper proves the case m=3m=3m=3 (Lemmas 2–4) and refers to its reference [13] for the induction on mmm.

Formalization Note The case Tp=SmT_p=S_mTp​=Sm​ is the published theorem AGT.gibbard_satterthwaite (an incentive compatible social choice function onto more than two alternatives has a voter whose unique top alternative is always elected), included in this mission as a reference item.

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

open AGT

/-- **Lemma 5** (Satterthwaite, p. 25). For a strict committee with `n ≥ 1`, `m ≥ 3` and
`p ≥ 1`, a strategy-proof strict voting procedure is either fully dictatorial or strong
alternative-excluding. -/
theorem lemma_5 {ι A : Type*} [Fintype ι] [Fintype A] [DecidableEq ι]
    (hn : 1 ≤ Fintype.card ι) (hm : 3 ≤ Fintype.card A)
    (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 5, p. 25
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