Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6 — the choice of a strategy-proof procedure depends only on the ballots' rankings of its range

Proved
StrategyProofArrow.Dictatorship.lemma_6

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

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

Consider a strict committee ⟨In,Sm,vnm,T=Tp⟩\langle I_n,S_m,v^{nm},T=T_p\rangle⟨In​,Sm​,vnm,T=Tp​⟩ with n≥2n\ge 2n≥2, m≥3m\ge 3m≥3, p≥1p\ge 1p≥1 and m≥pm\ge pm≥p. If vnmv^{nm}vnm is strategy-proof and two strict ballot sets C,D∈ρmnC,D\in\rho^n_mC,D∈ρmn​ satisfy θT(Ci)=θT(Di)\theta_T(C_i)=\theta_T(D_i)θT​(Ci​)=θT​(Di​) for every i∈Ini\in I_ni∈In​, that is, each CiC_iCi​ and DiD_iDi​ rank the elements of TTT in the same order, then

vnm(C)=vnm(D).v^{nm}(C)=v^{nm}(D).vnm(C)=vnm(D).

This is an "independence of irrelevant alternatives" property: alternatives outside the range do not influence the choice. It lets a strategy-proof procedure be viewed as a procedure on the alternatives of its range alone.

Formalization Note θT(Ci)=θT(Di)\theta_T(C_i)=\theta_T(D_i)θT​(Ci​)=θT​(Di​) is AgreeOn (range f) (C i) (D i): the strict parts of CiC_iCi​ and DiD_iDi​ agree on T×TT\times TT×T. The paper states n≥2n\ge 2n≥2; the hypothesis is kept as printed. m≥pm\ge pm≥p holds automatically (the range is a subset of the alternatives) and is not stated.

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

open AGT

/-- **Lemma 6** (Satterthwaite, p. 26). For a strict committee with `n ≥ 2`, `m ≥ 3` and
`p ≥ 1` (`m ≥ p` holds automatically), if `f` is strategy-proof and the strict ballot sets `C`,
`D` satisfy `θ_T(C_i) = θ_T(D_i)` for every individual `i`, where `T = T_p` is the range, then
`f C = f D`. -/
theorem lemma_6 {ι A : Type*} [Fintype ι] [Fintype A] [DecidableEq ι]
    (hn : 2 ≤ Fintype.card ι) (hm : 3 ≤ Fintype.card A)
    (f : (ι → A → A → Prop) → A) (hp : 1 ≤ (range f).ncard)
    (hsp : IncentiveCompatible f)
    (C D : ι → A → A → Prop) (hC : IsPrefProfile C) (hD : IsPrefProfile D)
    (hCD : ∀ i, AgreeOn (range f) (C i) (D i)) :
    f C = f D := by sorry

end StrategyProofArrow.Dictatorship
Source
Satterthwaite, Strategy-proofness and Arrow's Conditions, Northwestern Discussion Paper No. 122 (rev. Dec. 12, 1974), Lemma 6, p. 26
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