Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 10 (second sentence) — an Arrovian SWF with strong-order range factors as a strict Arrovian SWF after a tie-breaking function

Proved
StrategyProofArrow.WeakArrow.lemma_10_ii

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, and let uuu be a social welfare function on weak ballot sets B∈πmnB\in\pi_m^nB∈πmn​ whose range is contained in the strong orders ρm\rho_mρm​. If uuu satisfies IIA, CS and NNR, then there exist a tie-breaking function α\alphaα and a strict social welfare function μ\muμ satisfying IIA, CS and NNR such that

u(B)=μ(α(B))for all B∈πmn.u(B)=\mu\big(\alpha(B)\big)\qquad\text{for all } B\in\pi_m^n .u(B)=μ(α(B))for all B∈πmn​.

The tie-breaking function α\alphaα need not be regular: its value on individual iii may depend on the whole ballot set. This decomposition reduces Arrow's theorem with indifference to the strict case.

Formalization Note The standing hypothesis of Lemma 10, range contained in ρm\rho_mρm​, applies to this sentence and is kept. CS is stated for distinct alternatives. Conventions are those of the definitions file.

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

/-- **Lemma 10, second sentence**, Satterthwaite p. 44: let `u` be a social welfare function on weak
ballot sets with range contained in the strong orders. If `u` satisfies IIA, CS and NNR, then there
exist a tie-breaking function `α` and a strict social welfare function `μ` satisfying IIA, CS and
NNR such that `u(B) = μ(α(B))` for every weak ballot set `B`. -/
theorem lemma_10_ii {ι A : Type*} [Fintype ι] [Fintype A] [DecidableEq ι] [DecidableEq A]
    (hn : 2 ≤ Fintype.card ι) (hm : 3 ≤ Fintype.card A)
    (u : WeakProfile ι A → WeakOrder A) (hrange : ∀ B, (u B).IsStrong)
    (hIIA : IIA u) (hCS : CS u) (hNNR : NNR u) :
    ∃ α : WeakProfile ι A → StrongProfile ι A, IsTieBreaking α ∧
      ∃ μ : StrongProfile ι A → StrongOrder A,
        StrictIIA μ ∧ StrictCS μ ∧ StrictNNR μ ∧ ∀ B, u B = (μ (α 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 10, second sentence, p. 44
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