Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 11 — breaking the social ordering's ties by a regular tie-breaker preserves CS, NNR and IIA

Proved
StrategyProofArrow.WeakArrow.lemma_11

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

arrow-theoremp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1social-choicetie-breaking

Let n≥2n\ge 2n≥2 and m≥3m\ge 3m≥3, let uuu be a social welfare function on weak ballot sets, and let QQQ be a strong order on SmS_mSm​. Define a new social welfare function by breaking the ties of each social ordering according to QQQ:

μ(B)=γ[u(B)],x μ(B) y  ⟺  x u(B)‾ y  or  (x,y tied in u(B) and x Q y).\mu(B)=\gamma\big[u(B)\big],\qquad x\ \mu(B)\ y \iff x\,\overline{u(B)}\,y\ \text{ or }\ \big(x,y \text{ tied in } u(B) \text{ and } x\,Q\,y\big).μ(B)=γ[u(B)],x μ(B) y⟺xu(B)​y  or  (x,y tied in u(B) and xQy).

If uuu satisfies CS, NNR and IIA, then μ\muμ has range contained in ρm\rho_mρm​ and satisfies CS, NNR and IIA.

This lemma lets the proof of Theorem 3' pass from an arbitrary Arrovian social welfare function to one with strong-order range, to which Lemma 10 applies.

Formalization Note The paper applies a regular tie-breaking function γ\gammaγ, defined on ballot sets, to the single ordering u(B)u(B)u(B); we read this as the component tie-breaker with tie-breaking order QQQ, the order the proof of Theorem 3' calls "Q∈ρmQ\in\rho_mQ∈ρm​, the tie-breaking order for γ\gammaγ". The printed "define the social welfare function unmu^{nm}unm" is read as μnm\mu^{nm}μnm, as (44) shows. The range claim holds by construction (the tie-broken order is a strong order) and is stated as the first conjunct. CS is stated for distinct alternatives.

Preamble
import Mathlib
import Definitions.Def_StrategyProofArrow_WeakArrow_Basic
Formal statement
namespace StrategyProofArrow.WeakArrow

/-- **Lemma 11**, Satterthwaite p. 48: let `u` be a social welfare function on weak ballot sets,
with `n ≥ 2` and `m ≥ 3`, and let `μ(B) = γ[u(B)]` break the ties of each social ordering by a
regular tie-breaker with tie-breaking order `Q`. If `u` satisfies CS, NNR and IIA, then `μ` has
range contained in the strong orders and satisfies CS, NNR and IIA. -/
theorem lemma_11 {ι A : Type*} [Fintype ι] [Fintype A] [DecidableEq ι] [DecidableEq A]
    (hn : 2 ≤ Fintype.card ι) (hm : 3 ≤ Fintype.card A)
    (u : WeakProfile ι A → WeakOrder A) (Q : StrongOrder A)
    (hCS : CS u) (hNNR : NNR u) (hIIA : IIA u) :
    (∀ B, (breakTies Q (u B)).1.IsStrong) ∧
      CS (fun B => (breakTies Q (u B)).1) ∧
      NNR (fun B => (breakTies Q (u B)).1) ∧
      IIA (fun B => (breakTies Q (u B)).1) := by sorry

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