Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1 — a strategy-proof strict voting procedure satisfies Condition U

Proved
StrategyProofArrow.Dictatorship.lemma_1

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 with n≥1n\ge 1n≥1 individuals and m≥3m\ge 3m≥3 alternatives, and a strict voting procedure vnmv^{nm}vnm whose range T=TpT=T_pT=Tp​ has p≥1p\ge 1p≥1 elements. If vnmv^{nm}vnm is strategy-proof, then it satisfies Condition U: for every strict ballot set B∈ρmnB\in\rho^n_mB∈ρmn​ and every x∈Tx\in Tx∈T,

ΨT(B1)=⋯=ΨT(Bn)={x} ⟹ vnm(B)=x.\Psi_T(B_1)=\dots=\Psi_T(B_n)=\{x\}\ \Longrightarrow\ v^{nm}(B)=x .ΨT​(B1​)=⋯=ΨT​(Bn​)={x} ⟹ vnm(B)=x.

In words, if every individual ranks xxx above every other element of the range, the procedure selects xxx. Condition U is the Pareto-type property on which the definition of strong alternative-excluding procedures, and the rest of the proof of Theorem 1, rest.

Formalization Note Strategy-proofness is AGT.IncentiveCompatible. nnn, mmm, ppp are Fintype.card ι, Fintype.card A and (range f).ncard. The paper states m≥3m\ge 3m≥3 and p≥1p\ge 1p≥1 as hypotheses; both are kept, although the conclusion does not need them.

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

open AGT

/-- **Lemma 1** (Satterthwaite, p. 13). For a strict committee with `n ≥ 1`, `m ≥ 3` and
`p ≥ 1`, every strategy-proof strict voting procedure satisfies Condition U. -/
theorem lemma_1 {ι 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) :
    ConditionU f := by sorry

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