Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4, p. 34 — a strict SWF with PO and IIA underlying a strategy-proof procedure satisfies NNR

Proved
StrategyProofArrow.Correspondence.nnr_of_underlies

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

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

Let n≥2n\ge2n≥2, m≥3m\ge3m≥3, let v:ρmn→Smv:\rho_m^n\to S_mv:ρmn​→Sm​ be a strict strategy-proof voting procedure, and let u:ρmn→ρmu:\rho_m^n\to\rho_mu:ρmn​→ρm​ be a strict social welfare function that underlies vvv and satisfies Pareto optimality and IIA. Then uuu satisfies non-negative response: for every alternative xxx, with W=Sm∖{x}W=S_m\setminus\{x\}W=Sm​∖{x}, and all strict ballot sets C,DC,DC,D such that, for every individual iii, θW(Ci)=θW(Di)\theta_W(C_i)=\theta_W(D_i)θW​(Ci​)=θW​(Di​) and xxx is ranked by DiD_iDi​ at least as high against every y∈Wy\in Wy∈W as by CiC_iCi​,

x AˉC z ⟹ x AˉD zfor all z∈W,x\,\bar A_C\,z\ \Longrightarrow\ x\,\bar A_D\,z\qquad\text{for all } z\in W,xAˉC​z ⟹ xAˉD​zfor all z∈W,

where AC=u(C)A_C=u(C)AC​=u(C) and AD=u(D)A_D=u(D)AD​=u(D).

This is the paper's "third fact" about Gibbard's result, which completes the proof of Lemma 8.

Formalization Note NNR is formalized for every xxx and for arbitrary C,DC,DC,D (any number of individuals may move xxx up); the paper's argument treats a change in a single ballot. The standing hypotheses n≥2n\ge2n≥2, m≥3m\ge3m≥3 of §4 are kept.

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

theorem nnr_of_underlies {ι A : Type*} [Fintype ι] [Fintype A] [DecidableEq ι] [DecidableEq A]
    (hn : 2 ≤ Fintype.card ι) (hm : 3 ≤ Fintype.card A)
    (v : StrongProfile ι A → A) (hsp : StrategyProof v)
    (u : StrongProfile ι A → StrongOrder A) (hu : Underlies u v) (hpo : PO u) (hiia : IIA u) :
    NNR u := by sorry

end StrategyProofArrow.Correspondence
Source
Satterthwaite, Strategy-proofness and Arrow's Conditions, Northwestern Discussion Paper No. 122 (rev. Dec. 12, 1974), §4, p. 34 ("Third, note that …")
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