Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 8 — a strict strategy-proof procedure with full range has a unique underlying strict SWF with CS, NNR, IIA

Proved
StrategyProofArrow.Correspondence.lemma_8

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

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

Consider a strict committee with n≥2n\ge2n≥2 individuals and m≥3m\ge3m≥3 alternatives, and a strict voting procedure v:ρmn→Smv:\rho_m^n\to S_mv:ρmn​→Sm​ with range Tp=SmT_p=S_mTp​=Sm​. If vvv is strategy-proof, then there exists a unique strict social welfare function u:ρmn→ρmu:\rho_m^n\to\rho_mu:ρmn​→ρm​ such that

ΨSm[u(B)]={v(B)}  for all B∈ρmn,u satisfies CS, NNR and IIA.\Psi_{S_m}[u(B)]=\{v(B)\}\ \text{ for all } B\in\rho_m^n,\qquad u\text{ satisfies CS, NNR and IIA}.ΨSm​​[u(B)]={v(B)}  for all B∈ρmn​,u satisfies CS, NNR and IIA.

Lemma 8 is the second half of the correspondence of Theorem 2.

Formalization Note Uniqueness is equality of functions on strict ballot sets (a subtype), so junk values on non-admissible profiles cannot break it. The range is taken over strict ballot sets. CS is read for x≠yx\ne yx=y, NNR for every xxx.

Preamble
import Mathlib
import Definitions.Def_StrategyProofArrow_Correspondence_Basic
Formal statement
namespace StrategyProofArrow.Correspondence

theorem lemma_8 {ι A : Type*} [Fintype ι] [Fintype A] [DecidableEq ι] [DecidableEq A]
    (hn : 2 ≤ Fintype.card ι) (hm : 3 ≤ Fintype.card A)
    (v : StrongProfile ι A → A) (hsp : StrategyProof v) (hrange : Set.range v = Set.univ) :
    ∃! u : StrongProfile ι A → StrongOrder A, Underlies u v ∧ CS u ∧ NNR u ∧ IIA u := by sorry

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