Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4 — the induction step on the number of voters for three alternatives

Proved
StrategyProofArrow.Dictatorship.lemma_4

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

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

Consider strict committees with three alternatives and n≥1n\ge 1n≥1. Suppose every strategy-proof strict voting procedure vn,3v^{n,3}vn,3 for the nnn individuals InI_nIn​ is fully dictatorial or strong alternative-excluding. Then every strict voting procedure vn+1,3v^{n+1,3}vn+1,3 for the n+1n+1n+1 individuals In+1I_{n+1}In+1​, with range of 1≤p≤31\le p\le 31≤p≤3 elements, satisfies

vn+1,3 strategy-proof ⟹ vn+1,3 fully dictatorial or strong alternative-excluding.v^{n+1,3}\ \text{strategy-proof}\ \Longrightarrow\ v^{n+1,3}\ \text{fully dictatorial or strong alternative-excluding.}vn+1,3 strategy-proof ⟹ vn+1,3 fully dictatorial or strong alternative-excluding.

With Lemma 2 as base case, this yields Lemma 5 for m=3m=3m=3 by induction on nnn.

Formalization Note The individuals InI_nIn​ are ι with Fintype.card ι ≥ 1, and In+1I_{n+1}In+1​ is Option ι. The induction hypothesis quantifies over all strict voting procedures for ι on the same three-element alternative set A. p≤3p\le 3p≤3 holds automatically.

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

open AGT

/-- **Lemma 4** (Satterthwaite, p. 22). Three alternatives, `n ≥ 1`. If every strategy-proof
strict voting procedure for the `n` individuals `ι` is fully dictatorial or strong
alternative-excluding, then every strategy-proof strict voting procedure for the `n + 1`
individuals `Option ι` with `1 ≤ p ≤ 3` is fully dictatorial or strong alternative-excluding. -/
theorem lemma_4 {ι A : Type*} [Fintype ι] [Fintype A] [DecidableEq ι]
    (hn : 1 ≤ Fintype.card ι) (hm : Fintype.card A = 3)
    (hind : ∀ g : (ι → A → A → Prop) → A, IncentiveCompatible g →
      FullyDictatorial g ∨ StrongAltExcluding g)
    (f : (Option ι → 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 4, p. 22
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