Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 10 (first sentence) — a regular tie-breaking composition of a strict Arrovian SWF satisfies IIA, CS and NNR

Proved
StrategyProofArrow.WeakArrow.lemma_10_i

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​. Suppose that for every B∈πmnB\in\pi_m^nB∈πmn​

u(B)=μ(γ(B)),u(B)=\mu\big(\gamma(B)\big),u(B)=μ(γ(B)),

where γ\gammaγ is a regular tie-breaking function and μ\muμ is a strict social welfare function satisfying IIA, CS and NNR. Then uuu satisfies IIA, CS and NNR.

The two sentences of Lemma 10 describe tie-breaking compositions in both directions. Regularity is required for the forward preservation claim; the factorization in the second sentence permits any tie-breaking function.

Formalization Note The paper prints the hypothesis as "unm(B)=unm[γ(B)]u^{nm}(B)=u^{nm}[\gamma(B)]unm(B)=unm[γ(B)]", a misprint for unm(B)=μnm[γ(B)]u^{nm}(B)=\mu^{nm}[\gamma(B)]unm(B)=μnm[γ(B)]: the sentence names μ\muμ and the proof (p. 44) writes "Let unm(B)=μnm[γ(B)]u^{nm}(B)=\mu^{nm}[\gamma(B)]unm(B)=μnm[γ(B)]". The paper's committee is printed ⟨Im,Sm,unm⟩\langle I_m,S_m,u^{nm}\rangle⟨Im​,Sm​,unm⟩, read ⟨In,Sm,unm⟩\langle I_n,S_m,u^{nm}\rangle⟨In​,Sm​,unm⟩. The range hypothesis on uuu is kept as printed. 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, first sentence**, Satterthwaite p. 44: let `u` be a social welfare function on weak
ballot sets with range contained in the strong orders. If `u(B) = μ(γ(B))` for every `B`, where
`γ` is a regular tie-breaking function and `μ` is a strict social welfare function satisfying IIA,
CS and NNR, then `u` satisfies IIA, CS and NNR. (The printed `u^{nm}(B) = u^{nm}[γ(B)]` is read as
`μ^{nm}[γ(B)]`, as the proof writes it.) -/
theorem lemma_10_i {ι 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)
    (γ : WeakProfile ι A → StrongProfile ι A) (hγ : IsRegular γ)
    (μ : StrongProfile ι A → StrongOrder A)
    (hIIA : StrictIIA μ) (hCS : StrictCS μ) (hNNR : StrictNNR μ)
    (hu : ∀ B, u B = (μ (γ B)).1) :
    IIA u ∧ CS u ∧ NNR u := by sorry

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